./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 f470102c Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_6d41cb63-a41e-4bff-b288-b7dd5a14232f/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_6d41cb63-a41e-4bff-b288-b7dd5a14232f/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_6d41cb63-a41e-4bff-b288-b7dd5a14232f/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_6d41cb63-a41e-4bff-b288-b7dd5a14232f/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread/singleton.i -s /tmp/vcloud-vcloud-master/worker/run_dir_6d41cb63-a41e-4bff-b288-b7dd5a14232f/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_6d41cb63-a41e-4bff-b288-b7dd5a14232f/bin/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 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.25-f470102 [2019-12-07 18:16:23,654 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 18:16:23,655 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 18:16:23,663 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 18:16:23,663 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 18:16:23,664 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 18:16:23,665 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 18:16:23,667 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 18:16:23,669 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 18:16:23,669 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 18:16:23,670 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 18:16:23,671 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 18:16:23,671 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 18:16:23,672 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 18:16:23,672 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 18:16:23,673 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 18:16:23,674 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 18:16:23,675 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 18:16:23,676 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 18:16:23,678 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 18:16:23,678 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 18:16:23,679 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 18:16:23,680 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 18:16:23,680 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 18:16:23,682 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 18:16:23,682 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 18:16:23,682 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 18:16:23,683 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 18:16:23,683 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 18:16:23,684 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 18:16:23,684 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 18:16:23,684 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 18:16:23,685 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 18:16:23,685 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 18:16:23,686 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 18:16:23,687 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 18:16:23,687 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 18:16:23,687 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 18:16:23,687 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 18:16:23,688 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 18:16:23,689 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 18:16:23,689 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_6d41cb63-a41e-4bff-b288-b7dd5a14232f/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-07 18:16:23,702 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 18:16:23,702 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 18:16:23,702 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-07 18:16:23,703 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-07 18:16:23,703 INFO L138 SettingsManager]: * Use SBE=true [2019-12-07 18:16:23,703 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 18:16:23,703 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 18:16:23,703 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 18:16:23,704 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 18:16:23,704 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 18:16:23,704 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 18:16:23,704 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 18:16:23,704 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 18:16:23,705 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 18:16:23,705 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 18:16:23,705 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 18:16:23,705 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 18:16:23,705 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 18:16:23,706 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-07 18:16:23,706 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 18:16:23,706 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 18:16:23,706 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 18:16:23,706 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 18:16:23,706 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 18:16:23,707 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 18:16:23,707 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-07 18:16:23,707 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 18:16:23,707 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 18:16:23,707 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 18:16:23,707 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/run_dir_6d41cb63-a41e-4bff-b288-b7dd5a14232f/bin/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> f3491af59218a0433b9de95fff59451438a5c03e [2019-12-07 18:16:23,819 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 18:16:23,829 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 18:16:23,832 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 18:16:23,833 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 18:16:23,834 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 18:16:23,834 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_6d41cb63-a41e-4bff-b288-b7dd5a14232f/bin/uautomizer/../../sv-benchmarks/c/pthread/singleton.i [2019-12-07 18:16:23,873 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_6d41cb63-a41e-4bff-b288-b7dd5a14232f/bin/uautomizer/data/6482c652f/f17bcbe7c9bc4e07a595140db9c1a40c/FLAGb4bc5c690 [2019-12-07 18:16:24,333 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 18:16:24,334 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_6d41cb63-a41e-4bff-b288-b7dd5a14232f/sv-benchmarks/c/pthread/singleton.i [2019-12-07 18:16:24,346 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_6d41cb63-a41e-4bff-b288-b7dd5a14232f/bin/uautomizer/data/6482c652f/f17bcbe7c9bc4e07a595140db9c1a40c/FLAGb4bc5c690 [2019-12-07 18:16:24,866 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_6d41cb63-a41e-4bff-b288-b7dd5a14232f/bin/uautomizer/data/6482c652f/f17bcbe7c9bc4e07a595140db9c1a40c [2019-12-07 18:16:24,868 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 18:16:24,869 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 18:16:24,870 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 18:16:24,870 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 18:16:24,873 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 18:16:24,873 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 06:16:24" (1/1) ... [2019-12-07 18:16:24,875 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7b5dffbd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:16:24, skipping insertion in model container [2019-12-07 18:16:24,875 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 06:16:24" (1/1) ... [2019-12-07 18:16:24,881 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 18:16:24,912 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 18:16:25,226 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 18:16:25,233 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 18:16:25,273 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 18:16:25,371 INFO L208 MainTranslator]: Completed translation [2019-12-07 18:16:25,372 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:16:25 WrapperNode [2019-12-07 18:16:25,372 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 18:16:25,372 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 18:16:25,373 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 18:16:25,373 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 18:16:25,378 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:16:25" (1/1) ... [2019-12-07 18:16:25,393 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:16:25" (1/1) ... [2019-12-07 18:16:25,408 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 18:16:25,408 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 18:16:25,408 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 18:16:25,408 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 18:16:25,414 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:16:25" (1/1) ... [2019-12-07 18:16:25,414 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:16:25" (1/1) ... [2019-12-07 18:16:25,417 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:16:25" (1/1) ... [2019-12-07 18:16:25,417 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:16:25" (1/1) ... [2019-12-07 18:16:25,422 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:16:25" (1/1) ... [2019-12-07 18:16:25,424 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:16:25" (1/1) ... [2019-12-07 18:16:25,425 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:16:25" (1/1) ... [2019-12-07 18:16:25,428 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 18:16:25,428 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 18:16:25,428 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 18:16:25,428 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 18:16:25,429 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:16:25" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6d41cb63-a41e-4bff-b288-b7dd5a14232f/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 18:16:25,472 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-07 18:16:25,472 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-07 18:16:25,472 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-12-07 18:16:25,472 INFO L130 BoogieDeclarations]: Found specification of procedure thread0 [2019-12-07 18:16:25,473 INFO L138 BoogieDeclarations]: Found implementation of procedure thread0 [2019-12-07 18:16:25,473 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2019-12-07 18:16:25,473 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2019-12-07 18:16:25,473 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2019-12-07 18:16:25,473 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2019-12-07 18:16:25,473 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2019-12-07 18:16:25,473 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2019-12-07 18:16:25,474 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-07 18:16:25,474 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-12-07 18:16:25,474 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 18:16:25,474 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 18:16:25,475 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-07 18:16:25,683 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 18:16:25,683 INFO L287 CfgBuilder]: Removed 6 assume(true) statements. [2019-12-07 18:16:25,684 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 06:16:25 BoogieIcfgContainer [2019-12-07 18:16:25,684 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 18:16:25,685 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 18:16:25,685 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 18:16:25,687 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 18:16:25,687 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 06:16:24" (1/3) ... [2019-12-07 18:16:25,688 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@115b7a05 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 06:16:25, skipping insertion in model container [2019-12-07 18:16:25,688 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:16:25" (2/3) ... [2019-12-07 18:16:25,688 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@115b7a05 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 06:16:25, skipping insertion in model container [2019-12-07 18:16:25,688 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 06:16:25" (3/3) ... [2019-12-07 18:16:25,689 INFO L109 eAbstractionObserver]: Analyzing ICFG singleton.i [2019-12-07 18:16:25,696 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-07 18:16:25,696 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 18:16:25,701 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-12-07 18:16:25,702 INFO L339 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-07 18:16:25,728 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:16:25,728 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:16:25,728 WARN L315 ript$VariableManager]: TermVariabe thread0Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:16:25,729 WARN L315 ript$VariableManager]: TermVariabe thread0Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:16:25,729 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:16:25,729 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t1~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:16:25,729 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t2~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:16:25,729 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:16:25,729 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:16:25,729 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t3~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:16:25,730 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t4~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:16:25,730 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t4~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:16:25,730 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t5~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:16:25,730 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t5~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:16:25,730 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:16:25,730 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t1~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:16:25,731 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:16:25,731 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:16:25,731 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t1~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:16:25,731 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#t~mem4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:16:25,731 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#t~mem4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:16:25,732 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t2~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:16:25,732 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:16:25,732 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:16:25,732 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:16:25,732 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t3~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:16:25,732 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:16:25,732 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t4~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:16:25,732 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t4~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:16:25,733 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#t~nondet7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:16:25,733 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t5~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:16:25,733 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t5~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:16:25,733 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#t~nondet8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:16:25,733 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t2~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:16:25,733 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:16:25,733 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:16:25,733 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:16:25,734 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:16:25,734 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t3~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:16:25,734 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#t~mem10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:16:25,734 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#t~mem10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:16:25,734 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t4~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:16:25,734 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t4~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:16:25,734 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#t~mem11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:16:25,734 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#t~mem11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:16:25,735 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t5~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:16:25,735 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t5~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:16:25,735 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#t~mem12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:16:25,735 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#t~mem12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:16:25,735 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:16:25,735 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:16:25,735 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:16:25,735 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:16:25,735 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t1~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:16:25,736 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:16:25,736 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:16:25,736 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t2~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:16:25,736 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:16:25,736 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t3~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:16:25,736 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:16:25,736 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t4~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:16:25,736 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t4~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:16:25,737 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t4~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:16:25,737 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t5~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:16:25,737 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t5~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:16:25,737 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t5~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:16:25,737 WARN L315 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork4_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:16:25,737 WARN L315 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork4_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:16:25,737 WARN L315 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork4_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:16:25,737 WARN L315 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork4_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:16:25,737 WARN L315 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork4_#t~malloc2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:16:25,738 WARN L315 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork4_#t~malloc2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:16:25,738 WARN L315 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork4_#t~malloc2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:16:25,738 WARN L315 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork4_#t~malloc2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:16:25,738 WARN L315 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork4_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:16:25,738 WARN L315 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork4_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:16:25,738 WARN L315 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:16:25,738 WARN L315 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:16:25,738 WARN L315 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:16:25,738 WARN L315 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:16:25,739 WARN L315 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:16:25,739 WARN L315 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:16:25,739 WARN L315 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:16:25,739 WARN L315 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:16:25,739 WARN L315 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:16:25,739 WARN L315 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:16:25,739 WARN L315 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:16:25,739 WARN L315 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:16:25,740 WARN L315 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork5_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:16:25,740 WARN L315 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork5_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:16:25,740 WARN L315 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork5_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:16:25,740 WARN L315 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork5_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:16:25,740 WARN L315 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork5_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:16:25,740 WARN L315 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork5_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:16:25,740 WARN L315 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:16:25,740 WARN L315 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:16:25,741 WARN L315 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:16:25,741 WARN L315 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:16:25,741 WARN L315 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:16:25,741 WARN L315 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:16:25,871 INFO L249 AbstractCegarLoop]: Starting to check reachability of 12 error locations. [2019-12-07 18:16:25,884 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 18:16:25,885 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 18:16:25,885 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 18:16:25,885 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 18:16:25,885 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 18:16:25,885 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 18:16:25,885 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 18:16:25,885 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 18:16:25,897 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 172 places, 243 transitions [2019-12-07 18:16:25,898 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 172 places, 243 transitions [2019-12-07 18:16:25,986 INFO L134 PetriNetUnfolder]: 61/264 cut-off events. [2019-12-07 18:16:25,986 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 18:16:25,994 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-12-07 18:16:26,004 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 172 places, 243 transitions [2019-12-07 18:16:26,039 INFO L134 PetriNetUnfolder]: 61/264 cut-off events. [2019-12-07 18:16:26,039 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 18:16:26,045 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-12-07 18:16:26,057 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 4038 [2019-12-07 18:16:26,058 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-07 18:16:27,325 INFO L206 etLargeBlockEncoding]: Checked pairs total: 2242 [2019-12-07 18:16:27,326 INFO L214 etLargeBlockEncoding]: Total number of compositions: 74 [2019-12-07 18:16:27,328 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 99 places, 173 transitions [2019-12-07 18:16:27,655 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 3502 states. [2019-12-07 18:16:27,657 INFO L276 IsEmpty]: Start isEmpty. Operand 3502 states. [2019-12-07 18:16:27,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-12-07 18:16:27,661 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:16:27,662 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:16:27,662 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-12-07 18:16:27,666 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:16:27,666 INFO L82 PathProgramCache]: Analyzing trace with hash -1385407457, now seen corresponding path program 1 times [2019-12-07 18:16:27,672 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:16:27,672 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1930098330] [2019-12-07 18:16:27,672 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:16:27,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:16:27,839 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:16:27,839 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1930098330] [2019-12-07 18:16:27,840 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:16:27,840 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 18:16:27,840 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1709742430] [2019-12-07 18:16:27,843 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 18:16:27,843 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:16:27,852 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 18:16:27,853 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-07 18:16:27,854 INFO L87 Difference]: Start difference. First operand 3502 states. Second operand 6 states. [2019-12-07 18:16:28,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:16:28,073 INFO L93 Difference]: Finished difference Result 4760 states and 19900 transitions. [2019-12-07 18:16:28,073 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 18:16:28,074 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 9 [2019-12-07 18:16:28,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:16:28,117 INFO L225 Difference]: With dead ends: 4760 [2019-12-07 18:16:28,118 INFO L226 Difference]: Without dead ends: 4272 [2019-12-07 18:16:28,118 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-12-07 18:16:28,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4272 states. [2019-12-07 18:16:28,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4272 to 3018. [2019-12-07 18:16:28,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3018 states. [2019-12-07 18:16:28,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3018 states to 3018 states and 12272 transitions. [2019-12-07 18:16:28,269 INFO L78 Accepts]: Start accepts. Automaton has 3018 states and 12272 transitions. Word has length 9 [2019-12-07 18:16:28,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:16:28,269 INFO L462 AbstractCegarLoop]: Abstraction has 3018 states and 12272 transitions. [2019-12-07 18:16:28,269 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 18:16:28,269 INFO L276 IsEmpty]: Start isEmpty. Operand 3018 states and 12272 transitions. [2019-12-07 18:16:28,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-12-07 18:16:28,269 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:16:28,269 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:16:28,270 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-12-07 18:16:28,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:16:28,270 INFO L82 PathProgramCache]: Analyzing trace with hash -1192062693, now seen corresponding path program 2 times [2019-12-07 18:16:28,270 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:16:28,270 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1465442895] [2019-12-07 18:16:28,270 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:16:28,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:16:28,332 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:16:28,332 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1465442895] [2019-12-07 18:16:28,333 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:16:28,333 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 18:16:28,333 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1615544800] [2019-12-07 18:16:28,334 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 18:16:28,334 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:16:28,334 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 18:16:28,334 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-07 18:16:28,334 INFO L87 Difference]: Start difference. First operand 3018 states and 12272 transitions. Second operand 6 states. [2019-12-07 18:16:28,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:16:28,574 INFO L93 Difference]: Finished difference Result 5518 states and 23821 transitions. [2019-12-07 18:16:28,574 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 18:16:28,574 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 9 [2019-12-07 18:16:28,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:16:28,622 INFO L225 Difference]: With dead ends: 5518 [2019-12-07 18:16:28,623 INFO L226 Difference]: Without dead ends: 5518 [2019-12-07 18:16:28,623 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-12-07 18:16:28,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5518 states. [2019-12-07 18:16:28,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5518 to 3008. [2019-12-07 18:16:28,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3008 states. [2019-12-07 18:16:28,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3008 states to 3008 states and 12255 transitions. [2019-12-07 18:16:28,724 INFO L78 Accepts]: Start accepts. Automaton has 3008 states and 12255 transitions. Word has length 9 [2019-12-07 18:16:28,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:16:28,725 INFO L462 AbstractCegarLoop]: Abstraction has 3008 states and 12255 transitions. [2019-12-07 18:16:28,725 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 18:16:28,725 INFO L276 IsEmpty]: Start isEmpty. Operand 3008 states and 12255 transitions. [2019-12-07 18:16:28,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-07 18:16:28,726 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:16:28,726 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:16:28,726 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-12-07 18:16:28,726 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:16:28,726 INFO L82 PathProgramCache]: Analyzing trace with hash 1538202320, now seen corresponding path program 1 times [2019-12-07 18:16:28,726 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:16:28,727 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1550416684] [2019-12-07 18:16:28,727 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:16:28,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:16:28,767 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:16:28,767 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1550416684] [2019-12-07 18:16:28,767 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:16:28,768 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 18:16:28,768 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1265937088] [2019-12-07 18:16:28,768 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 18:16:28,768 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:16:28,768 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 18:16:28,768 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:16:28,769 INFO L87 Difference]: Start difference. First operand 3008 states and 12255 transitions. Second operand 3 states. [2019-12-07 18:16:28,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:16:28,844 INFO L93 Difference]: Finished difference Result 4848 states and 19273 transitions. [2019-12-07 18:16:28,844 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 18:16:28,845 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-12-07 18:16:28,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:16:28,871 INFO L225 Difference]: With dead ends: 4848 [2019-12-07 18:16:28,872 INFO L226 Difference]: Without dead ends: 3558 [2019-12-07 18:16:28,872 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-12-07 18:16:28,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3558 states. [2019-12-07 18:16:28,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3558 to 3181. [2019-12-07 18:16:28,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3181 states. [2019-12-07 18:16:28,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3181 states to 3181 states and 12171 transitions. [2019-12-07 18:16:28,983 INFO L78 Accepts]: Start accepts. Automaton has 3181 states and 12171 transitions. Word has length 16 [2019-12-07 18:16:28,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:16:28,984 INFO L462 AbstractCegarLoop]: Abstraction has 3181 states and 12171 transitions. [2019-12-07 18:16:28,984 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 18:16:28,984 INFO L276 IsEmpty]: Start isEmpty. Operand 3181 states and 12171 transitions. [2019-12-07 18:16:28,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-07 18:16:28,985 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:16:28,985 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:16:28,985 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-12-07 18:16:28,985 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:16:28,985 INFO L82 PathProgramCache]: Analyzing trace with hash 439630726, now seen corresponding path program 1 times [2019-12-07 18:16:28,986 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:16:28,986 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1385274828] [2019-12-07 18:16:28,986 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:16:28,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:16:29,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-12-07 18:16:29,044 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1385274828] [2019-12-07 18:16:29,044 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:16:29,045 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-07 18:16:29,045 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1681183366] [2019-12-07 18:16:29,045 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 18:16:29,045 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:16:29,045 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 18:16:29,045 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-12-07 18:16:29,045 INFO L87 Difference]: Start difference. First operand 3181 states and 12171 transitions. Second operand 7 states. [2019-12-07 18:16:29,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:16:29,241 INFO L93 Difference]: Finished difference Result 4417 states and 17212 transitions. [2019-12-07 18:16:29,241 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-07 18:16:29,242 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 17 [2019-12-07 18:16:29,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:16:29,258 INFO L225 Difference]: With dead ends: 4417 [2019-12-07 18:16:29,258 INFO L226 Difference]: Without dead ends: 4393 [2019-12-07 18:16:29,258 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-12-07 18:16:29,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4393 states. [2019-12-07 18:16:29,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4393 to 3588. [2019-12-07 18:16:29,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3588 states. [2019-12-07 18:16:29,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3588 states to 3588 states and 14085 transitions. [2019-12-07 18:16:29,347 INFO L78 Accepts]: Start accepts. Automaton has 3588 states and 14085 transitions. Word has length 17 [2019-12-07 18:16:29,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:16:29,347 INFO L462 AbstractCegarLoop]: Abstraction has 3588 states and 14085 transitions. [2019-12-07 18:16:29,347 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 18:16:29,347 INFO L276 IsEmpty]: Start isEmpty. Operand 3588 states and 14085 transitions. [2019-12-07 18:16:29,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-07 18:16:29,349 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:16:29,349 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:16:29,349 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-12-07 18:16:29,349 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:16:29,349 INFO L82 PathProgramCache]: Analyzing trace with hash 1784829996, now seen corresponding path program 2 times [2019-12-07 18:16:29,349 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:16:29,350 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1414488982] [2019-12-07 18:16:29,350 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:16:29,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:16:29,399 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:16:29,399 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1414488982] [2019-12-07 18:16:29,400 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:16:29,400 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 18:16:29,400 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [342696574] [2019-12-07 18:16:29,400 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 18:16:29,400 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:16:29,400 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 18:16:29,401 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-07 18:16:29,401 INFO L87 Difference]: Start difference. First operand 3588 states and 14085 transitions. Second operand 6 states. [2019-12-07 18:16:29,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:16:29,476 INFO L93 Difference]: Finished difference Result 4024 states and 15445 transitions. [2019-12-07 18:16:29,476 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 18:16:29,476 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 17 [2019-12-07 18:16:29,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:16:29,485 INFO L225 Difference]: With dead ends: 4024 [2019-12-07 18:16:29,485 INFO L226 Difference]: Without dead ends: 4024 [2019-12-07 18:16:29,486 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-12-07 18:16:29,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4024 states. [2019-12-07 18:16:29,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4024 to 3573. [2019-12-07 18:16:29,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3573 states. [2019-12-07 18:16:29,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3573 states to 3573 states and 14045 transitions. [2019-12-07 18:16:29,564 INFO L78 Accepts]: Start accepts. Automaton has 3573 states and 14045 transitions. Word has length 17 [2019-12-07 18:16:29,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:16:29,565 INFO L462 AbstractCegarLoop]: Abstraction has 3573 states and 14045 transitions. [2019-12-07 18:16:29,565 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 18:16:29,565 INFO L276 IsEmpty]: Start isEmpty. Operand 3573 states and 14045 transitions. [2019-12-07 18:16:29,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-07 18:16:29,566 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:16:29,566 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:16:29,567 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-12-07 18:16:29,567 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:16:29,567 INFO L82 PathProgramCache]: Analyzing trace with hash -2096337026, now seen corresponding path program 1 times [2019-12-07 18:16:29,567 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:16:29,567 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1049150738] [2019-12-07 18:16:29,567 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:16:29,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:16:29,634 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:16:29,635 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1049150738] [2019-12-07 18:16:29,635 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:16:29,635 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-07 18:16:29,635 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1886763122] [2019-12-07 18:16:29,635 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 18:16:29,636 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:16:29,636 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 18:16:29,636 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-12-07 18:16:29,636 INFO L87 Difference]: Start difference. First operand 3573 states and 14045 transitions. Second operand 7 states. [2019-12-07 18:16:29,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:16:29,772 INFO L93 Difference]: Finished difference Result 4225 states and 16225 transitions. [2019-12-07 18:16:29,772 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-07 18:16:29,772 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 18 [2019-12-07 18:16:29,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:16:29,780 INFO L225 Difference]: With dead ends: 4225 [2019-12-07 18:16:29,780 INFO L226 Difference]: Without dead ends: 4129 [2019-12-07 18:16:29,781 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-12-07 18:16:29,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4129 states. [2019-12-07 18:16:29,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4129 to 3713. [2019-12-07 18:16:29,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3713 states. [2019-12-07 18:16:29,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3713 states to 3713 states and 14455 transitions. [2019-12-07 18:16:29,874 INFO L78 Accepts]: Start accepts. Automaton has 3713 states and 14455 transitions. Word has length 18 [2019-12-07 18:16:29,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:16:29,874 INFO L462 AbstractCegarLoop]: Abstraction has 3713 states and 14455 transitions. [2019-12-07 18:16:29,874 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 18:16:29,874 INFO L276 IsEmpty]: Start isEmpty. Operand 3713 states and 14455 transitions. [2019-12-07 18:16:29,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-07 18:16:29,875 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:16:29,875 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:16:29,876 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-12-07 18:16:29,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:16:29,876 INFO L82 PathProgramCache]: Analyzing trace with hash -1440753652, now seen corresponding path program 2 times [2019-12-07 18:16:29,876 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:16:29,876 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1875950372] [2019-12-07 18:16:29,876 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:16:29,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:16:29,956 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:16:29,956 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1875950372] [2019-12-07 18:16:29,956 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:16:29,956 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-07 18:16:29,957 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [660334020] [2019-12-07 18:16:29,957 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-07 18:16:29,957 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:16:29,957 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-07 18:16:29,957 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-12-07 18:16:29,957 INFO L87 Difference]: Start difference. First operand 3713 states and 14455 transitions. Second operand 8 states. [2019-12-07 18:16:30,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:16:30,289 INFO L93 Difference]: Finished difference Result 4979 states and 19779 transitions. [2019-12-07 18:16:30,290 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-07 18:16:30,290 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 18 [2019-12-07 18:16:30,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:16:30,299 INFO L225 Difference]: With dead ends: 4979 [2019-12-07 18:16:30,300 INFO L226 Difference]: Without dead ends: 4905 [2019-12-07 18:16:30,300 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=128, Unknown=0, NotChecked=0, Total=182 [2019-12-07 18:16:30,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4905 states. [2019-12-07 18:16:30,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4905 to 4131. [2019-12-07 18:16:30,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4131 states. [2019-12-07 18:16:30,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4131 states to 4131 states and 16620 transitions. [2019-12-07 18:16:30,380 INFO L78 Accepts]: Start accepts. Automaton has 4131 states and 16620 transitions. Word has length 18 [2019-12-07 18:16:30,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:16:30,381 INFO L462 AbstractCegarLoop]: Abstraction has 4131 states and 16620 transitions. [2019-12-07 18:16:30,381 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-07 18:16:30,381 INFO L276 IsEmpty]: Start isEmpty. Operand 4131 states and 16620 transitions. [2019-12-07 18:16:30,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-07 18:16:30,382 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:16:30,382 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:16:30,382 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-12-07 18:16:30,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:16:30,382 INFO L82 PathProgramCache]: Analyzing trace with hash 2054209068, now seen corresponding path program 3 times [2019-12-07 18:16:30,382 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:16:30,382 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1558706369] [2019-12-07 18:16:30,382 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:16:30,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:16:30,463 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:16:30,463 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1558706369] [2019-12-07 18:16:30,463 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:16:30,463 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-07 18:16:30,463 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [182749809] [2019-12-07 18:16:30,463 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-07 18:16:30,464 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:16:30,464 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-07 18:16:30,464 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-12-07 18:16:30,464 INFO L87 Difference]: Start difference. First operand 4131 states and 16620 transitions. Second operand 9 states. [2019-12-07 18:16:30,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:16:30,670 INFO L93 Difference]: Finished difference Result 6735 states and 27904 transitions. [2019-12-07 18:16:30,671 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-07 18:16:30,671 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 18 [2019-12-07 18:16:30,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:16:30,682 INFO L225 Difference]: With dead ends: 6735 [2019-12-07 18:16:30,682 INFO L226 Difference]: Without dead ends: 6661 [2019-12-07 18:16:30,682 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2019-12-07 18:16:30,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6661 states. [2019-12-07 18:16:30,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6661 to 4129. [2019-12-07 18:16:30,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4129 states. [2019-12-07 18:16:30,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4129 states to 4129 states and 16616 transitions. [2019-12-07 18:16:30,767 INFO L78 Accepts]: Start accepts. Automaton has 4129 states and 16616 transitions. Word has length 18 [2019-12-07 18:16:30,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:16:30,767 INFO L462 AbstractCegarLoop]: Abstraction has 4129 states and 16616 transitions. [2019-12-07 18:16:30,767 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-07 18:16:30,767 INFO L276 IsEmpty]: Start isEmpty. Operand 4129 states and 16616 transitions. [2019-12-07 18:16:30,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-07 18:16:30,768 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:16:30,768 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:16:30,768 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-12-07 18:16:30,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:16:30,768 INFO L82 PathProgramCache]: Analyzing trace with hash -1150446370, now seen corresponding path program 4 times [2019-12-07 18:16:30,768 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:16:30,769 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1161358226] [2019-12-07 18:16:30,769 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:16:30,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:16:30,926 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:16:30,926 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1161358226] [2019-12-07 18:16:30,927 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:16:30,927 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-07 18:16:30,927 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [826410177] [2019-12-07 18:16:30,927 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-07 18:16:30,927 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:16:30,927 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-07 18:16:30,927 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2019-12-07 18:16:30,927 INFO L87 Difference]: Start difference. First operand 4129 states and 16616 transitions. Second operand 11 states. [2019-12-07 18:16:31,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:16:31,560 INFO L93 Difference]: Finished difference Result 5384 states and 21910 transitions. [2019-12-07 18:16:31,560 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-07 18:16:31,561 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 18 [2019-12-07 18:16:31,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:16:31,569 INFO L225 Difference]: With dead ends: 5384 [2019-12-07 18:16:31,569 INFO L226 Difference]: Without dead ends: 5310 [2019-12-07 18:16:31,569 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=91, Invalid=215, Unknown=0, NotChecked=0, Total=306 [2019-12-07 18:16:31,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5310 states. [2019-12-07 18:16:31,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5310 to 4116. [2019-12-07 18:16:31,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4116 states. [2019-12-07 18:16:31,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4116 states to 4116 states and 16578 transitions. [2019-12-07 18:16:31,638 INFO L78 Accepts]: Start accepts. Automaton has 4116 states and 16578 transitions. Word has length 18 [2019-12-07 18:16:31,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:16:31,639 INFO L462 AbstractCegarLoop]: Abstraction has 4116 states and 16578 transitions. [2019-12-07 18:16:31,639 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-07 18:16:31,639 INFO L276 IsEmpty]: Start isEmpty. Operand 4116 states and 16578 transitions. [2019-12-07 18:16:31,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-07 18:16:31,640 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:16:31,640 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-12-07 18:16:31,640 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-12-07 18:16:31,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:16:31,641 INFO L82 PathProgramCache]: Analyzing trace with hash 1529508729, now seen corresponding path program 1 times [2019-12-07 18:16:31,641 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:16:31,641 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1411249185] [2019-12-07 18:16:31,641 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:16:31,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:16:31,700 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:16:31,700 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1411249185] [2019-12-07 18:16:31,700 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:16:31,700 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-07 18:16:31,701 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [833505233] [2019-12-07 18:16:31,701 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 18:16:31,701 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:16:31,701 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 18:16:31,701 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-07 18:16:31,701 INFO L87 Difference]: Start difference. First operand 4116 states and 16578 transitions. Second operand 7 states. [2019-12-07 18:16:31,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:16:31,803 INFO L93 Difference]: Finished difference Result 4625 states and 18119 transitions. [2019-12-07 18:16:31,803 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 18:16:31,803 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 19 [2019-12-07 18:16:31,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:16:31,812 INFO L225 Difference]: With dead ends: 4625 [2019-12-07 18:16:31,812 INFO L226 Difference]: Without dead ends: 4625 [2019-12-07 18:16:31,812 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-07 18:16:31,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4625 states. [2019-12-07 18:16:31,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4625 to 4078. [2019-12-07 18:16:31,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4078 states. [2019-12-07 18:16:31,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4078 states to 4078 states and 16436 transitions. [2019-12-07 18:16:31,879 INFO L78 Accepts]: Start accepts. Automaton has 4078 states and 16436 transitions. Word has length 19 [2019-12-07 18:16:31,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:16:31,879 INFO L462 AbstractCegarLoop]: Abstraction has 4078 states and 16436 transitions. [2019-12-07 18:16:31,879 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 18:16:31,879 INFO L276 IsEmpty]: Start isEmpty. Operand 4078 states and 16436 transitions. [2019-12-07 18:16:31,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-07 18:16:31,880 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:16:31,880 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-12-07 18:16:31,880 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-12-07 18:16:31,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:16:31,881 INFO L82 PathProgramCache]: Analyzing trace with hash 386755117, now seen corresponding path program 1 times [2019-12-07 18:16:31,881 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:16:31,881 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1903508947] [2019-12-07 18:16:31,881 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:16:31,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:16:32,066 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:16:32,067 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1903508947] [2019-12-07 18:16:32,067 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:16:32,067 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-07 18:16:32,067 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1339518723] [2019-12-07 18:16:32,067 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-07 18:16:32,067 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:16:32,067 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-07 18:16:32,067 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2019-12-07 18:16:32,068 INFO L87 Difference]: Start difference. First operand 4078 states and 16436 transitions. Second operand 12 states. [2019-12-07 18:16:32,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:16:32,818 INFO L93 Difference]: Finished difference Result 5865 states and 24362 transitions. [2019-12-07 18:16:32,818 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-07 18:16:32,818 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 19 [2019-12-07 18:16:32,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:16:32,852 INFO L225 Difference]: With dead ends: 5865 [2019-12-07 18:16:32,852 INFO L226 Difference]: Without dead ends: 5791 [2019-12-07 18:16:32,853 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=100, Invalid=242, Unknown=0, NotChecked=0, Total=342 [2019-12-07 18:16:32,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5791 states. [2019-12-07 18:16:32,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5791 to 4021. [2019-12-07 18:16:32,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4021 states. [2019-12-07 18:16:32,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4021 states to 4021 states and 16226 transitions. [2019-12-07 18:16:32,925 INFO L78 Accepts]: Start accepts. Automaton has 4021 states and 16226 transitions. Word has length 19 [2019-12-07 18:16:32,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:16:32,925 INFO L462 AbstractCegarLoop]: Abstraction has 4021 states and 16226 transitions. [2019-12-07 18:16:32,925 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-07 18:16:32,925 INFO L276 IsEmpty]: Start isEmpty. Operand 4021 states and 16226 transitions. [2019-12-07 18:16:32,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-12-07 18:16:32,926 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:16:32,926 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-12-07 18:16:32,926 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-12-07 18:16:32,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:16:32,927 INFO L82 PathProgramCache]: Analyzing trace with hash 169969073, now seen corresponding path program 1 times [2019-12-07 18:16:32,927 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:16:32,927 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [380127176] [2019-12-07 18:16:32,927 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:16:32,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:16:33,014 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:16:33,014 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [380127176] [2019-12-07 18:16:33,015 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:16:33,015 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-07 18:16:33,015 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [625080034] [2019-12-07 18:16:33,015 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-07 18:16:33,015 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:16:33,015 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-07 18:16:33,015 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2019-12-07 18:16:33,015 INFO L87 Difference]: Start difference. First operand 4021 states and 16226 transitions. Second operand 10 states. [2019-12-07 18:16:33,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:16:33,438 INFO L93 Difference]: Finished difference Result 5436 states and 21881 transitions. [2019-12-07 18:16:33,438 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 18:16:33,438 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 20 [2019-12-07 18:16:33,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:16:33,449 INFO L225 Difference]: With dead ends: 5436 [2019-12-07 18:16:33,449 INFO L226 Difference]: Without dead ends: 5390 [2019-12-07 18:16:33,450 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2019-12-07 18:16:33,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5390 states. [2019-12-07 18:16:33,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5390 to 4174. [2019-12-07 18:16:33,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4174 states. [2019-12-07 18:16:33,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4174 states to 4174 states and 16952 transitions. [2019-12-07 18:16:33,524 INFO L78 Accepts]: Start accepts. Automaton has 4174 states and 16952 transitions. Word has length 20 [2019-12-07 18:16:33,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:16:33,524 INFO L462 AbstractCegarLoop]: Abstraction has 4174 states and 16952 transitions. [2019-12-07 18:16:33,524 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-07 18:16:33,524 INFO L276 IsEmpty]: Start isEmpty. Operand 4174 states and 16952 transitions. [2019-12-07 18:16:33,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-12-07 18:16:33,526 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:16:33,526 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-12-07 18:16:33,526 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-12-07 18:16:33,526 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:16:33,526 INFO L82 PathProgramCache]: Analyzing trace with hash -1932078158, now seen corresponding path program 1 times [2019-12-07 18:16:33,526 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:16:33,526 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1593561388] [2019-12-07 18:16:33,526 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:16:33,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:16:33,620 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:16:33,620 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1593561388] [2019-12-07 18:16:33,620 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:16:33,621 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-07 18:16:33,621 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1130130087] [2019-12-07 18:16:33,621 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-07 18:16:33,621 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:16:33,621 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-07 18:16:33,622 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2019-12-07 18:16:33,622 INFO L87 Difference]: Start difference. First operand 4174 states and 16952 transitions. Second operand 10 states. [2019-12-07 18:16:33,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:16:33,894 INFO L93 Difference]: Finished difference Result 5508 states and 22462 transitions. [2019-12-07 18:16:33,894 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-07 18:16:33,894 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 20 [2019-12-07 18:16:33,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:16:33,902 INFO L225 Difference]: With dead ends: 5508 [2019-12-07 18:16:33,903 INFO L226 Difference]: Without dead ends: 5462 [2019-12-07 18:16:33,903 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=149, Unknown=0, NotChecked=0, Total=210 [2019-12-07 18:16:33,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5462 states. [2019-12-07 18:16:33,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5462 to 4020. [2019-12-07 18:16:33,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4020 states. [2019-12-07 18:16:33,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4020 states to 4020 states and 16223 transitions. [2019-12-07 18:16:33,973 INFO L78 Accepts]: Start accepts. Automaton has 4020 states and 16223 transitions. Word has length 20 [2019-12-07 18:16:33,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:16:33,973 INFO L462 AbstractCegarLoop]: Abstraction has 4020 states and 16223 transitions. [2019-12-07 18:16:33,973 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-07 18:16:33,973 INFO L276 IsEmpty]: Start isEmpty. Operand 4020 states and 16223 transitions. [2019-12-07 18:16:33,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-12-07 18:16:33,975 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:16:33,975 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-12-07 18:16:33,975 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-12-07 18:16:33,975 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:16:33,975 INFO L82 PathProgramCache]: Analyzing trace with hash -944906415, now seen corresponding path program 2 times [2019-12-07 18:16:33,975 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:16:33,975 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1803644301] [2019-12-07 18:16:33,975 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:16:33,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:16:34,121 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:16:34,121 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1803644301] [2019-12-07 18:16:34,121 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:16:34,121 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-07 18:16:34,121 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [779537049] [2019-12-07 18:16:34,122 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-07 18:16:34,122 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:16:34,122 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-07 18:16:34,122 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-12-07 18:16:34,122 INFO L87 Difference]: Start difference. First operand 4020 states and 16223 transitions. Second operand 10 states. [2019-12-07 18:16:34,497 WARN L192 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 34 [2019-12-07 18:16:35,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:16:35,390 INFO L93 Difference]: Finished difference Result 5427 states and 21857 transitions. [2019-12-07 18:16:35,391 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-07 18:16:35,391 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 20 [2019-12-07 18:16:35,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:16:35,401 INFO L225 Difference]: With dead ends: 5427 [2019-12-07 18:16:35,401 INFO L226 Difference]: Without dead ends: 5381 [2019-12-07 18:16:35,401 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-12-07 18:16:35,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5381 states. [2019-12-07 18:16:35,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5381 to 4169. [2019-12-07 18:16:35,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4169 states. [2019-12-07 18:16:35,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4169 states to 4169 states and 16935 transitions. [2019-12-07 18:16:35,498 INFO L78 Accepts]: Start accepts. Automaton has 4169 states and 16935 transitions. Word has length 20 [2019-12-07 18:16:35,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:16:35,499 INFO L462 AbstractCegarLoop]: Abstraction has 4169 states and 16935 transitions. [2019-12-07 18:16:35,499 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-07 18:16:35,499 INFO L276 IsEmpty]: Start isEmpty. Operand 4169 states and 16935 transitions. [2019-12-07 18:16:35,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-12-07 18:16:35,500 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:16:35,500 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-12-07 18:16:35,500 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-12-07 18:16:35,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:16:35,501 INFO L82 PathProgramCache]: Analyzing trace with hash 1562884562, now seen corresponding path program 2 times [2019-12-07 18:16:35,501 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:16:35,501 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1851231283] [2019-12-07 18:16:35,501 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:16:35,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:16:35,601 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:16:35,602 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1851231283] [2019-12-07 18:16:35,602 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:16:35,602 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-07 18:16:35,602 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1161566330] [2019-12-07 18:16:35,602 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-07 18:16:35,603 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:16:35,603 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-07 18:16:35,603 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2019-12-07 18:16:35,603 INFO L87 Difference]: Start difference. First operand 4169 states and 16935 transitions. Second operand 10 states. [2019-12-07 18:16:36,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:16:36,003 INFO L93 Difference]: Finished difference Result 6798 states and 27735 transitions. [2019-12-07 18:16:36,003 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-07 18:16:36,003 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 20 [2019-12-07 18:16:36,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:16:36,014 INFO L225 Difference]: With dead ends: 6798 [2019-12-07 18:16:36,014 INFO L226 Difference]: Without dead ends: 6752 [2019-12-07 18:16:36,015 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=86, Invalid=186, Unknown=0, NotChecked=0, Total=272 [2019-12-07 18:16:36,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6752 states. [2019-12-07 18:16:36,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6752 to 4168. [2019-12-07 18:16:36,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4168 states. [2019-12-07 18:16:36,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4168 states to 4168 states and 16934 transitions. [2019-12-07 18:16:36,092 INFO L78 Accepts]: Start accepts. Automaton has 4168 states and 16934 transitions. Word has length 20 [2019-12-07 18:16:36,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:16:36,093 INFO L462 AbstractCegarLoop]: Abstraction has 4168 states and 16934 transitions. [2019-12-07 18:16:36,093 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-07 18:16:36,093 INFO L276 IsEmpty]: Start isEmpty. Operand 4168 states and 16934 transitions. [2019-12-07 18:16:36,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-12-07 18:16:36,094 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:16:36,094 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-12-07 18:16:36,094 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-12-07 18:16:36,094 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:16:36,094 INFO L82 PathProgramCache]: Analyzing trace with hash -1659645476, now seen corresponding path program 3 times [2019-12-07 18:16:36,095 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:16:36,095 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [367898481] [2019-12-07 18:16:36,095 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:16:36,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:16:36,199 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:16:36,199 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [367898481] [2019-12-07 18:16:36,200 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:16:36,200 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-07 18:16:36,200 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1007919476] [2019-12-07 18:16:36,200 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-07 18:16:36,200 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:16:36,200 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-07 18:16:36,200 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-12-07 18:16:36,200 INFO L87 Difference]: Start difference. First operand 4168 states and 16934 transitions. Second operand 10 states. [2019-12-07 18:16:36,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:16:36,509 INFO L93 Difference]: Finished difference Result 5273 states and 21186 transitions. [2019-12-07 18:16:36,509 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 18:16:36,509 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 20 [2019-12-07 18:16:36,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:16:36,517 INFO L225 Difference]: With dead ends: 5273 [2019-12-07 18:16:36,517 INFO L226 Difference]: Without dead ends: 5227 [2019-12-07 18:16:36,517 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=124, Unknown=0, NotChecked=0, Total=182 [2019-12-07 18:16:36,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5227 states. [2019-12-07 18:16:36,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5227 to 4013. [2019-12-07 18:16:36,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4013 states. [2019-12-07 18:16:36,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4013 states to 4013 states and 16202 transitions. [2019-12-07 18:16:36,581 INFO L78 Accepts]: Start accepts. Automaton has 4013 states and 16202 transitions. Word has length 20 [2019-12-07 18:16:36,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:16:36,581 INFO L462 AbstractCegarLoop]: Abstraction has 4013 states and 16202 transitions. [2019-12-07 18:16:36,581 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-07 18:16:36,581 INFO L276 IsEmpty]: Start isEmpty. Operand 4013 states and 16202 transitions. [2019-12-07 18:16:36,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-12-07 18:16:36,583 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:16:36,583 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-12-07 18:16:36,583 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-12-07 18:16:36,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:16:36,583 INFO L82 PathProgramCache]: Analyzing trace with hash 1961766501, now seen corresponding path program 3 times [2019-12-07 18:16:36,583 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:16:36,584 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1620822597] [2019-12-07 18:16:36,584 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:16:36,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:16:36,639 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:16:36,639 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1620822597] [2019-12-07 18:16:36,639 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:16:36,639 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-07 18:16:36,640 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1421700435] [2019-12-07 18:16:36,640 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-07 18:16:36,640 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:16:36,640 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-07 18:16:36,640 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-12-07 18:16:36,640 INFO L87 Difference]: Start difference. First operand 4013 states and 16202 transitions. Second operand 8 states. [2019-12-07 18:16:36,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:16:36,803 INFO L93 Difference]: Finished difference Result 6360 states and 25585 transitions. [2019-12-07 18:16:36,803 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-07 18:16:36,803 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 20 [2019-12-07 18:16:36,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:16:36,815 INFO L225 Difference]: With dead ends: 6360 [2019-12-07 18:16:36,815 INFO L226 Difference]: Without dead ends: 6314 [2019-12-07 18:16:36,815 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2019-12-07 18:16:36,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6314 states. [2019-12-07 18:16:36,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6314 to 3983. [2019-12-07 18:16:36,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3983 states. [2019-12-07 18:16:36,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3983 states to 3983 states and 16133 transitions. [2019-12-07 18:16:36,886 INFO L78 Accepts]: Start accepts. Automaton has 3983 states and 16133 transitions. Word has length 20 [2019-12-07 18:16:36,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:16:36,887 INFO L462 AbstractCegarLoop]: Abstraction has 3983 states and 16133 transitions. [2019-12-07 18:16:36,887 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-07 18:16:36,887 INFO L276 IsEmpty]: Start isEmpty. Operand 3983 states and 16133 transitions. [2019-12-07 18:16:36,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-07 18:16:36,888 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:16:36,888 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-12-07 18:16:36,888 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-12-07 18:16:36,889 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:16:36,889 INFO L82 PathProgramCache]: Analyzing trace with hash 2117723117, now seen corresponding path program 1 times [2019-12-07 18:16:36,889 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:16:36,889 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1088606173] [2019-12-07 18:16:36,889 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:16:36,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:16:36,924 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:16:36,925 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1088606173] [2019-12-07 18:16:36,925 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:16:36,925 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-07 18:16:36,925 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [41947057] [2019-12-07 18:16:36,925 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 18:16:36,925 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:16:36,925 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 18:16:36,926 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-12-07 18:16:36,926 INFO L87 Difference]: Start difference. First operand 3983 states and 16133 transitions. Second operand 7 states. [2019-12-07 18:16:37,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:16:37,058 INFO L93 Difference]: Finished difference Result 4762 states and 18800 transitions. [2019-12-07 18:16:37,058 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-07 18:16:37,058 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 21 [2019-12-07 18:16:37,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:16:37,066 INFO L225 Difference]: With dead ends: 4762 [2019-12-07 18:16:37,066 INFO L226 Difference]: Without dead ends: 4687 [2019-12-07 18:16:37,066 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-12-07 18:16:37,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4687 states. [2019-12-07 18:16:37,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4687 to 4305. [2019-12-07 18:16:37,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4305 states. [2019-12-07 18:16:37,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4305 states to 4305 states and 17320 transitions. [2019-12-07 18:16:37,143 INFO L78 Accepts]: Start accepts. Automaton has 4305 states and 17320 transitions. Word has length 21 [2019-12-07 18:16:37,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:16:37,143 INFO L462 AbstractCegarLoop]: Abstraction has 4305 states and 17320 transitions. [2019-12-07 18:16:37,143 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 18:16:37,143 INFO L276 IsEmpty]: Start isEmpty. Operand 4305 states and 17320 transitions. [2019-12-07 18:16:37,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-07 18:16:37,145 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:16:37,145 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-12-07 18:16:37,145 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-12-07 18:16:37,145 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:16:37,145 INFO L82 PathProgramCache]: Analyzing trace with hash -1335103446, now seen corresponding path program 1 times [2019-12-07 18:16:37,146 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:16:37,146 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [280834681] [2019-12-07 18:16:37,146 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:16:37,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:16:37,204 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:16:37,204 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [280834681] [2019-12-07 18:16:37,204 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:16:37,204 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-07 18:16:37,204 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1797235258] [2019-12-07 18:16:37,204 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-07 18:16:37,204 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:16:37,205 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-07 18:16:37,205 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2019-12-07 18:16:37,205 INFO L87 Difference]: Start difference. First operand 4305 states and 17320 transitions. Second operand 8 states. [2019-12-07 18:16:37,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:16:37,292 INFO L93 Difference]: Finished difference Result 4856 states and 18991 transitions. [2019-12-07 18:16:37,292 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 18:16:37,292 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 21 [2019-12-07 18:16:37,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:16:37,298 INFO L225 Difference]: With dead ends: 4856 [2019-12-07 18:16:37,298 INFO L226 Difference]: Without dead ends: 4329 [2019-12-07 18:16:37,299 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2019-12-07 18:16:37,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4329 states. [2019-12-07 18:16:37,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4329 to 3712. [2019-12-07 18:16:37,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3712 states. [2019-12-07 18:16:37,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3712 states to 3712 states and 14646 transitions. [2019-12-07 18:16:37,351 INFO L78 Accepts]: Start accepts. Automaton has 3712 states and 14646 transitions. Word has length 21 [2019-12-07 18:16:37,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:16:37,351 INFO L462 AbstractCegarLoop]: Abstraction has 3712 states and 14646 transitions. [2019-12-07 18:16:37,351 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-07 18:16:37,351 INFO L276 IsEmpty]: Start isEmpty. Operand 3712 states and 14646 transitions. [2019-12-07 18:16:37,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-07 18:16:37,352 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:16:37,352 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-12-07 18:16:37,352 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-12-07 18:16:37,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:16:37,353 INFO L82 PathProgramCache]: Analyzing trace with hash -1959403642, now seen corresponding path program 1 times [2019-12-07 18:16:37,353 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:16:37,353 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [844651583] [2019-12-07 18:16:37,353 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:16:37,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:16:37,548 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:16:37,549 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [844651583] [2019-12-07 18:16:37,549 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:16:37,549 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-07 18:16:37,549 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1907378] [2019-12-07 18:16:37,549 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-07 18:16:37,549 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:16:37,549 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-07 18:16:37,549 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2019-12-07 18:16:37,550 INFO L87 Difference]: Start difference. First operand 3712 states and 14646 transitions. Second operand 12 states. [2019-12-07 18:16:38,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:16:38,314 INFO L93 Difference]: Finished difference Result 4906 states and 19112 transitions. [2019-12-07 18:16:38,315 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-07 18:16:38,315 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 21 [2019-12-07 18:16:38,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:16:38,322 INFO L225 Difference]: With dead ends: 4906 [2019-12-07 18:16:38,322 INFO L226 Difference]: Without dead ends: 4857 [2019-12-07 18:16:38,322 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=88, Invalid=218, Unknown=0, NotChecked=0, Total=306 [2019-12-07 18:16:38,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4857 states. [2019-12-07 18:16:38,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4857 to 3488. [2019-12-07 18:16:38,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3488 states. [2019-12-07 18:16:38,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3488 states to 3488 states and 13508 transitions. [2019-12-07 18:16:38,376 INFO L78 Accepts]: Start accepts. Automaton has 3488 states and 13508 transitions. Word has length 21 [2019-12-07 18:16:38,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:16:38,376 INFO L462 AbstractCegarLoop]: Abstraction has 3488 states and 13508 transitions. [2019-12-07 18:16:38,376 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-07 18:16:38,376 INFO L276 IsEmpty]: Start isEmpty. Operand 3488 states and 13508 transitions. [2019-12-07 18:16:38,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-07 18:16:38,377 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:16:38,377 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-12-07 18:16:38,377 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-12-07 18:16:38,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:16:38,378 INFO L82 PathProgramCache]: Analyzing trace with hash -1977277281, now seen corresponding path program 1 times [2019-12-07 18:16:38,378 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:16:38,378 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [809855589] [2019-12-07 18:16:38,378 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:16:38,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:16:38,560 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:16:38,560 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [809855589] [2019-12-07 18:16:38,561 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:16:38,561 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-07 18:16:38,561 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [962432918] [2019-12-07 18:16:38,561 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-07 18:16:38,561 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:16:38,561 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-07 18:16:38,561 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2019-12-07 18:16:38,561 INFO L87 Difference]: Start difference. First operand 3488 states and 13508 transitions. Second operand 11 states. [2019-12-07 18:16:39,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:16:39,268 INFO L93 Difference]: Finished difference Result 4464 states and 17193 transitions. [2019-12-07 18:16:39,269 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-07 18:16:39,269 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 21 [2019-12-07 18:16:39,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:16:39,278 INFO L225 Difference]: With dead ends: 4464 [2019-12-07 18:16:39,278 INFO L226 Difference]: Without dead ends: 4415 [2019-12-07 18:16:39,278 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=78, Invalid=194, Unknown=0, NotChecked=0, Total=272 [2019-12-07 18:16:39,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4415 states. [2019-12-07 18:16:39,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4415 to 3330. [2019-12-07 18:16:39,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3330 states. [2019-12-07 18:16:39,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3330 states to 3330 states and 12802 transitions. [2019-12-07 18:16:39,334 INFO L78 Accepts]: Start accepts. Automaton has 3330 states and 12802 transitions. Word has length 21 [2019-12-07 18:16:39,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:16:39,334 INFO L462 AbstractCegarLoop]: Abstraction has 3330 states and 12802 transitions. [2019-12-07 18:16:39,334 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-07 18:16:39,334 INFO L276 IsEmpty]: Start isEmpty. Operand 3330 states and 12802 transitions. [2019-12-07 18:16:39,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-07 18:16:39,336 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:16:39,336 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-12-07 18:16:39,336 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-12-07 18:16:39,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:16:39,337 INFO L82 PathProgramCache]: Analyzing trace with hash -430854838, now seen corresponding path program 1 times [2019-12-07 18:16:39,337 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:16:39,337 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1600380098] [2019-12-07 18:16:39,337 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:16:39,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:16:39,594 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:16:39,594 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1600380098] [2019-12-07 18:16:39,594 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:16:39,594 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-07 18:16:39,594 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [328194966] [2019-12-07 18:16:39,594 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-07 18:16:39,595 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:16:39,595 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-07 18:16:39,595 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2019-12-07 18:16:39,595 INFO L87 Difference]: Start difference. First operand 3330 states and 12802 transitions. Second operand 12 states. [2019-12-07 18:16:40,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:16:40,166 INFO L93 Difference]: Finished difference Result 3991 states and 15112 transitions. [2019-12-07 18:16:40,166 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-07 18:16:40,166 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 21 [2019-12-07 18:16:40,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:16:40,172 INFO L225 Difference]: With dead ends: 3991 [2019-12-07 18:16:40,172 INFO L226 Difference]: Without dead ends: 3835 [2019-12-07 18:16:40,172 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=99, Invalid=243, Unknown=0, NotChecked=0, Total=342 [2019-12-07 18:16:40,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3835 states. [2019-12-07 18:16:40,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3835 to 2831. [2019-12-07 18:16:40,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2831 states. [2019-12-07 18:16:40,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2831 states to 2831 states and 10625 transitions. [2019-12-07 18:16:40,217 INFO L78 Accepts]: Start accepts. Automaton has 2831 states and 10625 transitions. Word has length 21 [2019-12-07 18:16:40,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:16:40,217 INFO L462 AbstractCegarLoop]: Abstraction has 2831 states and 10625 transitions. [2019-12-07 18:16:40,217 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-07 18:16:40,217 INFO L276 IsEmpty]: Start isEmpty. Operand 2831 states and 10625 transitions. [2019-12-07 18:16:40,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-07 18:16:40,219 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:16:40,219 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-12-07 18:16:40,219 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-12-07 18:16:40,219 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:16:40,219 INFO L82 PathProgramCache]: Analyzing trace with hash 641940987, now seen corresponding path program 1 times [2019-12-07 18:16:40,219 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:16:40,220 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [201265881] [2019-12-07 18:16:40,220 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:16:40,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:16:40,287 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:16:40,287 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [201265881] [2019-12-07 18:16:40,287 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:16:40,287 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-07 18:16:40,288 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1738346347] [2019-12-07 18:16:40,288 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-07 18:16:40,288 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:16:40,288 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-07 18:16:40,288 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-12-07 18:16:40,288 INFO L87 Difference]: Start difference. First operand 2831 states and 10625 transitions. Second operand 8 states. [2019-12-07 18:16:40,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:16:40,512 INFO L93 Difference]: Finished difference Result 3550 states and 13085 transitions. [2019-12-07 18:16:40,512 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-07 18:16:40,512 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 22 [2019-12-07 18:16:40,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:16:40,517 INFO L225 Difference]: With dead ends: 3550 [2019-12-07 18:16:40,518 INFO L226 Difference]: Without dead ends: 3490 [2019-12-07 18:16:40,518 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=128, Unknown=0, NotChecked=0, Total=182 [2019-12-07 18:16:40,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3490 states. [2019-12-07 18:16:40,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3490 to 2828. [2019-12-07 18:16:40,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2828 states. [2019-12-07 18:16:40,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2828 states to 2828 states and 10620 transitions. [2019-12-07 18:16:40,560 INFO L78 Accepts]: Start accepts. Automaton has 2828 states and 10620 transitions. Word has length 22 [2019-12-07 18:16:40,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:16:40,560 INFO L462 AbstractCegarLoop]: Abstraction has 2828 states and 10620 transitions. [2019-12-07 18:16:40,560 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-07 18:16:40,560 INFO L276 IsEmpty]: Start isEmpty. Operand 2828 states and 10620 transitions. [2019-12-07 18:16:40,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-07 18:16:40,562 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:16:40,562 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-12-07 18:16:40,562 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-12-07 18:16:40,562 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:16:40,562 INFO L82 PathProgramCache]: Analyzing trace with hash -109833189, now seen corresponding path program 2 times [2019-12-07 18:16:40,562 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:16:40,562 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [547138562] [2019-12-07 18:16:40,562 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:16:40,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:16:40,641 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:16:40,641 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [547138562] [2019-12-07 18:16:40,642 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:16:40,642 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-07 18:16:40,642 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1466080596] [2019-12-07 18:16:40,642 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-07 18:16:40,642 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:16:40,642 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-07 18:16:40,642 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-12-07 18:16:40,642 INFO L87 Difference]: Start difference. First operand 2828 states and 10620 transitions. Second operand 9 states. [2019-12-07 18:16:40,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:16:40,965 INFO L93 Difference]: Finished difference Result 3862 states and 14252 transitions. [2019-12-07 18:16:40,966 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-07 18:16:40,966 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2019-12-07 18:16:40,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:16:40,971 INFO L225 Difference]: With dead ends: 3862 [2019-12-07 18:16:40,971 INFO L226 Difference]: Without dead ends: 3802 [2019-12-07 18:16:40,971 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=70, Invalid=170, Unknown=0, NotChecked=0, Total=240 [2019-12-07 18:16:40,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3802 states. [2019-12-07 18:16:41,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3802 to 2822. [2019-12-07 18:16:41,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2822 states. [2019-12-07 18:16:41,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2822 states to 2822 states and 10606 transitions. [2019-12-07 18:16:41,010 INFO L78 Accepts]: Start accepts. Automaton has 2822 states and 10606 transitions. Word has length 22 [2019-12-07 18:16:41,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:16:41,010 INFO L462 AbstractCegarLoop]: Abstraction has 2822 states and 10606 transitions. [2019-12-07 18:16:41,010 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-07 18:16:41,010 INFO L276 IsEmpty]: Start isEmpty. Operand 2822 states and 10606 transitions. [2019-12-07 18:16:41,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-07 18:16:41,011 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:16:41,011 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-12-07 18:16:41,011 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-12-07 18:16:41,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:16:41,012 INFO L82 PathProgramCache]: Analyzing trace with hash -1541949331, now seen corresponding path program 3 times [2019-12-07 18:16:41,012 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:16:41,012 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2141995281] [2019-12-07 18:16:41,012 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:16:41,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:16:41,087 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:16:41,087 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2141995281] [2019-12-07 18:16:41,087 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:16:41,087 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-07 18:16:41,087 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2031942571] [2019-12-07 18:16:41,088 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-07 18:16:41,088 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:16:41,088 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-07 18:16:41,088 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2019-12-07 18:16:41,088 INFO L87 Difference]: Start difference. First operand 2822 states and 10606 transitions. Second operand 10 states. [2019-12-07 18:16:42,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:16:42,187 INFO L93 Difference]: Finished difference Result 3525 states and 13034 transitions. [2019-12-07 18:16:42,189 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 18:16:42,189 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 22 [2019-12-07 18:16:42,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:16:42,202 INFO L225 Difference]: With dead ends: 3525 [2019-12-07 18:16:42,203 INFO L226 Difference]: Without dead ends: 3465 [2019-12-07 18:16:42,203 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=58, Invalid=98, Unknown=0, NotChecked=0, Total=156 [2019-12-07 18:16:42,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3465 states. [2019-12-07 18:16:42,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3465 to 2822. [2019-12-07 18:16:42,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2822 states. [2019-12-07 18:16:42,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2822 states to 2822 states and 10606 transitions. [2019-12-07 18:16:42,253 INFO L78 Accepts]: Start accepts. Automaton has 2822 states and 10606 transitions. Word has length 22 [2019-12-07 18:16:42,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:16:42,253 INFO L462 AbstractCegarLoop]: Abstraction has 2822 states and 10606 transitions. [2019-12-07 18:16:42,253 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-07 18:16:42,253 INFO L276 IsEmpty]: Start isEmpty. Operand 2822 states and 10606 transitions. [2019-12-07 18:16:42,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-07 18:16:42,255 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:16:42,255 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-12-07 18:16:42,255 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-12-07 18:16:42,255 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:16:42,255 INFO L82 PathProgramCache]: Analyzing trace with hash -1025373391, now seen corresponding path program 4 times [2019-12-07 18:16:42,255 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:16:42,255 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1958054348] [2019-12-07 18:16:42,255 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:16:42,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:16:42,426 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:16:42,426 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1958054348] [2019-12-07 18:16:42,426 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:16:42,426 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-07 18:16:42,426 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2004441895] [2019-12-07 18:16:42,426 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-07 18:16:42,426 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:16:42,427 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-07 18:16:42,427 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2019-12-07 18:16:42,427 INFO L87 Difference]: Start difference. First operand 2822 states and 10606 transitions. Second operand 11 states. [2019-12-07 18:16:42,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:16:42,735 INFO L93 Difference]: Finished difference Result 3740 states and 13820 transitions. [2019-12-07 18:16:42,735 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 18:16:42,735 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 22 [2019-12-07 18:16:42,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:16:42,741 INFO L225 Difference]: With dead ends: 3740 [2019-12-07 18:16:42,742 INFO L226 Difference]: Without dead ends: 3680 [2019-12-07 18:16:42,742 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=144, Unknown=0, NotChecked=0, Total=210 [2019-12-07 18:16:42,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3680 states. [2019-12-07 18:16:42,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3680 to 2822. [2019-12-07 18:16:42,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2822 states. [2019-12-07 18:16:42,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2822 states to 2822 states and 10603 transitions. [2019-12-07 18:16:42,785 INFO L78 Accepts]: Start accepts. Automaton has 2822 states and 10603 transitions. Word has length 22 [2019-12-07 18:16:42,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:16:42,786 INFO L462 AbstractCegarLoop]: Abstraction has 2822 states and 10603 transitions. [2019-12-07 18:16:42,786 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-07 18:16:42,786 INFO L276 IsEmpty]: Start isEmpty. Operand 2822 states and 10603 transitions. [2019-12-07 18:16:42,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-07 18:16:42,787 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:16:42,787 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-12-07 18:16:42,787 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-12-07 18:16:42,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:16:42,787 INFO L82 PathProgramCache]: Analyzing trace with hash -1258119955, now seen corresponding path program 5 times [2019-12-07 18:16:42,788 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:16:42,788 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1326193610] [2019-12-07 18:16:42,788 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:16:42,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:16:42,870 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:16:42,870 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1326193610] [2019-12-07 18:16:42,870 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:16:42,870 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-07 18:16:42,870 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1839201176] [2019-12-07 18:16:42,871 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-07 18:16:42,871 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:16:42,871 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-07 18:16:42,871 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2019-12-07 18:16:42,871 INFO L87 Difference]: Start difference. First operand 2822 states and 10603 transitions. Second operand 10 states. [2019-12-07 18:16:43,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:16:43,135 INFO L93 Difference]: Finished difference Result 4237 states and 15414 transitions. [2019-12-07 18:16:43,135 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-07 18:16:43,135 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 22 [2019-12-07 18:16:43,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:16:43,141 INFO L225 Difference]: With dead ends: 4237 [2019-12-07 18:16:43,141 INFO L226 Difference]: Without dead ends: 4177 [2019-12-07 18:16:43,141 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=140, Unknown=0, NotChecked=0, Total=210 [2019-12-07 18:16:43,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4177 states. [2019-12-07 18:16:43,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4177 to 2670. [2019-12-07 18:16:43,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2670 states. [2019-12-07 18:16:43,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2670 states to 2670 states and 9904 transitions. [2019-12-07 18:16:43,181 INFO L78 Accepts]: Start accepts. Automaton has 2670 states and 9904 transitions. Word has length 22 [2019-12-07 18:16:43,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:16:43,181 INFO L462 AbstractCegarLoop]: Abstraction has 2670 states and 9904 transitions. [2019-12-07 18:16:43,181 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-07 18:16:43,181 INFO L276 IsEmpty]: Start isEmpty. Operand 2670 states and 9904 transitions. [2019-12-07 18:16:43,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-12-07 18:16:43,182 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:16:43,182 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-12-07 18:16:43,183 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-12-07 18:16:43,183 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:16:43,183 INFO L82 PathProgramCache]: Analyzing trace with hash -230669277, now seen corresponding path program 1 times [2019-12-07 18:16:43,183 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:16:43,183 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [593832561] [2019-12-07 18:16:43,183 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:16:43,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:16:43,399 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:16:43,399 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [593832561] [2019-12-07 18:16:43,400 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:16:43,400 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-07 18:16:43,400 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1015512441] [2019-12-07 18:16:43,400 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-07 18:16:43,400 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:16:43,400 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-07 18:16:43,400 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2019-12-07 18:16:43,400 INFO L87 Difference]: Start difference. First operand 2670 states and 9904 transitions. Second operand 12 states. [2019-12-07 18:16:43,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:16:43,892 INFO L93 Difference]: Finished difference Result 3103 states and 11113 transitions. [2019-12-07 18:16:43,893 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-07 18:16:43,893 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 23 [2019-12-07 18:16:43,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:16:43,897 INFO L225 Difference]: With dead ends: 3103 [2019-12-07 18:16:43,897 INFO L226 Difference]: Without dead ends: 3007 [2019-12-07 18:16:43,897 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=98, Invalid=244, Unknown=0, NotChecked=0, Total=342 [2019-12-07 18:16:43,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3007 states. [2019-12-07 18:16:43,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3007 to 2170. [2019-12-07 18:16:43,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2170 states. [2019-12-07 18:16:43,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2170 states to 2170 states and 7789 transitions. [2019-12-07 18:16:43,926 INFO L78 Accepts]: Start accepts. Automaton has 2170 states and 7789 transitions. Word has length 23 [2019-12-07 18:16:43,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:16:43,926 INFO L462 AbstractCegarLoop]: Abstraction has 2170 states and 7789 transitions. [2019-12-07 18:16:43,926 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-07 18:16:43,926 INFO L276 IsEmpty]: Start isEmpty. Operand 2170 states and 7789 transitions. [2019-12-07 18:16:43,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-12-07 18:16:43,928 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:16:43,928 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-12-07 18:16:43,928 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-12-07 18:16:43,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:16:43,928 INFO L82 PathProgramCache]: Analyzing trace with hash 1022800040, now seen corresponding path program 1 times [2019-12-07 18:16:43,928 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:16:43,928 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1505960914] [2019-12-07 18:16:43,928 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:16:43,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:16:44,156 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:16:44,156 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1505960914] [2019-12-07 18:16:44,156 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:16:44,156 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-07 18:16:44,156 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [623061694] [2019-12-07 18:16:44,156 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-07 18:16:44,156 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:16:44,157 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-07 18:16:44,157 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2019-12-07 18:16:44,157 INFO L87 Difference]: Start difference. First operand 2170 states and 7789 transitions. Second operand 11 states. [2019-12-07 18:16:44,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:16:44,482 INFO L93 Difference]: Finished difference Result 2812 states and 10003 transitions. [2019-12-07 18:16:44,483 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-07 18:16:44,483 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 23 [2019-12-07 18:16:44,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:16:44,486 INFO L225 Difference]: With dead ends: 2812 [2019-12-07 18:16:44,486 INFO L226 Difference]: Without dead ends: 2755 [2019-12-07 18:16:44,487 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=67, Invalid=143, Unknown=0, NotChecked=0, Total=210 [2019-12-07 18:16:44,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2755 states. [2019-12-07 18:16:44,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2755 to 2130. [2019-12-07 18:16:44,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2130 states. [2019-12-07 18:16:44,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2130 states to 2130 states and 7633 transitions. [2019-12-07 18:16:44,515 INFO L78 Accepts]: Start accepts. Automaton has 2130 states and 7633 transitions. Word has length 23 [2019-12-07 18:16:44,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:16:44,515 INFO L462 AbstractCegarLoop]: Abstraction has 2130 states and 7633 transitions. [2019-12-07 18:16:44,515 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-07 18:16:44,515 INFO L276 IsEmpty]: Start isEmpty. Operand 2130 states and 7633 transitions. [2019-12-07 18:16:44,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-12-07 18:16:44,516 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:16:44,516 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-12-07 18:16:44,517 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-12-07 18:16:44,517 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:16:44,517 INFO L82 PathProgramCache]: Analyzing trace with hash 1539375980, now seen corresponding path program 2 times [2019-12-07 18:16:44,517 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:16:44,517 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [979700822] [2019-12-07 18:16:44,517 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:16:44,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:16:44,728 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:16:44,728 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [979700822] [2019-12-07 18:16:44,728 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:16:44,728 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-12-07 18:16:44,728 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1227926694] [2019-12-07 18:16:44,729 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-07 18:16:44,729 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:16:44,729 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-07 18:16:44,729 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2019-12-07 18:16:44,729 INFO L87 Difference]: Start difference. First operand 2130 states and 7633 transitions. Second operand 13 states. [2019-12-07 18:16:45,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:16:45,328 INFO L93 Difference]: Finished difference Result 2895 states and 10221 transitions. [2019-12-07 18:16:45,328 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-07 18:16:45,328 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 23 [2019-12-07 18:16:45,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:16:45,332 INFO L225 Difference]: With dead ends: 2895 [2019-12-07 18:16:45,332 INFO L226 Difference]: Without dead ends: 2778 [2019-12-07 18:16:45,333 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=127, Invalid=335, Unknown=0, NotChecked=0, Total=462 [2019-12-07 18:16:45,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2778 states. [2019-12-07 18:16:45,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2778 to 1842. [2019-12-07 18:16:45,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1842 states. [2019-12-07 18:16:45,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1842 states to 1842 states and 6495 transitions. [2019-12-07 18:16:45,359 INFO L78 Accepts]: Start accepts. Automaton has 1842 states and 6495 transitions. Word has length 23 [2019-12-07 18:16:45,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:16:45,359 INFO L462 AbstractCegarLoop]: Abstraction has 1842 states and 6495 transitions. [2019-12-07 18:16:45,359 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-07 18:16:45,359 INFO L276 IsEmpty]: Start isEmpty. Operand 1842 states and 6495 transitions. [2019-12-07 18:16:45,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-12-07 18:16:45,360 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:16:45,360 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-12-07 18:16:45,360 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-12-07 18:16:45,360 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:16:45,361 INFO L82 PathProgramCache]: Analyzing trace with hash -396779108, now seen corresponding path program 1 times [2019-12-07 18:16:45,361 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:16:45,361 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1654745314] [2019-12-07 18:16:45,361 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:16:45,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:16:45,398 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:16:45,399 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1654745314] [2019-12-07 18:16:45,399 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:16:45,399 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-07 18:16:45,399 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [449105152] [2019-12-07 18:16:45,399 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 18:16:45,399 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:16:45,400 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 18:16:45,400 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-12-07 18:16:45,400 INFO L87 Difference]: Start difference. First operand 1842 states and 6495 transitions. Second operand 7 states. [2019-12-07 18:16:45,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:16:45,532 INFO L93 Difference]: Finished difference Result 2339 states and 7931 transitions. [2019-12-07 18:16:45,532 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-07 18:16:45,532 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 24 [2019-12-07 18:16:45,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:16:45,535 INFO L225 Difference]: With dead ends: 2339 [2019-12-07 18:16:45,535 INFO L226 Difference]: Without dead ends: 2275 [2019-12-07 18:16:45,535 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-12-07 18:16:45,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2275 states. [2019-12-07 18:16:45,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2275 to 2154. [2019-12-07 18:16:45,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2154 states. [2019-12-07 18:16:45,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2154 states to 2154 states and 7487 transitions. [2019-12-07 18:16:45,559 INFO L78 Accepts]: Start accepts. Automaton has 2154 states and 7487 transitions. Word has length 24 [2019-12-07 18:16:45,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:16:45,560 INFO L462 AbstractCegarLoop]: Abstraction has 2154 states and 7487 transitions. [2019-12-07 18:16:45,560 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 18:16:45,560 INFO L276 IsEmpty]: Start isEmpty. Operand 2154 states and 7487 transitions. [2019-12-07 18:16:45,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-12-07 18:16:45,561 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:16:45,561 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-12-07 18:16:45,561 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-12-07 18:16:45,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:16:45,561 INFO L82 PathProgramCache]: Analyzing trace with hash -1742211423, now seen corresponding path program 1 times [2019-12-07 18:16:45,562 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:16:45,562 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1381004351] [2019-12-07 18:16:45,562 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:16:45,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:16:45,634 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:16:45,634 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1381004351] [2019-12-07 18:16:45,635 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:16:45,635 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-07 18:16:45,635 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [770750332] [2019-12-07 18:16:45,635 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-07 18:16:45,635 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:16:45,635 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-07 18:16:45,635 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-07 18:16:45,635 INFO L87 Difference]: Start difference. First operand 2154 states and 7487 transitions. Second operand 9 states. [2019-12-07 18:16:45,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:16:45,898 INFO L93 Difference]: Finished difference Result 3002 states and 10436 transitions. [2019-12-07 18:16:45,899 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-07 18:16:45,899 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 24 [2019-12-07 18:16:45,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:16:45,903 INFO L225 Difference]: With dead ends: 3002 [2019-12-07 18:16:45,903 INFO L226 Difference]: Without dead ends: 2978 [2019-12-07 18:16:45,904 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2019-12-07 18:16:45,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2978 states. [2019-12-07 18:16:45,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2978 to 2153. [2019-12-07 18:16:45,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2153 states. [2019-12-07 18:16:45,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2153 states to 2153 states and 7486 transitions. [2019-12-07 18:16:45,945 INFO L78 Accepts]: Start accepts. Automaton has 2153 states and 7486 transitions. Word has length 24 [2019-12-07 18:16:45,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:16:45,945 INFO L462 AbstractCegarLoop]: Abstraction has 2153 states and 7486 transitions. [2019-12-07 18:16:45,946 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-07 18:16:45,946 INFO L276 IsEmpty]: Start isEmpty. Operand 2153 states and 7486 transitions. [2019-12-07 18:16:45,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-12-07 18:16:45,948 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:16:45,948 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-12-07 18:16:45,948 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-12-07 18:16:45,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:16:45,948 INFO L82 PathProgramCache]: Analyzing trace with hash 1800981697, now seen corresponding path program 2 times [2019-12-07 18:16:45,948 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:16:45,948 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1563208925] [2019-12-07 18:16:45,949 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:16:45,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:16:46,112 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:16:46,113 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1563208925] [2019-12-07 18:16:46,113 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:16:46,113 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-07 18:16:46,113 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [549425446] [2019-12-07 18:16:46,113 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-07 18:16:46,113 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:16:46,113 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-07 18:16:46,113 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2019-12-07 18:16:46,113 INFO L87 Difference]: Start difference. First operand 2153 states and 7486 transitions. Second operand 10 states. [2019-12-07 18:16:46,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:16:46,681 INFO L93 Difference]: Finished difference Result 3010 states and 10450 transitions. [2019-12-07 18:16:46,681 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-07 18:16:46,681 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 24 [2019-12-07 18:16:46,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:16:46,685 INFO L225 Difference]: With dead ends: 3010 [2019-12-07 18:16:46,685 INFO L226 Difference]: Without dead ends: 2986 [2019-12-07 18:16:46,685 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=105, Invalid=275, Unknown=0, NotChecked=0, Total=380 [2019-12-07 18:16:46,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2986 states. [2019-12-07 18:16:46,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2986 to 2156. [2019-12-07 18:16:46,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2156 states. [2019-12-07 18:16:46,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2156 states to 2156 states and 7493 transitions. [2019-12-07 18:16:46,713 INFO L78 Accepts]: Start accepts. Automaton has 2156 states and 7493 transitions. Word has length 24 [2019-12-07 18:16:46,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:16:46,714 INFO L462 AbstractCegarLoop]: Abstraction has 2156 states and 7493 transitions. [2019-12-07 18:16:46,714 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-07 18:16:46,714 INFO L276 IsEmpty]: Start isEmpty. Operand 2156 states and 7493 transitions. [2019-12-07 18:16:46,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-12-07 18:16:46,715 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:16:46,715 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-12-07 18:16:46,715 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-12-07 18:16:46,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:16:46,716 INFO L82 PathProgramCache]: Analyzing trace with hash 652694931, now seen corresponding path program 3 times [2019-12-07 18:16:46,716 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:16:46,716 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [123189963] [2019-12-07 18:16:46,716 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:16:46,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:16:46,826 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:16:46,826 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [123189963] [2019-12-07 18:16:46,826 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:16:46,826 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-07 18:16:46,826 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [317701121] [2019-12-07 18:16:46,826 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-07 18:16:46,826 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:16:46,827 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-07 18:16:46,827 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2019-12-07 18:16:46,827 INFO L87 Difference]: Start difference. First operand 2156 states and 7493 transitions. Second operand 11 states. [2019-12-07 18:16:47,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:16:47,108 INFO L93 Difference]: Finished difference Result 3595 states and 12600 transitions. [2019-12-07 18:16:47,109 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-07 18:16:47,109 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 24 [2019-12-07 18:16:47,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:16:47,113 INFO L225 Difference]: With dead ends: 3595 [2019-12-07 18:16:47,113 INFO L226 Difference]: Without dead ends: 3571 [2019-12-07 18:16:47,113 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=79, Invalid=193, Unknown=0, NotChecked=0, Total=272 [2019-12-07 18:16:47,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3571 states. [2019-12-07 18:16:47,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3571 to 2134. [2019-12-07 18:16:47,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2134 states. [2019-12-07 18:16:47,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2134 states to 2134 states and 7443 transitions. [2019-12-07 18:16:47,145 INFO L78 Accepts]: Start accepts. Automaton has 2134 states and 7443 transitions. Word has length 24 [2019-12-07 18:16:47,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:16:47,145 INFO L462 AbstractCegarLoop]: Abstraction has 2134 states and 7443 transitions. [2019-12-07 18:16:47,146 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-07 18:16:47,146 INFO L276 IsEmpty]: Start isEmpty. Operand 2134 states and 7443 transitions. [2019-12-07 18:16:47,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-12-07 18:16:47,147 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:16:47,147 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-12-07 18:16:47,147 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-12-07 18:16:47,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:16:47,148 INFO L82 PathProgramCache]: Analyzing trace with hash 351528874, now seen corresponding path program 2 times [2019-12-07 18:16:47,148 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:16:47,148 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1692870109] [2019-12-07 18:16:47,148 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:16:47,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:16:47,208 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:16:47,208 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1692870109] [2019-12-07 18:16:47,208 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:16:47,208 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-07 18:16:47,208 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [718562256] [2019-12-07 18:16:47,208 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-07 18:16:47,208 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:16:47,208 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-07 18:16:47,208 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-12-07 18:16:47,209 INFO L87 Difference]: Start difference. First operand 2134 states and 7443 transitions. Second operand 8 states. [2019-12-07 18:16:47,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:16:47,427 INFO L93 Difference]: Finished difference Result 2628 states and 8874 transitions. [2019-12-07 18:16:47,427 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-07 18:16:47,428 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 24 [2019-12-07 18:16:47,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:16:47,431 INFO L225 Difference]: With dead ends: 2628 [2019-12-07 18:16:47,431 INFO L226 Difference]: Without dead ends: 2564 [2019-12-07 18:16:47,431 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=128, Unknown=0, NotChecked=0, Total=182 [2019-12-07 18:16:47,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2564 states. [2019-12-07 18:16:47,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2564 to 2131. [2019-12-07 18:16:47,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2131 states. [2019-12-07 18:16:47,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2131 states to 2131 states and 7438 transitions. [2019-12-07 18:16:47,456 INFO L78 Accepts]: Start accepts. Automaton has 2131 states and 7438 transitions. Word has length 24 [2019-12-07 18:16:47,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:16:47,456 INFO L462 AbstractCegarLoop]: Abstraction has 2131 states and 7438 transitions. [2019-12-07 18:16:47,456 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-07 18:16:47,456 INFO L276 IsEmpty]: Start isEmpty. Operand 2131 states and 7438 transitions. [2019-12-07 18:16:47,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-12-07 18:16:47,458 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:16:47,458 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-12-07 18:16:47,458 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-12-07 18:16:47,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:16:47,458 INFO L82 PathProgramCache]: Analyzing trace with hash -548948534, now seen corresponding path program 3 times [2019-12-07 18:16:47,458 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:16:47,458 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [61167330] [2019-12-07 18:16:47,458 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:16:47,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:16:47,535 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:16:47,535 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [61167330] [2019-12-07 18:16:47,535 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:16:47,535 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-07 18:16:47,535 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2055094610] [2019-12-07 18:16:47,536 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-07 18:16:47,536 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:16:47,536 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-07 18:16:47,536 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-12-07 18:16:47,536 INFO L87 Difference]: Start difference. First operand 2131 states and 7438 transitions. Second operand 9 states. [2019-12-07 18:16:47,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:16:47,796 INFO L93 Difference]: Finished difference Result 2930 states and 9846 transitions. [2019-12-07 18:16:47,796 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-07 18:16:47,796 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 24 [2019-12-07 18:16:47,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:16:47,799 INFO L225 Difference]: With dead ends: 2930 [2019-12-07 18:16:47,799 INFO L226 Difference]: Without dead ends: 2866 [2019-12-07 18:16:47,800 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=70, Invalid=170, Unknown=0, NotChecked=0, Total=240 [2019-12-07 18:16:47,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2866 states. [2019-12-07 18:16:47,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2866 to 2125. [2019-12-07 18:16:47,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2125 states. [2019-12-07 18:16:47,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2125 states to 2125 states and 7424 transitions. [2019-12-07 18:16:47,826 INFO L78 Accepts]: Start accepts. Automaton has 2125 states and 7424 transitions. Word has length 24 [2019-12-07 18:16:47,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:16:47,826 INFO L462 AbstractCegarLoop]: Abstraction has 2125 states and 7424 transitions. [2019-12-07 18:16:47,826 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-07 18:16:47,826 INFO L276 IsEmpty]: Start isEmpty. Operand 2125 states and 7424 transitions. [2019-12-07 18:16:47,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-12-07 18:16:47,828 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:16:47,828 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-12-07 18:16:47,828 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-12-07 18:16:47,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:16:47,828 INFO L82 PathProgramCache]: Analyzing trace with hash -610918652, now seen corresponding path program 4 times [2019-12-07 18:16:47,828 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:16:47,828 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [257629869] [2019-12-07 18:16:47,828 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:16:47,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:16:47,979 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:16:47,980 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [257629869] [2019-12-07 18:16:47,980 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:16:47,980 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-07 18:16:47,980 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1014159693] [2019-12-07 18:16:47,980 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-07 18:16:47,980 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:16:47,980 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-07 18:16:47,980 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2019-12-07 18:16:47,980 INFO L87 Difference]: Start difference. First operand 2125 states and 7424 transitions. Second operand 11 states. [2019-12-07 18:16:48,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:16:48,155 INFO L93 Difference]: Finished difference Result 2567 states and 8721 transitions. [2019-12-07 18:16:48,155 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 18:16:48,155 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 24 [2019-12-07 18:16:48,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:16:48,158 INFO L225 Difference]: With dead ends: 2567 [2019-12-07 18:16:48,158 INFO L226 Difference]: Without dead ends: 2503 [2019-12-07 18:16:48,159 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=68, Invalid=114, Unknown=0, NotChecked=0, Total=182 [2019-12-07 18:16:48,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2503 states. [2019-12-07 18:16:48,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2503 to 2125. [2019-12-07 18:16:48,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2125 states. [2019-12-07 18:16:48,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2125 states to 2125 states and 7424 transitions. [2019-12-07 18:16:48,183 INFO L78 Accepts]: Start accepts. Automaton has 2125 states and 7424 transitions. Word has length 24 [2019-12-07 18:16:48,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:16:48,184 INFO L462 AbstractCegarLoop]: Abstraction has 2125 states and 7424 transitions. [2019-12-07 18:16:48,184 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-07 18:16:48,184 INFO L276 IsEmpty]: Start isEmpty. Operand 2125 states and 7424 transitions. [2019-12-07 18:16:48,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-12-07 18:16:48,185 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:16:48,185 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-12-07 18:16:48,185 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-12-07 18:16:48,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:16:48,185 INFO L82 PathProgramCache]: Analyzing trace with hash -847503804, now seen corresponding path program 5 times [2019-12-07 18:16:48,186 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:16:48,186 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [757799264] [2019-12-07 18:16:48,186 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:16:48,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:16:48,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-12-07 18:16:48,387 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [757799264] [2019-12-07 18:16:48,387 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:16:48,387 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-12-07 18:16:48,387 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2085885726] [2019-12-07 18:16:48,387 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-07 18:16:48,387 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:16:48,387 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-07 18:16:48,387 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2019-12-07 18:16:48,387 INFO L87 Difference]: Start difference. First operand 2125 states and 7424 transitions. Second operand 13 states. [2019-12-07 18:16:48,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:16:48,962 INFO L93 Difference]: Finished difference Result 3312 states and 11307 transitions. [2019-12-07 18:16:48,963 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-07 18:16:48,963 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 24 [2019-12-07 18:16:48,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:16:48,967 INFO L225 Difference]: With dead ends: 3312 [2019-12-07 18:16:48,967 INFO L226 Difference]: Without dead ends: 3184 [2019-12-07 18:16:48,967 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=132, Invalid=330, Unknown=0, NotChecked=0, Total=462 [2019-12-07 18:16:48,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3184 states. [2019-12-07 18:16:49,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3184 to 2185. [2019-12-07 18:16:49,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2185 states. [2019-12-07 18:16:49,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2185 states to 2185 states and 7740 transitions. [2019-12-07 18:16:49,010 INFO L78 Accepts]: Start accepts. Automaton has 2185 states and 7740 transitions. Word has length 24 [2019-12-07 18:16:49,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:16:49,010 INFO L462 AbstractCegarLoop]: Abstraction has 2185 states and 7740 transitions. [2019-12-07 18:16:49,010 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-07 18:16:49,010 INFO L276 IsEmpty]: Start isEmpty. Operand 2185 states and 7740 transitions. [2019-12-07 18:16:49,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-12-07 18:16:49,011 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:16:49,011 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-12-07 18:16:49,012 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-12-07 18:16:49,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:16:49,012 INFO L82 PathProgramCache]: Analyzing trace with hash -2037680112, now seen corresponding path program 6 times [2019-12-07 18:16:49,012 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:16:49,012 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1221477377] [2019-12-07 18:16:49,012 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:16:49,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:16:49,149 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:16:49,149 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1221477377] [2019-12-07 18:16:49,149 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:16:49,150 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-07 18:16:49,150 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1603540169] [2019-12-07 18:16:49,150 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-07 18:16:49,150 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:16:49,150 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-07 18:16:49,150 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2019-12-07 18:16:49,150 INFO L87 Difference]: Start difference. First operand 2185 states and 7740 transitions. Second operand 11 states. [2019-12-07 18:16:49,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:16:49,361 INFO L93 Difference]: Finished difference Result 3092 states and 10338 transitions. [2019-12-07 18:16:49,361 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-07 18:16:49,361 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 24 [2019-12-07 18:16:49,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:16:49,365 INFO L225 Difference]: With dead ends: 3092 [2019-12-07 18:16:49,365 INFO L226 Difference]: Without dead ends: 3028 [2019-12-07 18:16:49,365 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=80, Invalid=160, Unknown=0, NotChecked=0, Total=240 [2019-12-07 18:16:49,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3028 states. [2019-12-07 18:16:49,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3028 to 2005. [2019-12-07 18:16:49,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2005 states. [2019-12-07 18:16:49,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2005 states to 2005 states and 7054 transitions. [2019-12-07 18:16:49,395 INFO L78 Accepts]: Start accepts. Automaton has 2005 states and 7054 transitions. Word has length 24 [2019-12-07 18:16:49,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:16:49,395 INFO L462 AbstractCegarLoop]: Abstraction has 2005 states and 7054 transitions. [2019-12-07 18:16:49,395 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-07 18:16:49,395 INFO L276 IsEmpty]: Start isEmpty. Operand 2005 states and 7054 transitions. [2019-12-07 18:16:49,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-07 18:16:49,397 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:16:49,397 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-12-07 18:16:49,397 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-12-07 18:16:49,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:16:49,397 INFO L82 PathProgramCache]: Analyzing trace with hash 128519362, now seen corresponding path program 1 times [2019-12-07 18:16:49,397 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:16:49,397 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1794312187] [2019-12-07 18:16:49,397 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:16:49,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:16:49,600 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:16:49,600 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1794312187] [2019-12-07 18:16:49,600 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:16:49,600 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-07 18:16:49,600 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1271906981] [2019-12-07 18:16:49,600 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-07 18:16:49,601 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:16:49,601 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-07 18:16:49,601 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2019-12-07 18:16:49,601 INFO L87 Difference]: Start difference. First operand 2005 states and 7054 transitions. Second operand 12 states. [2019-12-07 18:16:50,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:16:50,057 INFO L93 Difference]: Finished difference Result 2627 states and 9048 transitions. [2019-12-07 18:16:50,057 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-07 18:16:50,057 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 25 [2019-12-07 18:16:50,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:16:50,061 INFO L225 Difference]: With dead ends: 2627 [2019-12-07 18:16:50,061 INFO L226 Difference]: Without dead ends: 2604 [2019-12-07 18:16:50,061 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=93, Invalid=249, Unknown=0, NotChecked=0, Total=342 [2019-12-07 18:16:50,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2604 states. [2019-12-07 18:16:50,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2604 to 1613. [2019-12-07 18:16:50,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1613 states. [2019-12-07 18:16:50,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1613 states to 1613 states and 5563 transitions. [2019-12-07 18:16:50,083 INFO L78 Accepts]: Start accepts. Automaton has 1613 states and 5563 transitions. Word has length 25 [2019-12-07 18:16:50,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:16:50,083 INFO L462 AbstractCegarLoop]: Abstraction has 1613 states and 5563 transitions. [2019-12-07 18:16:50,083 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-07 18:16:50,083 INFO L276 IsEmpty]: Start isEmpty. Operand 1613 states and 5563 transitions. [2019-12-07 18:16:50,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-07 18:16:50,085 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:16:50,085 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-12-07 18:16:50,085 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-12-07 18:16:50,085 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:16:50,085 INFO L82 PathProgramCache]: Analyzing trace with hash -1601368368, now seen corresponding path program 1 times [2019-12-07 18:16:50,085 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:16:50,085 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [596649380] [2019-12-07 18:16:50,085 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:16:50,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:16:50,158 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:16:50,158 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [596649380] [2019-12-07 18:16:50,158 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:16:50,158 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-07 18:16:50,158 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [759589911] [2019-12-07 18:16:50,158 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-07 18:16:50,159 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:16:50,159 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-07 18:16:50,159 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2019-12-07 18:16:50,159 INFO L87 Difference]: Start difference. First operand 1613 states and 5563 transitions. Second operand 10 states. [2019-12-07 18:16:50,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:16:50,317 INFO L93 Difference]: Finished difference Result 2230 states and 7382 transitions. [2019-12-07 18:16:50,317 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-07 18:16:50,317 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 26 [2019-12-07 18:16:50,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:16:50,319 INFO L225 Difference]: With dead ends: 2230 [2019-12-07 18:16:50,320 INFO L226 Difference]: Without dead ends: 2208 [2019-12-07 18:16:50,320 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=149, Unknown=0, NotChecked=0, Total=210 [2019-12-07 18:16:50,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2208 states. [2019-12-07 18:16:50,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2208 to 1612. [2019-12-07 18:16:50,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1612 states. [2019-12-07 18:16:50,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1612 states to 1612 states and 5562 transitions. [2019-12-07 18:16:50,340 INFO L78 Accepts]: Start accepts. Automaton has 1612 states and 5562 transitions. Word has length 26 [2019-12-07 18:16:50,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:16:50,340 INFO L462 AbstractCegarLoop]: Abstraction has 1612 states and 5562 transitions. [2019-12-07 18:16:50,340 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-07 18:16:50,340 INFO L276 IsEmpty]: Start isEmpty. Operand 1612 states and 5562 transitions. [2019-12-07 18:16:50,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-07 18:16:50,341 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:16:50,341 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-12-07 18:16:50,341 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-12-07 18:16:50,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:16:50,342 INFO L82 PathProgramCache]: Analyzing trace with hash 1793121520, now seen corresponding path program 2 times [2019-12-07 18:16:50,342 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:16:50,342 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1380638421] [2019-12-07 18:16:50,342 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:16:50,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:16:50,457 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:16:50,457 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1380638421] [2019-12-07 18:16:50,457 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:16:50,457 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-07 18:16:50,457 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [370519287] [2019-12-07 18:16:50,457 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-07 18:16:50,458 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:16:50,458 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-07 18:16:50,458 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2019-12-07 18:16:50,458 INFO L87 Difference]: Start difference. First operand 1612 states and 5562 transitions. Second operand 10 states. [2019-12-07 18:16:51,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:16:51,005 INFO L93 Difference]: Finished difference Result 2230 states and 7379 transitions. [2019-12-07 18:16:51,005 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-07 18:16:51,005 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 26 [2019-12-07 18:16:51,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:16:51,007 INFO L225 Difference]: With dead ends: 2230 [2019-12-07 18:16:51,008 INFO L226 Difference]: Without dead ends: 2208 [2019-12-07 18:16:51,008 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=105, Invalid=275, Unknown=0, NotChecked=0, Total=380 [2019-12-07 18:16:51,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2208 states. [2019-12-07 18:16:51,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2208 to 1615. [2019-12-07 18:16:51,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1615 states. [2019-12-07 18:16:51,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1615 states to 1615 states and 5569 transitions. [2019-12-07 18:16:51,028 INFO L78 Accepts]: Start accepts. Automaton has 1615 states and 5569 transitions. Word has length 26 [2019-12-07 18:16:51,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:16:51,028 INFO L462 AbstractCegarLoop]: Abstraction has 1615 states and 5569 transitions. [2019-12-07 18:16:51,028 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-07 18:16:51,028 INFO L276 IsEmpty]: Start isEmpty. Operand 1615 states and 5569 transitions. [2019-12-07 18:16:51,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-07 18:16:51,029 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:16:51,030 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-12-07 18:16:51,030 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-12-07 18:16:51,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:16:51,030 INFO L82 PathProgramCache]: Analyzing trace with hash 1731151402, now seen corresponding path program 3 times [2019-12-07 18:16:51,030 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:16:51,030 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [212970923] [2019-12-07 18:16:51,030 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:16:51,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:16:51,167 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:16:51,168 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [212970923] [2019-12-07 18:16:51,168 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:16:51,168 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-07 18:16:51,168 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1861403546] [2019-12-07 18:16:51,168 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-07 18:16:51,168 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:16:51,168 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-07 18:16:51,168 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2019-12-07 18:16:51,168 INFO L87 Difference]: Start difference. First operand 1615 states and 5569 transitions. Second operand 12 states. [2019-12-07 18:16:51,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:16:51,422 INFO L93 Difference]: Finished difference Result 2246 states and 7479 transitions. [2019-12-07 18:16:51,422 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-07 18:16:51,422 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 26 [2019-12-07 18:16:51,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:16:51,425 INFO L225 Difference]: With dead ends: 2246 [2019-12-07 18:16:51,425 INFO L226 Difference]: Without dead ends: 2202 [2019-12-07 18:16:51,425 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=92, Invalid=214, Unknown=0, NotChecked=0, Total=306 [2019-12-07 18:16:51,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2202 states. [2019-12-07 18:16:51,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2202 to 1491. [2019-12-07 18:16:51,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1491 states. [2019-12-07 18:16:51,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1491 states to 1491 states and 5039 transitions. [2019-12-07 18:16:51,444 INFO L78 Accepts]: Start accepts. Automaton has 1491 states and 5039 transitions. Word has length 26 [2019-12-07 18:16:51,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:16:51,445 INFO L462 AbstractCegarLoop]: Abstraction has 1491 states and 5039 transitions. [2019-12-07 18:16:51,445 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-07 18:16:51,445 INFO L276 IsEmpty]: Start isEmpty. Operand 1491 states and 5039 transitions. [2019-12-07 18:16:51,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-07 18:16:51,446 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:16:51,446 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-12-07 18:16:51,446 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-12-07 18:16:51,446 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:16:51,446 INFO L82 PathProgramCache]: Analyzing trace with hash 304389942, now seen corresponding path program 4 times [2019-12-07 18:16:51,447 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:16:51,447 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1724238609] [2019-12-07 18:16:51,447 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:16:51,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:16:51,589 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:16:51,589 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1724238609] [2019-12-07 18:16:51,590 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:16:51,590 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-07 18:16:51,590 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [983659703] [2019-12-07 18:16:51,590 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-07 18:16:51,590 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:16:51,590 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-07 18:16:51,590 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2019-12-07 18:16:51,590 INFO L87 Difference]: Start difference. First operand 1491 states and 5039 transitions. Second operand 12 states. [2019-12-07 18:16:51,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:16:51,861 INFO L93 Difference]: Finished difference Result 1544 states and 5003 transitions. [2019-12-07 18:16:51,861 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-07 18:16:51,861 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 26 [2019-12-07 18:16:51,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:16:51,863 INFO L225 Difference]: With dead ends: 1544 [2019-12-07 18:16:51,863 INFO L226 Difference]: Without dead ends: 1500 [2019-12-07 18:16:51,863 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=92, Invalid=214, Unknown=0, NotChecked=0, Total=306 [2019-12-07 18:16:51,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1500 states. [2019-12-07 18:16:51,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1500 to 885. [2019-12-07 18:16:51,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 885 states. [2019-12-07 18:16:51,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 885 states to 885 states and 3033 transitions. [2019-12-07 18:16:51,875 INFO L78 Accepts]: Start accepts. Automaton has 885 states and 3033 transitions. Word has length 26 [2019-12-07 18:16:51,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:16:51,875 INFO L462 AbstractCegarLoop]: Abstraction has 885 states and 3033 transitions. [2019-12-07 18:16:51,875 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-07 18:16:51,875 INFO L276 IsEmpty]: Start isEmpty. Operand 885 states and 3033 transitions. [2019-12-07 18:16:51,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-12-07 18:16:51,876 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:16:51,877 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-12-07 18:16:51,877 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-12-07 18:16:51,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:16:51,877 INFO L82 PathProgramCache]: Analyzing trace with hash -720297978, now seen corresponding path program 1 times [2019-12-07 18:16:51,877 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:16:51,877 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1516874442] [2019-12-07 18:16:51,877 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:16:51,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:16:51,929 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:16:51,929 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1516874442] [2019-12-07 18:16:51,929 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:16:51,929 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-07 18:16:51,930 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1761467028] [2019-12-07 18:16:51,930 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-07 18:16:51,930 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:16:51,930 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-07 18:16:51,930 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-12-07 18:16:51,930 INFO L87 Difference]: Start difference. First operand 885 states and 3033 transitions. Second operand 8 states. [2019-12-07 18:16:52,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:16:52,023 INFO L93 Difference]: Finished difference Result 885 states and 3029 transitions. [2019-12-07 18:16:52,023 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 18:16:52,023 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 41 [2019-12-07 18:16:52,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:16:52,024 INFO L225 Difference]: With dead ends: 885 [2019-12-07 18:16:52,024 INFO L226 Difference]: Without dead ends: 879 [2019-12-07 18:16:52,024 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-12-07 18:16:52,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 879 states. [2019-12-07 18:16:52,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 879 to 879. [2019-12-07 18:16:52,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 879 states. [2019-12-07 18:16:52,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 879 states to 879 states and 3010 transitions. [2019-12-07 18:16:52,035 INFO L78 Accepts]: Start accepts. Automaton has 879 states and 3010 transitions. Word has length 41 [2019-12-07 18:16:52,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:16:52,035 INFO L462 AbstractCegarLoop]: Abstraction has 879 states and 3010 transitions. [2019-12-07 18:16:52,035 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-07 18:16:52,035 INFO L276 IsEmpty]: Start isEmpty. Operand 879 states and 3010 transitions. [2019-12-07 18:16:52,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-12-07 18:16:52,036 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:16:52,036 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-12-07 18:16:52,037 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-12-07 18:16:52,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:16:52,037 INFO L82 PathProgramCache]: Analyzing trace with hash 525302158, now seen corresponding path program 1 times [2019-12-07 18:16:52,037 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:16:52,037 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [830893158] [2019-12-07 18:16:52,037 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:16:52,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:16:52,091 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:16:52,091 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [830893158] [2019-12-07 18:16:52,091 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:16:52,091 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-07 18:16:52,092 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [195571996] [2019-12-07 18:16:52,092 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-07 18:16:52,092 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:16:52,092 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-07 18:16:52,092 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-12-07 18:16:52,092 INFO L87 Difference]: Start difference. First operand 879 states and 3010 transitions. Second operand 8 states. [2019-12-07 18:16:52,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:16:52,186 INFO L93 Difference]: Finished difference Result 879 states and 3006 transitions. [2019-12-07 18:16:52,186 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 18:16:52,186 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 41 [2019-12-07 18:16:52,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:16:52,187 INFO L225 Difference]: With dead ends: 879 [2019-12-07 18:16:52,187 INFO L226 Difference]: Without dead ends: 819 [2019-12-07 18:16:52,187 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-12-07 18:16:52,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 819 states. [2019-12-07 18:16:52,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 819 to 819. [2019-12-07 18:16:52,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 819 states. [2019-12-07 18:16:52,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 819 states to 819 states and 2784 transitions. [2019-12-07 18:16:52,196 INFO L78 Accepts]: Start accepts. Automaton has 819 states and 2784 transitions. Word has length 41 [2019-12-07 18:16:52,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:16:52,196 INFO L462 AbstractCegarLoop]: Abstraction has 819 states and 2784 transitions. [2019-12-07 18:16:52,196 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-07 18:16:52,196 INFO L276 IsEmpty]: Start isEmpty. Operand 819 states and 2784 transitions. [2019-12-07 18:16:52,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-12-07 18:16:52,197 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:16:52,198 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-12-07 18:16:52,198 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-12-07 18:16:52,198 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:16:52,198 INFO L82 PathProgramCache]: Analyzing trace with hash 1075124498, now seen corresponding path program 1 times [2019-12-07 18:16:52,198 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:16:52,198 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [848435533] [2019-12-07 18:16:52,198 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:16:52,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 18:16:52,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 18:16:52,251 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 18:16:52,251 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-12-07 18:16:52,254 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-12-07 18:16:52,255 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-12-07 18:16:52,256 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-12-07 18:16:52,256 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-12-07 18:16:52,256 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-12-07 18:16:52,259 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-12-07 18:16:52,259 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-12-07 18:16:52,260 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-12-07 18:16:52,261 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-12-07 18:16:52,262 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-12-07 18:16:52,264 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-12-07 18:16:52,265 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-12-07 18:16:52,265 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-12-07 18:16:52,270 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-12-07 18:16:52,272 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-12-07 18:16:52,324 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 06:16:52 BasicIcfg [2019-12-07 18:16:52,324 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 18:16:52,324 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 18:16:52,325 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 18:16:52,325 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 18:16:52,325 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 06:16:25" (3/4) ... [2019-12-07 18:16:52,326 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-12-07 18:16:52,327 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-12-07 18:16:52,327 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-12-07 18:16:52,327 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-12-07 18:16:52,327 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-12-07 18:16:52,328 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-12-07 18:16:52,329 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-12-07 18:16:52,329 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-12-07 18:16:52,329 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-12-07 18:16:52,331 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-12-07 18:16:52,331 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-12-07 18:16:52,333 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-12-07 18:16:52,333 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-12-07 18:16:52,333 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-12-07 18:16:52,338 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-12-07 18:16:52,340 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-12-07 18:16:52,377 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_6d41cb63-a41e-4bff-b288-b7dd5a14232f/bin/uautomizer/witness.graphml [2019-12-07 18:16:52,377 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 18:16:52,378 INFO L168 Benchmark]: Toolchain (without parser) took 27509.39 ms. Allocated memory was 1.0 GB in the beginning and 1.9 GB in the end (delta: 852.0 MB). Free memory was 931.4 MB in the beginning and 797.1 MB in the end (delta: 134.3 MB). Peak memory consumption was 986.3 MB. Max. memory is 11.5 GB. [2019-12-07 18:16:52,378 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 955.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 18:16:52,379 INFO L168 Benchmark]: CACSL2BoogieTranslator took 502.34 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 97.5 MB). Free memory was 931.4 MB in the beginning and 1.0 GB in the end (delta: -94.5 MB). Peak memory consumption was 24.5 MB. Max. memory is 11.5 GB. [2019-12-07 18:16:52,379 INFO L168 Benchmark]: Boogie Procedure Inliner took 35.54 ms. Allocated memory is still 1.1 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 18:16:52,379 INFO L168 Benchmark]: Boogie Preprocessor took 19.47 ms. Allocated memory is still 1.1 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 18:16:52,379 INFO L168 Benchmark]: RCFGBuilder took 256.60 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 993.3 MB in the end (delta: 32.6 MB). Peak memory consumption was 32.6 MB. Max. memory is 11.5 GB. [2019-12-07 18:16:52,380 INFO L168 Benchmark]: TraceAbstraction took 26639.09 ms. Allocated memory was 1.1 GB in the beginning and 1.9 GB in the end (delta: 754.5 MB). Free memory was 993.3 MB in the beginning and 824.3 MB in the end (delta: 169.0 MB). Peak memory consumption was 923.5 MB. Max. memory is 11.5 GB. [2019-12-07 18:16:52,380 INFO L168 Benchmark]: Witness Printer took 52.98 ms. Allocated memory is still 1.9 GB. Free memory was 824.3 MB in the beginning and 797.1 MB in the end (delta: 27.2 MB). Peak memory consumption was 27.2 MB. Max. memory is 11.5 GB. [2019-12-07 18:16:52,381 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.18 ms. Allocated memory is still 1.0 GB. Free memory is still 955.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 502.34 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 97.5 MB). Free memory was 931.4 MB in the beginning and 1.0 GB in the end (delta: -94.5 MB). Peak memory consumption was 24.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 35.54 ms. Allocated memory is still 1.1 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 19.47 ms. Allocated memory is still 1.1 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 256.60 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 993.3 MB in the end (delta: 32.6 MB). Peak memory consumption was 32.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 26639.09 ms. Allocated memory was 1.1 GB in the beginning and 1.9 GB in the end (delta: 754.5 MB). Free memory was 993.3 MB in the beginning and 824.3 MB in the end (delta: 169.0 MB). Peak memory consumption was 923.5 MB. Max. memory is 11.5 GB. * Witness Printer took 52.98 ms. Allocated memory is still 1.9 GB. Free memory was 824.3 MB in the beginning and 797.1 MB in the end (delta: 27.2 MB). Peak memory consumption was 27.2 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 1.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: 26.3s, OverallIterations: 47, TraceHistogramMax: 1, AutomataDifference: 16.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 4903 SDtfs, 9208 SDslu, 16268 SDs, 0 SdLazy, 9710 SolverSat, 1377 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 7.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 654 GetRequests, 50 SyntacticMatches, 21 SemanticMatches, 583 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 820 ImplicationChecksByTransitivity, 10.6s 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: 2.3s AutomataMinimizationTime, 46 MinimizatonAttempts, 44427 StatesRemovedByMinimization, 44 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 4.7s 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...