/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe.epf -i ../../../trunk/examples/svcomp/pthread/singleton.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 04:43:14,494 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 04:43:14,498 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 04:43:14,518 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 04:43:14,518 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 04:43:14,520 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 04:43:14,523 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 04:43:14,533 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 04:43:14,538 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 04:43:14,541 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 04:43:14,544 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 04:43:14,546 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 04:43:14,547 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 04:43:14,549 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 04:43:14,552 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 04:43:14,554 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 04:43:14,556 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 04:43:14,557 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 04:43:14,558 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 04:43:14,564 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 04:43:14,570 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 04:43:14,575 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 04:43:14,577 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 04:43:14,578 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 04:43:14,580 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 04:43:14,580 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 04:43:14,580 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 04:43:14,583 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 04:43:14,584 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 04:43:14,585 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 04:43:14,586 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 04:43:14,588 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 04:43:14,589 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 04:43:14,590 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 04:43:14,591 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 04:43:14,592 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 04:43:14,592 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 04:43:14,593 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 04:43:14,593 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 04:43:14,594 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 04:43:14,595 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 04:43:14,596 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe.epf [2019-12-27 04:43:14,618 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 04:43:14,618 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 04:43:14,621 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 04:43:14,625 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 04:43:14,625 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 04:43:14,625 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 04:43:14,626 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 04:43:14,626 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 04:43:14,626 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 04:43:14,626 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 04:43:14,626 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 04:43:14,627 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 04:43:14,627 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 04:43:14,627 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 04:43:14,627 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 04:43:14,628 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 04:43:14,629 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 04:43:14,629 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 04:43:14,630 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 04:43:14,630 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 04:43:14,630 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 04:43:14,630 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 04:43:14,630 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 04:43:14,631 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 04:43:14,631 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 04:43:14,631 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 04:43:14,631 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 04:43:14,632 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2019-12-27 04:43:14,632 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 04:43:14,632 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 04:43:14,924 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 04:43:14,939 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 04:43:14,944 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 04:43:14,945 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 04:43:14,946 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 04:43:14,947 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread/singleton.i [2019-12-27 04:43:15,027 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1f185de8e/bd3a2696445b495da914035effd97b96/FLAGddbd84cec [2019-12-27 04:43:15,685 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 04:43:15,686 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread/singleton.i [2019-12-27 04:43:15,713 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1f185de8e/bd3a2696445b495da914035effd97b96/FLAGddbd84cec [2019-12-27 04:43:15,875 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1f185de8e/bd3a2696445b495da914035effd97b96 [2019-12-27 04:43:15,886 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 04:43:15,889 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 04:43:15,890 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 04:43:15,890 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 04:43:15,894 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 04:43:15,895 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 04:43:15" (1/1) ... [2019-12-27 04:43:15,899 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@34bee71e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:43:15, skipping insertion in model container [2019-12-27 04:43:15,899 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 04:43:15" (1/1) ... [2019-12-27 04:43:15,908 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 04:43:15,987 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 04:43:16,604 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 04:43:16,614 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 04:43:16,660 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 04:43:16,843 INFO L208 MainTranslator]: Completed translation [2019-12-27 04:43:16,844 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:43:16 WrapperNode [2019-12-27 04:43:16,844 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 04:43:16,845 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 04:43:16,845 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 04:43:16,845 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 04:43:16,854 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:43:16" (1/1) ... [2019-12-27 04:43:16,878 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:43:16" (1/1) ... [2019-12-27 04:43:16,898 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 04:43:16,898 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 04:43:16,898 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 04:43:16,899 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 04:43:16,905 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:43:16" (1/1) ... [2019-12-27 04:43:16,905 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:43:16" (1/1) ... [2019-12-27 04:43:16,909 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:43:16" (1/1) ... [2019-12-27 04:43:16,909 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:43:16" (1/1) ... [2019-12-27 04:43:16,917 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:43:16" (1/1) ... [2019-12-27 04:43:16,919 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:43:16" (1/1) ... [2019-12-27 04:43:16,922 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:43:16" (1/1) ... [2019-12-27 04:43:16,925 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 04:43:16,926 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 04:43:16,926 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 04:43:16,926 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 04:43:16,927 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:43:16" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 04:43:16,987 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 04:43:16,987 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 04:43:16,987 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-12-27 04:43:16,987 INFO L130 BoogieDeclarations]: Found specification of procedure thread0 [2019-12-27 04:43:16,988 INFO L138 BoogieDeclarations]: Found implementation of procedure thread0 [2019-12-27 04:43:16,988 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2019-12-27 04:43:16,988 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2019-12-27 04:43:16,988 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2019-12-27 04:43:16,988 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2019-12-27 04:43:16,989 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2019-12-27 04:43:16,989 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2019-12-27 04:43:16,989 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 04:43:16,989 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-12-27 04:43:16,989 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 04:43:16,989 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 04:43:16,991 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-27 04:43:17,431 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 04:43:17,432 INFO L287 CfgBuilder]: Removed 6 assume(true) statements. [2019-12-27 04:43:17,433 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 04:43:17 BoogieIcfgContainer [2019-12-27 04:43:17,434 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 04:43:17,435 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 04:43:17,435 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 04:43:17,440 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 04:43:17,440 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 04:43:15" (1/3) ... [2019-12-27 04:43:17,441 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7691c926 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 04:43:17, skipping insertion in model container [2019-12-27 04:43:17,441 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:43:16" (2/3) ... [2019-12-27 04:43:17,442 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7691c926 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 04:43:17, skipping insertion in model container [2019-12-27 04:43:17,442 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 04:43:17" (3/3) ... [2019-12-27 04:43:17,444 INFO L109 eAbstractionObserver]: Analyzing ICFG singleton.i [2019-12-27 04:43:17,476 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 04:43:17,476 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 04:43:17,487 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-12-27 04:43:17,489 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 04:43:17,538 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:43:17,538 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:43:17,538 WARN L315 ript$VariableManager]: TermVariabe thread0Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:43:17,538 WARN L315 ript$VariableManager]: TermVariabe thread0Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:43:17,539 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:43:17,539 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t1~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:43:17,539 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t2~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:43:17,539 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:43:17,540 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:43:17,540 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t3~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:43:17,540 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t4~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:43:17,541 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t4~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:43:17,541 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t5~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:43:17,541 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t5~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:43:17,541 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:43:17,542 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t1~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:43:17,542 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:43:17,542 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:43:17,543 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t1~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:43:17,543 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#t~mem4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:43:17,543 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#t~mem4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:43:17,544 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t2~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:43:17,544 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:43:17,544 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:43:17,544 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:43:17,545 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t3~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:43:17,545 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:43:17,545 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t4~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:43:17,545 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t4~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:43:17,546 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#t~nondet7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:43:17,546 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t5~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:43:17,546 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t5~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:43:17,546 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#t~nondet8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:43:17,546 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t2~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:43:17,547 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:43:17,547 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:43:17,547 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:43:17,547 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:43:17,548 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t3~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:43:17,548 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#t~mem10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:43:17,548 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#t~mem10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:43:17,548 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t4~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:43:17,549 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t4~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:43:17,549 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#t~mem11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:43:17,549 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#t~mem11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:43:17,549 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t5~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:43:17,549 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t5~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:43:17,550 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#t~mem12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:43:17,550 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#t~mem12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:43:17,550 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:43:17,550 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:43:17,551 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:43:17,551 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:43:17,551 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t1~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:43:17,551 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:43:17,552 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:43:17,552 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t2~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:43:17,552 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:43:17,552 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t3~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:43:17,552 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:43:17,553 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t4~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:43:17,553 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t4~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:43:17,553 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t4~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:43:17,553 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t5~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:43:17,553 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t5~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:43:17,554 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t5~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:43:17,554 WARN L315 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork4_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:43:17,554 WARN L315 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork4_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:43:17,554 WARN L315 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork4_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:43:17,555 WARN L315 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork4_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:43:17,555 WARN L315 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork4_#t~malloc2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:43:17,555 WARN L315 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork4_#t~malloc2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:43:17,555 WARN L315 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork4_#t~malloc2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:43:17,555 WARN L315 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork4_#t~malloc2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:43:17,556 WARN L315 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork4_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:43:17,556 WARN L315 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork4_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:43:17,556 WARN L315 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:43:17,556 WARN L315 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:43:17,557 WARN L315 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:43:17,557 WARN L315 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:43:17,557 WARN L315 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:43:17,557 WARN L315 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:43:17,558 WARN L315 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:43:17,558 WARN L315 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:43:17,558 WARN L315 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:43:17,558 WARN L315 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:43:17,559 WARN L315 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:43:17,559 WARN L315 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:43:17,559 WARN L315 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork5_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:43:17,559 WARN L315 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork5_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:43:17,559 WARN L315 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork5_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:43:17,560 WARN L315 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork5_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:43:17,560 WARN L315 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork5_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:43:17,560 WARN L315 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork5_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:43:17,561 WARN L315 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:43:17,561 WARN L315 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:43:17,561 WARN L315 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:43:17,561 WARN L315 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:43:17,561 WARN L315 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:43:17,561 WARN L315 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:43:17,565 WARN L315 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:43:17,565 WARN L315 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:43:17,565 WARN L315 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:43:17,566 WARN L315 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:43:17,572 WARN L315 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:43:17,573 WARN L315 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:43:17,573 WARN L315 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:43:17,573 WARN L315 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:43:17,585 WARN L315 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:43:17,586 WARN L315 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:43:17,586 WARN L315 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:43:17,586 WARN L315 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:43:17,589 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#t~nondet8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:43:17,589 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#t~mem4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:43:17,589 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:43:17,590 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t4~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:43:17,590 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t2~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:43:17,590 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:43:17,590 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:43:17,590 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#t~mem10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:43:17,591 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#t~mem11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:43:17,592 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t4~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:43:17,592 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#t~mem12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:43:17,592 WARN L315 ript$VariableManager]: TermVariabe thread0Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:43:17,592 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t3~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:43:17,593 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:43:17,593 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:43:17,593 WARN L315 ript$VariableManager]: TermVariabe thread0Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:43:17,593 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:43:17,593 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t1~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:43:17,594 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t5~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:43:17,594 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:43:17,594 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t5~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:43:17,594 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:43:17,594 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:43:17,595 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#t~nondet7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:43:17,600 WARN L315 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork4_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:43:17,600 WARN L315 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork4_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:43:17,600 WARN L315 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork4_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:43:17,600 WARN L315 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork4_#t~malloc2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:43:17,600 WARN L315 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork4_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:43:17,601 WARN L315 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork4_#t~malloc2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:43:17,604 WARN L315 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork5_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:43:17,605 WARN L315 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork5_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:43:17,605 WARN L315 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork5_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:43:17,605 WARN L315 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork5_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:43:17,607 WARN L315 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork4_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:43:17,608 WARN L315 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork4_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:43:17,608 WARN L315 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork4_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:43:17,608 WARN L315 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork4_#t~malloc2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:43:17,608 WARN L315 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork4_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:43:17,608 WARN L315 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork4_#t~malloc2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:43:17,610 WARN L315 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork5_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:43:17,611 WARN L315 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork5_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:43:17,611 WARN L315 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork5_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:43:17,611 WARN L315 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork5_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:43:17,613 WARN L315 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:43:17,614 WARN L315 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:43:17,614 WARN L315 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:43:17,614 WARN L315 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:43:17,616 WARN L315 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:43:17,616 WARN L315 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:43:17,617 WARN L315 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:43:17,617 WARN L315 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:43:17,619 WARN L315 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:43:17,619 WARN L315 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:43:17,619 WARN L315 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:43:17,619 WARN L315 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:43:17,777 INFO L249 AbstractCegarLoop]: Starting to check reachability of 12 error locations. [2019-12-27 04:43:17,798 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 04:43:17,799 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 04:43:17,799 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 04:43:17,799 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-27 04:43:17,799 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 04:43:17,799 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 04:43:17,799 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 04:43:17,800 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 04:43:17,827 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 172 places, 243 transitions [2019-12-27 04:43:17,828 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 172 places, 243 transitions [2019-12-27 04:43:17,985 INFO L132 PetriNetUnfolder]: 61/264 cut-off events. [2019-12-27 04:43:17,986 INFO L133 PetriNetUnfolder]: For 39/39 co-relation queries the response was YES. [2019-12-27 04:43:18,003 INFO L76 FinitePrefix]: Finished finitePrefix Result has 365 conditions, 264 events. 61/264 cut-off events. For 39/39 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 750 event pairs. 0/214 useless extension candidates. Maximal degree in co-relation 353. Up to 24 conditions per place. [2019-12-27 04:43:18,021 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 172 places, 243 transitions [2019-12-27 04:43:18,088 INFO L132 PetriNetUnfolder]: 61/264 cut-off events. [2019-12-27 04:43:18,089 INFO L133 PetriNetUnfolder]: For 39/39 co-relation queries the response was YES. [2019-12-27 04:43:18,093 INFO L76 FinitePrefix]: Finished finitePrefix Result has 365 conditions, 264 events. 61/264 cut-off events. For 39/39 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 750 event pairs. 0/214 useless extension candidates. Maximal degree in co-relation 353. Up to 24 conditions per place. [2019-12-27 04:43:18,106 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 4038 [2019-12-27 04:43:18,107 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-27 04:43:19,426 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 61 [2019-12-27 04:43:20,031 WARN L192 SmtUtils]: Spent 203.00 ms on a formula simplification that was a NOOP. DAG size: 77 [2019-12-27 04:43:20,160 WARN L192 SmtUtils]: Spent 126.00 ms on a formula simplification that was a NOOP. DAG size: 73 [2019-12-27 04:43:20,417 INFO L206 etLargeBlockEncoding]: Checked pairs total: 2242 [2019-12-27 04:43:20,417 INFO L214 etLargeBlockEncoding]: Total number of compositions: 74 [2019-12-27 04:43:20,421 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 99 places, 173 transitions [2019-12-27 04:43:20,984 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 3502 states. [2019-12-27 04:43:20,986 INFO L276 IsEmpty]: Start isEmpty. Operand 3502 states. [2019-12-27 04:43:21,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-12-27 04:43:21,001 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:43:21,002 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 04:43:21,003 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-27 04:43:21,010 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:43:21,010 INFO L82 PathProgramCache]: Analyzing trace with hash -1385407457, now seen corresponding path program 1 times [2019-12-27 04:43:21,021 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:43:21,022 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [376989133] [2019-12-27 04:43:21,022 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:43:21,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:43:21,348 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-27 04:43:21,349 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [376989133] [2019-12-27 04:43:21,350 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 04:43:21,350 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 04:43:21,351 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1092019627] [2019-12-27 04:43:21,355 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 04:43:21,356 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:43:21,371 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 04:43:21,372 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 04:43:21,374 INFO L87 Difference]: Start difference. First operand 3502 states. Second operand 6 states. [2019-12-27 04:43:21,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:43:21,791 INFO L93 Difference]: Finished difference Result 4760 states and 19900 transitions. [2019-12-27 04:43:21,791 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 04:43:21,793 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 9 [2019-12-27 04:43:21,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:43:21,904 INFO L225 Difference]: With dead ends: 4760 [2019-12-27 04:43:21,905 INFO L226 Difference]: Without dead ends: 4272 [2019-12-27 04:43:21,906 INFO L631 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-27 04:43:21,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4272 states. [2019-12-27 04:43:22,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4272 to 3018. [2019-12-27 04:43:22,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3018 states. [2019-12-27 04:43:22,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3018 states to 3018 states and 12272 transitions. [2019-12-27 04:43:22,225 INFO L78 Accepts]: Start accepts. Automaton has 3018 states and 12272 transitions. Word has length 9 [2019-12-27 04:43:22,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:43:22,225 INFO L462 AbstractCegarLoop]: Abstraction has 3018 states and 12272 transitions. [2019-12-27 04:43:22,225 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 04:43:22,225 INFO L276 IsEmpty]: Start isEmpty. Operand 3018 states and 12272 transitions. [2019-12-27 04:43:22,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-12-27 04:43:22,226 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:43:22,226 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 04:43:22,227 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-27 04:43:22,227 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:43:22,227 INFO L82 PathProgramCache]: Analyzing trace with hash -1192062693, now seen corresponding path program 2 times [2019-12-27 04:43:22,227 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:43:22,228 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1843244522] [2019-12-27 04:43:22,228 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:43:22,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:43:22,367 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-27 04:43:22,368 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1843244522] [2019-12-27 04:43:22,368 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 04:43:22,368 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 04:43:22,368 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [80818896] [2019-12-27 04:43:22,369 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 04:43:22,370 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:43:22,370 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 04:43:22,370 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 04:43:22,370 INFO L87 Difference]: Start difference. First operand 3018 states and 12272 transitions. Second operand 6 states. [2019-12-27 04:43:22,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:43:22,697 INFO L93 Difference]: Finished difference Result 5518 states and 23821 transitions. [2019-12-27 04:43:22,697 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 04:43:22,697 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 9 [2019-12-27 04:43:22,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:43:22,752 INFO L225 Difference]: With dead ends: 5518 [2019-12-27 04:43:22,753 INFO L226 Difference]: Without dead ends: 5518 [2019-12-27 04:43:22,753 INFO L631 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-27 04:43:22,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5518 states. [2019-12-27 04:43:22,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5518 to 3008. [2019-12-27 04:43:22,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3008 states. [2019-12-27 04:43:22,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3008 states to 3008 states and 12255 transitions. [2019-12-27 04:43:22,904 INFO L78 Accepts]: Start accepts. Automaton has 3008 states and 12255 transitions. Word has length 9 [2019-12-27 04:43:22,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:43:22,905 INFO L462 AbstractCegarLoop]: Abstraction has 3008 states and 12255 transitions. [2019-12-27 04:43:22,905 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 04:43:22,905 INFO L276 IsEmpty]: Start isEmpty. Operand 3008 states and 12255 transitions. [2019-12-27 04:43:22,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-27 04:43:22,906 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:43:22,907 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 04:43:22,907 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-27 04:43:22,907 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:43:22,907 INFO L82 PathProgramCache]: Analyzing trace with hash 1538202320, now seen corresponding path program 1 times [2019-12-27 04:43:22,908 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:43:22,908 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1107370414] [2019-12-27 04:43:22,908 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:43:22,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:43:23,000 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-27 04:43:23,001 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1107370414] [2019-12-27 04:43:23,001 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 04:43:23,001 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 04:43:23,002 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1195148903] [2019-12-27 04:43:23,003 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 04:43:23,003 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:43:23,003 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 04:43:23,003 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 04:43:23,004 INFO L87 Difference]: Start difference. First operand 3008 states and 12255 transitions. Second operand 3 states. [2019-12-27 04:43:23,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:43:23,091 INFO L93 Difference]: Finished difference Result 4848 states and 19273 transitions. [2019-12-27 04:43:23,091 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 04:43:23,092 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-12-27 04:43:23,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:43:23,184 INFO L225 Difference]: With dead ends: 4848 [2019-12-27 04:43:23,184 INFO L226 Difference]: Without dead ends: 3558 [2019-12-27 04:43:23,184 INFO L631 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-27 04:43:23,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3558 states. [2019-12-27 04:43:23,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3558 to 3181. [2019-12-27 04:43:23,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3181 states. [2019-12-27 04:43:23,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3181 states to 3181 states and 12171 transitions. [2019-12-27 04:43:23,307 INFO L78 Accepts]: Start accepts. Automaton has 3181 states and 12171 transitions. Word has length 16 [2019-12-27 04:43:23,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:43:23,307 INFO L462 AbstractCegarLoop]: Abstraction has 3181 states and 12171 transitions. [2019-12-27 04:43:23,308 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 04:43:23,308 INFO L276 IsEmpty]: Start isEmpty. Operand 3181 states and 12171 transitions. [2019-12-27 04:43:23,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-27 04:43:23,312 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:43:23,312 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 04:43:23,313 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-27 04:43:23,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:43:23,313 INFO L82 PathProgramCache]: Analyzing trace with hash 439630726, now seen corresponding path program 1 times [2019-12-27 04:43:23,314 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:43:23,316 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1541651178] [2019-12-27 04:43:23,316 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:43:23,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:43:23,466 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-27 04:43:23,469 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1541651178] [2019-12-27 04:43:23,469 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 04:43:23,470 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 04:43:23,470 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1525173336] [2019-12-27 04:43:23,470 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 04:43:23,470 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:43:23,471 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 04:43:23,471 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-12-27 04:43:23,471 INFO L87 Difference]: Start difference. First operand 3181 states and 12171 transitions. Second operand 7 states. [2019-12-27 04:43:23,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:43:23,775 INFO L93 Difference]: Finished difference Result 4417 states and 17212 transitions. [2019-12-27 04:43:23,775 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-27 04:43:23,775 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 17 [2019-12-27 04:43:23,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:43:23,796 INFO L225 Difference]: With dead ends: 4417 [2019-12-27 04:43:23,797 INFO L226 Difference]: Without dead ends: 4393 [2019-12-27 04:43:23,797 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2019-12-27 04:43:23,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4393 states. [2019-12-27 04:43:23,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4393 to 3588. [2019-12-27 04:43:23,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3588 states. [2019-12-27 04:43:23,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3588 states to 3588 states and 14085 transitions. [2019-12-27 04:43:23,933 INFO L78 Accepts]: Start accepts. Automaton has 3588 states and 14085 transitions. Word has length 17 [2019-12-27 04:43:23,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:43:23,933 INFO L462 AbstractCegarLoop]: Abstraction has 3588 states and 14085 transitions. [2019-12-27 04:43:23,934 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 04:43:23,934 INFO L276 IsEmpty]: Start isEmpty. Operand 3588 states and 14085 transitions. [2019-12-27 04:43:23,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-27 04:43:23,936 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:43:23,936 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 04:43:23,936 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-27 04:43:23,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:43:23,936 INFO L82 PathProgramCache]: Analyzing trace with hash 1784829996, now seen corresponding path program 2 times [2019-12-27 04:43:23,937 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:43:23,937 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1368117262] [2019-12-27 04:43:23,937 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:43:23,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:43:24,022 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-27 04:43:24,022 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1368117262] [2019-12-27 04:43:24,023 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 04:43:24,023 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 04:43:24,023 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2067882131] [2019-12-27 04:43:24,024 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 04:43:24,024 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:43:24,024 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 04:43:24,024 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-27 04:43:24,025 INFO L87 Difference]: Start difference. First operand 3588 states and 14085 transitions. Second operand 6 states. [2019-12-27 04:43:24,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:43:24,150 INFO L93 Difference]: Finished difference Result 4024 states and 15445 transitions. [2019-12-27 04:43:24,151 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 04:43:24,151 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 17 [2019-12-27 04:43:24,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:43:24,166 INFO L225 Difference]: With dead ends: 4024 [2019-12-27 04:43:24,166 INFO L226 Difference]: Without dead ends: 4024 [2019-12-27 04:43:24,166 INFO L631 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-27 04:43:24,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4024 states. [2019-12-27 04:43:24,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4024 to 3573. [2019-12-27 04:43:24,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3573 states. [2019-12-27 04:43:24,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3573 states to 3573 states and 14045 transitions. [2019-12-27 04:43:24,366 INFO L78 Accepts]: Start accepts. Automaton has 3573 states and 14045 transitions. Word has length 17 [2019-12-27 04:43:24,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:43:24,366 INFO L462 AbstractCegarLoop]: Abstraction has 3573 states and 14045 transitions. [2019-12-27 04:43:24,366 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 04:43:24,366 INFO L276 IsEmpty]: Start isEmpty. Operand 3573 states and 14045 transitions. [2019-12-27 04:43:24,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-27 04:43:24,368 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:43:24,368 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 04:43:24,368 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-27 04:43:24,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:43:24,369 INFO L82 PathProgramCache]: Analyzing trace with hash -2096337026, now seen corresponding path program 1 times [2019-12-27 04:43:24,369 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:43:24,369 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1053859741] [2019-12-27 04:43:24,369 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:43:24,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:43:24,443 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-27 04:43:24,443 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1053859741] [2019-12-27 04:43:24,443 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 04:43:24,443 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 04:43:24,444 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1516610704] [2019-12-27 04:43:24,444 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 04:43:24,444 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:43:24,445 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 04:43:24,445 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-12-27 04:43:24,445 INFO L87 Difference]: Start difference. First operand 3573 states and 14045 transitions. Second operand 7 states. [2019-12-27 04:43:24,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:43:24,655 INFO L93 Difference]: Finished difference Result 4225 states and 16225 transitions. [2019-12-27 04:43:24,655 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-27 04:43:24,656 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 18 [2019-12-27 04:43:24,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:43:24,670 INFO L225 Difference]: With dead ends: 4225 [2019-12-27 04:43:24,670 INFO L226 Difference]: Without dead ends: 4129 [2019-12-27 04:43:24,670 INFO L631 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-27 04:43:24,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4129 states. [2019-12-27 04:43:24,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4129 to 3713. [2019-12-27 04:43:24,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3713 states. [2019-12-27 04:43:24,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3713 states to 3713 states and 14455 transitions. [2019-12-27 04:43:24,793 INFO L78 Accepts]: Start accepts. Automaton has 3713 states and 14455 transitions. Word has length 18 [2019-12-27 04:43:24,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:43:24,793 INFO L462 AbstractCegarLoop]: Abstraction has 3713 states and 14455 transitions. [2019-12-27 04:43:24,793 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 04:43:24,793 INFO L276 IsEmpty]: Start isEmpty. Operand 3713 states and 14455 transitions. [2019-12-27 04:43:24,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-27 04:43:24,795 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:43:24,795 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 04:43:24,795 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-27 04:43:24,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:43:24,795 INFO L82 PathProgramCache]: Analyzing trace with hash -1440753652, now seen corresponding path program 2 times [2019-12-27 04:43:24,796 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:43:24,796 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [673885354] [2019-12-27 04:43:24,796 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:43:24,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:43:24,898 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-27 04:43:24,899 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [673885354] [2019-12-27 04:43:24,899 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 04:43:24,899 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 04:43:24,899 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1150937886] [2019-12-27 04:43:24,900 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 04:43:24,900 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:43:24,900 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 04:43:24,900 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-12-27 04:43:24,901 INFO L87 Difference]: Start difference. First operand 3713 states and 14455 transitions. Second operand 8 states. [2019-12-27 04:43:25,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:43:25,344 INFO L93 Difference]: Finished difference Result 4979 states and 19779 transitions. [2019-12-27 04:43:25,345 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-27 04:43:25,345 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 18 [2019-12-27 04:43:25,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:43:25,362 INFO L225 Difference]: With dead ends: 4979 [2019-12-27 04:43:25,362 INFO L226 Difference]: Without dead ends: 4905 [2019-12-27 04:43:25,363 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2019-12-27 04:43:25,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4905 states. [2019-12-27 04:43:25,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4905 to 4131. [2019-12-27 04:43:25,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4131 states. [2019-12-27 04:43:25,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4131 states to 4131 states and 16620 transitions. [2019-12-27 04:43:25,493 INFO L78 Accepts]: Start accepts. Automaton has 4131 states and 16620 transitions. Word has length 18 [2019-12-27 04:43:25,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:43:25,493 INFO L462 AbstractCegarLoop]: Abstraction has 4131 states and 16620 transitions. [2019-12-27 04:43:25,493 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 04:43:25,494 INFO L276 IsEmpty]: Start isEmpty. Operand 4131 states and 16620 transitions. [2019-12-27 04:43:25,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-27 04:43:25,495 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:43:25,495 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 04:43:25,495 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-27 04:43:25,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:43:25,496 INFO L82 PathProgramCache]: Analyzing trace with hash 2054209068, now seen corresponding path program 3 times [2019-12-27 04:43:25,496 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:43:25,496 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [718823473] [2019-12-27 04:43:25,496 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:43:25,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:43:25,629 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-27 04:43:25,630 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [718823473] [2019-12-27 04:43:25,630 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 04:43:25,630 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 04:43:25,631 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1784617321] [2019-12-27 04:43:25,631 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 04:43:25,631 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:43:25,631 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 04:43:25,632 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-12-27 04:43:25,632 INFO L87 Difference]: Start difference. First operand 4131 states and 16620 transitions. Second operand 9 states. [2019-12-27 04:43:26,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:43:26,095 INFO L93 Difference]: Finished difference Result 6735 states and 27904 transitions. [2019-12-27 04:43:26,096 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 04:43:26,096 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 18 [2019-12-27 04:43:26,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:43:26,119 INFO L225 Difference]: With dead ends: 6735 [2019-12-27 04:43:26,119 INFO L226 Difference]: Without dead ends: 6661 [2019-12-27 04:43:26,119 INFO L631 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-27 04:43:26,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6661 states. [2019-12-27 04:43:26,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6661 to 4129. [2019-12-27 04:43:26,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4129 states. [2019-12-27 04:43:26,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4129 states to 4129 states and 16616 transitions. [2019-12-27 04:43:26,255 INFO L78 Accepts]: Start accepts. Automaton has 4129 states and 16616 transitions. Word has length 18 [2019-12-27 04:43:26,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:43:26,256 INFO L462 AbstractCegarLoop]: Abstraction has 4129 states and 16616 transitions. [2019-12-27 04:43:26,256 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 04:43:26,256 INFO L276 IsEmpty]: Start isEmpty. Operand 4129 states and 16616 transitions. [2019-12-27 04:43:26,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-27 04:43:26,257 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:43:26,258 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 04:43:26,258 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-27 04:43:26,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:43:26,258 INFO L82 PathProgramCache]: Analyzing trace with hash -1150446370, now seen corresponding path program 4 times [2019-12-27 04:43:26,258 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:43:26,259 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [273051949] [2019-12-27 04:43:26,259 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:43:26,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:43:26,415 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 04:43:26,416 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [273051949] [2019-12-27 04:43:26,416 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 04:43:26,416 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 04:43:26,416 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1253769207] [2019-12-27 04:43:26,417 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-27 04:43:26,417 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:43:26,417 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-27 04:43:26,417 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-12-27 04:43:26,417 INFO L87 Difference]: Start difference. First operand 4129 states and 16616 transitions. Second operand 10 states. [2019-12-27 04:43:27,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:43:27,037 INFO L93 Difference]: Finished difference Result 5374 states and 21882 transitions. [2019-12-27 04:43:27,037 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 04:43:27,037 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 18 [2019-12-27 04:43:27,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:43:27,053 INFO L225 Difference]: With dead ends: 5374 [2019-12-27 04:43:27,054 INFO L226 Difference]: Without dead ends: 5300 [2019-12-27 04:43:27,054 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=58, Invalid=124, Unknown=0, NotChecked=0, Total=182 [2019-12-27 04:43:27,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5300 states. [2019-12-27 04:43:27,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5300 to 4114. [2019-12-27 04:43:27,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4114 states. [2019-12-27 04:43:27,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4114 states to 4114 states and 16572 transitions. [2019-12-27 04:43:27,164 INFO L78 Accepts]: Start accepts. Automaton has 4114 states and 16572 transitions. Word has length 18 [2019-12-27 04:43:27,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:43:27,165 INFO L462 AbstractCegarLoop]: Abstraction has 4114 states and 16572 transitions. [2019-12-27 04:43:27,165 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-27 04:43:27,165 INFO L276 IsEmpty]: Start isEmpty. Operand 4114 states and 16572 transitions. [2019-12-27 04:43:27,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-27 04:43:27,166 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:43:27,167 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 04:43:27,167 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-27 04:43:27,167 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:43:27,167 INFO L82 PathProgramCache]: Analyzing trace with hash 1529508729, now seen corresponding path program 1 times [2019-12-27 04:43:27,167 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:43:27,168 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1939879857] [2019-12-27 04:43:27,168 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:43:27,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:43:27,241 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-27 04:43:27,242 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1939879857] [2019-12-27 04:43:27,242 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 04:43:27,242 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 04:43:27,242 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1011930900] [2019-12-27 04:43:27,243 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 04:43:27,243 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:43:27,243 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 04:43:27,243 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-27 04:43:27,243 INFO L87 Difference]: Start difference. First operand 4114 states and 16572 transitions. Second operand 7 states. [2019-12-27 04:43:27,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:43:27,400 INFO L93 Difference]: Finished difference Result 4623 states and 18113 transitions. [2019-12-27 04:43:27,400 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 04:43:27,400 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 19 [2019-12-27 04:43:27,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:43:27,412 INFO L225 Difference]: With dead ends: 4623 [2019-12-27 04:43:27,412 INFO L226 Difference]: Without dead ends: 4623 [2019-12-27 04:43:27,412 INFO L631 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-27 04:43:27,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4623 states. [2019-12-27 04:43:27,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4623 to 4076. [2019-12-27 04:43:27,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4076 states. [2019-12-27 04:43:27,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4076 states to 4076 states and 16430 transitions. [2019-12-27 04:43:27,520 INFO L78 Accepts]: Start accepts. Automaton has 4076 states and 16430 transitions. Word has length 19 [2019-12-27 04:43:27,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:43:27,520 INFO L462 AbstractCegarLoop]: Abstraction has 4076 states and 16430 transitions. [2019-12-27 04:43:27,520 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 04:43:27,520 INFO L276 IsEmpty]: Start isEmpty. Operand 4076 states and 16430 transitions. [2019-12-27 04:43:27,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-27 04:43:27,523 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:43:27,523 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 04:43:27,523 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-27 04:43:27,523 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:43:27,523 INFO L82 PathProgramCache]: Analyzing trace with hash 386755117, now seen corresponding path program 1 times [2019-12-27 04:43:27,524 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:43:27,524 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1513351047] [2019-12-27 04:43:27,524 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:43:27,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:43:28,135 WARN L192 SmtUtils]: Spent 398.00 ms on a formula simplification that was a NOOP. DAG size: 4 [2019-12-27 04:43:28,138 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-27 04:43:28,139 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1513351047] [2019-12-27 04:43:28,139 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 04:43:28,139 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-27 04:43:28,140 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1339961563] [2019-12-27 04:43:28,140 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 04:43:28,140 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:43:28,141 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 04:43:28,141 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2019-12-27 04:43:28,141 INFO L87 Difference]: Start difference. First operand 4076 states and 16430 transitions. Second operand 11 states. [2019-12-27 04:43:28,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:43:28,797 INFO L93 Difference]: Finished difference Result 5825 states and 24230 transitions. [2019-12-27 04:43:28,797 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-27 04:43:28,797 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2019-12-27 04:43:28,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:43:28,811 INFO L225 Difference]: With dead ends: 5825 [2019-12-27 04:43:28,811 INFO L226 Difference]: Without dead ends: 5751 [2019-12-27 04:43:28,812 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=64, Invalid=146, Unknown=0, NotChecked=0, Total=210 [2019-12-27 04:43:28,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5751 states. [2019-12-27 04:43:28,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5751 to 4013. [2019-12-27 04:43:28,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4013 states. [2019-12-27 04:43:28,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4013 states to 4013 states and 16198 transitions. [2019-12-27 04:43:28,943 INFO L78 Accepts]: Start accepts. Automaton has 4013 states and 16198 transitions. Word has length 19 [2019-12-27 04:43:28,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:43:28,943 INFO L462 AbstractCegarLoop]: Abstraction has 4013 states and 16198 transitions. [2019-12-27 04:43:28,943 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 04:43:28,944 INFO L276 IsEmpty]: Start isEmpty. Operand 4013 states and 16198 transitions. [2019-12-27 04:43:28,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-12-27 04:43:28,947 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:43:28,947 INFO L411 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-27 04:43:28,948 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-27 04:43:28,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:43:28,948 INFO L82 PathProgramCache]: Analyzing trace with hash 169969073, now seen corresponding path program 1 times [2019-12-27 04:43:28,949 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:43:28,949 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [804943757] [2019-12-27 04:43:28,949 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:43:28,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:43:29,109 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-27 04:43:29,110 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [804943757] [2019-12-27 04:43:29,110 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 04:43:29,110 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 04:43:29,111 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1392085346] [2019-12-27 04:43:29,111 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-27 04:43:29,111 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:43:29,112 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-27 04:43:29,112 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2019-12-27 04:43:29,112 INFO L87 Difference]: Start difference. First operand 4013 states and 16198 transitions. Second operand 10 states. [2019-12-27 04:43:29,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:43:29,654 INFO L93 Difference]: Finished difference Result 5428 states and 21853 transitions. [2019-12-27 04:43:29,655 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 04:43:29,655 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 20 [2019-12-27 04:43:29,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:43:29,668 INFO L225 Difference]: With dead ends: 5428 [2019-12-27 04:43:29,668 INFO L226 Difference]: Without dead ends: 5382 [2019-12-27 04:43:29,668 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2019-12-27 04:43:29,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5382 states. [2019-12-27 04:43:29,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5382 to 4166. [2019-12-27 04:43:29,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4166 states. [2019-12-27 04:43:29,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4166 states to 4166 states and 16924 transitions. [2019-12-27 04:43:29,799 INFO L78 Accepts]: Start accepts. Automaton has 4166 states and 16924 transitions. Word has length 20 [2019-12-27 04:43:29,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:43:29,799 INFO L462 AbstractCegarLoop]: Abstraction has 4166 states and 16924 transitions. [2019-12-27 04:43:29,800 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-27 04:43:29,800 INFO L276 IsEmpty]: Start isEmpty. Operand 4166 states and 16924 transitions. [2019-12-27 04:43:29,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-12-27 04:43:29,803 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:43:29,803 INFO L411 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-27 04:43:29,803 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-27 04:43:29,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:43:29,804 INFO L82 PathProgramCache]: Analyzing trace with hash -1932078158, now seen corresponding path program 1 times [2019-12-27 04:43:29,804 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:43:29,804 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [214393066] [2019-12-27 04:43:29,804 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:43:29,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:43:29,939 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-27 04:43:29,940 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [214393066] [2019-12-27 04:43:29,940 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 04:43:29,940 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 04:43:29,941 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1184286601] [2019-12-27 04:43:29,941 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-27 04:43:29,941 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:43:29,941 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-27 04:43:29,942 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2019-12-27 04:43:29,942 INFO L87 Difference]: Start difference. First operand 4166 states and 16924 transitions. Second operand 10 states. [2019-12-27 04:43:30,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:43:30,536 INFO L93 Difference]: Finished difference Result 5500 states and 22434 transitions. [2019-12-27 04:43:30,536 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-27 04:43:30,537 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 20 [2019-12-27 04:43:30,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:43:30,549 INFO L225 Difference]: With dead ends: 5500 [2019-12-27 04:43:30,550 INFO L226 Difference]: Without dead ends: 5454 [2019-12-27 04:43:30,550 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=61, Invalid=149, Unknown=0, NotChecked=0, Total=210 [2019-12-27 04:43:30,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5454 states. [2019-12-27 04:43:30,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5454 to 4012. [2019-12-27 04:43:30,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4012 states. [2019-12-27 04:43:30,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4012 states to 4012 states and 16195 transitions. [2019-12-27 04:43:30,635 INFO L78 Accepts]: Start accepts. Automaton has 4012 states and 16195 transitions. Word has length 20 [2019-12-27 04:43:30,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:43:30,636 INFO L462 AbstractCegarLoop]: Abstraction has 4012 states and 16195 transitions. [2019-12-27 04:43:30,636 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-27 04:43:30,636 INFO L276 IsEmpty]: Start isEmpty. Operand 4012 states and 16195 transitions. [2019-12-27 04:43:30,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-12-27 04:43:30,638 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:43:30,638 INFO L411 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-27 04:43:30,639 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-27 04:43:30,639 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:43:30,639 INFO L82 PathProgramCache]: Analyzing trace with hash -944906415, now seen corresponding path program 2 times [2019-12-27 04:43:30,639 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:43:30,639 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1142233715] [2019-12-27 04:43:30,640 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:43:30,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:43:30,825 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-27 04:43:30,826 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1142233715] [2019-12-27 04:43:30,826 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 04:43:30,826 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 04:43:30,826 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2024083916] [2019-12-27 04:43:30,827 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-27 04:43:30,827 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:43:30,827 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-27 04:43:30,827 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2019-12-27 04:43:30,827 INFO L87 Difference]: Start difference. First operand 4012 states and 16195 transitions. Second operand 10 states. [2019-12-27 04:43:31,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:43:31,461 INFO L93 Difference]: Finished difference Result 5781 states and 23394 transitions. [2019-12-27 04:43:31,461 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-27 04:43:31,462 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 20 [2019-12-27 04:43:31,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:43:31,476 INFO L225 Difference]: With dead ends: 5781 [2019-12-27 04:43:31,476 INFO L226 Difference]: Without dead ends: 5735 [2019-12-27 04:43:31,476 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=57, Invalid=125, Unknown=0, NotChecked=0, Total=182 [2019-12-27 04:43:31,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5735 states. [2019-12-27 04:43:31,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5735 to 4148. [2019-12-27 04:43:31,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4148 states. [2019-12-27 04:43:31,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4148 states to 4148 states and 16836 transitions. [2019-12-27 04:43:31,591 INFO L78 Accepts]: Start accepts. Automaton has 4148 states and 16836 transitions. Word has length 20 [2019-12-27 04:43:31,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:43:31,591 INFO L462 AbstractCegarLoop]: Abstraction has 4148 states and 16836 transitions. [2019-12-27 04:43:31,591 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-27 04:43:31,591 INFO L276 IsEmpty]: Start isEmpty. Operand 4148 states and 16836 transitions. [2019-12-27 04:43:31,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-12-27 04:43:31,593 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:43:31,593 INFO L411 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-27 04:43:31,593 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-27 04:43:31,594 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:43:31,594 INFO L82 PathProgramCache]: Analyzing trace with hash 1562884562, now seen corresponding path program 2 times [2019-12-27 04:43:31,594 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:43:31,594 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1118734658] [2019-12-27 04:43:31,594 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:43:31,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:43:31,853 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-27 04:43:31,854 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1118734658] [2019-12-27 04:43:31,854 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 04:43:31,854 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 04:43:31,854 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2072062701] [2019-12-27 04:43:31,855 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-27 04:43:31,855 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:43:31,855 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-27 04:43:31,855 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2019-12-27 04:43:31,855 INFO L87 Difference]: Start difference. First operand 4148 states and 16836 transitions. Second operand 10 states. [2019-12-27 04:43:32,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:43:32,472 INFO L93 Difference]: Finished difference Result 6399 states and 26032 transitions. [2019-12-27 04:43:32,472 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-27 04:43:32,473 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 20 [2019-12-27 04:43:32,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:43:32,486 INFO L225 Difference]: With dead ends: 6399 [2019-12-27 04:43:32,487 INFO L226 Difference]: Without dead ends: 6353 [2019-12-27 04:43:32,487 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=86, Invalid=186, Unknown=0, NotChecked=0, Total=272 [2019-12-27 04:43:32,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6353 states. [2019-12-27 04:43:32,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6353 to 3978. [2019-12-27 04:43:32,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3978 states. [2019-12-27 04:43:32,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3978 states to 3978 states and 16074 transitions. [2019-12-27 04:43:32,596 INFO L78 Accepts]: Start accepts. Automaton has 3978 states and 16074 transitions. Word has length 20 [2019-12-27 04:43:32,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:43:32,596 INFO L462 AbstractCegarLoop]: Abstraction has 3978 states and 16074 transitions. [2019-12-27 04:43:32,597 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-27 04:43:32,597 INFO L276 IsEmpty]: Start isEmpty. Operand 3978 states and 16074 transitions. [2019-12-27 04:43:32,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-12-27 04:43:32,598 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:43:32,599 INFO L411 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-27 04:43:32,599 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-27 04:43:32,599 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:43:32,599 INFO L82 PathProgramCache]: Analyzing trace with hash 1961766501, now seen corresponding path program 3 times [2019-12-27 04:43:32,599 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:43:32,599 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1578643144] [2019-12-27 04:43:32,600 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:43:32,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:43:32,669 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-27 04:43:32,670 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1578643144] [2019-12-27 04:43:32,670 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 04:43:32,670 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 04:43:32,670 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1164654710] [2019-12-27 04:43:32,671 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 04:43:32,671 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:43:32,671 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 04:43:32,671 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-12-27 04:43:32,671 INFO L87 Difference]: Start difference. First operand 3978 states and 16074 transitions. Second operand 8 states. [2019-12-27 04:43:32,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:43:32,977 INFO L93 Difference]: Finished difference Result 6325 states and 25457 transitions. [2019-12-27 04:43:32,978 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 04:43:32,978 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 20 [2019-12-27 04:43:32,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:43:33,000 INFO L225 Difference]: With dead ends: 6325 [2019-12-27 04:43:33,001 INFO L226 Difference]: Without dead ends: 6279 [2019-12-27 04:43:33,001 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2019-12-27 04:43:33,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6279 states. [2019-12-27 04:43:33,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6279 to 3948. [2019-12-27 04:43:33,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3948 states. [2019-12-27 04:43:33,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3948 states to 3948 states and 16005 transitions. [2019-12-27 04:43:33,142 INFO L78 Accepts]: Start accepts. Automaton has 3948 states and 16005 transitions. Word has length 20 [2019-12-27 04:43:33,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:43:33,142 INFO L462 AbstractCegarLoop]: Abstraction has 3948 states and 16005 transitions. [2019-12-27 04:43:33,142 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 04:43:33,142 INFO L276 IsEmpty]: Start isEmpty. Operand 3948 states and 16005 transitions. [2019-12-27 04:43:33,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-27 04:43:33,145 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:43:33,146 INFO L411 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-27 04:43:33,146 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-27 04:43:33,146 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:43:33,146 INFO L82 PathProgramCache]: Analyzing trace with hash 2117723117, now seen corresponding path program 1 times [2019-12-27 04:43:33,146 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:43:33,147 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [831472420] [2019-12-27 04:43:33,147 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:43:33,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:43:33,207 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-27 04:43:33,207 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [831472420] [2019-12-27 04:43:33,208 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 04:43:33,208 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 04:43:33,208 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [217547795] [2019-12-27 04:43:33,208 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 04:43:33,209 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:43:33,209 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 04:43:33,209 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-12-27 04:43:33,209 INFO L87 Difference]: Start difference. First operand 3948 states and 16005 transitions. Second operand 7 states. [2019-12-27 04:43:33,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:43:33,394 INFO L93 Difference]: Finished difference Result 4727 states and 18672 transitions. [2019-12-27 04:43:33,395 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-27 04:43:33,395 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 21 [2019-12-27 04:43:33,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:43:33,410 INFO L225 Difference]: With dead ends: 4727 [2019-12-27 04:43:33,410 INFO L226 Difference]: Without dead ends: 4652 [2019-12-27 04:43:33,411 INFO L631 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-27 04:43:33,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4652 states. [2019-12-27 04:43:33,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4652 to 4270. [2019-12-27 04:43:33,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4270 states. [2019-12-27 04:43:33,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4270 states to 4270 states and 17192 transitions. [2019-12-27 04:43:33,537 INFO L78 Accepts]: Start accepts. Automaton has 4270 states and 17192 transitions. Word has length 21 [2019-12-27 04:43:33,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:43:33,538 INFO L462 AbstractCegarLoop]: Abstraction has 4270 states and 17192 transitions. [2019-12-27 04:43:33,538 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 04:43:33,538 INFO L276 IsEmpty]: Start isEmpty. Operand 4270 states and 17192 transitions. [2019-12-27 04:43:33,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-27 04:43:33,542 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:43:33,542 INFO L411 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-27 04:43:33,543 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-27 04:43:33,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:43:33,543 INFO L82 PathProgramCache]: Analyzing trace with hash -1335103446, now seen corresponding path program 1 times [2019-12-27 04:43:33,543 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:43:33,544 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1821704893] [2019-12-27 04:43:33,544 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:43:33,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:43:33,654 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-27 04:43:33,654 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1821704893] [2019-12-27 04:43:33,655 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 04:43:33,655 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 04:43:33,655 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [227452474] [2019-12-27 04:43:33,655 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 04:43:33,655 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:43:33,656 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 04:43:33,656 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2019-12-27 04:43:33,656 INFO L87 Difference]: Start difference. First operand 4270 states and 17192 transitions. Second operand 8 states. [2019-12-27 04:43:33,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:43:33,808 INFO L93 Difference]: Finished difference Result 4820 states and 18862 transitions. [2019-12-27 04:43:33,808 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 04:43:33,809 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 21 [2019-12-27 04:43:33,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:43:33,822 INFO L225 Difference]: With dead ends: 4820 [2019-12-27 04:43:33,822 INFO L226 Difference]: Without dead ends: 4296 [2019-12-27 04:43:33,822 INFO L631 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-27 04:43:33,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4296 states. [2019-12-27 04:43:33,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4296 to 3680. [2019-12-27 04:43:33,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3680 states. [2019-12-27 04:43:33,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3680 states to 3680 states and 14531 transitions. [2019-12-27 04:43:33,930 INFO L78 Accepts]: Start accepts. Automaton has 3680 states and 14531 transitions. Word has length 21 [2019-12-27 04:43:33,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:43:33,930 INFO L462 AbstractCegarLoop]: Abstraction has 3680 states and 14531 transitions. [2019-12-27 04:43:33,930 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 04:43:33,930 INFO L276 IsEmpty]: Start isEmpty. Operand 3680 states and 14531 transitions. [2019-12-27 04:43:33,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-27 04:43:33,933 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:43:33,933 INFO L411 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-27 04:43:33,934 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-27 04:43:33,934 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:43:33,934 INFO L82 PathProgramCache]: Analyzing trace with hash -1959403642, now seen corresponding path program 1 times [2019-12-27 04:43:33,934 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:43:33,934 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1697246130] [2019-12-27 04:43:33,934 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:43:33,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:43:34,122 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-27 04:43:34,122 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1697246130] [2019-12-27 04:43:34,123 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 04:43:34,123 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-27 04:43:34,123 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [427977921] [2019-12-27 04:43:34,123 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 04:43:34,123 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:43:34,124 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 04:43:34,124 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2019-12-27 04:43:34,124 INFO L87 Difference]: Start difference. First operand 3680 states and 14531 transitions. Second operand 11 states. [2019-12-27 04:43:34,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:43:34,711 INFO L93 Difference]: Finished difference Result 4556 states and 17623 transitions. [2019-12-27 04:43:34,711 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-27 04:43:34,712 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 21 [2019-12-27 04:43:34,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:43:34,723 INFO L225 Difference]: With dead ends: 4556 [2019-12-27 04:43:34,723 INFO L226 Difference]: Without dead ends: 4507 [2019-12-27 04:43:34,724 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2019-12-27 04:43:34,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4507 states. [2019-12-27 04:43:34,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4507 to 3330. [2019-12-27 04:43:34,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3330 states. [2019-12-27 04:43:34,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3330 states to 3330 states and 12802 transitions. [2019-12-27 04:43:34,793 INFO L78 Accepts]: Start accepts. Automaton has 3330 states and 12802 transitions. Word has length 21 [2019-12-27 04:43:34,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:43:34,793 INFO L462 AbstractCegarLoop]: Abstraction has 3330 states and 12802 transitions. [2019-12-27 04:43:34,793 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 04:43:34,793 INFO L276 IsEmpty]: Start isEmpty. Operand 3330 states and 12802 transitions. [2019-12-27 04:43:34,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-27 04:43:34,796 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:43:34,796 INFO L411 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-27 04:43:34,796 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-27 04:43:34,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:43:34,796 INFO L82 PathProgramCache]: Analyzing trace with hash -430854838, now seen corresponding path program 1 times [2019-12-27 04:43:34,797 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:43:34,797 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1303772340] [2019-12-27 04:43:34,797 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:43:34,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:43:35,022 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-27 04:43:35,022 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1303772340] [2019-12-27 04:43:35,022 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 04:43:35,023 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-27 04:43:35,023 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1211497452] [2019-12-27 04:43:35,023 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-27 04:43:35,024 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:43:35,024 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-27 04:43:35,024 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2019-12-27 04:43:35,024 INFO L87 Difference]: Start difference. First operand 3330 states and 12802 transitions. Second operand 12 states. [2019-12-27 04:43:35,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:43:35,526 INFO L93 Difference]: Finished difference Result 3991 states and 15112 transitions. [2019-12-27 04:43:35,526 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 04:43:35,526 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 21 [2019-12-27 04:43:35,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:43:35,535 INFO L225 Difference]: With dead ends: 3991 [2019-12-27 04:43:35,535 INFO L226 Difference]: Without dead ends: 3835 [2019-12-27 04:43:35,536 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=83, Invalid=223, Unknown=0, NotChecked=0, Total=306 [2019-12-27 04:43:35,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3835 states. [2019-12-27 04:43:35,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3835 to 2831. [2019-12-27 04:43:35,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2831 states. [2019-12-27 04:43:35,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2831 states to 2831 states and 10625 transitions. [2019-12-27 04:43:35,603 INFO L78 Accepts]: Start accepts. Automaton has 2831 states and 10625 transitions. Word has length 21 [2019-12-27 04:43:35,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:43:35,603 INFO L462 AbstractCegarLoop]: Abstraction has 2831 states and 10625 transitions. [2019-12-27 04:43:35,603 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-27 04:43:35,604 INFO L276 IsEmpty]: Start isEmpty. Operand 2831 states and 10625 transitions. [2019-12-27 04:43:35,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-27 04:43:35,606 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:43:35,606 INFO L411 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-27 04:43:35,607 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-27 04:43:35,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:43:35,607 INFO L82 PathProgramCache]: Analyzing trace with hash 641940987, now seen corresponding path program 1 times [2019-12-27 04:43:35,607 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:43:35,607 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [63644793] [2019-12-27 04:43:35,608 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:43:35,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:43:35,673 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 04:43:35,673 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [63644793] [2019-12-27 04:43:35,674 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 04:43:35,674 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 04:43:35,674 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [714074703] [2019-12-27 04:43:35,674 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 04:43:35,674 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:43:35,676 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 04:43:35,676 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-12-27 04:43:35,676 INFO L87 Difference]: Start difference. First operand 2831 states and 10625 transitions. Second operand 8 states. [2019-12-27 04:43:35,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:43:35,956 INFO L93 Difference]: Finished difference Result 3550 states and 13085 transitions. [2019-12-27 04:43:35,957 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-27 04:43:35,957 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 22 [2019-12-27 04:43:35,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:43:35,965 INFO L225 Difference]: With dead ends: 3550 [2019-12-27 04:43:35,965 INFO L226 Difference]: Without dead ends: 3490 [2019-12-27 04:43:35,965 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2019-12-27 04:43:35,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3490 states. [2019-12-27 04:43:36,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3490 to 2828. [2019-12-27 04:43:36,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2828 states. [2019-12-27 04:43:36,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2828 states to 2828 states and 10620 transitions. [2019-12-27 04:43:36,046 INFO L78 Accepts]: Start accepts. Automaton has 2828 states and 10620 transitions. Word has length 22 [2019-12-27 04:43:36,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:43:36,046 INFO L462 AbstractCegarLoop]: Abstraction has 2828 states and 10620 transitions. [2019-12-27 04:43:36,046 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 04:43:36,046 INFO L276 IsEmpty]: Start isEmpty. Operand 2828 states and 10620 transitions. [2019-12-27 04:43:36,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-27 04:43:36,048 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:43:36,048 INFO L411 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-27 04:43:36,049 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-27 04:43:36,049 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:43:36,049 INFO L82 PathProgramCache]: Analyzing trace with hash -109833189, now seen corresponding path program 2 times [2019-12-27 04:43:36,049 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:43:36,049 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1956197350] [2019-12-27 04:43:36,049 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:43:36,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:43:36,141 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-27 04:43:36,142 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1956197350] [2019-12-27 04:43:36,142 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 04:43:36,142 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 04:43:36,142 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1394440001] [2019-12-27 04:43:36,143 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 04:43:36,143 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:43:36,143 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 04:43:36,143 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-12-27 04:43:36,143 INFO L87 Difference]: Start difference. First operand 2828 states and 10620 transitions. Second operand 9 states. [2019-12-27 04:43:36,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:43:36,358 INFO L93 Difference]: Finished difference Result 3540 states and 13065 transitions. [2019-12-27 04:43:36,358 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-27 04:43:36,358 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2019-12-27 04:43:36,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:43:36,366 INFO L225 Difference]: With dead ends: 3540 [2019-12-27 04:43:36,366 INFO L226 Difference]: Without dead ends: 3480 [2019-12-27 04:43:36,367 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2019-12-27 04:43:36,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3480 states. [2019-12-27 04:43:36,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3480 to 2822. [2019-12-27 04:43:36,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2822 states. [2019-12-27 04:43:36,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2822 states to 2822 states and 10606 transitions. [2019-12-27 04:43:36,407 INFO L78 Accepts]: Start accepts. Automaton has 2822 states and 10606 transitions. Word has length 22 [2019-12-27 04:43:36,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:43:36,408 INFO L462 AbstractCegarLoop]: Abstraction has 2822 states and 10606 transitions. [2019-12-27 04:43:36,408 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 04:43:36,408 INFO L276 IsEmpty]: Start isEmpty. Operand 2822 states and 10606 transitions. [2019-12-27 04:43:36,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-27 04:43:36,411 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:43:36,411 INFO L411 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-27 04:43:36,411 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-27 04:43:36,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:43:36,412 INFO L82 PathProgramCache]: Analyzing trace with hash -1541949331, now seen corresponding path program 3 times [2019-12-27 04:43:36,412 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:43:36,416 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1563793552] [2019-12-27 04:43:36,416 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:43:36,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:43:36,541 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-27 04:43:36,542 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1563793552] [2019-12-27 04:43:36,542 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 04:43:36,542 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 04:43:36,542 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [635951679] [2019-12-27 04:43:36,544 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-27 04:43:36,544 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:43:36,544 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-27 04:43:36,544 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2019-12-27 04:43:36,544 INFO L87 Difference]: Start difference. First operand 2822 states and 10606 transitions. Second operand 10 states. [2019-12-27 04:43:36,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:43:36,888 INFO L93 Difference]: Finished difference Result 3525 states and 13034 transitions. [2019-12-27 04:43:36,888 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 04:43:36,888 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 22 [2019-12-27 04:43:36,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:43:36,896 INFO L225 Difference]: With dead ends: 3525 [2019-12-27 04:43:36,896 INFO L226 Difference]: Without dead ends: 3465 [2019-12-27 04:43:36,896 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=98, Unknown=0, NotChecked=0, Total=156 [2019-12-27 04:43:36,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3465 states. [2019-12-27 04:43:36,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3465 to 2822. [2019-12-27 04:43:36,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2822 states. [2019-12-27 04:43:36,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2822 states to 2822 states and 10606 transitions. [2019-12-27 04:43:36,947 INFO L78 Accepts]: Start accepts. Automaton has 2822 states and 10606 transitions. Word has length 22 [2019-12-27 04:43:36,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:43:36,947 INFO L462 AbstractCegarLoop]: Abstraction has 2822 states and 10606 transitions. [2019-12-27 04:43:36,947 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-27 04:43:36,948 INFO L276 IsEmpty]: Start isEmpty. Operand 2822 states and 10606 transitions. [2019-12-27 04:43:36,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-27 04:43:36,950 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:43:36,950 INFO L411 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-27 04:43:36,950 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-27 04:43:36,950 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:43:36,951 INFO L82 PathProgramCache]: Analyzing trace with hash -1025373391, now seen corresponding path program 4 times [2019-12-27 04:43:36,951 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:43:36,951 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [941702813] [2019-12-27 04:43:36,951 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:43:36,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:43:37,130 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-27 04:43:37,130 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [941702813] [2019-12-27 04:43:37,130 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 04:43:37,130 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-27 04:43:37,131 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [357314976] [2019-12-27 04:43:37,132 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 04:43:37,133 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:43:37,133 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 04:43:37,133 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2019-12-27 04:43:37,134 INFO L87 Difference]: Start difference. First operand 2822 states and 10606 transitions. Second operand 11 states. [2019-12-27 04:43:37,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:43:37,563 INFO L93 Difference]: Finished difference Result 3740 states and 13820 transitions. [2019-12-27 04:43:37,563 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 04:43:37,563 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 22 [2019-12-27 04:43:37,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:43:37,572 INFO L225 Difference]: With dead ends: 3740 [2019-12-27 04:43:37,572 INFO L226 Difference]: Without dead ends: 3680 [2019-12-27 04:43:37,573 INFO L631 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-27 04:43:37,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3680 states. [2019-12-27 04:43:37,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3680 to 2822. [2019-12-27 04:43:37,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2822 states. [2019-12-27 04:43:37,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2822 states to 2822 states and 10603 transitions. [2019-12-27 04:43:37,641 INFO L78 Accepts]: Start accepts. Automaton has 2822 states and 10603 transitions. Word has length 22 [2019-12-27 04:43:37,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:43:37,642 INFO L462 AbstractCegarLoop]: Abstraction has 2822 states and 10603 transitions. [2019-12-27 04:43:37,642 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 04:43:37,642 INFO L276 IsEmpty]: Start isEmpty. Operand 2822 states and 10603 transitions. [2019-12-27 04:43:37,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-27 04:43:37,644 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:43:37,645 INFO L411 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-27 04:43:37,645 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-27 04:43:37,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:43:37,645 INFO L82 PathProgramCache]: Analyzing trace with hash -1258119955, now seen corresponding path program 5 times [2019-12-27 04:43:37,645 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:43:37,645 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [919622706] [2019-12-27 04:43:37,646 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:43:37,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:43:37,760 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-27 04:43:37,760 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [919622706] [2019-12-27 04:43:37,760 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 04:43:37,760 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 04:43:37,761 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2027119731] [2019-12-27 04:43:37,761 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-27 04:43:37,761 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:43:37,761 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-27 04:43:37,761 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2019-12-27 04:43:37,762 INFO L87 Difference]: Start difference. First operand 2822 states and 10603 transitions. Second operand 10 states. [2019-12-27 04:43:38,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:43:38,090 INFO L93 Difference]: Finished difference Result 4237 states and 15414 transitions. [2019-12-27 04:43:38,090 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 04:43:38,090 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 22 [2019-12-27 04:43:38,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:43:38,099 INFO L225 Difference]: With dead ends: 4237 [2019-12-27 04:43:38,100 INFO L226 Difference]: Without dead ends: 4177 [2019-12-27 04:43:38,100 INFO L631 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-27 04:43:38,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4177 states. [2019-12-27 04:43:38,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4177 to 2670. [2019-12-27 04:43:38,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2670 states. [2019-12-27 04:43:38,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2670 states to 2670 states and 9904 transitions. [2019-12-27 04:43:38,149 INFO L78 Accepts]: Start accepts. Automaton has 2670 states and 9904 transitions. Word has length 22 [2019-12-27 04:43:38,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:43:38,150 INFO L462 AbstractCegarLoop]: Abstraction has 2670 states and 9904 transitions. [2019-12-27 04:43:38,150 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-27 04:43:38,150 INFO L276 IsEmpty]: Start isEmpty. Operand 2670 states and 9904 transitions. [2019-12-27 04:43:38,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-12-27 04:43:38,152 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:43:38,152 INFO L411 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-27 04:43:38,152 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-27 04:43:38,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:43:38,152 INFO L82 PathProgramCache]: Analyzing trace with hash -230669277, now seen corresponding path program 1 times [2019-12-27 04:43:38,152 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:43:38,152 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1907736628] [2019-12-27 04:43:38,152 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:43:38,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:43:38,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-27 04:43:38,399 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1907736628] [2019-12-27 04:43:38,399 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 04:43:38,400 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-27 04:43:38,400 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1616240267] [2019-12-27 04:43:38,400 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-27 04:43:38,400 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:43:38,400 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-27 04:43:38,400 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2019-12-27 04:43:38,401 INFO L87 Difference]: Start difference. First operand 2670 states and 9904 transitions. Second operand 12 states. [2019-12-27 04:43:38,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:43:38,913 INFO L93 Difference]: Finished difference Result 3103 states and 11113 transitions. [2019-12-27 04:43:38,914 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 04:43:38,914 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 23 [2019-12-27 04:43:38,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:43:38,920 INFO L225 Difference]: With dead ends: 3103 [2019-12-27 04:43:38,920 INFO L226 Difference]: Without dead ends: 3007 [2019-12-27 04:43:38,920 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=83, Invalid=223, Unknown=0, NotChecked=0, Total=306 [2019-12-27 04:43:38,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3007 states. [2019-12-27 04:43:38,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3007 to 2170. [2019-12-27 04:43:38,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2170 states. [2019-12-27 04:43:38,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2170 states to 2170 states and 7789 transitions. [2019-12-27 04:43:38,951 INFO L78 Accepts]: Start accepts. Automaton has 2170 states and 7789 transitions. Word has length 23 [2019-12-27 04:43:38,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:43:38,951 INFO L462 AbstractCegarLoop]: Abstraction has 2170 states and 7789 transitions. [2019-12-27 04:43:38,951 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-27 04:43:38,952 INFO L276 IsEmpty]: Start isEmpty. Operand 2170 states and 7789 transitions. [2019-12-27 04:43:38,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-12-27 04:43:38,953 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:43:38,953 INFO L411 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-27 04:43:38,953 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-27 04:43:38,953 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:43:38,954 INFO L82 PathProgramCache]: Analyzing trace with hash 1022800040, now seen corresponding path program 1 times [2019-12-27 04:43:38,954 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:43:38,954 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1050210715] [2019-12-27 04:43:38,954 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:43:38,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:43:39,171 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-27 04:43:39,171 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1050210715] [2019-12-27 04:43:39,171 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 04:43:39,171 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-27 04:43:39,172 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [283073461] [2019-12-27 04:43:39,172 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 04:43:39,172 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:43:39,172 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 04:43:39,172 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2019-12-27 04:43:39,172 INFO L87 Difference]: Start difference. First operand 2170 states and 7789 transitions. Second operand 11 states. [2019-12-27 04:43:39,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:43:39,623 INFO L93 Difference]: Finished difference Result 3115 states and 11153 transitions. [2019-12-27 04:43:39,624 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 04:43:39,624 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 23 [2019-12-27 04:43:39,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:43:39,630 INFO L225 Difference]: With dead ends: 3115 [2019-12-27 04:43:39,630 INFO L226 Difference]: Without dead ends: 3058 [2019-12-27 04:43:39,631 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=62, Invalid=120, Unknown=0, NotChecked=0, Total=182 [2019-12-27 04:43:39,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3058 states. [2019-12-27 04:43:39,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3058 to 2130. [2019-12-27 04:43:39,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2130 states. [2019-12-27 04:43:39,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2130 states to 2130 states and 7633 transitions. [2019-12-27 04:43:39,661 INFO L78 Accepts]: Start accepts. Automaton has 2130 states and 7633 transitions. Word has length 23 [2019-12-27 04:43:39,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:43:39,661 INFO L462 AbstractCegarLoop]: Abstraction has 2130 states and 7633 transitions. [2019-12-27 04:43:39,661 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 04:43:39,662 INFO L276 IsEmpty]: Start isEmpty. Operand 2130 states and 7633 transitions. [2019-12-27 04:43:39,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-12-27 04:43:39,663 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:43:39,663 INFO L411 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-27 04:43:39,663 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-27 04:43:39,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:43:39,663 INFO L82 PathProgramCache]: Analyzing trace with hash 1539375980, now seen corresponding path program 2 times [2019-12-27 04:43:39,664 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:43:39,664 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2039431574] [2019-12-27 04:43:39,664 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:43:39,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:43:39,874 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 04:43:39,874 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2039431574] [2019-12-27 04:43:39,874 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 04:43:39,874 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-12-27 04:43:39,874 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [330407465] [2019-12-27 04:43:39,875 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-27 04:43:39,875 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:43:39,875 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-27 04:43:39,875 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2019-12-27 04:43:39,875 INFO L87 Difference]: Start difference. First operand 2130 states and 7633 transitions. Second operand 13 states. [2019-12-27 04:43:40,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:43:40,405 INFO L93 Difference]: Finished difference Result 2799 states and 9853 transitions. [2019-12-27 04:43:40,405 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 04:43:40,405 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 23 [2019-12-27 04:43:40,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:43:40,411 INFO L225 Difference]: With dead ends: 2799 [2019-12-27 04:43:40,412 INFO L226 Difference]: Without dead ends: 2682 [2019-12-27 04:43:40,412 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=93, Invalid=249, Unknown=0, NotChecked=0, Total=342 [2019-12-27 04:43:40,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2682 states. [2019-12-27 04:43:40,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2682 to 1794. [2019-12-27 04:43:40,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1794 states. [2019-12-27 04:43:40,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1794 states to 1794 states and 6287 transitions. [2019-12-27 04:43:40,454 INFO L78 Accepts]: Start accepts. Automaton has 1794 states and 6287 transitions. Word has length 23 [2019-12-27 04:43:40,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:43:40,454 INFO L462 AbstractCegarLoop]: Abstraction has 1794 states and 6287 transitions. [2019-12-27 04:43:40,454 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-27 04:43:40,454 INFO L276 IsEmpty]: Start isEmpty. Operand 1794 states and 6287 transitions. [2019-12-27 04:43:40,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-12-27 04:43:40,456 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:43:40,457 INFO L411 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-27 04:43:40,457 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-27 04:43:40,457 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:43:40,457 INFO L82 PathProgramCache]: Analyzing trace with hash -396779108, now seen corresponding path program 1 times [2019-12-27 04:43:40,457 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:43:40,457 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1216603949] [2019-12-27 04:43:40,458 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:43:40,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:43:40,505 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 04:43:40,506 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1216603949] [2019-12-27 04:43:40,506 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 04:43:40,506 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 04:43:40,506 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1163304673] [2019-12-27 04:43:40,506 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 04:43:40,506 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:43:40,507 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 04:43:40,507 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-12-27 04:43:40,507 INFO L87 Difference]: Start difference. First operand 1794 states and 6287 transitions. Second operand 7 states. [2019-12-27 04:43:40,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:43:40,685 INFO L93 Difference]: Finished difference Result 2291 states and 7723 transitions. [2019-12-27 04:43:40,686 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-27 04:43:40,686 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 24 [2019-12-27 04:43:40,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:43:40,690 INFO L225 Difference]: With dead ends: 2291 [2019-12-27 04:43:40,690 INFO L226 Difference]: Without dead ends: 2227 [2019-12-27 04:43:40,691 INFO L631 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-27 04:43:40,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2227 states. [2019-12-27 04:43:40,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2227 to 2106. [2019-12-27 04:43:40,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2106 states. [2019-12-27 04:43:40,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2106 states to 2106 states and 7279 transitions. [2019-12-27 04:43:40,716 INFO L78 Accepts]: Start accepts. Automaton has 2106 states and 7279 transitions. Word has length 24 [2019-12-27 04:43:40,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:43:40,717 INFO L462 AbstractCegarLoop]: Abstraction has 2106 states and 7279 transitions. [2019-12-27 04:43:40,717 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 04:43:40,717 INFO L276 IsEmpty]: Start isEmpty. Operand 2106 states and 7279 transitions. [2019-12-27 04:43:40,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-12-27 04:43:40,719 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:43:40,719 INFO L411 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-27 04:43:40,719 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-27 04:43:40,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:43:40,720 INFO L82 PathProgramCache]: Analyzing trace with hash -1742211423, now seen corresponding path program 1 times [2019-12-27 04:43:40,720 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:43:40,720 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [38581670] [2019-12-27 04:43:40,720 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:43:40,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:43:40,834 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-27 04:43:40,835 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [38581670] [2019-12-27 04:43:40,835 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 04:43:40,835 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 04:43:40,835 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1613635643] [2019-12-27 04:43:40,835 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 04:43:40,835 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:43:40,836 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 04:43:40,836 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-27 04:43:40,836 INFO L87 Difference]: Start difference. First operand 2106 states and 7279 transitions. Second operand 9 states. [2019-12-27 04:43:41,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:43:41,194 INFO L93 Difference]: Finished difference Result 2954 states and 10228 transitions. [2019-12-27 04:43:41,194 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-27 04:43:41,194 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 24 [2019-12-27 04:43:41,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:43:41,200 INFO L225 Difference]: With dead ends: 2954 [2019-12-27 04:43:41,200 INFO L226 Difference]: Without dead ends: 2930 [2019-12-27 04:43:41,201 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2019-12-27 04:43:41,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2930 states. [2019-12-27 04:43:41,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2930 to 2105. [2019-12-27 04:43:41,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2105 states. [2019-12-27 04:43:41,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2105 states to 2105 states and 7278 transitions. [2019-12-27 04:43:41,230 INFO L78 Accepts]: Start accepts. Automaton has 2105 states and 7278 transitions. Word has length 24 [2019-12-27 04:43:41,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:43:41,230 INFO L462 AbstractCegarLoop]: Abstraction has 2105 states and 7278 transitions. [2019-12-27 04:43:41,231 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 04:43:41,231 INFO L276 IsEmpty]: Start isEmpty. Operand 2105 states and 7278 transitions. [2019-12-27 04:43:41,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-12-27 04:43:41,232 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:43:41,232 INFO L411 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-27 04:43:41,233 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-27 04:43:41,233 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:43:41,233 INFO L82 PathProgramCache]: Analyzing trace with hash 1800981697, now seen corresponding path program 2 times [2019-12-27 04:43:41,233 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:43:41,233 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1468757095] [2019-12-27 04:43:41,234 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:43:41,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:43:41,478 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-27 04:43:41,478 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1468757095] [2019-12-27 04:43:41,478 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 04:43:41,479 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 04:43:41,479 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [739215144] [2019-12-27 04:43:41,479 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-27 04:43:41,479 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:43:41,480 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-27 04:43:41,480 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2019-12-27 04:43:41,480 INFO L87 Difference]: Start difference. First operand 2105 states and 7278 transitions. Second operand 10 states. [2019-12-27 04:43:41,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:43:41,954 INFO L93 Difference]: Finished difference Result 2941 states and 10205 transitions. [2019-12-27 04:43:41,954 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-27 04:43:41,954 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 24 [2019-12-27 04:43:41,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:43:41,961 INFO L225 Difference]: With dead ends: 2941 [2019-12-27 04:43:41,961 INFO L226 Difference]: Without dead ends: 2917 [2019-12-27 04:43:41,962 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=70, Invalid=170, Unknown=0, NotChecked=0, Total=240 [2019-12-27 04:43:41,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2917 states. [2019-12-27 04:43:42,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2917 to 2102. [2019-12-27 04:43:42,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2102 states. [2019-12-27 04:43:42,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2102 states to 2102 states and 7274 transitions. [2019-12-27 04:43:42,010 INFO L78 Accepts]: Start accepts. Automaton has 2102 states and 7274 transitions. Word has length 24 [2019-12-27 04:43:42,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:43:42,010 INFO L462 AbstractCegarLoop]: Abstraction has 2102 states and 7274 transitions. [2019-12-27 04:43:42,010 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-27 04:43:42,010 INFO L276 IsEmpty]: Start isEmpty. Operand 2102 states and 7274 transitions. [2019-12-27 04:43:42,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-12-27 04:43:42,013 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:43:42,013 INFO L411 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-27 04:43:42,013 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-27 04:43:42,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:43:42,014 INFO L82 PathProgramCache]: Analyzing trace with hash 652694931, now seen corresponding path program 3 times [2019-12-27 04:43:42,014 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:43:42,014 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [741837874] [2019-12-27 04:43:42,014 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:43:42,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:43:42,200 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 04:43:42,200 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [741837874] [2019-12-27 04:43:42,200 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 04:43:42,200 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-27 04:43:42,201 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1589164779] [2019-12-27 04:43:42,201 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 04:43:42,201 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:43:42,201 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 04:43:42,201 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2019-12-27 04:43:42,202 INFO L87 Difference]: Start difference. First operand 2102 states and 7274 transitions. Second operand 11 states. [2019-12-27 04:43:42,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:43:42,652 INFO L93 Difference]: Finished difference Result 3197 states and 11098 transitions. [2019-12-27 04:43:42,652 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 04:43:42,652 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 24 [2019-12-27 04:43:42,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:43:42,659 INFO L225 Difference]: With dead ends: 3197 [2019-12-27 04:43:42,660 INFO L226 Difference]: Without dead ends: 3173 [2019-12-27 04:43:42,660 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=79, Invalid=193, Unknown=0, NotChecked=0, Total=272 [2019-12-27 04:43:42,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3173 states. [2019-12-27 04:43:42,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3173 to 1742. [2019-12-27 04:43:42,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1742 states. [2019-12-27 04:43:42,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1742 states to 1742 states and 5952 transitions. [2019-12-27 04:43:42,712 INFO L78 Accepts]: Start accepts. Automaton has 1742 states and 5952 transitions. Word has length 24 [2019-12-27 04:43:42,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:43:42,712 INFO L462 AbstractCegarLoop]: Abstraction has 1742 states and 5952 transitions. [2019-12-27 04:43:42,713 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 04:43:42,713 INFO L276 IsEmpty]: Start isEmpty. Operand 1742 states and 5952 transitions. [2019-12-27 04:43:42,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-12-27 04:43:42,715 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:43:42,716 INFO L411 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-27 04:43:42,716 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-27 04:43:42,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:43:42,716 INFO L82 PathProgramCache]: Analyzing trace with hash 351528874, now seen corresponding path program 2 times [2019-12-27 04:43:42,716 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:43:42,716 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1559633142] [2019-12-27 04:43:42,717 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:43:42,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:43:42,798 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-27 04:43:42,798 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1559633142] [2019-12-27 04:43:42,799 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 04:43:42,799 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 04:43:42,799 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1192067458] [2019-12-27 04:43:42,799 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 04:43:42,799 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:43:42,800 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 04:43:42,800 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-12-27 04:43:42,800 INFO L87 Difference]: Start difference. First operand 1742 states and 5952 transitions. Second operand 8 states. [2019-12-27 04:43:42,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:43:42,982 INFO L93 Difference]: Finished difference Result 2236 states and 7383 transitions. [2019-12-27 04:43:42,983 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-27 04:43:42,983 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 24 [2019-12-27 04:43:42,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:43:42,987 INFO L225 Difference]: With dead ends: 2236 [2019-12-27 04:43:42,987 INFO L226 Difference]: Without dead ends: 2172 [2019-12-27 04:43:42,988 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2019-12-27 04:43:42,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2172 states. [2019-12-27 04:43:43,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2172 to 1739. [2019-12-27 04:43:43,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1739 states. [2019-12-27 04:43:43,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1739 states to 1739 states and 5947 transitions. [2019-12-27 04:43:43,014 INFO L78 Accepts]: Start accepts. Automaton has 1739 states and 5947 transitions. Word has length 24 [2019-12-27 04:43:43,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:43:43,014 INFO L462 AbstractCegarLoop]: Abstraction has 1739 states and 5947 transitions. [2019-12-27 04:43:43,014 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 04:43:43,014 INFO L276 IsEmpty]: Start isEmpty. Operand 1739 states and 5947 transitions. [2019-12-27 04:43:43,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-12-27 04:43:43,016 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:43:43,016 INFO L411 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-27 04:43:43,016 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-27 04:43:43,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:43:43,016 INFO L82 PathProgramCache]: Analyzing trace with hash -548948534, now seen corresponding path program 3 times [2019-12-27 04:43:43,016 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:43:43,017 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1528607528] [2019-12-27 04:43:43,017 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:43:43,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:43:43,117 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-27 04:43:43,118 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1528607528] [2019-12-27 04:43:43,118 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 04:43:43,118 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 04:43:43,118 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [254815606] [2019-12-27 04:43:43,119 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 04:43:43,119 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:43:43,119 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 04:43:43,119 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-12-27 04:43:43,119 INFO L87 Difference]: Start difference. First operand 1739 states and 5947 transitions. Second operand 9 states. [2019-12-27 04:43:43,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:43:43,372 INFO L93 Difference]: Finished difference Result 2226 states and 7363 transitions. [2019-12-27 04:43:43,372 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-27 04:43:43,372 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 24 [2019-12-27 04:43:43,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:43:43,378 INFO L225 Difference]: With dead ends: 2226 [2019-12-27 04:43:43,378 INFO L226 Difference]: Without dead ends: 2162 [2019-12-27 04:43:43,379 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2019-12-27 04:43:43,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2162 states. [2019-12-27 04:43:43,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2162 to 1733. [2019-12-27 04:43:43,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1733 states. [2019-12-27 04:43:43,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1733 states to 1733 states and 5933 transitions. [2019-12-27 04:43:43,404 INFO L78 Accepts]: Start accepts. Automaton has 1733 states and 5933 transitions. Word has length 24 [2019-12-27 04:43:43,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:43:43,405 INFO L462 AbstractCegarLoop]: Abstraction has 1733 states and 5933 transitions. [2019-12-27 04:43:43,405 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 04:43:43,405 INFO L276 IsEmpty]: Start isEmpty. Operand 1733 states and 5933 transitions. [2019-12-27 04:43:43,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-12-27 04:43:43,406 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:43:43,406 INFO L411 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-27 04:43:43,407 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-27 04:43:43,407 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:43:43,407 INFO L82 PathProgramCache]: Analyzing trace with hash -610918652, now seen corresponding path program 4 times [2019-12-27 04:43:43,407 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:43:43,407 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [585234319] [2019-12-27 04:43:43,407 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:43:43,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:43:43,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-27 04:43:43,595 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [585234319] [2019-12-27 04:43:43,595 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 04:43:43,595 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-27 04:43:43,595 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1457893963] [2019-12-27 04:43:43,595 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 04:43:43,595 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:43:43,596 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 04:43:43,596 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2019-12-27 04:43:43,596 INFO L87 Difference]: Start difference. First operand 1733 states and 5933 transitions. Second operand 11 states. [2019-12-27 04:43:43,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:43:43,885 INFO L93 Difference]: Finished difference Result 2175 states and 7230 transitions. [2019-12-27 04:43:43,886 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 04:43:43,886 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 24 [2019-12-27 04:43:43,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:43:43,891 INFO L225 Difference]: With dead ends: 2175 [2019-12-27 04:43:43,891 INFO L226 Difference]: Without dead ends: 2111 [2019-12-27 04:43:43,892 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=68, Invalid=114, Unknown=0, NotChecked=0, Total=182 [2019-12-27 04:43:43,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2111 states. [2019-12-27 04:43:43,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2111 to 1733. [2019-12-27 04:43:43,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1733 states. [2019-12-27 04:43:43,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1733 states to 1733 states and 5933 transitions. [2019-12-27 04:43:43,917 INFO L78 Accepts]: Start accepts. Automaton has 1733 states and 5933 transitions. Word has length 24 [2019-12-27 04:43:43,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:43:43,918 INFO L462 AbstractCegarLoop]: Abstraction has 1733 states and 5933 transitions. [2019-12-27 04:43:43,918 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 04:43:43,918 INFO L276 IsEmpty]: Start isEmpty. Operand 1733 states and 5933 transitions. [2019-12-27 04:43:43,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-12-27 04:43:43,920 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:43:43,920 INFO L411 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-27 04:43:43,920 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-27 04:43:43,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:43:43,920 INFO L82 PathProgramCache]: Analyzing trace with hash -847503804, now seen corresponding path program 5 times [2019-12-27 04:43:43,920 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:43:43,920 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [243660636] [2019-12-27 04:43:43,920 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:43:43,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:43:44,161 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-27 04:43:44,161 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [243660636] [2019-12-27 04:43:44,161 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 04:43:44,161 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-12-27 04:43:44,161 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [368427327] [2019-12-27 04:43:44,162 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-27 04:43:44,162 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:43:44,162 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-27 04:43:44,162 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2019-12-27 04:43:44,162 INFO L87 Difference]: Start difference. First operand 1733 states and 5933 transitions. Second operand 13 states. [2019-12-27 04:43:44,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:43:44,649 INFO L93 Difference]: Finished difference Result 2400 states and 7955 transitions. [2019-12-27 04:43:44,649 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-27 04:43:44,649 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 24 [2019-12-27 04:43:44,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:43:44,655 INFO L225 Difference]: With dead ends: 2400 [2019-12-27 04:43:44,656 INFO L226 Difference]: Without dead ends: 2272 [2019-12-27 04:43:44,656 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=99, Invalid=243, Unknown=0, NotChecked=0, Total=342 [2019-12-27 04:43:44,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2272 states. [2019-12-27 04:43:44,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2272 to 1669. [2019-12-27 04:43:44,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1669 states. [2019-12-27 04:43:44,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1669 states to 1669 states and 5719 transitions. [2019-12-27 04:43:44,689 INFO L78 Accepts]: Start accepts. Automaton has 1669 states and 5719 transitions. Word has length 24 [2019-12-27 04:43:44,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:43:44,689 INFO L462 AbstractCegarLoop]: Abstraction has 1669 states and 5719 transitions. [2019-12-27 04:43:44,689 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-27 04:43:44,689 INFO L276 IsEmpty]: Start isEmpty. Operand 1669 states and 5719 transitions. [2019-12-27 04:43:44,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-12-27 04:43:44,692 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:43:44,692 INFO L411 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-27 04:43:44,692 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-27 04:43:44,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:43:44,693 INFO L82 PathProgramCache]: Analyzing trace with hash -2037680112, now seen corresponding path program 6 times [2019-12-27 04:43:44,693 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:43:44,693 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1666142116] [2019-12-27 04:43:44,693 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:43:44,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:43:44,944 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-27 04:43:44,944 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1666142116] [2019-12-27 04:43:44,944 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 04:43:44,944 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-27 04:43:44,944 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1792592456] [2019-12-27 04:43:44,945 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 04:43:44,945 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:43:44,945 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 04:43:44,945 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2019-12-27 04:43:44,945 INFO L87 Difference]: Start difference. First operand 1669 states and 5719 transitions. Second operand 11 states. [2019-12-27 04:43:45,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:43:45,317 INFO L93 Difference]: Finished difference Result 2576 states and 8317 transitions. [2019-12-27 04:43:45,318 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 04:43:45,318 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 24 [2019-12-27 04:43:45,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:43:45,324 INFO L225 Difference]: With dead ends: 2576 [2019-12-27 04:43:45,324 INFO L226 Difference]: Without dead ends: 2512 [2019-12-27 04:43:45,324 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=80, Invalid=160, Unknown=0, NotChecked=0, Total=240 [2019-12-27 04:43:45,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2512 states. [2019-12-27 04:43:45,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2512 to 1489. [2019-12-27 04:43:45,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1489 states. [2019-12-27 04:43:45,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1489 states to 1489 states and 5033 transitions. [2019-12-27 04:43:45,354 INFO L78 Accepts]: Start accepts. Automaton has 1489 states and 5033 transitions. Word has length 24 [2019-12-27 04:43:45,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:43:45,354 INFO L462 AbstractCegarLoop]: Abstraction has 1489 states and 5033 transitions. [2019-12-27 04:43:45,354 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 04:43:45,354 INFO L276 IsEmpty]: Start isEmpty. Operand 1489 states and 5033 transitions. [2019-12-27 04:43:45,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-27 04:43:45,356 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:43:45,356 INFO L411 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-27 04:43:45,356 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-27 04:43:45,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:43:45,357 INFO L82 PathProgramCache]: Analyzing trace with hash -1601368368, now seen corresponding path program 1 times [2019-12-27 04:43:45,357 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:43:45,357 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [562481026] [2019-12-27 04:43:45,357 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:43:45,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:43:45,501 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-27 04:43:45,501 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [562481026] [2019-12-27 04:43:45,501 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 04:43:45,501 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 04:43:45,502 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1394765949] [2019-12-27 04:43:45,502 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-27 04:43:45,502 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:43:45,502 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-27 04:43:45,502 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2019-12-27 04:43:45,502 INFO L87 Difference]: Start difference. First operand 1489 states and 5033 transitions. Second operand 10 states. [2019-12-27 04:43:45,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:43:45,913 INFO L93 Difference]: Finished difference Result 2106 states and 6852 transitions. [2019-12-27 04:43:45,913 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-27 04:43:45,913 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 26 [2019-12-27 04:43:45,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:43:45,917 INFO L225 Difference]: With dead ends: 2106 [2019-12-27 04:43:45,918 INFO L226 Difference]: Without dead ends: 2084 [2019-12-27 04:43:45,918 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=61, Invalid=149, Unknown=0, NotChecked=0, Total=210 [2019-12-27 04:43:45,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2084 states. [2019-12-27 04:43:45,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2084 to 1488. [2019-12-27 04:43:45,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1488 states. [2019-12-27 04:43:45,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1488 states to 1488 states and 5032 transitions. [2019-12-27 04:43:45,938 INFO L78 Accepts]: Start accepts. Automaton has 1488 states and 5032 transitions. Word has length 26 [2019-12-27 04:43:45,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:43:45,938 INFO L462 AbstractCegarLoop]: Abstraction has 1488 states and 5032 transitions. [2019-12-27 04:43:45,939 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-27 04:43:45,939 INFO L276 IsEmpty]: Start isEmpty. Operand 1488 states and 5032 transitions. [2019-12-27 04:43:45,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-27 04:43:45,940 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:43:45,940 INFO L411 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-27 04:43:45,940 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-27 04:43:45,941 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:43:45,941 INFO L82 PathProgramCache]: Analyzing trace with hash 1793121520, now seen corresponding path program 2 times [2019-12-27 04:43:45,941 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:43:45,941 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [326114729] [2019-12-27 04:43:45,941 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:43:45,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:43:46,126 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 04:43:46,127 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [326114729] [2019-12-27 04:43:46,127 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 04:43:46,127 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 04:43:46,127 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [686579487] [2019-12-27 04:43:46,127 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-27 04:43:46,127 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:43:46,127 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-27 04:43:46,127 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2019-12-27 04:43:46,128 INFO L87 Difference]: Start difference. First operand 1488 states and 5032 transitions. Second operand 10 states. [2019-12-27 04:43:46,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:43:46,531 INFO L93 Difference]: Finished difference Result 2093 states and 6829 transitions. [2019-12-27 04:43:46,531 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-27 04:43:46,531 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 26 [2019-12-27 04:43:46,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:43:46,536 INFO L225 Difference]: With dead ends: 2093 [2019-12-27 04:43:46,536 INFO L226 Difference]: Without dead ends: 2071 [2019-12-27 04:43:46,537 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=70, Invalid=170, Unknown=0, NotChecked=0, Total=240 [2019-12-27 04:43:46,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2071 states. [2019-12-27 04:43:46,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2071 to 1485. [2019-12-27 04:43:46,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1485 states. [2019-12-27 04:43:46,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1485 states to 1485 states and 5028 transitions. [2019-12-27 04:43:46,557 INFO L78 Accepts]: Start accepts. Automaton has 1485 states and 5028 transitions. Word has length 26 [2019-12-27 04:43:46,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:43:46,558 INFO L462 AbstractCegarLoop]: Abstraction has 1485 states and 5028 transitions. [2019-12-27 04:43:46,558 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-27 04:43:46,558 INFO L276 IsEmpty]: Start isEmpty. Operand 1485 states and 5028 transitions. [2019-12-27 04:43:46,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-27 04:43:46,559 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:43:46,559 INFO L411 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-27 04:43:46,560 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-27 04:43:46,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:43:46,560 INFO L82 PathProgramCache]: Analyzing trace with hash 304389942, now seen corresponding path program 3 times [2019-12-27 04:43:46,560 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:43:46,560 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [539441769] [2019-12-27 04:43:46,560 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:43:46,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:43:46,761 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-27 04:43:46,762 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [539441769] [2019-12-27 04:43:46,762 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 04:43:46,762 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-27 04:43:46,762 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [977705988] [2019-12-27 04:43:46,762 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-27 04:43:46,762 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:43:46,762 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-27 04:43:46,763 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2019-12-27 04:43:46,763 INFO L87 Difference]: Start difference. First operand 1485 states and 5028 transitions. Second operand 12 states. [2019-12-27 04:43:47,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:43:47,204 INFO L93 Difference]: Finished difference Result 1538 states and 4992 transitions. [2019-12-27 04:43:47,204 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-27 04:43:47,205 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 26 [2019-12-27 04:43:47,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:43:47,208 INFO L225 Difference]: With dead ends: 1538 [2019-12-27 04:43:47,209 INFO L226 Difference]: Without dead ends: 1494 [2019-12-27 04:43:47,209 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=92, Invalid=214, Unknown=0, NotChecked=0, Total=306 [2019-12-27 04:43:47,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1494 states. [2019-12-27 04:43:47,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1494 to 885. [2019-12-27 04:43:47,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 885 states. [2019-12-27 04:43:47,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 885 states to 885 states and 3033 transitions. [2019-12-27 04:43:47,223 INFO L78 Accepts]: Start accepts. Automaton has 885 states and 3033 transitions. Word has length 26 [2019-12-27 04:43:47,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:43:47,223 INFO L462 AbstractCegarLoop]: Abstraction has 885 states and 3033 transitions. [2019-12-27 04:43:47,223 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-27 04:43:47,223 INFO L276 IsEmpty]: Start isEmpty. Operand 885 states and 3033 transitions. [2019-12-27 04:43:47,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-12-27 04:43:47,224 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:43:47,224 INFO L411 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-27 04:43:47,225 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-27 04:43:47,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:43:47,225 INFO L82 PathProgramCache]: Analyzing trace with hash -720297978, now seen corresponding path program 1 times [2019-12-27 04:43:47,225 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:43:47,225 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [804443723] [2019-12-27 04:43:47,225 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:43:47,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:43:47,323 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-27 04:43:47,324 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [804443723] [2019-12-27 04:43:47,324 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 04:43:47,324 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 04:43:47,324 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [689547482] [2019-12-27 04:43:47,325 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 04:43:47,325 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:43:47,325 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 04:43:47,326 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-12-27 04:43:47,326 INFO L87 Difference]: Start difference. First operand 885 states and 3033 transitions. Second operand 8 states. [2019-12-27 04:43:47,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:43:47,481 INFO L93 Difference]: Finished difference Result 885 states and 3029 transitions. [2019-12-27 04:43:47,481 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 04:43:47,481 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 41 [2019-12-27 04:43:47,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:43:47,484 INFO L225 Difference]: With dead ends: 885 [2019-12-27 04:43:47,484 INFO L226 Difference]: Without dead ends: 879 [2019-12-27 04:43:47,484 INFO L631 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-27 04:43:47,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 879 states. [2019-12-27 04:43:47,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 879 to 879. [2019-12-27 04:43:47,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 879 states. [2019-12-27 04:43:47,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 879 states to 879 states and 3010 transitions. [2019-12-27 04:43:47,500 INFO L78 Accepts]: Start accepts. Automaton has 879 states and 3010 transitions. Word has length 41 [2019-12-27 04:43:47,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:43:47,500 INFO L462 AbstractCegarLoop]: Abstraction has 879 states and 3010 transitions. [2019-12-27 04:43:47,500 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 04:43:47,500 INFO L276 IsEmpty]: Start isEmpty. Operand 879 states and 3010 transitions. [2019-12-27 04:43:47,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-12-27 04:43:47,502 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:43:47,503 INFO L411 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-27 04:43:47,503 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-27 04:43:47,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:43:47,503 INFO L82 PathProgramCache]: Analyzing trace with hash 525302158, now seen corresponding path program 1 times [2019-12-27 04:43:47,503 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:43:47,504 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1972263108] [2019-12-27 04:43:47,504 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:43:47,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:43:47,576 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-27 04:43:47,576 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1972263108] [2019-12-27 04:43:47,576 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 04:43:47,577 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 04:43:47,577 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [596570451] [2019-12-27 04:43:47,577 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 04:43:47,577 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:43:47,577 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 04:43:47,578 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-12-27 04:43:47,578 INFO L87 Difference]: Start difference. First operand 879 states and 3010 transitions. Second operand 8 states. [2019-12-27 04:43:47,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:43:47,707 INFO L93 Difference]: Finished difference Result 879 states and 3006 transitions. [2019-12-27 04:43:47,708 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 04:43:47,708 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 41 [2019-12-27 04:43:47,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:43:47,710 INFO L225 Difference]: With dead ends: 879 [2019-12-27 04:43:47,711 INFO L226 Difference]: Without dead ends: 819 [2019-12-27 04:43:47,711 INFO L631 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-27 04:43:47,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 819 states. [2019-12-27 04:43:47,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 819 to 819. [2019-12-27 04:43:47,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 819 states. [2019-12-27 04:43:47,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 819 states to 819 states and 2784 transitions. [2019-12-27 04:43:47,721 INFO L78 Accepts]: Start accepts. Automaton has 819 states and 2784 transitions. Word has length 41 [2019-12-27 04:43:47,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:43:47,721 INFO L462 AbstractCegarLoop]: Abstraction has 819 states and 2784 transitions. [2019-12-27 04:43:47,721 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 04:43:47,721 INFO L276 IsEmpty]: Start isEmpty. Operand 819 states and 2784 transitions. [2019-12-27 04:43:47,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-12-27 04:43:47,723 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:43:47,723 INFO L411 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-27 04:43:47,723 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-27 04:43:47,723 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:43:47,724 INFO L82 PathProgramCache]: Analyzing trace with hash 1075124498, now seen corresponding path program 1 times [2019-12-27 04:43:47,724 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:43:47,724 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [635578684] [2019-12-27 04:43:47,724 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:43:47,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 04:43:47,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 04:43:47,797 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 04:43:47,798 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 04:43:47,801 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_~v~0.offset_23 0) (= 0 |v_#NULL.base_4|) (< |v_#StackHeapBarrier_22| |v_ULTIMATE.start_main_~#t~0.base_18|) (= (store |v_#length_40| |v_ULTIMATE.start_main_~#t~0.base_18| 4) |v_#length_39|) (= |v_#memory_int_65| (store |v_#memory_int_66| |v_ULTIMATE.start_main_~#t~0.base_18| (store (select |v_#memory_int_66| |v_ULTIMATE.start_main_~#t~0.base_18|) |v_ULTIMATE.start_main_~#t~0.offset_14| 5))) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t~0.base_18|)) (< 0 |v_#StackHeapBarrier_22|) (= v_~v~0.base_23 0) (= |v_#valid_111| (store .cse0 |v_ULTIMATE.start_main_~#t~0.base_18| 1)) (= |v_ULTIMATE.start_main_~#t~0.offset_14| 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_22|, #valid=|v_#valid_113|, #memory_int=|v_#memory_int_66|, #length=|v_#length_40|} OutVars{ULTIMATE.start_main_#t~nondet13=|v_ULTIMATE.start_main_#t~nondet13_7|, #NULL.offset=|v_#NULL.offset_4|, ULTIMATE.start_main_~#t~0.offset=|v_ULTIMATE.start_main_~#t~0.offset_14|, ~v~0.base=v_~v~0.base_23, #NULL.base=|v_#NULL.base_4|, #StackHeapBarrier=|v_#StackHeapBarrier_22|, ~v~0.offset=v_~v~0.offset_23, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_13|, #valid=|v_#valid_111|, #memory_int=|v_#memory_int_65|, ULTIMATE.start_main_~#t~0.base=|v_ULTIMATE.start_main_~#t~0.base_18|, #length=|v_#length_39|, ULTIMATE.start_main_#t~mem15=|v_ULTIMATE.start_main_#t~mem15_19|, ULTIMATE.start_main_#t~mem14=|v_ULTIMATE.start_main_#t~mem14_30|} 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-27 04:43:47,802 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [464] [464] thread0ENTRY-->L1108: Formula: (let ((.cse3 (store |v_#valid_104| |v_thread0Thread1of1ForFork3_~#t1~0.base_18| 1))) (let ((.cse1 (store .cse3 |v_thread0Thread1of1ForFork3_~#t2~0.base_17| 1))) (let ((.cse0 (store .cse1 |v_thread0Thread1of1ForFork3_~#t3~0.base_16| 1))) (let ((.cse2 (store .cse0 |v_thread0Thread1of1ForFork3_~#t4~0.base_17| 1))) (and (= 0 (select .cse0 |v_thread0Thread1of1ForFork3_~#t4~0.base_17|)) (= 0 (select .cse1 |v_thread0Thread1of1ForFork3_~#t3~0.base_16|)) (not (= 0 |v_thread0Thread1of1ForFork3_~#t4~0.base_17|)) (= (select .cse2 |v_thread0Thread1of1ForFork3_~#t5~0.base_15|) 0) (= 0 |v_thread0Thread1of1ForFork3_~#t3~0.offset_13|) (= v_thread0Thread1of1ForFork3_~arg.offset_6 |v_thread0Thread1of1ForFork3_#in~arg.offset_6|) (= 0 |v_thread0Thread1of1ForFork3_~#t2~0.offset_13|) (= |v_#length_36| (store (store (store (store (store |v_#length_38| |v_thread0Thread1of1ForFork3_~#t1~0.base_18| 4) |v_thread0Thread1of1ForFork3_~#t2~0.base_17| 4) |v_thread0Thread1of1ForFork3_~#t3~0.base_16| 4) |v_thread0Thread1of1ForFork3_~#t4~0.base_17| 4) |v_thread0Thread1of1ForFork3_~#t5~0.base_15| 4)) (= 0 |v_thread0Thread1of1ForFork3_~#t4~0.offset_14|) (< |v_#StackHeapBarrier_21| |v_thread0Thread1of1ForFork3_~#t3~0.base_16|) (not (= |v_thread0Thread1of1ForFork3_~#t3~0.base_16| 0)) (not (= |v_thread0Thread1of1ForFork3_~#t1~0.base_18| 0)) (< |v_#StackHeapBarrier_21| |v_thread0Thread1of1ForFork3_~#t2~0.base_17|) (= (store |v_#memory_int_64| |v_thread0Thread1of1ForFork3_~#t1~0.base_18| (store (select |v_#memory_int_64| |v_thread0Thread1of1ForFork3_~#t1~0.base_18|) |v_thread0Thread1of1ForFork3_~#t1~0.offset_14| 0)) |v_#memory_int_63|) (= |v_thread0Thread1of1ForFork3_~#t5~0.offset_11| 0) (= v_thread0Thread1of1ForFork3_~arg.base_6 |v_thread0Thread1of1ForFork3_#in~arg.base_6|) (not (= 0 |v_thread0Thread1of1ForFork3_~#t2~0.base_17|)) (< |v_#StackHeapBarrier_21| |v_thread0Thread1of1ForFork3_~#t1~0.base_18|) (= |v_#valid_102| (store .cse2 |v_thread0Thread1of1ForFork3_~#t5~0.base_15| 1)) (< |v_#StackHeapBarrier_21| |v_thread0Thread1of1ForFork3_~#t5~0.base_15|) (= 0 (select .cse3 |v_thread0Thread1of1ForFork3_~#t2~0.base_17|)) (= (select |v_#valid_104| |v_thread0Thread1of1ForFork3_~#t1~0.base_18|) 0) (= 0 |v_thread0Thread1of1ForFork3_~#t1~0.offset_14|) (not (= 0 |v_thread0Thread1of1ForFork3_~#t5~0.base_15|)) (< |v_#StackHeapBarrier_21| |v_thread0Thread1of1ForFork3_~#t4~0.base_17|)))))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_21|, thread0Thread1of1ForFork3_#in~arg.offset=|v_thread0Thread1of1ForFork3_#in~arg.offset_6|, #valid=|v_#valid_104|, #memory_int=|v_#memory_int_64|, #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_14|, thread0Thread1of1ForFork3_~#t2~0.offset=|v_thread0Thread1of1ForFork3_~#t2~0.offset_13|, 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_17|, thread0Thread1of1ForFork3_~arg.base=v_thread0Thread1of1ForFork3_~arg.base_6, #StackHeapBarrier=|v_#StackHeapBarrier_21|, thread0Thread1of1ForFork3_~#t3~0.offset=|v_thread0Thread1of1ForFork3_~#t3~0.offset_13|, thread0Thread1of1ForFork3_~#t1~0.base=|v_thread0Thread1of1ForFork3_~#t1~0.base_18|, #valid=|v_#valid_102|, #memory_int=|v_#memory_int_63|, thread0Thread1of1ForFork3_~arg.offset=v_thread0Thread1of1ForFork3_~arg.offset_6, thread0Thread1of1ForFork3_~#t1~0.offset=|v_thread0Thread1of1ForFork3_~#t1~0.offset_14|, thread0Thread1of1ForFork3_~#t2~0.base=|v_thread0Thread1of1ForFork3_~#t2~0.base_17|, #length=|v_#length_36|, thread0Thread1of1ForFork3_~#t5~0.base=|v_thread0Thread1of1ForFork3_~#t5~0.base_15|, thread0Thread1of1ForFork3_~#t5~0.offset=|v_thread0Thread1of1ForFork3_~#t5~0.offset_11|} 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-27 04:43:47,802 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [424] [424] L1108-1-->L1109-1: Formula: (= (select (select |v_#memory_int_40| |v_thread0Thread1of1ForFork3_~#t1~0.base_10|) |v_thread0Thread1of1ForFork3_~#t1~0.offset_9|) |v_thread0Thread1of1ForFork3_#t~mem4_27|) InVars {thread0Thread1of1ForFork3_~#t1~0.base=|v_thread0Thread1of1ForFork3_~#t1~0.base_10|, #memory_int=|v_#memory_int_40|, thread0Thread1of1ForFork3_~#t1~0.offset=|v_thread0Thread1of1ForFork3_~#t1~0.offset_9|} OutVars{thread0Thread1of1ForFork3_#t~mem4=|v_thread0Thread1of1ForFork3_#t~mem4_27|, thread0Thread1of1ForFork3_~#t1~0.base=|v_thread0Thread1of1ForFork3_~#t1~0.base_10|, #memory_int=|v_#memory_int_40|, thread0Thread1of1ForFork3_~#t1~0.offset=|v_thread0Thread1of1ForFork3_~#t1~0.offset_9|, thread0Thread1of1ForFork3_#t~nondet3=|v_thread0Thread1of1ForFork3_#t~nondet3_4|} AuxVars[] AssignedVars[thread0Thread1of1ForFork3_#t~mem4, thread0Thread1of1ForFork3_#t~nondet3] because there is no mapped edge [2019-12-27 04:43:47,803 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [428] [428] L1123-1-->L1124-1: Formula: (= (select (select |v_#memory_int_43| |v_ULTIMATE.start_main_~#t~0.base_10|) |v_ULTIMATE.start_main_~#t~0.offset_10|) |v_ULTIMATE.start_main_#t~mem14_27|) InVars {#memory_int=|v_#memory_int_43|, ULTIMATE.start_main_~#t~0.base=|v_ULTIMATE.start_main_~#t~0.base_10|, ULTIMATE.start_main_~#t~0.offset=|v_ULTIMATE.start_main_~#t~0.offset_10|} OutVars{ULTIMATE.start_main_#t~nondet13=|v_ULTIMATE.start_main_#t~nondet13_4|, #memory_int=|v_#memory_int_43|, ULTIMATE.start_main_~#t~0.base=|v_ULTIMATE.start_main_~#t~0.base_10|, ULTIMATE.start_main_~#t~0.offset=|v_ULTIMATE.start_main_~#t~0.offset_10|, ULTIMATE.start_main_#t~mem14=|v_ULTIMATE.start_main_#t~mem14_27|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet13, ULTIMATE.start_main_#t~mem14] because there is no mapped edge [2019-12-27 04:43:47,803 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [462] [462] thread1ENTRY-->thread1EXIT: Formula: (and (= 0 |v_thread1Thread1of1ForFork4_#res.base_7|) (= v_thread1Thread1of1ForFork4_~arg.offset_7 |v_thread1Thread1of1ForFork4_#in~arg.offset_7|) (not (= |v_thread1Thread1of1ForFork4_#t~malloc2.base_9| 0)) (= |v_#length_34| (store |v_#length_35| |v_thread1Thread1of1ForFork4_#t~malloc2.base_9| 1)) (= 0 (select |v_#valid_99| |v_thread1Thread1of1ForFork4_#t~malloc2.base_9|)) (= |v_thread1Thread1of1ForFork4_#t~malloc2.base_9| v_~v~0.base_22) (< |v_thread1Thread1of1ForFork4_#t~malloc2.base_9| |v_#StackHeapBarrier_20|) (= |v_#valid_98| (store |v_#valid_99| |v_thread1Thread1of1ForFork4_#t~malloc2.base_9| 1)) (= v_~v~0.offset_22 |v_thread1Thread1of1ForFork4_#t~malloc2.offset_9|) (= 0 |v_thread1Thread1of1ForFork4_#res.offset_7|) (= |v_thread1Thread1of1ForFork4_#t~malloc2.offset_9| 0) (= v_thread1Thread1of1ForFork4_~arg.base_7 |v_thread1Thread1of1ForFork4_#in~arg.base_7|)) 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_7|, thread1Thread1of1ForFork4_~arg.offset=v_thread1Thread1of1ForFork4_~arg.offset_7, thread1Thread1of1ForFork4_#t~malloc2.base=|v_thread1Thread1of1ForFork4_#t~malloc2.base_9|, thread1Thread1of1ForFork4_#in~arg.base=|v_thread1Thread1of1ForFork4_#in~arg.base_7|, ~v~0.base=v_~v~0.base_22, #StackHeapBarrier=|v_#StackHeapBarrier_20|, thread1Thread1of1ForFork4_~arg.base=v_thread1Thread1of1ForFork4_~arg.base_7, thread1Thread1of1ForFork4_#res.offset=|v_thread1Thread1of1ForFork4_#res.offset_7|, ~v~0.offset=v_~v~0.offset_22, #valid=|v_#valid_98|, #length=|v_#length_34|, thread1Thread1of1ForFork4_#t~malloc2.offset=|v_thread1Thread1of1ForFork4_#t~malloc2.offset_9|, 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-27 04:43:47,805 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [443] [443] L1097-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork5_#res.offset_7| 0) (= (store |v_#memory_int_53| v_~v~0.base_13 (store (select |v_#memory_int_53| v_~v~0.base_13) v_~v~0.offset_13 88)) |v_#memory_int_52|) (= 0 |v_thread2Thread1of1ForFork5_#res.base_7|)) InVars {~v~0.offset=v_~v~0.offset_13, #memory_int=|v_#memory_int_53|, ~v~0.base=v_~v~0.base_13} OutVars{~v~0.offset=v_~v~0.offset_13, #memory_int=|v_#memory_int_52|, thread2Thread1of1ForFork5_#res.base=|v_thread2Thread1of1ForFork5_#res.base_7|, thread2Thread1of1ForFork5_#res.offset=|v_thread2Thread1of1ForFork5_#res.offset_7|, ~v~0.base=v_~v~0.base_13} AuxVars[] AssignedVars[#memory_int, thread2Thread1of1ForFork5_#res.base, thread2Thread1of1ForFork5_#res.offset] because there is no mapped edge [2019-12-27 04:43:47,805 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [412] [412] L1110-2-->L1111-1: Formula: (= (store |v_#memory_int_33| |v_thread0Thread1of1ForFork3_~#t3~0.base_11| (store (select |v_#memory_int_33| |v_thread0Thread1of1ForFork3_~#t3~0.base_11|) |v_thread0Thread1of1ForFork3_~#t3~0.offset_9| 2)) |v_#memory_int_32|) InVars {thread0Thread1of1ForFork3_~#t3~0.base=|v_thread0Thread1of1ForFork3_~#t3~0.base_11|, thread0Thread1of1ForFork3_~#t3~0.offset=|v_thread0Thread1of1ForFork3_~#t3~0.offset_9|, #memory_int=|v_#memory_int_33|} OutVars{thread0Thread1of1ForFork3_~#t3~0.base=|v_thread0Thread1of1ForFork3_~#t3~0.base_11|, thread0Thread1of1ForFork3_~#t3~0.offset=|v_thread0Thread1of1ForFork3_~#t3~0.offset_9|, #memory_int=|v_#memory_int_32|, thread0Thread1of1ForFork3_#t~nondet5=|v_thread0Thread1of1ForFork3_#t~nondet5_4|} AuxVars[] AssignedVars[#memory_int, thread0Thread1of1ForFork3_#t~nondet5] because there is no mapped edge [2019-12-27 04:43:47,805 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [417] [417] L1111-2-->L1112-1: Formula: (= (store |v_#memory_int_37| |v_thread0Thread1of1ForFork3_~#t4~0.base_10| (store (select |v_#memory_int_37| |v_thread0Thread1of1ForFork3_~#t4~0.base_10|) |v_thread0Thread1of1ForFork3_~#t4~0.offset_9| 3)) |v_#memory_int_36|) InVars {thread0Thread1of1ForFork3_~#t4~0.offset=|v_thread0Thread1of1ForFork3_~#t4~0.offset_9|, #memory_int=|v_#memory_int_37|, thread0Thread1of1ForFork3_~#t4~0.base=|v_thread0Thread1of1ForFork3_~#t4~0.base_10|} OutVars{thread0Thread1of1ForFork3_~#t4~0.offset=|v_thread0Thread1of1ForFork3_~#t4~0.offset_9|, #memory_int=|v_#memory_int_36|, thread0Thread1of1ForFork3_~#t4~0.base=|v_thread0Thread1of1ForFork3_~#t4~0.base_10|, thread0Thread1of1ForFork3_#t~nondet6=|v_thread0Thread1of1ForFork3_#t~nondet6_4|} AuxVars[] AssignedVars[#memory_int, thread0Thread1of1ForFork3_#t~nondet6] because there is no mapped edge [2019-12-27 04:43:47,807 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [411] [411] L1112-2-->L1113-1: Formula: (= (store |v_#memory_int_31| |v_thread0Thread1of1ForFork3_~#t5~0.base_10| (store (select |v_#memory_int_31| |v_thread0Thread1of1ForFork3_~#t5~0.base_10|) |v_thread0Thread1of1ForFork3_~#t5~0.offset_8| 4)) |v_#memory_int_30|) InVars {#memory_int=|v_#memory_int_31|, thread0Thread1of1ForFork3_~#t5~0.base=|v_thread0Thread1of1ForFork3_~#t5~0.base_10|, thread0Thread1of1ForFork3_~#t5~0.offset=|v_thread0Thread1of1ForFork3_~#t5~0.offset_8|} OutVars{#memory_int=|v_#memory_int_30|, thread0Thread1of1ForFork3_~#t5~0.base=|v_thread0Thread1of1ForFork3_~#t5~0.base_10|, thread0Thread1of1ForFork3_~#t5~0.offset=|v_thread0Thread1of1ForFork3_~#t5~0.offset_8|, thread0Thread1of1ForFork3_#t~nondet7=|v_thread0Thread1of1ForFork3_#t~nondet7_4|} AuxVars[] AssignedVars[#memory_int, thread0Thread1of1ForFork3_#t~nondet7] because there is no mapped edge [2019-12-27 04:43:47,807 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [435] [435] L1113-2-->L1114-1: Formula: (= (select (select |v_#memory_int_50| |v_thread0Thread1of1ForFork3_~#t2~0.base_10|) |v_thread0Thread1of1ForFork3_~#t2~0.offset_8|) |v_thread0Thread1of1ForFork3_#t~mem9_27|) InVars {thread0Thread1of1ForFork3_~#t2~0.offset=|v_thread0Thread1of1ForFork3_~#t2~0.offset_8|, #memory_int=|v_#memory_int_50|, thread0Thread1of1ForFork3_~#t2~0.base=|v_thread0Thread1of1ForFork3_~#t2~0.base_10|} OutVars{thread0Thread1of1ForFork3_#t~nondet8=|v_thread0Thread1of1ForFork3_#t~nondet8_4|, thread0Thread1of1ForFork3_~#t2~0.offset=|v_thread0Thread1of1ForFork3_~#t2~0.offset_8|, #memory_int=|v_#memory_int_50|, thread0Thread1of1ForFork3_~#t2~0.base=|v_thread0Thread1of1ForFork3_~#t2~0.base_10|, thread0Thread1of1ForFork3_#t~mem9=|v_thread0Thread1of1ForFork3_#t~mem9_27|} AuxVars[] AssignedVars[thread0Thread1of1ForFork3_#t~nondet8, thread0Thread1of1ForFork3_#t~mem9] because there is no mapped edge [2019-12-27 04:43:47,809 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [449] [449] L1097-->thread2EXIT: Formula: (and (= (store |v_#memory_int_59| v_~v~0.base_17 (store (select |v_#memory_int_59| v_~v~0.base_17) v_~v~0.offset_17 88)) |v_#memory_int_58|) (= |v_thread2Thread1of1ForFork2_#res.offset_7| 0) (= |v_thread2Thread1of1ForFork2_#res.base_7| 0)) InVars {~v~0.offset=v_~v~0.offset_17, #memory_int=|v_#memory_int_59|, ~v~0.base=v_~v~0.base_17} OutVars{thread2Thread1of1ForFork2_#res.base=|v_thread2Thread1of1ForFork2_#res.base_7|, ~v~0.offset=v_~v~0.offset_17, #memory_int=|v_#memory_int_58|, ~v~0.base=v_~v~0.base_17, 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-27 04:43:47,809 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [446] [446] L1097-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork1_#res.base_7| 0) (= |v_thread2Thread1of1ForFork1_#res.offset_7| 0) (= (store |v_#memory_int_55| v_~v~0.base_14 (store (select |v_#memory_int_55| v_~v~0.base_14) v_~v~0.offset_14 88)) |v_#memory_int_54|)) InVars {~v~0.offset=v_~v~0.offset_14, #memory_int=|v_#memory_int_55|, ~v~0.base=v_~v~0.base_14} OutVars{thread2Thread1of1ForFork1_#res.offset=|v_thread2Thread1of1ForFork1_#res.offset_7|, ~v~0.offset=v_~v~0.offset_14, thread2Thread1of1ForFork1_#res.base=|v_thread2Thread1of1ForFork1_#res.base_7|, #memory_int=|v_#memory_int_54|, ~v~0.base=v_~v~0.base_14} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res.offset, thread2Thread1of1ForFork1_#res.base, #memory_int] because there is no mapped edge [2019-12-27 04:43:47,810 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [448] [448] L1102-->thread3EXIT: Formula: (and (= (store |v_#memory_int_57| v_~v~0.base_16 (store (select |v_#memory_int_57| v_~v~0.base_16) v_~v~0.offset_16 89)) |v_#memory_int_56|) (= |v_thread3Thread1of1ForFork0_#res.offset_7| 0) (= |v_thread3Thread1of1ForFork0_#res.base_7| 0)) InVars {~v~0.offset=v_~v~0.offset_16, #memory_int=|v_#memory_int_57|, ~v~0.base=v_~v~0.base_16} OutVars{~v~0.offset=v_~v~0.offset_16, thread3Thread1of1ForFork0_#res.offset=|v_thread3Thread1of1ForFork0_#res.offset_7|, #memory_int=|v_#memory_int_56|, thread3Thread1of1ForFork0_#res.base=|v_thread3Thread1of1ForFork0_#res.base_7|, ~v~0.base=v_~v~0.base_16} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#res.offset, #memory_int, thread3Thread1of1ForFork0_#res.base] because there is no mapped edge [2019-12-27 04:43:47,814 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [470] [470] L1118-->thread0EXIT: Formula: (and (= 0 |v_thread0Thread1of1ForFork3_#res.offset_4|) (= (store (store (store (store (store |v_#valid_117| |v_thread0Thread1of1ForFork3_~#t1~0.base_22| 0) |v_thread0Thread1of1ForFork3_~#t2~0.base_21| 0) |v_thread0Thread1of1ForFork3_~#t3~0.base_20| 0) |v_thread0Thread1of1ForFork3_~#t4~0.base_21| 0) |v_thread0Thread1of1ForFork3_~#t5~0.base_19| 0) |v_#valid_116|) (= 0 |v_thread0Thread1of1ForFork3_#res.base_4|)) InVars {thread0Thread1of1ForFork3_~#t3~0.base=|v_thread0Thread1of1ForFork3_~#t3~0.base_20|, thread0Thread1of1ForFork3_~#t1~0.base=|v_thread0Thread1of1ForFork3_~#t1~0.base_22|, #valid=|v_#valid_117|, thread0Thread1of1ForFork3_~#t2~0.base=|v_thread0Thread1of1ForFork3_~#t2~0.base_21|, thread0Thread1of1ForFork3_~#t5~0.base=|v_thread0Thread1of1ForFork3_~#t5~0.base_19|, thread0Thread1of1ForFork3_~#t4~0.base=|v_thread0Thread1of1ForFork3_~#t4~0.base_21|} OutVars{thread0Thread1of1ForFork3_~#t3~0.base=|v_thread0Thread1of1ForFork3_~#t3~0.base_19|, thread0Thread1of1ForFork3_~#t4~0.offset=|v_thread0Thread1of1ForFork3_~#t4~0.offset_16|, thread0Thread1of1ForFork3_~#t2~0.offset=|v_thread0Thread1of1ForFork3_~#t2~0.offset_15|, thread0Thread1of1ForFork3_#res.base=|v_thread0Thread1of1ForFork3_#res.base_4|, thread0Thread1of1ForFork3_~#t4~0.base=|v_thread0Thread1of1ForFork3_~#t4~0.base_20|, thread0Thread1of1ForFork3_~#t3~0.offset=|v_thread0Thread1of1ForFork3_~#t3~0.offset_15|, thread0Thread1of1ForFork3_~#t1~0.base=|v_thread0Thread1of1ForFork3_~#t1~0.base_21|, thread0Thread1of1ForFork3_#res.offset=|v_thread0Thread1of1ForFork3_#res.offset_4|, #valid=|v_#valid_116|, thread0Thread1of1ForFork3_~#t2~0.base=|v_thread0Thread1of1ForFork3_~#t2~0.base_20|, thread0Thread1of1ForFork3_~#t1~0.offset=|v_thread0Thread1of1ForFork3_~#t1~0.offset_16|, thread0Thread1of1ForFork3_~#t5~0.base=|v_thread0Thread1of1ForFork3_~#t5~0.base_18|, thread0Thread1of1ForFork3_~#t5~0.offset=|v_thread0Thread1of1ForFork3_~#t5~0.offset_13|} 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-27 04:43:47,815 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [457] [457] L1125-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_13 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_7|) (not (= |v_ULTIMATE.start_main_#t~mem15_15| 88)) (= |v_ULTIMATE.start_main_#t~mem15_15| (select (select |v_#memory_int_61| v_~v~0.base_20) v_~v~0.offset_20)) (= v_ULTIMATE.start___VERIFIER_assert_~expression_13 0)) InVars {~v~0.offset=v_~v~0.offset_20, #memory_int=|v_#memory_int_61|, ~v~0.base=v_~v~0.base_20} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_13, ~v~0.offset=v_~v~0.offset_20, #memory_int=|v_#memory_int_61|, ULTIMATE.start_main_#t~mem15=|v_ULTIMATE.start_main_#t~mem15_15|, ~v~0.base=v_~v~0.base_20, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_7|} 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-27 04:43:47,870 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 04:43:47 BasicIcfg [2019-12-27 04:43:47,870 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 04:43:47,872 INFO L168 Benchmark]: Toolchain (without parser) took 31984.33 ms. Allocated memory was 138.4 MB in the beginning and 872.9 MB in the end (delta: 734.5 MB). Free memory was 100.2 MB in the beginning and 212.5 MB in the end (delta: -112.3 MB). Peak memory consumption was 622.2 MB. Max. memory is 7.1 GB. [2019-12-27 04:43:47,872 INFO L168 Benchmark]: CDTParser took 0.61 ms. Allocated memory is still 138.4 MB. Free memory was 120.3 MB in the beginning and 120.1 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-12-27 04:43:47,873 INFO L168 Benchmark]: CACSL2BoogieTranslator took 954.38 ms. Allocated memory was 138.4 MB in the beginning and 202.4 MB in the end (delta: 64.0 MB). Free memory was 99.8 MB in the beginning and 122.0 MB in the end (delta: -22.2 MB). Peak memory consumption was 47.0 MB. Max. memory is 7.1 GB. [2019-12-27 04:43:47,873 INFO L168 Benchmark]: Boogie Procedure Inliner took 53.36 ms. Allocated memory is still 202.4 MB. Free memory was 122.0 MB in the beginning and 119.2 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-27 04:43:47,873 INFO L168 Benchmark]: Boogie Preprocessor took 27.02 ms. Allocated memory is still 202.4 MB. Free memory was 119.2 MB in the beginning and 117.8 MB in the end (delta: 1.4 MB). Peak memory consumption was 1.4 MB. Max. memory is 7.1 GB. [2019-12-27 04:43:47,874 INFO L168 Benchmark]: RCFGBuilder took 508.27 ms. Allocated memory is still 202.4 MB. Free memory was 117.8 MB in the beginning and 91.0 MB in the end (delta: 26.8 MB). Peak memory consumption was 26.8 MB. Max. memory is 7.1 GB. [2019-12-27 04:43:47,874 INFO L168 Benchmark]: TraceAbstraction took 30435.29 ms. Allocated memory was 202.4 MB in the beginning and 872.9 MB in the end (delta: 670.6 MB). Free memory was 91.0 MB in the beginning and 212.5 MB in the end (delta: -121.4 MB). Peak memory consumption was 549.1 MB. Max. memory is 7.1 GB. [2019-12-27 04:43:47,876 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.61 ms. Allocated memory is still 138.4 MB. Free memory was 120.3 MB in the beginning and 120.1 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 954.38 ms. Allocated memory was 138.4 MB in the beginning and 202.4 MB in the end (delta: 64.0 MB). Free memory was 99.8 MB in the beginning and 122.0 MB in the end (delta: -22.2 MB). Peak memory consumption was 47.0 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 53.36 ms. Allocated memory is still 202.4 MB. Free memory was 122.0 MB in the beginning and 119.2 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 27.02 ms. Allocated memory is still 202.4 MB. Free memory was 119.2 MB in the beginning and 117.8 MB in the end (delta: 1.4 MB). Peak memory consumption was 1.4 MB. Max. memory is 7.1 GB. * RCFGBuilder took 508.27 ms. Allocated memory is still 202.4 MB. Free memory was 117.8 MB in the beginning and 91.0 MB in the end (delta: 26.8 MB). Peak memory consumption was 26.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 30435.29 ms. Allocated memory was 202.4 MB in the beginning and 872.9 MB in the end (delta: 670.6 MB). Free memory was 91.0 MB in the beginning and 212.5 MB in the end (delta: -121.4 MB). Peak memory consumption was 549.1 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 2.5s, 172 ProgramPointsBefore, 99 ProgramPointsAfterwards, 243 TransitionsBefore, 173 TransitionsAfterwards, 4038 CoEnabledTransitionPairs, 6 FixpointIterations, 23 TrivialSequentialCompositions, 49 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 1 ChoiceCompositions, 1460 VarBasedMoverChecksPositive, 10 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 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={10:0}, t2={11:0}, t3={6:0}, t4={8: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={10:0}, t2={11:0}, t3={6:0}, t4={8: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={10:0}, t2={11:0}, t3={6:0}, t4={8: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={10:0}, t2={11:0}, t3={6:0}, t4={8: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={10:0}, t2={11:0}, t3={6:0}, t4={8: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={10:0}, t2={11:0}, t3={6:0}, t4={8: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={10:0}, t2={11:0}, t3={6:0}, t4={8: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={10:0}, t2={11:0}, t3={6:0}, t4={8: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={10:0}, t2={11:0}, t3={6:0}, t4={8: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={10:0}, t2={11:0}, t3={6:0}, t4={8: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={10:0}, t2={11:0}, t3={6:0}, t4={8: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={10:0}, t2={11:0}, t3={6:0}, t4={8: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={10:0}, t2={11:0}, t3={6:0}, t4={8: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: 30.0s, OverallIterations: 43, TraceHistogramMax: 1, AutomataDifference: 16.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 4482 SDtfs, 8122 SDslu, 13555 SDs, 0 SdLazy, 8087 SolverSat, 1096 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 8.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 547 GetRequests, 46 SyntacticMatches, 20 SemanticMatches, 481 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 507 ImplicationChecksByTransitivity, 9.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=4270occurred in iteration=17, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 3.3s AutomataMinimizationTime, 42 MinimizatonAttempts, 39550 StatesRemovedByMinimization, 40 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 5.8s InterpolantComputationTime, 958 NumberOfCodeBlocks, 958 NumberOfCodeBlocksAsserted, 43 NumberOfCheckSat, 875 ConstructedInterpolants, 0 QuantifiedInterpolants, 283067 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 42 InterpolantComputations, 42 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...