/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-SemanticLbe.epf -i ../../../trunk/examples/svcomp/pthread/singleton.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-fae578e [2019-12-18 15:42:17,489 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-18 15:42:17,491 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-18 15:42:17,503 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-18 15:42:17,503 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-18 15:42:17,504 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-18 15:42:17,506 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-18 15:42:17,508 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-18 15:42:17,509 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-18 15:42:17,510 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-18 15:42:17,511 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-18 15:42:17,512 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-18 15:42:17,513 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-18 15:42:17,514 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-18 15:42:17,515 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-18 15:42:17,516 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-18 15:42:17,517 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-18 15:42:17,518 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-18 15:42:17,519 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-18 15:42:17,522 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-18 15:42:17,523 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-18 15:42:17,524 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-18 15:42:17,526 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-18 15:42:17,526 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-18 15:42:17,529 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-18 15:42:17,529 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-18 15:42:17,529 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-18 15:42:17,530 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-18 15:42:17,531 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-18 15:42:17,531 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-18 15:42:17,532 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-18 15:42:17,532 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-18 15:42:17,533 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-18 15:42:17,534 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-18 15:42:17,535 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-18 15:42:17,535 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-18 15:42:17,536 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-18 15:42:17,536 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-18 15:42:17,536 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-18 15:42:17,537 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-18 15:42:17,538 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-18 15:42:17,539 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-SemanticLbe.epf [2019-12-18 15:42:17,553 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-18 15:42:17,553 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-18 15:42:17,554 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-18 15:42:17,555 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-18 15:42:17,555 INFO L138 SettingsManager]: * Use SBE=true [2019-12-18 15:42:17,555 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-18 15:42:17,555 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-18 15:42:17,555 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-18 15:42:17,556 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-18 15:42:17,556 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-18 15:42:17,556 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-18 15:42:17,556 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-18 15:42:17,556 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-18 15:42:17,557 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-18 15:42:17,557 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-18 15:42:17,557 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-18 15:42:17,557 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-18 15:42:17,557 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-18 15:42:17,558 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-18 15:42:17,558 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-18 15:42:17,558 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-18 15:42:17,558 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 15:42:17,558 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-18 15:42:17,559 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-18 15:42:17,559 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-18 15:42:17,559 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-18 15:42:17,559 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-18 15:42:17,559 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-18 15:42:17,560 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-18 15:42:17,846 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-18 15:42:17,859 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-18 15:42:17,862 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-18 15:42:17,864 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-18 15:42:17,864 INFO L275 PluginConnector]: CDTParser initialized [2019-12-18 15:42:17,865 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread/singleton.i [2019-12-18 15:42:17,941 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/721cfac8d/3061bee1da8f4d189d7cad776fd8ba3d/FLAG39291aa5f [2019-12-18 15:42:18,524 INFO L306 CDTParser]: Found 1 translation units. [2019-12-18 15:42:18,524 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread/singleton.i [2019-12-18 15:42:18,547 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/721cfac8d/3061bee1da8f4d189d7cad776fd8ba3d/FLAG39291aa5f [2019-12-18 15:42:18,791 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/721cfac8d/3061bee1da8f4d189d7cad776fd8ba3d [2019-12-18 15:42:18,800 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-18 15:42:18,802 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-18 15:42:18,803 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-18 15:42:18,803 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-18 15:42:18,808 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-18 15:42:18,809 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 03:42:18" (1/1) ... [2019-12-18 15:42:18,812 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@58e761a1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 03:42:18, skipping insertion in model container [2019-12-18 15:42:18,812 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 03:42:18" (1/1) ... [2019-12-18 15:42:18,819 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-18 15:42:18,869 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-18 15:42:19,508 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 15:42:19,519 INFO L203 MainTranslator]: Completed pre-run [2019-12-18 15:42:19,567 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 15:42:19,784 INFO L208 MainTranslator]: Completed translation [2019-12-18 15:42:19,785 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 03:42:19 WrapperNode [2019-12-18 15:42:19,785 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-18 15:42:19,786 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-18 15:42:19,787 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-18 15:42:19,787 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-18 15:42:19,796 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 03:42:19" (1/1) ... [2019-12-18 15:42:19,820 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 03:42:19" (1/1) ... [2019-12-18 15:42:19,851 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-18 15:42:19,852 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-18 15:42:19,852 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-18 15:42:19,853 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-18 15:42:19,862 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 03:42:19" (1/1) ... [2019-12-18 15:42:19,862 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 03:42:19" (1/1) ... [2019-12-18 15:42:19,870 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 03:42:19" (1/1) ... [2019-12-18 15:42:19,871 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 03:42:19" (1/1) ... [2019-12-18 15:42:19,887 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 03:42:19" (1/1) ... [2019-12-18 15:42:19,890 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 03:42:19" (1/1) ... [2019-12-18 15:42:19,893 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 03:42:19" (1/1) ... [2019-12-18 15:42:19,896 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-18 15:42:19,903 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-18 15:42:19,903 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-18 15:42:19,903 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-18 15:42:19,904 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 03:42:19" (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-18 15:42:19,966 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-18 15:42:19,967 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-18 15:42:19,967 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-12-18 15:42:19,968 INFO L130 BoogieDeclarations]: Found specification of procedure thread0 [2019-12-18 15:42:19,968 INFO L138 BoogieDeclarations]: Found implementation of procedure thread0 [2019-12-18 15:42:19,968 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2019-12-18 15:42:19,969 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2019-12-18 15:42:19,969 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2019-12-18 15:42:19,970 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2019-12-18 15:42:19,971 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2019-12-18 15:42:19,972 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2019-12-18 15:42:19,972 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-18 15:42:19,972 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-12-18 15:42:19,973 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-18 15:42:19,973 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-18 15:42:19,976 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-18 15:42:20,465 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-18 15:42:20,465 INFO L287 CfgBuilder]: Removed 6 assume(true) statements. [2019-12-18 15:42:20,466 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 03:42:20 BoogieIcfgContainer [2019-12-18 15:42:20,467 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-18 15:42:20,468 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-18 15:42:20,468 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-18 15:42:20,471 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-18 15:42:20,472 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 03:42:18" (1/3) ... [2019-12-18 15:42:20,473 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5feb5b3e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 03:42:20, skipping insertion in model container [2019-12-18 15:42:20,473 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 03:42:19" (2/3) ... [2019-12-18 15:42:20,474 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5feb5b3e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 03:42:20, skipping insertion in model container [2019-12-18 15:42:20,474 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 03:42:20" (3/3) ... [2019-12-18 15:42:20,476 INFO L109 eAbstractionObserver]: Analyzing ICFG singleton.i [2019-12-18 15:42:20,487 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-18 15:42:20,487 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-18 15:42:20,495 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-12-18 15:42:20,498 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-18 15:42:20,553 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:42:20,553 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:42:20,554 WARN L315 ript$VariableManager]: TermVariabe thread0Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:42:20,554 WARN L315 ript$VariableManager]: TermVariabe thread0Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:42:20,554 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:42:20,554 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t1~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:42:20,554 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t2~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:42:20,555 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:42:20,555 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:42:20,555 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t3~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:42:20,556 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t4~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:42:20,556 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t4~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:42:20,556 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t5~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:42:20,556 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t5~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:42:20,557 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:42:20,557 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t1~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:42:20,557 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:42:20,557 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:42:20,558 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t1~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:42:20,558 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#t~mem4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:42:20,559 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#t~mem4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:42:20,559 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t2~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:42:20,559 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:42:20,559 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:42:20,560 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:42:20,560 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t3~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:42:20,560 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:42:20,560 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t4~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:42:20,560 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t4~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:42:20,561 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#t~nondet7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:42:20,561 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t5~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:42:20,561 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t5~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:42:20,561 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#t~nondet8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:42:20,562 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t2~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:42:20,562 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:42:20,562 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:42:20,562 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:42:20,562 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:42:20,563 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t3~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:42:20,563 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#t~mem10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:42:20,563 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#t~mem10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:42:20,563 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t4~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:42:20,564 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t4~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:42:20,564 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#t~mem11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:42:20,564 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#t~mem11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:42:20,564 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t5~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:42:20,564 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t5~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:42:20,565 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#t~mem12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:42:20,565 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#t~mem12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:42:20,565 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:42:20,565 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:42:20,566 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:42:20,566 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:42:20,566 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t1~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:42:20,566 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:42:20,567 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:42:20,567 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t2~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:42:20,567 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:42:20,567 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t3~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:42:20,567 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:42:20,568 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t4~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:42:20,568 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t4~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:42:20,568 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t4~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:42:20,568 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t5~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:42:20,568 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t5~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:42:20,569 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t5~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:42:20,569 WARN L315 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork4_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:42:20,569 WARN L315 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork4_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:42:20,569 WARN L315 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork4_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:42:20,569 WARN L315 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork4_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:42:20,570 WARN L315 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork4_#t~malloc2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:42:20,570 WARN L315 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork4_#t~malloc2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:42:20,570 WARN L315 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork4_#t~malloc2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:42:20,570 WARN L315 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork4_#t~malloc2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:42:20,571 WARN L315 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork4_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:42:20,571 WARN L315 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork4_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:42:20,571 WARN L315 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:42:20,571 WARN L315 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:42:20,572 WARN L315 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:42:20,572 WARN L315 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:42:20,572 WARN L315 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:42:20,572 WARN L315 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:42:20,573 WARN L315 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:42:20,573 WARN L315 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:42:20,573 WARN L315 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:42:20,573 WARN L315 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:42:20,573 WARN L315 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:42:20,574 WARN L315 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:42:20,574 WARN L315 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork5_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:42:20,574 WARN L315 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork5_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:42:20,574 WARN L315 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork5_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:42:20,575 WARN L315 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork5_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:42:20,575 WARN L315 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork5_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:42:20,575 WARN L315 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork5_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:42:20,576 WARN L315 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:42:20,576 WARN L315 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:42:20,576 WARN L315 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:42:20,576 WARN L315 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:42:20,576 WARN L315 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:42:20,577 WARN L315 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:42:20,580 WARN L315 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:42:20,580 WARN L315 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:42:20,581 WARN L315 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:42:20,581 WARN L315 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:42:20,587 WARN L315 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:42:20,587 WARN L315 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:42:20,587 WARN L315 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:42:20,587 WARN L315 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:42:20,590 WARN L315 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:42:20,591 WARN L315 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:42:20,591 WARN L315 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:42:20,591 WARN L315 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:42:20,593 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#t~nondet8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:42:20,594 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#t~mem4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:42:20,594 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:42:20,594 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t4~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:42:20,594 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t2~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:42:20,594 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:42:20,595 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:42:20,595 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#t~mem10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:42:20,595 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#t~mem11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:42:20,595 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t4~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:42:20,595 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#t~mem12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:42:20,595 WARN L315 ript$VariableManager]: TermVariabe thread0Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:42:20,596 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t3~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:42:20,596 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:42:20,596 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:42:20,596 WARN L315 ript$VariableManager]: TermVariabe thread0Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:42:20,596 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:42:20,597 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t1~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:42:20,597 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t5~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:42:20,597 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:42:20,597 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t5~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:42:20,597 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:42:20,597 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:42:20,598 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#t~nondet7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:42:20,600 WARN L315 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork4_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:42:20,601 WARN L315 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork4_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:42:20,601 WARN L315 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork4_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:42:20,601 WARN L315 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork4_#t~malloc2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:42:20,601 WARN L315 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork4_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:42:20,601 WARN L315 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork4_#t~malloc2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:42:20,603 WARN L315 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork5_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:42:20,604 WARN L315 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork5_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:42:20,604 WARN L315 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork5_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:42:20,604 WARN L315 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork5_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:42:20,606 WARN L315 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork4_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:42:20,607 WARN L315 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork4_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:42:20,607 WARN L315 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork4_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:42:20,607 WARN L315 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork4_#t~malloc2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:42:20,607 WARN L315 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork4_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:42:20,607 WARN L315 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork4_#t~malloc2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:42:20,610 WARN L315 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork5_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:42:20,611 WARN L315 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork5_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:42:20,611 WARN L315 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork5_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:42:20,611 WARN L315 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork5_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:42:20,613 WARN L315 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:42:20,614 WARN L315 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:42:20,614 WARN L315 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:42:20,614 WARN L315 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:42:20,616 WARN L315 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:42:20,617 WARN L315 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:42:20,617 WARN L315 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:42:20,617 WARN L315 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:42:20,619 WARN L315 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:42:20,619 WARN L315 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:42:20,620 WARN L315 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:42:20,620 WARN L315 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:42:20,793 INFO L249 AbstractCegarLoop]: Starting to check reachability of 12 error locations. [2019-12-18 15:42:20,811 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-18 15:42:20,811 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-18 15:42:20,811 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-18 15:42:20,811 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-18 15:42:20,811 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-18 15:42:20,812 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-18 15:42:20,812 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-18 15:42:20,812 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-18 15:42:20,829 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 172 places, 243 transitions [2019-12-18 15:42:20,831 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 172 places, 243 transitions [2019-12-18 15:42:20,971 INFO L126 PetriNetUnfolder]: 61/264 cut-off events. [2019-12-18 15:42:20,972 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 15:42:20,989 INFO L76 FinitePrefix]: Finished finitePrefix Result has 365 conditions, 264 events. 61/264 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 750 event pairs. 227/441 useless extension candidates. Maximal degree in co-relation 353. Up to 24 conditions per place. [2019-12-18 15:42:21,010 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 172 places, 243 transitions [2019-12-18 15:42:21,107 INFO L126 PetriNetUnfolder]: 61/264 cut-off events. [2019-12-18 15:42:21,107 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 15:42:21,112 INFO L76 FinitePrefix]: Finished finitePrefix Result has 365 conditions, 264 events. 61/264 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 750 event pairs. 227/441 useless extension candidates. Maximal degree in co-relation 353. Up to 24 conditions per place. [2019-12-18 15:42:21,125 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 4038 [2019-12-18 15:42:21,126 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-18 15:42:22,938 WARN L192 SmtUtils]: Spent 135.00 ms on a formula simplification that was a NOOP. DAG size: 77 [2019-12-18 15:42:23,078 WARN L192 SmtUtils]: Spent 137.00 ms on a formula simplification that was a NOOP. DAG size: 73 [2019-12-18 15:42:23,367 INFO L206 etLargeBlockEncoding]: Checked pairs total: 2242 [2019-12-18 15:42:23,367 INFO L214 etLargeBlockEncoding]: Total number of compositions: 74 [2019-12-18 15:42:23,371 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 99 places, 173 transitions [2019-12-18 15:42:23,944 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 3502 states. [2019-12-18 15:42:23,947 INFO L276 IsEmpty]: Start isEmpty. Operand 3502 states. [2019-12-18 15:42:23,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-12-18 15:42:23,955 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:42:23,956 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:42:23,957 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-18 15:42:23,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:42:23,965 INFO L82 PathProgramCache]: Analyzing trace with hash -1385407457, now seen corresponding path program 1 times [2019-12-18 15:42:23,976 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:42:23,977 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [567195837] [2019-12-18 15:42:23,977 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:42:24,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:42:24,282 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-18 15:42:24,283 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [567195837] [2019-12-18 15:42:24,285 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:42:24,285 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 15:42:24,286 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1742671574] [2019-12-18 15:42:24,292 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 15:42:24,293 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:42:24,308 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 15:42:24,309 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-18 15:42:24,311 INFO L87 Difference]: Start difference. First operand 3502 states. Second operand 6 states. [2019-12-18 15:42:24,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:42:24,681 INFO L93 Difference]: Finished difference Result 4760 states and 19900 transitions. [2019-12-18 15:42:24,681 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 15:42:24,683 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 9 [2019-12-18 15:42:24,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:42:24,754 INFO L225 Difference]: With dead ends: 4760 [2019-12-18 15:42:24,754 INFO L226 Difference]: Without dead ends: 4272 [2019-12-18 15:42:24,756 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-18 15:42:24,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4272 states. [2019-12-18 15:42:25,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4272 to 3018. [2019-12-18 15:42:25,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3018 states. [2019-12-18 15:42:25,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3018 states to 3018 states and 12272 transitions. [2019-12-18 15:42:25,091 INFO L78 Accepts]: Start accepts. Automaton has 3018 states and 12272 transitions. Word has length 9 [2019-12-18 15:42:25,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:42:25,092 INFO L462 AbstractCegarLoop]: Abstraction has 3018 states and 12272 transitions. [2019-12-18 15:42:25,092 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 15:42:25,092 INFO L276 IsEmpty]: Start isEmpty. Operand 3018 states and 12272 transitions. [2019-12-18 15:42:25,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-12-18 15:42:25,093 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:42:25,093 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:42:25,094 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-18 15:42:25,094 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:42:25,094 INFO L82 PathProgramCache]: Analyzing trace with hash -1192062693, now seen corresponding path program 2 times [2019-12-18 15:42:25,094 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:42:25,095 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1804749635] [2019-12-18 15:42:25,095 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:42:25,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:42:25,212 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-18 15:42:25,212 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1804749635] [2019-12-18 15:42:25,213 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:42:25,213 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 15:42:25,213 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1351644356] [2019-12-18 15:42:25,215 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 15:42:25,216 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:42:25,216 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 15:42:25,216 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-18 15:42:25,216 INFO L87 Difference]: Start difference. First operand 3018 states and 12272 transitions. Second operand 6 states. [2019-12-18 15:42:25,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:42:25,573 INFO L93 Difference]: Finished difference Result 5518 states and 23821 transitions. [2019-12-18 15:42:25,574 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 15:42:25,574 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 9 [2019-12-18 15:42:25,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:42:25,651 INFO L225 Difference]: With dead ends: 5518 [2019-12-18 15:42:25,652 INFO L226 Difference]: Without dead ends: 5518 [2019-12-18 15:42:25,654 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-18 15:42:25,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5518 states. [2019-12-18 15:42:25,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5518 to 3008. [2019-12-18 15:42:25,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3008 states. [2019-12-18 15:42:25,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3008 states to 3008 states and 12255 transitions. [2019-12-18 15:42:25,980 INFO L78 Accepts]: Start accepts. Automaton has 3008 states and 12255 transitions. Word has length 9 [2019-12-18 15:42:25,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:42:25,980 INFO L462 AbstractCegarLoop]: Abstraction has 3008 states and 12255 transitions. [2019-12-18 15:42:25,981 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 15:42:25,981 INFO L276 IsEmpty]: Start isEmpty. Operand 3008 states and 12255 transitions. [2019-12-18 15:42:25,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-18 15:42:25,982 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:42:25,982 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:42:25,983 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-18 15:42:25,983 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:42:25,983 INFO L82 PathProgramCache]: Analyzing trace with hash 1538202320, now seen corresponding path program 1 times [2019-12-18 15:42:25,984 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:42:25,984 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [511501883] [2019-12-18 15:42:25,984 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:42:26,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:42:26,078 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-18 15:42:26,079 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [511501883] [2019-12-18 15:42:26,079 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:42:26,079 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 15:42:26,080 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1073423085] [2019-12-18 15:42:26,080 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 15:42:26,080 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:42:26,082 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 15:42:26,082 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 15:42:26,082 INFO L87 Difference]: Start difference. First operand 3008 states and 12255 transitions. Second operand 3 states. [2019-12-18 15:42:26,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:42:26,181 INFO L93 Difference]: Finished difference Result 4848 states and 19273 transitions. [2019-12-18 15:42:26,182 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 15:42:26,183 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-12-18 15:42:26,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:42:26,238 INFO L225 Difference]: With dead ends: 4848 [2019-12-18 15:42:26,239 INFO L226 Difference]: Without dead ends: 3558 [2019-12-18 15:42:26,239 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-18 15:42:26,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3558 states. [2019-12-18 15:42:26,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3558 to 3181. [2019-12-18 15:42:26,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3181 states. [2019-12-18 15:42:26,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3181 states to 3181 states and 12171 transitions. [2019-12-18 15:42:26,422 INFO L78 Accepts]: Start accepts. Automaton has 3181 states and 12171 transitions. Word has length 16 [2019-12-18 15:42:26,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:42:26,423 INFO L462 AbstractCegarLoop]: Abstraction has 3181 states and 12171 transitions. [2019-12-18 15:42:26,423 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 15:42:26,424 INFO L276 IsEmpty]: Start isEmpty. Operand 3181 states and 12171 transitions. [2019-12-18 15:42:26,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-18 15:42:26,426 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:42:26,427 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:42:26,427 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-18 15:42:26,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:42:26,427 INFO L82 PathProgramCache]: Analyzing trace with hash 439630726, now seen corresponding path program 1 times [2019-12-18 15:42:26,428 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:42:26,428 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [3452595] [2019-12-18 15:42:26,428 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:42:26,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:42:26,538 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-18 15:42:26,539 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [3452595] [2019-12-18 15:42:26,539 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:42:26,539 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 15:42:26,539 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2146173589] [2019-12-18 15:42:26,540 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 15:42:26,540 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:42:26,540 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 15:42:26,540 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-12-18 15:42:26,541 INFO L87 Difference]: Start difference. First operand 3181 states and 12171 transitions. Second operand 7 states. [2019-12-18 15:42:26,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:42:26,824 INFO L93 Difference]: Finished difference Result 4417 states and 17212 transitions. [2019-12-18 15:42:26,824 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-18 15:42:26,825 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 17 [2019-12-18 15:42:26,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:42:26,846 INFO L225 Difference]: With dead ends: 4417 [2019-12-18 15:42:26,846 INFO L226 Difference]: Without dead ends: 4393 [2019-12-18 15:42:26,847 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-18 15:42:26,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4393 states. [2019-12-18 15:42:27,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4393 to 3588. [2019-12-18 15:42:27,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3588 states. [2019-12-18 15:42:27,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3588 states to 3588 states and 14085 transitions. [2019-12-18 15:42:27,097 INFO L78 Accepts]: Start accepts. Automaton has 3588 states and 14085 transitions. Word has length 17 [2019-12-18 15:42:27,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:42:27,097 INFO L462 AbstractCegarLoop]: Abstraction has 3588 states and 14085 transitions. [2019-12-18 15:42:27,097 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 15:42:27,097 INFO L276 IsEmpty]: Start isEmpty. Operand 3588 states and 14085 transitions. [2019-12-18 15:42:27,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-18 15:42:27,106 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:42:27,106 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:42:27,106 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-18 15:42:27,106 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:42:27,107 INFO L82 PathProgramCache]: Analyzing trace with hash 1784829996, now seen corresponding path program 2 times [2019-12-18 15:42:27,107 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:42:27,107 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [603376902] [2019-12-18 15:42:27,107 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:42:27,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:42:27,195 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-18 15:42:27,197 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [603376902] [2019-12-18 15:42:27,197 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:42:27,198 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 15:42:27,198 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [955842995] [2019-12-18 15:42:27,198 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 15:42:27,198 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:42:27,199 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 15:42:27,199 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-18 15:42:27,199 INFO L87 Difference]: Start difference. First operand 3588 states and 14085 transitions. Second operand 6 states. [2019-12-18 15:42:27,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:42:27,323 INFO L93 Difference]: Finished difference Result 4024 states and 15445 transitions. [2019-12-18 15:42:27,323 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 15:42:27,324 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 17 [2019-12-18 15:42:27,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:42:27,338 INFO L225 Difference]: With dead ends: 4024 [2019-12-18 15:42:27,339 INFO L226 Difference]: Without dead ends: 4024 [2019-12-18 15:42:27,340 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-18 15:42:27,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4024 states. [2019-12-18 15:42:27,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4024 to 3573. [2019-12-18 15:42:27,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3573 states. [2019-12-18 15:42:27,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3573 states to 3573 states and 14045 transitions. [2019-12-18 15:42:27,460 INFO L78 Accepts]: Start accepts. Automaton has 3573 states and 14045 transitions. Word has length 17 [2019-12-18 15:42:27,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:42:27,461 INFO L462 AbstractCegarLoop]: Abstraction has 3573 states and 14045 transitions. [2019-12-18 15:42:27,461 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 15:42:27,461 INFO L276 IsEmpty]: Start isEmpty. Operand 3573 states and 14045 transitions. [2019-12-18 15:42:27,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-18 15:42:27,463 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:42:27,463 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-18 15:42:27,463 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-18 15:42:27,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:42:27,464 INFO L82 PathProgramCache]: Analyzing trace with hash -2096337026, now seen corresponding path program 1 times [2019-12-18 15:42:27,464 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:42:27,464 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [296344800] [2019-12-18 15:42:27,464 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:42:27,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:42:27,558 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-18 15:42:27,558 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [296344800] [2019-12-18 15:42:27,559 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:42:27,559 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 15:42:27,559 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1973442919] [2019-12-18 15:42:27,559 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 15:42:27,559 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:42:27,560 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 15:42:27,560 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-12-18 15:42:27,560 INFO L87 Difference]: Start difference. First operand 3573 states and 14045 transitions. Second operand 7 states. [2019-12-18 15:42:27,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:42:27,774 INFO L93 Difference]: Finished difference Result 4225 states and 16225 transitions. [2019-12-18 15:42:27,775 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-18 15:42:27,775 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 18 [2019-12-18 15:42:27,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:42:27,792 INFO L225 Difference]: With dead ends: 4225 [2019-12-18 15:42:27,793 INFO L226 Difference]: Without dead ends: 4129 [2019-12-18 15:42:27,793 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-18 15:42:27,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4129 states. [2019-12-18 15:42:28,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4129 to 3713. [2019-12-18 15:42:28,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3713 states. [2019-12-18 15:42:28,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3713 states to 3713 states and 14455 transitions. [2019-12-18 15:42:28,343 INFO L78 Accepts]: Start accepts. Automaton has 3713 states and 14455 transitions. Word has length 18 [2019-12-18 15:42:28,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:42:28,343 INFO L462 AbstractCegarLoop]: Abstraction has 3713 states and 14455 transitions. [2019-12-18 15:42:28,343 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 15:42:28,344 INFO L276 IsEmpty]: Start isEmpty. Operand 3713 states and 14455 transitions. [2019-12-18 15:42:28,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-18 15:42:28,345 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:42:28,345 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-18 15:42:28,345 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-18 15:42:28,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:42:28,351 INFO L82 PathProgramCache]: Analyzing trace with hash -1440753652, now seen corresponding path program 2 times [2019-12-18 15:42:28,352 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:42:28,353 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [385774416] [2019-12-18 15:42:28,353 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:42:28,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:42:28,497 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-18 15:42:28,498 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [385774416] [2019-12-18 15:42:28,498 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:42:28,498 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 15:42:28,499 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1719587307] [2019-12-18 15:42:28,499 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-18 15:42:28,499 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:42:28,500 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-18 15:42:28,500 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-12-18 15:42:28,500 INFO L87 Difference]: Start difference. First operand 3713 states and 14455 transitions. Second operand 8 states. [2019-12-18 15:42:29,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:42:29,038 INFO L93 Difference]: Finished difference Result 4979 states and 19779 transitions. [2019-12-18 15:42:29,038 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-18 15:42:29,039 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 18 [2019-12-18 15:42:29,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:42:29,062 INFO L225 Difference]: With dead ends: 4979 [2019-12-18 15:42:29,062 INFO L226 Difference]: Without dead ends: 4905 [2019-12-18 15:42:29,063 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=54, Invalid=128, Unknown=0, NotChecked=0, Total=182 [2019-12-18 15:42:29,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4905 states. [2019-12-18 15:42:29,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4905 to 4131. [2019-12-18 15:42:29,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4131 states. [2019-12-18 15:42:29,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4131 states to 4131 states and 16620 transitions. [2019-12-18 15:42:29,201 INFO L78 Accepts]: Start accepts. Automaton has 4131 states and 16620 transitions. Word has length 18 [2019-12-18 15:42:29,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:42:29,202 INFO L462 AbstractCegarLoop]: Abstraction has 4131 states and 16620 transitions. [2019-12-18 15:42:29,202 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-18 15:42:29,202 INFO L276 IsEmpty]: Start isEmpty. Operand 4131 states and 16620 transitions. [2019-12-18 15:42:29,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-18 15:42:29,203 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:42:29,204 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-18 15:42:29,204 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-18 15:42:29,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:42:29,204 INFO L82 PathProgramCache]: Analyzing trace with hash 2054209068, now seen corresponding path program 3 times [2019-12-18 15:42:29,204 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:42:29,205 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [290027161] [2019-12-18 15:42:29,205 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:42:29,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:42:29,351 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-18 15:42:29,352 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [290027161] [2019-12-18 15:42:29,352 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:42:29,352 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 15:42:29,352 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1419810552] [2019-12-18 15:42:29,353 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 15:42:29,353 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:42:29,353 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 15:42:29,353 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-12-18 15:42:29,354 INFO L87 Difference]: Start difference. First operand 4131 states and 16620 transitions. Second operand 9 states. [2019-12-18 15:42:29,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:42:29,763 INFO L93 Difference]: Finished difference Result 6735 states and 27904 transitions. [2019-12-18 15:42:29,764 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-18 15:42:29,764 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 18 [2019-12-18 15:42:29,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:42:29,787 INFO L225 Difference]: With dead ends: 6735 [2019-12-18 15:42:29,787 INFO L226 Difference]: Without dead ends: 6661 [2019-12-18 15:42:29,788 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-18 15:42:29,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6661 states. [2019-12-18 15:42:29,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6661 to 4129. [2019-12-18 15:42:29,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4129 states. [2019-12-18 15:42:29,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4129 states to 4129 states and 16616 transitions. [2019-12-18 15:42:29,927 INFO L78 Accepts]: Start accepts. Automaton has 4129 states and 16616 transitions. Word has length 18 [2019-12-18 15:42:29,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:42:29,927 INFO L462 AbstractCegarLoop]: Abstraction has 4129 states and 16616 transitions. [2019-12-18 15:42:29,927 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 15:42:29,927 INFO L276 IsEmpty]: Start isEmpty. Operand 4129 states and 16616 transitions. [2019-12-18 15:42:29,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-18 15:42:29,929 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:42:29,929 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-18 15:42:29,929 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-18 15:42:29,930 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:42:29,930 INFO L82 PathProgramCache]: Analyzing trace with hash -1150446370, now seen corresponding path program 4 times [2019-12-18 15:42:29,930 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:42:29,930 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2106554952] [2019-12-18 15:42:29,931 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:42:29,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:42:30,156 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:42:30,156 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2106554952] [2019-12-18 15:42:30,157 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:42:30,157 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-18 15:42:30,157 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2126130221] [2019-12-18 15:42:30,157 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-18 15:42:30,158 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:42:30,158 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-18 15:42:30,158 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2019-12-18 15:42:30,158 INFO L87 Difference]: Start difference. First operand 4129 states and 16616 transitions. Second operand 11 states. [2019-12-18 15:42:31,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:42:31,107 INFO L93 Difference]: Finished difference Result 5384 states and 21910 transitions. [2019-12-18 15:42:31,108 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-18 15:42:31,108 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 18 [2019-12-18 15:42:31,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:42:31,126 INFO L225 Difference]: With dead ends: 5384 [2019-12-18 15:42:31,127 INFO L226 Difference]: Without dead ends: 5310 [2019-12-18 15:42:31,127 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=91, Invalid=215, Unknown=0, NotChecked=0, Total=306 [2019-12-18 15:42:31,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5310 states. [2019-12-18 15:42:31,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5310 to 4116. [2019-12-18 15:42:31,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4116 states. [2019-12-18 15:42:31,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4116 states to 4116 states and 16578 transitions. [2019-12-18 15:42:31,270 INFO L78 Accepts]: Start accepts. Automaton has 4116 states and 16578 transitions. Word has length 18 [2019-12-18 15:42:31,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:42:31,271 INFO L462 AbstractCegarLoop]: Abstraction has 4116 states and 16578 transitions. [2019-12-18 15:42:31,271 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-18 15:42:31,271 INFO L276 IsEmpty]: Start isEmpty. Operand 4116 states and 16578 transitions. [2019-12-18 15:42:31,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-18 15:42:31,273 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:42:31,273 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-18 15:42:31,274 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-18 15:42:31,274 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:42:31,274 INFO L82 PathProgramCache]: Analyzing trace with hash 1529508729, now seen corresponding path program 1 times [2019-12-18 15:42:31,274 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:42:31,275 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [846260866] [2019-12-18 15:42:31,275 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:42:31,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:42:31,350 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-18 15:42:31,350 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [846260866] [2019-12-18 15:42:31,351 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:42:31,351 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 15:42:31,351 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [82059371] [2019-12-18 15:42:31,351 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 15:42:31,352 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:42:31,352 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 15:42:31,352 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-18 15:42:31,352 INFO L87 Difference]: Start difference. First operand 4116 states and 16578 transitions. Second operand 7 states. [2019-12-18 15:42:31,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:42:31,495 INFO L93 Difference]: Finished difference Result 4625 states and 18119 transitions. [2019-12-18 15:42:31,496 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 15:42:31,496 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 19 [2019-12-18 15:42:31,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:42:31,509 INFO L225 Difference]: With dead ends: 4625 [2019-12-18 15:42:31,510 INFO L226 Difference]: Without dead ends: 4625 [2019-12-18 15:42:31,510 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-18 15:42:31,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4625 states. [2019-12-18 15:42:31,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4625 to 4078. [2019-12-18 15:42:31,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4078 states. [2019-12-18 15:42:31,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4078 states to 4078 states and 16436 transitions. [2019-12-18 15:42:31,627 INFO L78 Accepts]: Start accepts. Automaton has 4078 states and 16436 transitions. Word has length 19 [2019-12-18 15:42:31,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:42:31,627 INFO L462 AbstractCegarLoop]: Abstraction has 4078 states and 16436 transitions. [2019-12-18 15:42:31,627 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 15:42:31,627 INFO L276 IsEmpty]: Start isEmpty. Operand 4078 states and 16436 transitions. [2019-12-18 15:42:31,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-18 15:42:31,629 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:42:31,629 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-18 15:42:31,630 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-18 15:42:31,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:42:31,630 INFO L82 PathProgramCache]: Analyzing trace with hash 386755117, now seen corresponding path program 1 times [2019-12-18 15:42:31,630 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:42:31,631 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1218816866] [2019-12-18 15:42:31,631 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:42:31,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:42:31,907 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-18 15:42:31,907 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1218816866] [2019-12-18 15:42:31,908 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:42:31,908 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-18 15:42:31,908 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [999823663] [2019-12-18 15:42:31,908 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-18 15:42:31,908 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:42:31,909 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-18 15:42:31,909 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2019-12-18 15:42:31,909 INFO L87 Difference]: Start difference. First operand 4078 states and 16436 transitions. Second operand 12 states. [2019-12-18 15:42:32,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:42:32,997 INFO L93 Difference]: Finished difference Result 5865 states and 24362 transitions. [2019-12-18 15:42:32,997 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-18 15:42:32,998 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 19 [2019-12-18 15:42:32,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:42:33,011 INFO L225 Difference]: With dead ends: 5865 [2019-12-18 15:42:33,011 INFO L226 Difference]: Without dead ends: 5791 [2019-12-18 15:42:33,011 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=100, Invalid=242, Unknown=0, NotChecked=0, Total=342 [2019-12-18 15:42:33,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5791 states. [2019-12-18 15:42:33,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5791 to 4021. [2019-12-18 15:42:33,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4021 states. [2019-12-18 15:42:33,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4021 states to 4021 states and 16226 transitions. [2019-12-18 15:42:33,124 INFO L78 Accepts]: Start accepts. Automaton has 4021 states and 16226 transitions. Word has length 19 [2019-12-18 15:42:33,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:42:33,124 INFO L462 AbstractCegarLoop]: Abstraction has 4021 states and 16226 transitions. [2019-12-18 15:42:33,124 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-18 15:42:33,125 INFO L276 IsEmpty]: Start isEmpty. Operand 4021 states and 16226 transitions. [2019-12-18 15:42:33,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-12-18 15:42:33,127 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:42:33,127 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-18 15:42:33,127 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-18 15:42:33,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:42:33,127 INFO L82 PathProgramCache]: Analyzing trace with hash 169969073, now seen corresponding path program 1 times [2019-12-18 15:42:33,127 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:42:33,128 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [970341802] [2019-12-18 15:42:33,128 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:42:33,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:42:33,239 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-18 15:42:33,240 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [970341802] [2019-12-18 15:42:33,240 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:42:33,240 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-18 15:42:33,240 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [451437794] [2019-12-18 15:42:33,241 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-18 15:42:33,241 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:42:33,241 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-18 15:42:33,241 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2019-12-18 15:42:33,241 INFO L87 Difference]: Start difference. First operand 4021 states and 16226 transitions. Second operand 10 states. [2019-12-18 15:42:33,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:42:33,826 INFO L93 Difference]: Finished difference Result 5436 states and 21881 transitions. [2019-12-18 15:42:33,827 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 15:42:33,827 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 20 [2019-12-18 15:42:33,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:42:33,838 INFO L225 Difference]: With dead ends: 5436 [2019-12-18 15:42:33,839 INFO L226 Difference]: Without dead ends: 5390 [2019-12-18 15:42:33,839 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-18 15:42:33,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5390 states. [2019-12-18 15:42:33,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5390 to 4174. [2019-12-18 15:42:33,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4174 states. [2019-12-18 15:42:34,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4174 states to 4174 states and 16952 transitions. [2019-12-18 15:42:34,060 INFO L78 Accepts]: Start accepts. Automaton has 4174 states and 16952 transitions. Word has length 20 [2019-12-18 15:42:34,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:42:34,060 INFO L462 AbstractCegarLoop]: Abstraction has 4174 states and 16952 transitions. [2019-12-18 15:42:34,061 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-18 15:42:34,061 INFO L276 IsEmpty]: Start isEmpty. Operand 4174 states and 16952 transitions. [2019-12-18 15:42:34,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-12-18 15:42:34,064 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:42:34,064 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-18 15:42:34,064 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-18 15:42:34,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:42:34,065 INFO L82 PathProgramCache]: Analyzing trace with hash -1932078158, now seen corresponding path program 1 times [2019-12-18 15:42:34,065 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:42:34,066 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1494619614] [2019-12-18 15:42:34,066 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:42:34,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:42:34,213 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-18 15:42:34,213 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1494619614] [2019-12-18 15:42:34,214 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:42:34,214 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-18 15:42:34,214 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1030348016] [2019-12-18 15:42:34,215 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-18 15:42:34,215 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:42:34,215 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-18 15:42:34,215 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2019-12-18 15:42:34,216 INFO L87 Difference]: Start difference. First operand 4174 states and 16952 transitions. Second operand 10 states. [2019-12-18 15:42:34,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:42:34,623 INFO L93 Difference]: Finished difference Result 5508 states and 22462 transitions. [2019-12-18 15:42:34,623 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-18 15:42:34,624 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 20 [2019-12-18 15:42:34,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:42:34,634 INFO L225 Difference]: With dead ends: 5508 [2019-12-18 15:42:34,634 INFO L226 Difference]: Without dead ends: 5462 [2019-12-18 15:42:34,635 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-18 15:42:34,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5462 states. [2019-12-18 15:42:34,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5462 to 4020. [2019-12-18 15:42:34,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4020 states. [2019-12-18 15:42:34,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4020 states to 4020 states and 16223 transitions. [2019-12-18 15:42:34,748 INFO L78 Accepts]: Start accepts. Automaton has 4020 states and 16223 transitions. Word has length 20 [2019-12-18 15:42:34,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:42:34,749 INFO L462 AbstractCegarLoop]: Abstraction has 4020 states and 16223 transitions. [2019-12-18 15:42:34,749 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-18 15:42:34,749 INFO L276 IsEmpty]: Start isEmpty. Operand 4020 states and 16223 transitions. [2019-12-18 15:42:34,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-12-18 15:42:34,751 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:42:34,751 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-18 15:42:34,751 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-18 15:42:34,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:42:34,752 INFO L82 PathProgramCache]: Analyzing trace with hash -944906415, now seen corresponding path program 2 times [2019-12-18 15:42:34,752 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:42:34,753 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [23319010] [2019-12-18 15:42:34,753 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:42:34,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:42:34,999 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-18 15:42:35,000 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [23319010] [2019-12-18 15:42:35,000 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:42:35,000 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-18 15:42:35,000 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1769882202] [2019-12-18 15:42:35,001 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-18 15:42:35,001 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:42:35,001 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-18 15:42:35,001 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-12-18 15:42:35,002 INFO L87 Difference]: Start difference. First operand 4020 states and 16223 transitions. Second operand 10 states. [2019-12-18 15:42:35,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:42:35,998 INFO L93 Difference]: Finished difference Result 5427 states and 21857 transitions. [2019-12-18 15:42:35,999 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-18 15:42:35,999 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 20 [2019-12-18 15:42:35,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:42:36,013 INFO L225 Difference]: With dead ends: 5427 [2019-12-18 15:42:36,013 INFO L226 Difference]: Without dead ends: 5381 [2019-12-18 15:42:36,014 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=69, Invalid=171, Unknown=0, NotChecked=0, Total=240 [2019-12-18 15:42:36,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5381 states. [2019-12-18 15:42:36,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5381 to 4169. [2019-12-18 15:42:36,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4169 states. [2019-12-18 15:42:36,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4169 states to 4169 states and 16935 transitions. [2019-12-18 15:42:36,133 INFO L78 Accepts]: Start accepts. Automaton has 4169 states and 16935 transitions. Word has length 20 [2019-12-18 15:42:36,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:42:36,133 INFO L462 AbstractCegarLoop]: Abstraction has 4169 states and 16935 transitions. [2019-12-18 15:42:36,133 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-18 15:42:36,133 INFO L276 IsEmpty]: Start isEmpty. Operand 4169 states and 16935 transitions. [2019-12-18 15:42:36,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-12-18 15:42:36,135 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:42:36,136 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-18 15:42:36,136 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-18 15:42:36,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:42:36,136 INFO L82 PathProgramCache]: Analyzing trace with hash 1562884562, now seen corresponding path program 2 times [2019-12-18 15:42:36,136 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:42:36,137 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2075088679] [2019-12-18 15:42:36,137 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:42:36,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:42:36,358 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-18 15:42:36,359 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2075088679] [2019-12-18 15:42:36,359 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:42:36,359 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-18 15:42:36,359 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [8987662] [2019-12-18 15:42:36,360 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-18 15:42:36,360 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:42:36,360 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-18 15:42:36,360 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2019-12-18 15:42:36,361 INFO L87 Difference]: Start difference. First operand 4169 states and 16935 transitions. Second operand 10 states. [2019-12-18 15:42:36,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:42:36,988 INFO L93 Difference]: Finished difference Result 6798 states and 27735 transitions. [2019-12-18 15:42:36,988 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-18 15:42:36,988 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 20 [2019-12-18 15:42:36,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:42:37,002 INFO L225 Difference]: With dead ends: 6798 [2019-12-18 15:42:37,003 INFO L226 Difference]: Without dead ends: 6752 [2019-12-18 15:42:37,003 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-18 15:42:37,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6752 states. [2019-12-18 15:42:37,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6752 to 4168. [2019-12-18 15:42:37,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4168 states. [2019-12-18 15:42:37,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4168 states to 4168 states and 16934 transitions. [2019-12-18 15:42:37,102 INFO L78 Accepts]: Start accepts. Automaton has 4168 states and 16934 transitions. Word has length 20 [2019-12-18 15:42:37,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:42:37,102 INFO L462 AbstractCegarLoop]: Abstraction has 4168 states and 16934 transitions. [2019-12-18 15:42:37,102 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-18 15:42:37,102 INFO L276 IsEmpty]: Start isEmpty. Operand 4168 states and 16934 transitions. [2019-12-18 15:42:37,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-12-18 15:42:37,104 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:42:37,104 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-18 15:42:37,104 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-18 15:42:37,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:42:37,104 INFO L82 PathProgramCache]: Analyzing trace with hash -1659645476, now seen corresponding path program 3 times [2019-12-18 15:42:37,104 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:42:37,105 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1169000902] [2019-12-18 15:42:37,105 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:42:37,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:42:37,287 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:42:37,288 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1169000902] [2019-12-18 15:42:37,288 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:42:37,288 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-18 15:42:37,288 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1016091604] [2019-12-18 15:42:37,289 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-18 15:42:37,289 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:42:37,289 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-18 15:42:37,289 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-12-18 15:42:37,290 INFO L87 Difference]: Start difference. First operand 4168 states and 16934 transitions. Second operand 10 states. [2019-12-18 15:42:37,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:42:37,727 INFO L93 Difference]: Finished difference Result 5273 states and 21186 transitions. [2019-12-18 15:42:37,727 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 15:42:37,727 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 20 [2019-12-18 15:42:37,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:42:37,738 INFO L225 Difference]: With dead ends: 5273 [2019-12-18 15:42:37,738 INFO L226 Difference]: Without dead ends: 5227 [2019-12-18 15:42:37,738 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=58, Invalid=124, Unknown=0, NotChecked=0, Total=182 [2019-12-18 15:42:37,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5227 states. [2019-12-18 15:42:37,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5227 to 4013. [2019-12-18 15:42:37,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4013 states. [2019-12-18 15:42:37,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4013 states to 4013 states and 16202 transitions. [2019-12-18 15:42:37,807 INFO L78 Accepts]: Start accepts. Automaton has 4013 states and 16202 transitions. Word has length 20 [2019-12-18 15:42:37,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:42:37,808 INFO L462 AbstractCegarLoop]: Abstraction has 4013 states and 16202 transitions. [2019-12-18 15:42:37,808 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-18 15:42:37,808 INFO L276 IsEmpty]: Start isEmpty. Operand 4013 states and 16202 transitions. [2019-12-18 15:42:37,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-12-18 15:42:37,810 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:42:37,810 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-18 15:42:37,811 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-18 15:42:37,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:42:37,811 INFO L82 PathProgramCache]: Analyzing trace with hash 1961766501, now seen corresponding path program 3 times [2019-12-18 15:42:37,811 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:42:37,811 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1412991713] [2019-12-18 15:42:37,812 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:42:37,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:42:37,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-18 15:42:37,899 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1412991713] [2019-12-18 15:42:37,899 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:42:37,899 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 15:42:37,899 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1995908513] [2019-12-18 15:42:37,900 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-18 15:42:37,901 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:42:37,901 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-18 15:42:37,901 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-12-18 15:42:37,901 INFO L87 Difference]: Start difference. First operand 4013 states and 16202 transitions. Second operand 8 states. [2019-12-18 15:42:38,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:42:38,233 INFO L93 Difference]: Finished difference Result 6360 states and 25585 transitions. [2019-12-18 15:42:38,233 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-18 15:42:38,234 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 20 [2019-12-18 15:42:38,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:42:38,251 INFO L225 Difference]: With dead ends: 6360 [2019-12-18 15:42:38,252 INFO L226 Difference]: Without dead ends: 6314 [2019-12-18 15:42:38,252 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-18 15:42:38,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6314 states. [2019-12-18 15:42:38,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6314 to 3983. [2019-12-18 15:42:38,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3983 states. [2019-12-18 15:42:38,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3983 states to 3983 states and 16133 transitions. [2019-12-18 15:42:38,360 INFO L78 Accepts]: Start accepts. Automaton has 3983 states and 16133 transitions. Word has length 20 [2019-12-18 15:42:38,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:42:38,360 INFO L462 AbstractCegarLoop]: Abstraction has 3983 states and 16133 transitions. [2019-12-18 15:42:38,360 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-18 15:42:38,360 INFO L276 IsEmpty]: Start isEmpty. Operand 3983 states and 16133 transitions. [2019-12-18 15:42:38,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-18 15:42:38,363 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:42:38,363 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-18 15:42:38,364 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-18 15:42:38,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:42:38,364 INFO L82 PathProgramCache]: Analyzing trace with hash 2117723117, now seen corresponding path program 1 times [2019-12-18 15:42:38,364 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:42:38,364 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1118220710] [2019-12-18 15:42:38,365 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:42:38,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:42:38,418 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-18 15:42:38,419 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1118220710] [2019-12-18 15:42:38,419 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:42:38,419 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 15:42:38,419 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [109697812] [2019-12-18 15:42:38,420 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 15:42:38,420 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:42:38,420 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 15:42:38,420 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-12-18 15:42:38,420 INFO L87 Difference]: Start difference. First operand 3983 states and 16133 transitions. Second operand 7 states. [2019-12-18 15:42:38,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:42:38,630 INFO L93 Difference]: Finished difference Result 4762 states and 18800 transitions. [2019-12-18 15:42:38,630 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-18 15:42:38,630 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 21 [2019-12-18 15:42:38,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:42:38,641 INFO L225 Difference]: With dead ends: 4762 [2019-12-18 15:42:38,641 INFO L226 Difference]: Without dead ends: 4687 [2019-12-18 15:42:38,641 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-18 15:42:38,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4687 states. [2019-12-18 15:42:38,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4687 to 4305. [2019-12-18 15:42:38,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4305 states. [2019-12-18 15:42:38,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4305 states to 4305 states and 17320 transitions. [2019-12-18 15:42:38,704 INFO L78 Accepts]: Start accepts. Automaton has 4305 states and 17320 transitions. Word has length 21 [2019-12-18 15:42:38,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:42:38,705 INFO L462 AbstractCegarLoop]: Abstraction has 4305 states and 17320 transitions. [2019-12-18 15:42:38,705 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 15:42:38,705 INFO L276 IsEmpty]: Start isEmpty. Operand 4305 states and 17320 transitions. [2019-12-18 15:42:38,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-18 15:42:38,708 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:42:38,708 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-18 15:42:38,709 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-18 15:42:38,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:42:38,709 INFO L82 PathProgramCache]: Analyzing trace with hash -1335103446, now seen corresponding path program 1 times [2019-12-18 15:42:38,709 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:42:38,709 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1405106651] [2019-12-18 15:42:38,709 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:42:38,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:42:38,860 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-18 15:42:38,860 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1405106651] [2019-12-18 15:42:38,860 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:42:38,860 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 15:42:38,861 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [605781503] [2019-12-18 15:42:38,861 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-18 15:42:38,861 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:42:38,861 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-18 15:42:38,862 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2019-12-18 15:42:38,862 INFO L87 Difference]: Start difference. First operand 4305 states and 17320 transitions. Second operand 8 states. [2019-12-18 15:42:38,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:42:38,996 INFO L93 Difference]: Finished difference Result 4856 states and 18991 transitions. [2019-12-18 15:42:38,996 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 15:42:38,996 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 21 [2019-12-18 15:42:38,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:42:39,006 INFO L225 Difference]: With dead ends: 4856 [2019-12-18 15:42:39,006 INFO L226 Difference]: Without dead ends: 4329 [2019-12-18 15:42:39,007 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2019-12-18 15:42:39,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4329 states. [2019-12-18 15:42:39,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4329 to 3712. [2019-12-18 15:42:39,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3712 states. [2019-12-18 15:42:39,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3712 states to 3712 states and 14646 transitions. [2019-12-18 15:42:39,063 INFO L78 Accepts]: Start accepts. Automaton has 3712 states and 14646 transitions. Word has length 21 [2019-12-18 15:42:39,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:42:39,063 INFO L462 AbstractCegarLoop]: Abstraction has 3712 states and 14646 transitions. [2019-12-18 15:42:39,063 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-18 15:42:39,063 INFO L276 IsEmpty]: Start isEmpty. Operand 3712 states and 14646 transitions. [2019-12-18 15:42:39,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-18 15:42:39,066 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:42:39,066 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-18 15:42:39,066 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-18 15:42:39,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:42:39,067 INFO L82 PathProgramCache]: Analyzing trace with hash -1959403642, now seen corresponding path program 1 times [2019-12-18 15:42:39,067 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:42:39,067 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [799193805] [2019-12-18 15:42:39,067 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:42:39,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:42:39,374 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-18 15:42:39,374 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [799193805] [2019-12-18 15:42:39,375 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:42:39,375 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-18 15:42:39,375 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1871069377] [2019-12-18 15:42:39,375 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-18 15:42:39,375 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:42:39,376 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-18 15:42:39,376 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2019-12-18 15:42:39,376 INFO L87 Difference]: Start difference. First operand 3712 states and 14646 transitions. Second operand 12 states. [2019-12-18 15:42:40,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:42:40,361 INFO L93 Difference]: Finished difference Result 4906 states and 19112 transitions. [2019-12-18 15:42:40,362 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-18 15:42:40,362 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 21 [2019-12-18 15:42:40,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:42:40,373 INFO L225 Difference]: With dead ends: 4906 [2019-12-18 15:42:40,373 INFO L226 Difference]: Without dead ends: 4857 [2019-12-18 15:42:40,373 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=88, Invalid=218, Unknown=0, NotChecked=0, Total=306 [2019-12-18 15:42:40,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4857 states. [2019-12-18 15:42:40,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4857 to 3488. [2019-12-18 15:42:40,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3488 states. [2019-12-18 15:42:40,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3488 states to 3488 states and 13508 transitions. [2019-12-18 15:42:40,428 INFO L78 Accepts]: Start accepts. Automaton has 3488 states and 13508 transitions. Word has length 21 [2019-12-18 15:42:40,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:42:40,428 INFO L462 AbstractCegarLoop]: Abstraction has 3488 states and 13508 transitions. [2019-12-18 15:42:40,428 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-18 15:42:40,428 INFO L276 IsEmpty]: Start isEmpty. Operand 3488 states and 13508 transitions. [2019-12-18 15:42:40,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-18 15:42:40,430 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:42:40,430 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-18 15:42:40,430 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-18 15:42:40,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:42:40,430 INFO L82 PathProgramCache]: Analyzing trace with hash -1977277281, now seen corresponding path program 1 times [2019-12-18 15:42:40,430 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:42:40,430 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [456794102] [2019-12-18 15:42:40,431 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:42:40,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:42:40,678 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-18 15:42:40,678 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [456794102] [2019-12-18 15:42:40,678 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:42:40,678 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-18 15:42:40,679 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1883645692] [2019-12-18 15:42:40,679 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-18 15:42:40,679 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:42:40,679 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-18 15:42:40,679 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2019-12-18 15:42:40,679 INFO L87 Difference]: Start difference. First operand 3488 states and 13508 transitions. Second operand 11 states. [2019-12-18 15:42:41,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:42:41,556 INFO L93 Difference]: Finished difference Result 4464 states and 17193 transitions. [2019-12-18 15:42:41,556 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-18 15:42:41,556 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 21 [2019-12-18 15:42:41,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:42:41,566 INFO L225 Difference]: With dead ends: 4464 [2019-12-18 15:42:41,566 INFO L226 Difference]: Without dead ends: 4415 [2019-12-18 15:42:41,567 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=78, Invalid=194, Unknown=0, NotChecked=0, Total=272 [2019-12-18 15:42:41,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4415 states. [2019-12-18 15:42:41,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4415 to 3330. [2019-12-18 15:42:41,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3330 states. [2019-12-18 15:42:41,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3330 states to 3330 states and 12802 transitions. [2019-12-18 15:42:41,622 INFO L78 Accepts]: Start accepts. Automaton has 3330 states and 12802 transitions. Word has length 21 [2019-12-18 15:42:41,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:42:41,622 INFO L462 AbstractCegarLoop]: Abstraction has 3330 states and 12802 transitions. [2019-12-18 15:42:41,622 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-18 15:42:41,623 INFO L276 IsEmpty]: Start isEmpty. Operand 3330 states and 12802 transitions. [2019-12-18 15:42:41,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-18 15:42:41,625 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:42:41,625 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-18 15:42:41,625 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-18 15:42:41,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:42:41,625 INFO L82 PathProgramCache]: Analyzing trace with hash -430854838, now seen corresponding path program 1 times [2019-12-18 15:42:41,625 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:42:41,626 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2133488865] [2019-12-18 15:42:41,626 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:42:41,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:42:42,051 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-18 15:42:42,052 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2133488865] [2019-12-18 15:42:42,052 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:42:42,053 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-18 15:42:42,053 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [866840156] [2019-12-18 15:42:42,053 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-18 15:42:42,054 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:42:42,054 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-18 15:42:42,055 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2019-12-18 15:42:42,055 INFO L87 Difference]: Start difference. First operand 3330 states and 12802 transitions. Second operand 12 states. [2019-12-18 15:42:42,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:42:42,952 INFO L93 Difference]: Finished difference Result 3991 states and 15112 transitions. [2019-12-18 15:42:42,952 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-18 15:42:42,952 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 21 [2019-12-18 15:42:42,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:42:42,960 INFO L225 Difference]: With dead ends: 3991 [2019-12-18 15:42:42,961 INFO L226 Difference]: Without dead ends: 3835 [2019-12-18 15:42:42,961 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=99, Invalid=243, Unknown=0, NotChecked=0, Total=342 [2019-12-18 15:42:42,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3835 states. [2019-12-18 15:42:43,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3835 to 2831. [2019-12-18 15:42:43,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2831 states. [2019-12-18 15:42:43,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2831 states to 2831 states and 10625 transitions. [2019-12-18 15:42:43,042 INFO L78 Accepts]: Start accepts. Automaton has 2831 states and 10625 transitions. Word has length 21 [2019-12-18 15:42:43,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:42:43,043 INFO L462 AbstractCegarLoop]: Abstraction has 2831 states and 10625 transitions. [2019-12-18 15:42:43,043 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-18 15:42:43,043 INFO L276 IsEmpty]: Start isEmpty. Operand 2831 states and 10625 transitions. [2019-12-18 15:42:43,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-18 15:42:43,045 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:42:43,045 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-18 15:42:43,046 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-18 15:42:43,046 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:42:43,046 INFO L82 PathProgramCache]: Analyzing trace with hash 641940987, now seen corresponding path program 1 times [2019-12-18 15:42:43,046 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:42:43,047 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1285566519] [2019-12-18 15:42:43,047 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:42:43,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:42:43,150 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-18 15:42:43,150 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1285566519] [2019-12-18 15:42:43,150 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:42:43,151 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 15:42:43,152 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [103565830] [2019-12-18 15:42:43,152 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-18 15:42:43,152 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:42:43,153 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-18 15:42:43,153 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-12-18 15:42:43,153 INFO L87 Difference]: Start difference. First operand 2831 states and 10625 transitions. Second operand 8 states. [2019-12-18 15:42:43,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:42:43,581 INFO L93 Difference]: Finished difference Result 3550 states and 13085 transitions. [2019-12-18 15:42:43,581 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-18 15:42:43,581 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 22 [2019-12-18 15:42:43,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:42:43,589 INFO L225 Difference]: With dead ends: 3550 [2019-12-18 15:42:43,589 INFO L226 Difference]: Without dead ends: 3490 [2019-12-18 15:42:43,590 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=54, Invalid=128, Unknown=0, NotChecked=0, Total=182 [2019-12-18 15:42:43,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3490 states. [2019-12-18 15:42:43,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3490 to 2828. [2019-12-18 15:42:43,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2828 states. [2019-12-18 15:42:43,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2828 states to 2828 states and 10620 transitions. [2019-12-18 15:42:43,637 INFO L78 Accepts]: Start accepts. Automaton has 2828 states and 10620 transitions. Word has length 22 [2019-12-18 15:42:43,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:42:43,637 INFO L462 AbstractCegarLoop]: Abstraction has 2828 states and 10620 transitions. [2019-12-18 15:42:43,638 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-18 15:42:43,638 INFO L276 IsEmpty]: Start isEmpty. Operand 2828 states and 10620 transitions. [2019-12-18 15:42:43,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-18 15:42:43,639 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:42:43,640 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-18 15:42:43,640 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-18 15:42:43,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:42:43,640 INFO L82 PathProgramCache]: Analyzing trace with hash -109833189, now seen corresponding path program 2 times [2019-12-18 15:42:43,640 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:42:43,641 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [19460336] [2019-12-18 15:42:43,641 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:42:43,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:42:43,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-18 15:42:43,761 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [19460336] [2019-12-18 15:42:43,761 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:42:43,761 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 15:42:43,761 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1010243660] [2019-12-18 15:42:43,762 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 15:42:43,762 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:42:43,762 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 15:42:43,762 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-12-18 15:42:43,762 INFO L87 Difference]: Start difference. First operand 2828 states and 10620 transitions. Second operand 9 states. [2019-12-18 15:42:44,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:42:44,282 INFO L93 Difference]: Finished difference Result 3862 states and 14252 transitions. [2019-12-18 15:42:44,283 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-18 15:42:44,283 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2019-12-18 15:42:44,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:42:44,292 INFO L225 Difference]: With dead ends: 3862 [2019-12-18 15:42:44,292 INFO L226 Difference]: Without dead ends: 3802 [2019-12-18 15:42:44,292 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=70, Invalid=170, Unknown=0, NotChecked=0, Total=240 [2019-12-18 15:42:44,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3802 states. [2019-12-18 15:42:44,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3802 to 2822. [2019-12-18 15:42:44,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2822 states. [2019-12-18 15:42:44,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2822 states to 2822 states and 10606 transitions. [2019-12-18 15:42:44,341 INFO L78 Accepts]: Start accepts. Automaton has 2822 states and 10606 transitions. Word has length 22 [2019-12-18 15:42:44,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:42:44,342 INFO L462 AbstractCegarLoop]: Abstraction has 2822 states and 10606 transitions. [2019-12-18 15:42:44,342 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 15:42:44,342 INFO L276 IsEmpty]: Start isEmpty. Operand 2822 states and 10606 transitions. [2019-12-18 15:42:44,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-18 15:42:44,344 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:42:44,344 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-18 15:42:44,344 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-18 15:42:44,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:42:44,344 INFO L82 PathProgramCache]: Analyzing trace with hash -1541949331, now seen corresponding path program 3 times [2019-12-18 15:42:44,345 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:42:44,345 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [177058283] [2019-12-18 15:42:44,345 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:42:44,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:42:44,468 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-18 15:42:44,469 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [177058283] [2019-12-18 15:42:44,469 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:42:44,469 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-18 15:42:44,469 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [86059081] [2019-12-18 15:42:44,470 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-18 15:42:44,470 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:42:44,470 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-18 15:42:44,471 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2019-12-18 15:42:44,471 INFO L87 Difference]: Start difference. First operand 2822 states and 10606 transitions. Second operand 10 states. [2019-12-18 15:42:44,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:42:44,917 INFO L93 Difference]: Finished difference Result 3525 states and 13034 transitions. [2019-12-18 15:42:44,917 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 15:42:44,917 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 22 [2019-12-18 15:42:44,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:42:44,926 INFO L225 Difference]: With dead ends: 3525 [2019-12-18 15:42:44,926 INFO L226 Difference]: Without dead ends: 3465 [2019-12-18 15:42:44,926 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=58, Invalid=98, Unknown=0, NotChecked=0, Total=156 [2019-12-18 15:42:44,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3465 states. [2019-12-18 15:42:44,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3465 to 2822. [2019-12-18 15:42:44,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2822 states. [2019-12-18 15:42:44,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2822 states to 2822 states and 10606 transitions. [2019-12-18 15:42:44,987 INFO L78 Accepts]: Start accepts. Automaton has 2822 states and 10606 transitions. Word has length 22 [2019-12-18 15:42:44,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:42:44,988 INFO L462 AbstractCegarLoop]: Abstraction has 2822 states and 10606 transitions. [2019-12-18 15:42:44,988 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-18 15:42:44,988 INFO L276 IsEmpty]: Start isEmpty. Operand 2822 states and 10606 transitions. [2019-12-18 15:42:44,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-18 15:42:44,991 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:42:44,991 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-18 15:42:44,991 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-18 15:42:44,991 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:42:44,991 INFO L82 PathProgramCache]: Analyzing trace with hash -1025373391, now seen corresponding path program 4 times [2019-12-18 15:42:44,991 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:42:44,992 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [994989159] [2019-12-18 15:42:44,992 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:42:45,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:42:45,289 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-18 15:42:45,289 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [994989159] [2019-12-18 15:42:45,290 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:42:45,290 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-18 15:42:45,290 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1402091639] [2019-12-18 15:42:45,291 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-18 15:42:45,291 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:42:45,291 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-18 15:42:45,291 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2019-12-18 15:42:45,291 INFO L87 Difference]: Start difference. First operand 2822 states and 10606 transitions. Second operand 11 states. [2019-12-18 15:42:45,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:42:45,789 INFO L93 Difference]: Finished difference Result 3740 states and 13820 transitions. [2019-12-18 15:42:45,789 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 15:42:45,789 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 22 [2019-12-18 15:42:45,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:42:45,798 INFO L225 Difference]: With dead ends: 3740 [2019-12-18 15:42:45,799 INFO L226 Difference]: Without dead ends: 3680 [2019-12-18 15:42:45,799 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=66, Invalid=144, Unknown=0, NotChecked=0, Total=210 [2019-12-18 15:42:45,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3680 states. [2019-12-18 15:42:45,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3680 to 2822. [2019-12-18 15:42:45,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2822 states. [2019-12-18 15:42:45,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2822 states to 2822 states and 10603 transitions. [2019-12-18 15:42:45,872 INFO L78 Accepts]: Start accepts. Automaton has 2822 states and 10603 transitions. Word has length 22 [2019-12-18 15:42:45,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:42:45,872 INFO L462 AbstractCegarLoop]: Abstraction has 2822 states and 10603 transitions. [2019-12-18 15:42:45,872 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-18 15:42:45,873 INFO L276 IsEmpty]: Start isEmpty. Operand 2822 states and 10603 transitions. [2019-12-18 15:42:45,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-18 15:42:45,875 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:42:45,875 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-18 15:42:45,875 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-18 15:42:45,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:42:45,876 INFO L82 PathProgramCache]: Analyzing trace with hash -1258119955, now seen corresponding path program 5 times [2019-12-18 15:42:45,876 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:42:45,876 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1683712046] [2019-12-18 15:42:45,876 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:42:45,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:42:45,987 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-18 15:42:45,987 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1683712046] [2019-12-18 15:42:45,987 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:42:45,987 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-18 15:42:45,988 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [662038456] [2019-12-18 15:42:45,988 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-18 15:42:45,988 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:42:45,988 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-18 15:42:45,989 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2019-12-18 15:42:45,989 INFO L87 Difference]: Start difference. First operand 2822 states and 10603 transitions. Second operand 10 states. [2019-12-18 15:42:46,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:42:46,345 INFO L93 Difference]: Finished difference Result 4237 states and 15414 transitions. [2019-12-18 15:42:46,345 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-18 15:42:46,345 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 22 [2019-12-18 15:42:46,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:42:46,354 INFO L225 Difference]: With dead ends: 4237 [2019-12-18 15:42:46,354 INFO L226 Difference]: Without dead ends: 4177 [2019-12-18 15:42:46,354 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-18 15:42:46,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4177 states. [2019-12-18 15:42:46,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4177 to 2670. [2019-12-18 15:42:46,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2670 states. [2019-12-18 15:42:46,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2670 states to 2670 states and 9904 transitions. [2019-12-18 15:42:46,397 INFO L78 Accepts]: Start accepts. Automaton has 2670 states and 9904 transitions. Word has length 22 [2019-12-18 15:42:46,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:42:46,397 INFO L462 AbstractCegarLoop]: Abstraction has 2670 states and 9904 transitions. [2019-12-18 15:42:46,397 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-18 15:42:46,397 INFO L276 IsEmpty]: Start isEmpty. Operand 2670 states and 9904 transitions. [2019-12-18 15:42:46,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-12-18 15:42:46,399 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:42:46,400 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-18 15:42:46,400 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-18 15:42:46,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:42:46,400 INFO L82 PathProgramCache]: Analyzing trace with hash -230669277, now seen corresponding path program 1 times [2019-12-18 15:42:46,400 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:42:46,400 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [451701488] [2019-12-18 15:42:46,401 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:42:46,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:42:46,740 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-18 15:42:46,740 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [451701488] [2019-12-18 15:42:46,741 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:42:46,741 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-18 15:42:46,741 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [401324997] [2019-12-18 15:42:46,741 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-18 15:42:46,741 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:42:46,742 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-18 15:42:46,742 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2019-12-18 15:42:46,742 INFO L87 Difference]: Start difference. First operand 2670 states and 9904 transitions. Second operand 12 states. [2019-12-18 15:42:47,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:42:47,612 INFO L93 Difference]: Finished difference Result 3103 states and 11113 transitions. [2019-12-18 15:42:47,612 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-18 15:42:47,612 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 23 [2019-12-18 15:42:47,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:42:47,619 INFO L225 Difference]: With dead ends: 3103 [2019-12-18 15:42:47,619 INFO L226 Difference]: Without dead ends: 3007 [2019-12-18 15:42:47,620 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=98, Invalid=244, Unknown=0, NotChecked=0, Total=342 [2019-12-18 15:42:47,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3007 states. [2019-12-18 15:42:47,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3007 to 2170. [2019-12-18 15:42:47,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2170 states. [2019-12-18 15:42:47,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2170 states to 2170 states and 7789 transitions. [2019-12-18 15:42:47,671 INFO L78 Accepts]: Start accepts. Automaton has 2170 states and 7789 transitions. Word has length 23 [2019-12-18 15:42:47,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:42:47,671 INFO L462 AbstractCegarLoop]: Abstraction has 2170 states and 7789 transitions. [2019-12-18 15:42:47,672 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-18 15:42:47,672 INFO L276 IsEmpty]: Start isEmpty. Operand 2170 states and 7789 transitions. [2019-12-18 15:42:47,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-12-18 15:42:47,674 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:42:47,674 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-18 15:42:47,675 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-18 15:42:47,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:42:47,675 INFO L82 PathProgramCache]: Analyzing trace with hash 1022800040, now seen corresponding path program 1 times [2019-12-18 15:42:47,675 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:42:47,675 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [629392889] [2019-12-18 15:42:47,676 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:42:47,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:42:47,995 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-18 15:42:47,995 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [629392889] [2019-12-18 15:42:47,995 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:42:47,995 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-18 15:42:47,996 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1120645029] [2019-12-18 15:42:47,996 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-18 15:42:47,996 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:42:47,996 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-18 15:42:47,996 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2019-12-18 15:42:47,997 INFO L87 Difference]: Start difference. First operand 2170 states and 7789 transitions. Second operand 11 states. [2019-12-18 15:42:48,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:42:48,550 INFO L93 Difference]: Finished difference Result 2812 states and 10003 transitions. [2019-12-18 15:42:48,550 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-18 15:42:48,550 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 23 [2019-12-18 15:42:48,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:42:48,557 INFO L225 Difference]: With dead ends: 2812 [2019-12-18 15:42:48,557 INFO L226 Difference]: Without dead ends: 2755 [2019-12-18 15:42:48,557 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=67, Invalid=143, Unknown=0, NotChecked=0, Total=210 [2019-12-18 15:42:48,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2755 states. [2019-12-18 15:42:48,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2755 to 2130. [2019-12-18 15:42:48,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2130 states. [2019-12-18 15:42:48,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2130 states to 2130 states and 7633 transitions. [2019-12-18 15:42:48,592 INFO L78 Accepts]: Start accepts. Automaton has 2130 states and 7633 transitions. Word has length 23 [2019-12-18 15:42:48,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:42:48,592 INFO L462 AbstractCegarLoop]: Abstraction has 2130 states and 7633 transitions. [2019-12-18 15:42:48,592 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-18 15:42:48,592 INFO L276 IsEmpty]: Start isEmpty. Operand 2130 states and 7633 transitions. [2019-12-18 15:42:48,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-12-18 15:42:48,594 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:42:48,595 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-18 15:42:48,595 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-18 15:42:48,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:42:48,595 INFO L82 PathProgramCache]: Analyzing trace with hash 1539375980, now seen corresponding path program 2 times [2019-12-18 15:42:48,595 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:42:48,595 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1600098396] [2019-12-18 15:42:48,596 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:42:48,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:42:48,952 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-18 15:42:48,952 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1600098396] [2019-12-18 15:42:48,953 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:42:48,953 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-12-18 15:42:48,953 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [262866995] [2019-12-18 15:42:48,953 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-18 15:42:48,954 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:42:48,954 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-18 15:42:48,954 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2019-12-18 15:42:48,954 INFO L87 Difference]: Start difference. First operand 2130 states and 7633 transitions. Second operand 13 states. [2019-12-18 15:42:49,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:42:49,893 INFO L93 Difference]: Finished difference Result 2895 states and 10221 transitions. [2019-12-18 15:42:49,894 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 15:42:49,894 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 23 [2019-12-18 15:42:49,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:42:49,900 INFO L225 Difference]: With dead ends: 2895 [2019-12-18 15:42:49,900 INFO L226 Difference]: Without dead ends: 2778 [2019-12-18 15:42:49,901 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=127, Invalid=335, Unknown=0, NotChecked=0, Total=462 [2019-12-18 15:42:49,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2778 states. [2019-12-18 15:42:49,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2778 to 1842. [2019-12-18 15:42:49,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1842 states. [2019-12-18 15:42:49,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1842 states to 1842 states and 6495 transitions. [2019-12-18 15:42:49,935 INFO L78 Accepts]: Start accepts. Automaton has 1842 states and 6495 transitions. Word has length 23 [2019-12-18 15:42:49,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:42:49,935 INFO L462 AbstractCegarLoop]: Abstraction has 1842 states and 6495 transitions. [2019-12-18 15:42:49,935 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-18 15:42:49,935 INFO L276 IsEmpty]: Start isEmpty. Operand 1842 states and 6495 transitions. [2019-12-18 15:42:49,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-12-18 15:42:49,937 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:42:49,938 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-18 15:42:49,938 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-18 15:42:49,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:42:49,938 INFO L82 PathProgramCache]: Analyzing trace with hash -396779108, now seen corresponding path program 1 times [2019-12-18 15:42:49,938 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:42:49,939 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [716461105] [2019-12-18 15:42:49,939 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:42:49,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:42:49,999 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-18 15:42:49,999 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [716461105] [2019-12-18 15:42:49,999 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:42:49,999 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 15:42:49,999 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2006353109] [2019-12-18 15:42:50,000 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 15:42:50,000 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:42:50,000 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 15:42:50,000 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-12-18 15:42:50,000 INFO L87 Difference]: Start difference. First operand 1842 states and 6495 transitions. Second operand 7 states. [2019-12-18 15:42:50,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:42:50,198 INFO L93 Difference]: Finished difference Result 2339 states and 7931 transitions. [2019-12-18 15:42:50,199 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-18 15:42:50,199 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 24 [2019-12-18 15:42:50,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:42:50,203 INFO L225 Difference]: With dead ends: 2339 [2019-12-18 15:42:50,204 INFO L226 Difference]: Without dead ends: 2275 [2019-12-18 15:42:50,204 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-18 15:42:50,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2275 states. [2019-12-18 15:42:50,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2275 to 2154. [2019-12-18 15:42:50,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2154 states. [2019-12-18 15:42:50,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2154 states to 2154 states and 7487 transitions. [2019-12-18 15:42:50,233 INFO L78 Accepts]: Start accepts. Automaton has 2154 states and 7487 transitions. Word has length 24 [2019-12-18 15:42:50,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:42:50,233 INFO L462 AbstractCegarLoop]: Abstraction has 2154 states and 7487 transitions. [2019-12-18 15:42:50,233 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 15:42:50,233 INFO L276 IsEmpty]: Start isEmpty. Operand 2154 states and 7487 transitions. [2019-12-18 15:42:50,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-12-18 15:42:50,235 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:42:50,235 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-18 15:42:50,235 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-18 15:42:50,235 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:42:50,235 INFO L82 PathProgramCache]: Analyzing trace with hash -1742211423, now seen corresponding path program 1 times [2019-12-18 15:42:50,236 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:42:50,236 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [245110487] [2019-12-18 15:42:50,236 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:42:50,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:42:50,357 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-18 15:42:50,357 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [245110487] [2019-12-18 15:42:50,357 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:42:50,357 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 15:42:50,357 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [850224088] [2019-12-18 15:42:50,358 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 15:42:50,358 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:42:50,358 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 15:42:50,358 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-18 15:42:50,358 INFO L87 Difference]: Start difference. First operand 2154 states and 7487 transitions. Second operand 9 states. [2019-12-18 15:42:50,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:42:50,869 INFO L93 Difference]: Finished difference Result 3002 states and 10436 transitions. [2019-12-18 15:42:50,870 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-18 15:42:50,870 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 24 [2019-12-18 15:42:50,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:42:50,880 INFO L225 Difference]: With dead ends: 3002 [2019-12-18 15:42:50,880 INFO L226 Difference]: Without dead ends: 2978 [2019-12-18 15:42:50,881 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-18 15:42:50,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2978 states. [2019-12-18 15:42:50,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2978 to 2153. [2019-12-18 15:42:50,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2153 states. [2019-12-18 15:42:50,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2153 states to 2153 states and 7486 transitions. [2019-12-18 15:42:50,953 INFO L78 Accepts]: Start accepts. Automaton has 2153 states and 7486 transitions. Word has length 24 [2019-12-18 15:42:50,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:42:50,954 INFO L462 AbstractCegarLoop]: Abstraction has 2153 states and 7486 transitions. [2019-12-18 15:42:50,954 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 15:42:50,954 INFO L276 IsEmpty]: Start isEmpty. Operand 2153 states and 7486 transitions. [2019-12-18 15:42:50,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-12-18 15:42:50,957 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:42:50,957 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-18 15:42:50,957 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-18 15:42:50,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:42:50,957 INFO L82 PathProgramCache]: Analyzing trace with hash 1800981697, now seen corresponding path program 2 times [2019-12-18 15:42:50,958 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:42:50,958 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [330317941] [2019-12-18 15:42:50,958 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:42:50,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:42:51,264 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-18 15:42:51,264 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [330317941] [2019-12-18 15:42:51,265 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:42:51,265 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-18 15:42:51,265 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1600738024] [2019-12-18 15:42:51,265 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-18 15:42:51,266 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:42:51,266 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-18 15:42:51,266 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2019-12-18 15:42:51,267 INFO L87 Difference]: Start difference. First operand 2153 states and 7486 transitions. Second operand 10 states. [2019-12-18 15:42:52,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:42:52,233 INFO L93 Difference]: Finished difference Result 3010 states and 10450 transitions. [2019-12-18 15:42:52,233 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-18 15:42:52,233 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 24 [2019-12-18 15:42:52,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:42:52,240 INFO L225 Difference]: With dead ends: 3010 [2019-12-18 15:42:52,240 INFO L226 Difference]: Without dead ends: 2986 [2019-12-18 15:42:52,241 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=105, Invalid=275, Unknown=0, NotChecked=0, Total=380 [2019-12-18 15:42:52,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2986 states. [2019-12-18 15:42:52,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2986 to 2156. [2019-12-18 15:42:52,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2156 states. [2019-12-18 15:42:52,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2156 states to 2156 states and 7493 transitions. [2019-12-18 15:42:52,282 INFO L78 Accepts]: Start accepts. Automaton has 2156 states and 7493 transitions. Word has length 24 [2019-12-18 15:42:52,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:42:52,282 INFO L462 AbstractCegarLoop]: Abstraction has 2156 states and 7493 transitions. [2019-12-18 15:42:52,282 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-18 15:42:52,283 INFO L276 IsEmpty]: Start isEmpty. Operand 2156 states and 7493 transitions. [2019-12-18 15:42:52,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-12-18 15:42:52,285 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:42:52,285 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-18 15:42:52,285 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-18 15:42:52,286 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:42:52,286 INFO L82 PathProgramCache]: Analyzing trace with hash 652694931, now seen corresponding path program 3 times [2019-12-18 15:42:52,286 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:42:52,286 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [358388826] [2019-12-18 15:42:52,286 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:42:52,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:42:52,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-18 15:42:52,467 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [358388826] [2019-12-18 15:42:52,467 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:42:52,467 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-18 15:42:52,467 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [313960022] [2019-12-18 15:42:52,467 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-18 15:42:52,468 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:42:52,489 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-18 15:42:52,489 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2019-12-18 15:42:52,489 INFO L87 Difference]: Start difference. First operand 2156 states and 7493 transitions. Second operand 11 states. [2019-12-18 15:42:52,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:42:52,966 INFO L93 Difference]: Finished difference Result 3595 states and 12600 transitions. [2019-12-18 15:42:52,966 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-18 15:42:52,966 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 24 [2019-12-18 15:42:52,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:42:52,973 INFO L225 Difference]: With dead ends: 3595 [2019-12-18 15:42:52,973 INFO L226 Difference]: Without dead ends: 3571 [2019-12-18 15:42:52,973 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-18 15:42:52,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3571 states. [2019-12-18 15:42:53,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3571 to 2134. [2019-12-18 15:42:53,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2134 states. [2019-12-18 15:42:53,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2134 states to 2134 states and 7443 transitions. [2019-12-18 15:42:53,015 INFO L78 Accepts]: Start accepts. Automaton has 2134 states and 7443 transitions. Word has length 24 [2019-12-18 15:42:53,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:42:53,015 INFO L462 AbstractCegarLoop]: Abstraction has 2134 states and 7443 transitions. [2019-12-18 15:42:53,015 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-18 15:42:53,016 INFO L276 IsEmpty]: Start isEmpty. Operand 2134 states and 7443 transitions. [2019-12-18 15:42:53,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-12-18 15:42:53,018 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:42:53,018 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-18 15:42:53,019 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-18 15:42:53,019 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:42:53,019 INFO L82 PathProgramCache]: Analyzing trace with hash 351528874, now seen corresponding path program 2 times [2019-12-18 15:42:53,019 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:42:53,019 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1028567071] [2019-12-18 15:42:53,019 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:42:53,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:42:53,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-18 15:42:53,118 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1028567071] [2019-12-18 15:42:53,118 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:42:53,118 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 15:42:53,118 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1938916383] [2019-12-18 15:42:53,118 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-18 15:42:53,118 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:42:53,119 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-18 15:42:53,119 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-12-18 15:42:53,119 INFO L87 Difference]: Start difference. First operand 2134 states and 7443 transitions. Second operand 8 states. [2019-12-18 15:42:53,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:42:53,484 INFO L93 Difference]: Finished difference Result 2628 states and 8874 transitions. [2019-12-18 15:42:53,485 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-18 15:42:53,485 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 24 [2019-12-18 15:42:53,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:42:53,491 INFO L225 Difference]: With dead ends: 2628 [2019-12-18 15:42:53,491 INFO L226 Difference]: Without dead ends: 2564 [2019-12-18 15:42:53,491 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=54, Invalid=128, Unknown=0, NotChecked=0, Total=182 [2019-12-18 15:42:53,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2564 states. [2019-12-18 15:42:53,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2564 to 2131. [2019-12-18 15:42:53,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2131 states. [2019-12-18 15:42:53,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2131 states to 2131 states and 7438 transitions. [2019-12-18 15:42:53,520 INFO L78 Accepts]: Start accepts. Automaton has 2131 states and 7438 transitions. Word has length 24 [2019-12-18 15:42:53,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:42:53,521 INFO L462 AbstractCegarLoop]: Abstraction has 2131 states and 7438 transitions. [2019-12-18 15:42:53,521 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-18 15:42:53,521 INFO L276 IsEmpty]: Start isEmpty. Operand 2131 states and 7438 transitions. [2019-12-18 15:42:53,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-12-18 15:42:53,523 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:42:53,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, 1, 1, 1, 1, 1] [2019-12-18 15:42:53,523 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-18 15:42:53,523 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:42:53,523 INFO L82 PathProgramCache]: Analyzing trace with hash -548948534, now seen corresponding path program 3 times [2019-12-18 15:42:53,523 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:42:53,523 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [343477538] [2019-12-18 15:42:53,524 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:42:53,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:42:53,649 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-18 15:42:53,649 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [343477538] [2019-12-18 15:42:53,649 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:42:53,649 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 15:42:53,649 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1736355356] [2019-12-18 15:42:53,650 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 15:42:53,650 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:42:53,650 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 15:42:53,650 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-12-18 15:42:53,650 INFO L87 Difference]: Start difference. First operand 2131 states and 7438 transitions. Second operand 9 states. [2019-12-18 15:42:54,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:42:54,073 INFO L93 Difference]: Finished difference Result 2930 states and 9846 transitions. [2019-12-18 15:42:54,073 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-18 15:42:54,073 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 24 [2019-12-18 15:42:54,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:42:54,080 INFO L225 Difference]: With dead ends: 2930 [2019-12-18 15:42:54,080 INFO L226 Difference]: Without dead ends: 2866 [2019-12-18 15:42:54,080 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=70, Invalid=170, Unknown=0, NotChecked=0, Total=240 [2019-12-18 15:42:54,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2866 states. [2019-12-18 15:42:54,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2866 to 2125. [2019-12-18 15:42:54,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2125 states. [2019-12-18 15:42:54,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2125 states to 2125 states and 7424 transitions. [2019-12-18 15:42:54,110 INFO L78 Accepts]: Start accepts. Automaton has 2125 states and 7424 transitions. Word has length 24 [2019-12-18 15:42:54,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:42:54,110 INFO L462 AbstractCegarLoop]: Abstraction has 2125 states and 7424 transitions. [2019-12-18 15:42:54,110 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 15:42:54,110 INFO L276 IsEmpty]: Start isEmpty. Operand 2125 states and 7424 transitions. [2019-12-18 15:42:54,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-12-18 15:42:54,113 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:42:54,113 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-18 15:42:54,113 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-18 15:42:54,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:42:54,114 INFO L82 PathProgramCache]: Analyzing trace with hash -610918652, now seen corresponding path program 4 times [2019-12-18 15:42:54,114 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:42:54,114 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1856019594] [2019-12-18 15:42:54,114 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:42:54,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:42:54,360 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-18 15:42:54,360 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1856019594] [2019-12-18 15:42:54,361 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:42:54,361 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-18 15:42:54,361 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [318680352] [2019-12-18 15:42:54,361 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-18 15:42:54,361 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:42:54,362 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-18 15:42:54,362 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2019-12-18 15:42:54,362 INFO L87 Difference]: Start difference. First operand 2125 states and 7424 transitions. Second operand 11 states. [2019-12-18 15:42:54,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:42:54,640 INFO L93 Difference]: Finished difference Result 2567 states and 8721 transitions. [2019-12-18 15:42:54,641 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 15:42:54,641 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 24 [2019-12-18 15:42:54,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:42:54,646 INFO L225 Difference]: With dead ends: 2567 [2019-12-18 15:42:54,646 INFO L226 Difference]: Without dead ends: 2503 [2019-12-18 15:42:54,647 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=68, Invalid=114, Unknown=0, NotChecked=0, Total=182 [2019-12-18 15:42:54,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2503 states. [2019-12-18 15:42:54,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2503 to 2125. [2019-12-18 15:42:54,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2125 states. [2019-12-18 15:42:54,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2125 states to 2125 states and 7424 transitions. [2019-12-18 15:42:54,675 INFO L78 Accepts]: Start accepts. Automaton has 2125 states and 7424 transitions. Word has length 24 [2019-12-18 15:42:54,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:42:54,675 INFO L462 AbstractCegarLoop]: Abstraction has 2125 states and 7424 transitions. [2019-12-18 15:42:54,676 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-18 15:42:54,676 INFO L276 IsEmpty]: Start isEmpty. Operand 2125 states and 7424 transitions. [2019-12-18 15:42:54,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-12-18 15:42:54,678 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:42:54,678 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-18 15:42:54,678 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-18 15:42:54,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:42:54,678 INFO L82 PathProgramCache]: Analyzing trace with hash -847503804, now seen corresponding path program 5 times [2019-12-18 15:42:54,678 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:42:54,678 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1337891428] [2019-12-18 15:42:54,678 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:42:54,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:42:54,971 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-18 15:42:54,971 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1337891428] [2019-12-18 15:42:54,971 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:42:54,971 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-12-18 15:42:54,972 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1747161800] [2019-12-18 15:42:54,972 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-18 15:42:54,972 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:42:54,972 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-18 15:42:54,972 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2019-12-18 15:42:54,973 INFO L87 Difference]: Start difference. First operand 2125 states and 7424 transitions. Second operand 13 states. [2019-12-18 15:42:55,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:42:55,904 INFO L93 Difference]: Finished difference Result 3312 states and 11307 transitions. [2019-12-18 15:42:55,904 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-18 15:42:55,904 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 24 [2019-12-18 15:42:55,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:42:55,911 INFO L225 Difference]: With dead ends: 3312 [2019-12-18 15:42:55,912 INFO L226 Difference]: Without dead ends: 3184 [2019-12-18 15:42:55,912 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=132, Invalid=330, Unknown=0, NotChecked=0, Total=462 [2019-12-18 15:42:55,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3184 states. [2019-12-18 15:42:55,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3184 to 2185. [2019-12-18 15:42:55,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2185 states. [2019-12-18 15:42:55,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2185 states to 2185 states and 7740 transitions. [2019-12-18 15:42:55,944 INFO L78 Accepts]: Start accepts. Automaton has 2185 states and 7740 transitions. Word has length 24 [2019-12-18 15:42:55,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:42:55,944 INFO L462 AbstractCegarLoop]: Abstraction has 2185 states and 7740 transitions. [2019-12-18 15:42:55,944 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-18 15:42:55,944 INFO L276 IsEmpty]: Start isEmpty. Operand 2185 states and 7740 transitions. [2019-12-18 15:42:55,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-12-18 15:42:55,946 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:42:55,946 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-18 15:42:55,947 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-18 15:42:55,947 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:42:55,947 INFO L82 PathProgramCache]: Analyzing trace with hash -2037680112, now seen corresponding path program 6 times [2019-12-18 15:42:55,947 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:42:55,947 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1689355860] [2019-12-18 15:42:55,947 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:42:55,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:42:56,180 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-18 15:42:56,181 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1689355860] [2019-12-18 15:42:56,181 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:42:56,181 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-18 15:42:56,181 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [735241849] [2019-12-18 15:42:56,182 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-18 15:42:56,182 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:42:56,182 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-18 15:42:56,182 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2019-12-18 15:42:56,183 INFO L87 Difference]: Start difference. First operand 2185 states and 7740 transitions. Second operand 11 states. [2019-12-18 15:42:56,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:42:56,559 INFO L93 Difference]: Finished difference Result 3092 states and 10338 transitions. [2019-12-18 15:42:56,559 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-18 15:42:56,560 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 24 [2019-12-18 15:42:56,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:42:56,566 INFO L225 Difference]: With dead ends: 3092 [2019-12-18 15:42:56,566 INFO L226 Difference]: Without dead ends: 3028 [2019-12-18 15:42:56,567 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-18 15:42:56,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3028 states. [2019-12-18 15:42:56,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3028 to 2005. [2019-12-18 15:42:56,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2005 states. [2019-12-18 15:42:56,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2005 states to 2005 states and 7054 transitions. [2019-12-18 15:42:56,596 INFO L78 Accepts]: Start accepts. Automaton has 2005 states and 7054 transitions. Word has length 24 [2019-12-18 15:42:56,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:42:56,596 INFO L462 AbstractCegarLoop]: Abstraction has 2005 states and 7054 transitions. [2019-12-18 15:42:56,596 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-18 15:42:56,596 INFO L276 IsEmpty]: Start isEmpty. Operand 2005 states and 7054 transitions. [2019-12-18 15:42:56,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 15:42:56,599 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:42:56,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, 1, 1, 1, 1, 1] [2019-12-18 15:42:56,599 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-18 15:42:56,599 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:42:56,599 INFO L82 PathProgramCache]: Analyzing trace with hash 128519362, now seen corresponding path program 1 times [2019-12-18 15:42:56,600 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:42:56,600 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1578218421] [2019-12-18 15:42:56,600 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:42:56,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:42:56,885 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-18 15:42:56,886 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1578218421] [2019-12-18 15:42:56,886 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:42:56,886 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-18 15:42:56,886 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1185418062] [2019-12-18 15:42:56,886 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-18 15:42:56,886 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:42:56,887 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-18 15:42:56,887 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2019-12-18 15:42:56,887 INFO L87 Difference]: Start difference. First operand 2005 states and 7054 transitions. Second operand 12 states. [2019-12-18 15:42:57,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:42:57,654 INFO L93 Difference]: Finished difference Result 2627 states and 9048 transitions. [2019-12-18 15:42:57,654 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-18 15:42:57,654 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 25 [2019-12-18 15:42:57,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:42:57,660 INFO L225 Difference]: With dead ends: 2627 [2019-12-18 15:42:57,660 INFO L226 Difference]: Without dead ends: 2604 [2019-12-18 15:42:57,660 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=93, Invalid=249, Unknown=0, NotChecked=0, Total=342 [2019-12-18 15:42:57,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2604 states. [2019-12-18 15:42:57,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2604 to 1613. [2019-12-18 15:42:57,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1613 states. [2019-12-18 15:42:57,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1613 states to 1613 states and 5563 transitions. [2019-12-18 15:42:57,695 INFO L78 Accepts]: Start accepts. Automaton has 1613 states and 5563 transitions. Word has length 25 [2019-12-18 15:42:57,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:42:57,695 INFO L462 AbstractCegarLoop]: Abstraction has 1613 states and 5563 transitions. [2019-12-18 15:42:57,695 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-18 15:42:57,696 INFO L276 IsEmpty]: Start isEmpty. Operand 1613 states and 5563 transitions. [2019-12-18 15:42:57,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-18 15:42:57,698 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:42:57,698 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-18 15:42:57,698 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-18 15:42:57,699 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:42:57,699 INFO L82 PathProgramCache]: Analyzing trace with hash -1601368368, now seen corresponding path program 1 times [2019-12-18 15:42:57,699 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:42:57,699 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2055783528] [2019-12-18 15:42:57,699 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:42:57,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:42:57,849 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-18 15:42:57,849 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2055783528] [2019-12-18 15:42:57,849 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:42:57,849 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-18 15:42:57,850 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2022020281] [2019-12-18 15:42:57,850 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-18 15:42:57,850 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:42:57,850 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-18 15:42:57,850 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2019-12-18 15:42:57,850 INFO L87 Difference]: Start difference. First operand 1613 states and 5563 transitions. Second operand 10 states. [2019-12-18 15:42:58,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:42:58,116 INFO L93 Difference]: Finished difference Result 2230 states and 7382 transitions. [2019-12-18 15:42:58,116 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-18 15:42:58,117 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 26 [2019-12-18 15:42:58,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:42:58,122 INFO L225 Difference]: With dead ends: 2230 [2019-12-18 15:42:58,122 INFO L226 Difference]: Without dead ends: 2208 [2019-12-18 15:42:58,122 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-18 15:42:58,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2208 states. [2019-12-18 15:42:58,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2208 to 1612. [2019-12-18 15:42:58,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1612 states. [2019-12-18 15:42:58,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1612 states to 1612 states and 5562 transitions. [2019-12-18 15:42:58,144 INFO L78 Accepts]: Start accepts. Automaton has 1612 states and 5562 transitions. Word has length 26 [2019-12-18 15:42:58,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:42:58,144 INFO L462 AbstractCegarLoop]: Abstraction has 1612 states and 5562 transitions. [2019-12-18 15:42:58,144 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-18 15:42:58,144 INFO L276 IsEmpty]: Start isEmpty. Operand 1612 states and 5562 transitions. [2019-12-18 15:42:58,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-18 15:42:58,146 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:42:58,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, 1, 1, 1, 1, 1] [2019-12-18 15:42:58,146 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-18 15:42:58,146 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:42:58,146 INFO L82 PathProgramCache]: Analyzing trace with hash 1793121520, now seen corresponding path program 2 times [2019-12-18 15:42:58,146 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:42:58,146 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2069572708] [2019-12-18 15:42:58,146 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:42:58,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:42:58,329 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-18 15:42:58,329 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2069572708] [2019-12-18 15:42:58,329 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:42:58,329 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-18 15:42:58,329 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1967486579] [2019-12-18 15:42:58,330 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-18 15:42:58,330 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:42:58,330 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-18 15:42:58,330 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2019-12-18 15:42:58,330 INFO L87 Difference]: Start difference. First operand 1612 states and 5562 transitions. Second operand 10 states. [2019-12-18 15:42:59,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:42:59,257 INFO L93 Difference]: Finished difference Result 2230 states and 7379 transitions. [2019-12-18 15:42:59,257 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-18 15:42:59,257 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 26 [2019-12-18 15:42:59,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:42:59,262 INFO L225 Difference]: With dead ends: 2230 [2019-12-18 15:42:59,262 INFO L226 Difference]: Without dead ends: 2208 [2019-12-18 15:42:59,263 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=105, Invalid=275, Unknown=0, NotChecked=0, Total=380 [2019-12-18 15:42:59,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2208 states. [2019-12-18 15:42:59,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2208 to 1615. [2019-12-18 15:42:59,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1615 states. [2019-12-18 15:42:59,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1615 states to 1615 states and 5569 transitions. [2019-12-18 15:42:59,298 INFO L78 Accepts]: Start accepts. Automaton has 1615 states and 5569 transitions. Word has length 26 [2019-12-18 15:42:59,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:42:59,298 INFO L462 AbstractCegarLoop]: Abstraction has 1615 states and 5569 transitions. [2019-12-18 15:42:59,298 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-18 15:42:59,299 INFO L276 IsEmpty]: Start isEmpty. Operand 1615 states and 5569 transitions. [2019-12-18 15:42:59,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-18 15:42:59,303 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:42:59,303 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-18 15:42:59,303 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-18 15:42:59,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:42:59,304 INFO L82 PathProgramCache]: Analyzing trace with hash 1731151402, now seen corresponding path program 3 times [2019-12-18 15:42:59,304 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:42:59,305 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1990529697] [2019-12-18 15:42:59,305 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:42:59,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:42:59,600 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:42:59,601 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1990529697] [2019-12-18 15:42:59,601 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:42:59,601 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-18 15:42:59,601 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1705484505] [2019-12-18 15:42:59,602 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-18 15:42:59,602 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:42:59,602 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-18 15:42:59,602 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2019-12-18 15:42:59,603 INFO L87 Difference]: Start difference. First operand 1615 states and 5569 transitions. Second operand 12 states. [2019-12-18 15:42:59,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:42:59,985 INFO L93 Difference]: Finished difference Result 2246 states and 7479 transitions. [2019-12-18 15:42:59,986 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-18 15:42:59,986 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 26 [2019-12-18 15:42:59,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:42:59,991 INFO L225 Difference]: With dead ends: 2246 [2019-12-18 15:42:59,991 INFO L226 Difference]: Without dead ends: 2202 [2019-12-18 15:42:59,991 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=92, Invalid=214, Unknown=0, NotChecked=0, Total=306 [2019-12-18 15:42:59,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2202 states. [2019-12-18 15:43:00,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2202 to 1491. [2019-12-18 15:43:00,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1491 states. [2019-12-18 15:43:00,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1491 states to 1491 states and 5039 transitions. [2019-12-18 15:43:00,012 INFO L78 Accepts]: Start accepts. Automaton has 1491 states and 5039 transitions. Word has length 26 [2019-12-18 15:43:00,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:43:00,012 INFO L462 AbstractCegarLoop]: Abstraction has 1491 states and 5039 transitions. [2019-12-18 15:43:00,012 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-18 15:43:00,012 INFO L276 IsEmpty]: Start isEmpty. Operand 1491 states and 5039 transitions. [2019-12-18 15:43:00,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-18 15:43:00,014 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:43:00,014 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-18 15:43:00,015 INFO L410 AbstractCegarLoop]: === Iteration 44 === [thread0Err1INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Err4INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5INUSE_VIOLATION, thread0Thread1of1ForFork3Err8INUSE_VIOLATION, thread0Thread1of1ForFork3Err9INUSE_VIOLATION, thread0Thread1of1ForFork3Err7INUSE_VIOLATION, thread0Thread1of1ForFork3Err6INUSE_VIOLATION, thread0Thread1of1ForFork3Err10INUSE_VIOLATION]=== [2019-12-18 15:43:00,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:43:00,015 INFO L82 PathProgramCache]: Analyzing trace with hash 304389942, now seen corresponding path program 4 times [2019-12-18 15:43:00,015 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:43:00,015 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [212670312] [2019-12-18 15:43:00,015 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:43:00,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:43:00,205 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-18 15:43:00,205 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [212670312] [2019-12-18 15:43:00,205 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:43:00,206 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-18 15:43:00,206 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1333348536] [2019-12-18 15:43:00,206 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-18 15:43:00,206 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:43:00,206 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-18 15:43:00,206 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2019-12-18 15:43:00,207 INFO L87 Difference]: Start difference. First operand 1491 states and 5039 transitions. Second operand 12 states. [2019-12-18 15:43:00,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:43:00,656 INFO L93 Difference]: Finished difference Result 1544 states and 5003 transitions. [2019-12-18 15:43:00,656 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-18 15:43:00,657 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 26 [2019-12-18 15:43:00,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:43:00,660 INFO L225 Difference]: With dead ends: 1544 [2019-12-18 15:43:00,660 INFO L226 Difference]: Without dead ends: 1500 [2019-12-18 15:43:00,660 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-18 15:43:00,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1500 states. [2019-12-18 15:43:00,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1500 to 885. [2019-12-18 15:43:00,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 885 states. [2019-12-18 15:43:00,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 885 states to 885 states and 3033 transitions. [2019-12-18 15:43:00,673 INFO L78 Accepts]: Start accepts. Automaton has 885 states and 3033 transitions. Word has length 26 [2019-12-18 15:43:00,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:43:00,674 INFO L462 AbstractCegarLoop]: Abstraction has 885 states and 3033 transitions. [2019-12-18 15:43:00,674 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-18 15:43:00,674 INFO L276 IsEmpty]: Start isEmpty. Operand 885 states and 3033 transitions. [2019-12-18 15:43:00,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-12-18 15:43:00,675 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:43:00,675 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-18 15:43:00,675 INFO L410 AbstractCegarLoop]: === Iteration 45 === [thread0Err1INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Err4INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5INUSE_VIOLATION, thread0Thread1of1ForFork3Err8INUSE_VIOLATION, thread0Thread1of1ForFork3Err9INUSE_VIOLATION, thread0Thread1of1ForFork3Err7INUSE_VIOLATION, thread0Thread1of1ForFork3Err6INUSE_VIOLATION, thread0Thread1of1ForFork3Err10INUSE_VIOLATION]=== [2019-12-18 15:43:00,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:43:00,676 INFO L82 PathProgramCache]: Analyzing trace with hash -720297978, now seen corresponding path program 1 times [2019-12-18 15:43:00,676 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:43:00,676 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1733260184] [2019-12-18 15:43:00,676 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:43:00,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:43:00,758 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-18 15:43:00,758 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1733260184] [2019-12-18 15:43:00,759 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:43:00,759 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 15:43:00,759 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1676354477] [2019-12-18 15:43:00,760 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-18 15:43:00,760 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:43:00,760 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-18 15:43:00,760 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-12-18 15:43:00,760 INFO L87 Difference]: Start difference. First operand 885 states and 3033 transitions. Second operand 8 states. [2019-12-18 15:43:00,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:43:00,917 INFO L93 Difference]: Finished difference Result 885 states and 3029 transitions. [2019-12-18 15:43:00,917 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 15:43:00,917 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 41 [2019-12-18 15:43:00,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:43:00,920 INFO L225 Difference]: With dead ends: 885 [2019-12-18 15:43:00,920 INFO L226 Difference]: Without dead ends: 879 [2019-12-18 15:43:00,920 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-18 15:43:00,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 879 states. [2019-12-18 15:43:00,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 879 to 879. [2019-12-18 15:43:00,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 879 states. [2019-12-18 15:43:00,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 879 states to 879 states and 3010 transitions. [2019-12-18 15:43:00,934 INFO L78 Accepts]: Start accepts. Automaton has 879 states and 3010 transitions. Word has length 41 [2019-12-18 15:43:00,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:43:00,935 INFO L462 AbstractCegarLoop]: Abstraction has 879 states and 3010 transitions. [2019-12-18 15:43:00,935 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-18 15:43:00,935 INFO L276 IsEmpty]: Start isEmpty. Operand 879 states and 3010 transitions. [2019-12-18 15:43:00,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-12-18 15:43:00,937 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:43:00,937 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-18 15:43:00,937 INFO L410 AbstractCegarLoop]: === Iteration 46 === [thread0Err1INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Err4INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5INUSE_VIOLATION, thread0Thread1of1ForFork3Err8INUSE_VIOLATION, thread0Thread1of1ForFork3Err9INUSE_VIOLATION, thread0Thread1of1ForFork3Err7INUSE_VIOLATION, thread0Thread1of1ForFork3Err6INUSE_VIOLATION, thread0Thread1of1ForFork3Err10INUSE_VIOLATION]=== [2019-12-18 15:43:00,937 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:43:00,937 INFO L82 PathProgramCache]: Analyzing trace with hash 525302158, now seen corresponding path program 1 times [2019-12-18 15:43:00,937 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:43:00,937 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1226919418] [2019-12-18 15:43:00,938 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:43:00,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:43:01,006 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-18 15:43:01,007 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1226919418] [2019-12-18 15:43:01,007 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:43:01,007 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 15:43:01,007 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [124492607] [2019-12-18 15:43:01,007 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-18 15:43:01,007 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:43:01,008 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-18 15:43:01,008 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-12-18 15:43:01,008 INFO L87 Difference]: Start difference. First operand 879 states and 3010 transitions. Second operand 8 states. [2019-12-18 15:43:01,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:43:01,139 INFO L93 Difference]: Finished difference Result 879 states and 3006 transitions. [2019-12-18 15:43:01,139 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 15:43:01,139 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 41 [2019-12-18 15:43:01,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:43:01,142 INFO L225 Difference]: With dead ends: 879 [2019-12-18 15:43:01,142 INFO L226 Difference]: Without dead ends: 819 [2019-12-18 15:43:01,142 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-18 15:43:01,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 819 states. [2019-12-18 15:43:01,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 819 to 819. [2019-12-18 15:43:01,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 819 states. [2019-12-18 15:43:01,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 819 states to 819 states and 2784 transitions. [2019-12-18 15:43:01,153 INFO L78 Accepts]: Start accepts. Automaton has 819 states and 2784 transitions. Word has length 41 [2019-12-18 15:43:01,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:43:01,153 INFO L462 AbstractCegarLoop]: Abstraction has 819 states and 2784 transitions. [2019-12-18 15:43:01,153 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-18 15:43:01,153 INFO L276 IsEmpty]: Start isEmpty. Operand 819 states and 2784 transitions. [2019-12-18 15:43:01,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-12-18 15:43:01,156 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:43:01,156 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-18 15:43:01,156 INFO L410 AbstractCegarLoop]: === Iteration 47 === [thread0Err1INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Err4INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5INUSE_VIOLATION, thread0Thread1of1ForFork3Err8INUSE_VIOLATION, thread0Thread1of1ForFork3Err9INUSE_VIOLATION, thread0Thread1of1ForFork3Err7INUSE_VIOLATION, thread0Thread1of1ForFork3Err6INUSE_VIOLATION, thread0Thread1of1ForFork3Err10INUSE_VIOLATION]=== [2019-12-18 15:43:01,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:43:01,157 INFO L82 PathProgramCache]: Analyzing trace with hash 1075124498, now seen corresponding path program 1 times [2019-12-18 15:43:01,157 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:43:01,157 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1009669011] [2019-12-18 15:43:01,157 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:43:01,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 15:43:01,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 15:43:01,241 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-18 15:43:01,241 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-18 15:43:01,245 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [467] [467] ULTIMATE.startENTRY-->L1123: Formula: (let ((.cse0 (store |v_#valid_113| 0 0))) (and (= |v_#NULL.offset_4| 0) (= |v_#valid_111| (store .cse0 |v_ULTIMATE.start_main_~#t~0.base_24| 1)) (= |v_ULTIMATE.start_main_~#t~0.offset_20| 0) (= 0 |v_#NULL.base_4|) (= v_~v~0.offset_45 0) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t~0.base_24|)) (= (store |v_#memory_int_120| |v_ULTIMATE.start_main_~#t~0.base_24| (store (select |v_#memory_int_120| |v_ULTIMATE.start_main_~#t~0.base_24|) |v_ULTIMATE.start_main_~#t~0.offset_20| 5)) |v_#memory_int_119|) (< 0 |v_#StackHeapBarrier_22|) (= v_~v~0.base_45 0) (= (store |v_#length_40| |v_ULTIMATE.start_main_~#t~0.base_24| 4) |v_#length_39|) (< |v_#StackHeapBarrier_22| |v_ULTIMATE.start_main_~#t~0.base_24|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_22|, #valid=|v_#valid_113|, #memory_int=|v_#memory_int_120|, #length=|v_#length_40|} OutVars{ULTIMATE.start_main_#t~nondet13=|v_ULTIMATE.start_main_#t~nondet13_9|, #NULL.offset=|v_#NULL.offset_4|, ULTIMATE.start_main_~#t~0.offset=|v_ULTIMATE.start_main_~#t~0.offset_20|, ~v~0.base=v_~v~0.base_45, #NULL.base=|v_#NULL.base_4|, #StackHeapBarrier=|v_#StackHeapBarrier_22|, ~v~0.offset=v_~v~0.offset_45, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_13|, #valid=|v_#valid_111|, #memory_int=|v_#memory_int_119|, ULTIMATE.start_main_~#t~0.base=|v_ULTIMATE.start_main_~#t~0.base_24|, #length=|v_#length_39|, ULTIMATE.start_main_#t~mem15=|v_ULTIMATE.start_main_#t~mem15_25|, ULTIMATE.start_main_#t~mem14=|v_ULTIMATE.start_main_#t~mem14_36|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet13, #NULL.offset, ULTIMATE.start_main_~#t~0.offset, ~v~0.base, #NULL.base, ~v~0.offset, ULTIMATE.start_main_#res, #valid, #memory_int, ULTIMATE.start_main_~#t~0.base, #length, ULTIMATE.start_main_#t~mem15, ULTIMATE.start_main_#t~mem14] because there is no mapped edge [2019-12-18 15:43:01,245 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 ((.cse0 (store .cse3 |v_thread0Thread1of1ForFork3_~#t2~0.base_17| 1))) (let ((.cse2 (store .cse0 |v_thread0Thread1of1ForFork3_~#t3~0.base_18| 1))) (let ((.cse1 (store .cse2 |v_thread0Thread1of1ForFork3_~#t4~0.base_17| 1))) (and (not (= 0 |v_thread0Thread1of1ForFork3_~#t4~0.base_17|)) (= 0 |v_thread0Thread1of1ForFork3_~#t3~0.offset_15|) (= v_thread0Thread1of1ForFork3_~arg.offset_6 |v_thread0Thread1of1ForFork3_#in~arg.offset_6|) (= 0 |v_thread0Thread1of1ForFork3_~#t2~0.offset_13|) (= 0 |v_thread0Thread1of1ForFork3_~#t4~0.offset_14|) (not (= 0 |v_thread0Thread1of1ForFork3_~#t5~0.base_21|)) (= 0 (select .cse0 |v_thread0Thread1of1ForFork3_~#t3~0.base_18|)) (= 0 (select .cse1 |v_thread0Thread1of1ForFork3_~#t5~0.base_21|)) (< |v_#StackHeapBarrier_21| |v_thread0Thread1of1ForFork3_~#t5~0.base_21|) (= (select .cse2 |v_thread0Thread1of1ForFork3_~#t4~0.base_17|) 0) (not (= |v_thread0Thread1of1ForFork3_~#t1~0.base_18| 0)) (< |v_#StackHeapBarrier_21| |v_thread0Thread1of1ForFork3_~#t2~0.base_17|) (= (store .cse1 |v_thread0Thread1of1ForFork3_~#t5~0.base_21| 1) |v_#valid_102|) (= v_thread0Thread1of1ForFork3_~arg.base_6 |v_thread0Thread1of1ForFork3_#in~arg.base_6|) (not (= 0 |v_thread0Thread1of1ForFork3_~#t2~0.base_17|)) (< |v_#StackHeapBarrier_21| |v_thread0Thread1of1ForFork3_~#t3~0.base_18|) (< |v_#StackHeapBarrier_21| |v_thread0Thread1of1ForFork3_~#t1~0.base_18|) (= (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_18| 4) |v_thread0Thread1of1ForFork3_~#t4~0.base_17| 4) |v_thread0Thread1of1ForFork3_~#t5~0.base_21| 4) |v_#length_36|) (= 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 (= |v_thread0Thread1of1ForFork3_~#t3~0.base_18| 0)) (= |v_#memory_int_117| (store |v_#memory_int_118| |v_thread0Thread1of1ForFork3_~#t1~0.base_18| (store (select |v_#memory_int_118| |v_thread0Thread1of1ForFork3_~#t1~0.base_18|) |v_thread0Thread1of1ForFork3_~#t1~0.offset_14| 0))) (= |v_thread0Thread1of1ForFork3_~#t5~0.offset_17| 0) (< |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_118|, #length=|v_#length_38|, thread0Thread1of1ForFork3_#in~arg.base=|v_thread0Thread1of1ForFork3_#in~arg.base_6|} OutVars{thread0Thread1of1ForFork3_~#t3~0.base=|v_thread0Thread1of1ForFork3_~#t3~0.base_18|, 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_15|, thread0Thread1of1ForFork3_~#t1~0.base=|v_thread0Thread1of1ForFork3_~#t1~0.base_18|, #valid=|v_#valid_102|, #memory_int=|v_#memory_int_117|, 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_21|, thread0Thread1of1ForFork3_~#t5~0.offset=|v_thread0Thread1of1ForFork3_~#t5~0.offset_17|} AuxVars[] AssignedVars[thread0Thread1of1ForFork3_~#t3~0.base, thread0Thread1of1ForFork3_~#t4~0.offset, thread0Thread1of1ForFork3_~#t2~0.offset, thread0Thread1of1ForFork3_~#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-18 15:43:01,246 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [424] [424] L1108-1-->L1109-1: Formula: (= (select (select |v_#memory_int_48| |v_thread0Thread1of1ForFork3_~#t1~0.base_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_48|, 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_48|, 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-18 15:43:01,246 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [428] [428] L1123-1-->L1124-1: Formula: (= |v_ULTIMATE.start_main_#t~mem14_31| (select (select |v_#memory_int_51| |v_ULTIMATE.start_main_~#t~0.base_14|) |v_ULTIMATE.start_main_~#t~0.offset_14|)) InVars {#memory_int=|v_#memory_int_51|, ULTIMATE.start_main_~#t~0.base=|v_ULTIMATE.start_main_~#t~0.base_14|, ULTIMATE.start_main_~#t~0.offset=|v_ULTIMATE.start_main_~#t~0.offset_14|} OutVars{ULTIMATE.start_main_#t~nondet13=|v_ULTIMATE.start_main_#t~nondet13_4|, #memory_int=|v_#memory_int_51|, ULTIMATE.start_main_~#t~0.base=|v_ULTIMATE.start_main_~#t~0.base_14|, ULTIMATE.start_main_~#t~0.offset=|v_ULTIMATE.start_main_~#t~0.offset_14|, ULTIMATE.start_main_#t~mem14=|v_ULTIMATE.start_main_#t~mem14_31|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet13, ULTIMATE.start_main_#t~mem14] because there is no mapped edge [2019-12-18 15:43:01,246 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [462] [462] thread1ENTRY-->thread1EXIT: Formula: (and (= 0 |v_thread1Thread1of1ForFork4_#res.base_7|) (= |v_thread1Thread1of1ForFork4_#t~malloc2.base_9| v_~v~0.base_44) (= v_~v~0.offset_44 |v_thread1Thread1of1ForFork4_#t~malloc2.offset_9|) (= 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_#StackHeapBarrier_20|) (= |v_#valid_98| (store |v_#valid_99| |v_thread1Thread1of1ForFork4_#t~malloc2.base_9| 1)) (= 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_44, #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_44, #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-18 15:43:01,249 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [443] [443] L1097-->thread2EXIT: Formula: (and (= (store |v_#memory_int_81| v_~v~0.base_25 (store (select |v_#memory_int_81| v_~v~0.base_25) v_~v~0.offset_25 88)) |v_#memory_int_80|) (= |v_thread2Thread1of1ForFork5_#res.offset_7| 0) (= 0 |v_thread2Thread1of1ForFork5_#res.base_7|)) InVars {~v~0.offset=v_~v~0.offset_25, #memory_int=|v_#memory_int_81|, ~v~0.base=v_~v~0.base_25} OutVars{~v~0.offset=v_~v~0.offset_25, #memory_int=|v_#memory_int_80|, thread2Thread1of1ForFork5_#res.base=|v_thread2Thread1of1ForFork5_#res.base_7|, thread2Thread1of1ForFork5_#res.offset=|v_thread2Thread1of1ForFork5_#res.offset_7|, ~v~0.base=v_~v~0.base_25} AuxVars[] AssignedVars[#memory_int, thread2Thread1of1ForFork5_#res.base, thread2Thread1of1ForFork5_#res.offset] because there is no mapped edge [2019-12-18 15:43:01,250 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [412] [412] L1110-2-->L1111-1: Formula: (= (store |v_#memory_int_37| |v_thread0Thread1of1ForFork3_~#t3~0.base_11| (store (select |v_#memory_int_37| |v_thread0Thread1of1ForFork3_~#t3~0.base_11|) |v_thread0Thread1of1ForFork3_~#t3~0.offset_9| 2)) |v_#memory_int_36|) 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_37|} 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_36|, thread0Thread1of1ForFork3_#t~nondet5=|v_thread0Thread1of1ForFork3_#t~nondet5_4|} AuxVars[] AssignedVars[#memory_int, thread0Thread1of1ForFork3_#t~nondet5] because there is no mapped edge [2019-12-18 15:43:01,250 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [417] [417] L1111-2-->L1112-1: Formula: (= (store |v_#memory_int_41| |v_thread0Thread1of1ForFork3_~#t4~0.base_10| (store (select |v_#memory_int_41| |v_thread0Thread1of1ForFork3_~#t4~0.base_10|) |v_thread0Thread1of1ForFork3_~#t4~0.offset_9| 3)) |v_#memory_int_40|) InVars {thread0Thread1of1ForFork3_~#t4~0.offset=|v_thread0Thread1of1ForFork3_~#t4~0.offset_9|, #memory_int=|v_#memory_int_41|, 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_40|, 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-18 15:43:01,252 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [411] [411] L1112-2-->L1113-1: Formula: (= (store |v_#memory_int_35| |v_thread0Thread1of1ForFork3_~#t5~0.base_10| (store (select |v_#memory_int_35| |v_thread0Thread1of1ForFork3_~#t5~0.base_10|) |v_thread0Thread1of1ForFork3_~#t5~0.offset_8| 4)) |v_#memory_int_34|) InVars {#memory_int=|v_#memory_int_35|, 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_34|, 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-18 15:43:01,252 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [435] [435] L1113-2-->L1114-1: Formula: (= (select (select |v_#memory_int_62| |v_thread0Thread1of1ForFork3_~#t2~0.base_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_62|, 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_62|, 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-18 15:43:01,254 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [449] [449] L1097-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork2_#res.base_11| 0) (= 0 |v_thread2Thread1of1ForFork2_#res.offset_11|) (= (store |v_#memory_int_109| v_~v~0.base_37 (store (select |v_#memory_int_109| v_~v~0.base_37) v_~v~0.offset_37 88)) |v_#memory_int_108|)) InVars {~v~0.offset=v_~v~0.offset_37, #memory_int=|v_#memory_int_109|, ~v~0.base=v_~v~0.base_37} OutVars{thread2Thread1of1ForFork2_#res.base=|v_thread2Thread1of1ForFork2_#res.base_11|, ~v~0.offset=v_~v~0.offset_37, #memory_int=|v_#memory_int_108|, ~v~0.base=v_~v~0.base_37, thread2Thread1of1ForFork2_#res.offset=|v_thread2Thread1of1ForFork2_#res.offset_11|} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#res.base, #memory_int, thread2Thread1of1ForFork2_#res.offset] because there is no mapped edge [2019-12-18 15:43:01,255 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [446] [446] L1097-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork1_#res.offset_13| 0) (= |v_thread2Thread1of1ForFork1_#res.base_13| 0) (= (store |v_#memory_int_89| v_~v~0.base_28 (store (select |v_#memory_int_89| v_~v~0.base_28) v_~v~0.offset_28 88)) |v_#memory_int_88|)) InVars {~v~0.offset=v_~v~0.offset_28, #memory_int=|v_#memory_int_89|, ~v~0.base=v_~v~0.base_28} OutVars{thread2Thread1of1ForFork1_#res.offset=|v_thread2Thread1of1ForFork1_#res.offset_13|, ~v~0.offset=v_~v~0.offset_28, thread2Thread1of1ForFork1_#res.base=|v_thread2Thread1of1ForFork1_#res.base_13|, #memory_int=|v_#memory_int_88|, ~v~0.base=v_~v~0.base_28} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res.offset, thread2Thread1of1ForFork1_#res.base, #memory_int] because there is no mapped edge [2019-12-18 15:43:01,255 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [448] [448] L1102-->thread3EXIT: Formula: (and (= |v_thread3Thread1of1ForFork0_#res.offset_7| 0) (= |v_#memory_int_96| (store |v_#memory_int_97| v_~v~0.base_32 (store (select |v_#memory_int_97| v_~v~0.base_32) v_~v~0.offset_32 89))) (= |v_thread3Thread1of1ForFork0_#res.base_7| 0)) InVars {~v~0.offset=v_~v~0.offset_32, #memory_int=|v_#memory_int_97|, ~v~0.base=v_~v~0.base_32} OutVars{~v~0.offset=v_~v~0.offset_32, thread3Thread1of1ForFork0_#res.offset=|v_thread3Thread1of1ForFork0_#res.offset_7|, #memory_int=|v_#memory_int_96|, thread3Thread1of1ForFork0_#res.base=|v_thread3Thread1of1ForFork0_#res.base_7|, ~v~0.base=v_~v~0.base_32} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#res.offset, #memory_int, thread3Thread1of1ForFork0_#res.base] because there is no mapped edge [2019-12-18 15:43:01,258 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [470] [470] L1118-->thread0EXIT: Formula: (and (= (store (store (store (store (store |v_#valid_121| |v_thread0Thread1of1ForFork3_~#t1~0.base_22| 0) |v_thread0Thread1of1ForFork3_~#t2~0.base_21| 0) |v_thread0Thread1of1ForFork3_~#t3~0.base_22| 0) |v_thread0Thread1of1ForFork3_~#t4~0.base_21| 0) |v_thread0Thread1of1ForFork3_~#t5~0.base_25| 0) |v_#valid_120|) (= 0 |v_thread0Thread1of1ForFork3_#res.offset_4|) (= 0 |v_thread0Thread1of1ForFork3_#res.base_4|)) InVars {thread0Thread1of1ForFork3_~#t3~0.base=|v_thread0Thread1of1ForFork3_~#t3~0.base_22|, thread0Thread1of1ForFork3_~#t1~0.base=|v_thread0Thread1of1ForFork3_~#t1~0.base_22|, #valid=|v_#valid_121|, thread0Thread1of1ForFork3_~#t2~0.base=|v_thread0Thread1of1ForFork3_~#t2~0.base_21|, thread0Thread1of1ForFork3_~#t5~0.base=|v_thread0Thread1of1ForFork3_~#t5~0.base_25|, thread0Thread1of1ForFork3_~#t4~0.base=|v_thread0Thread1of1ForFork3_~#t4~0.base_21|} OutVars{thread0Thread1of1ForFork3_~#t3~0.base=|v_thread0Thread1of1ForFork3_~#t3~0.base_21|, 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_17|, thread0Thread1of1ForFork3_~#t1~0.base=|v_thread0Thread1of1ForFork3_~#t1~0.base_21|, thread0Thread1of1ForFork3_#res.offset=|v_thread0Thread1of1ForFork3_#res.offset_4|, #valid=|v_#valid_120|, 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_24|, thread0Thread1of1ForFork3_~#t5~0.offset=|v_thread0Thread1of1ForFork3_~#t5~0.offset_19|} 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-18 15:43:01,260 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [457] [457] L1125-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= |v_ULTIMATE.start_main_#t~mem15_21| (select (select |v_#memory_int_115| v_~v~0.base_42) v_~v~0.offset_42)) (= v_ULTIMATE.start___VERIFIER_assert_~expression_15 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_11|) (not (= |v_ULTIMATE.start_main_#t~mem15_21| 88)) (= v_ULTIMATE.start___VERIFIER_assert_~expression_15 0)) InVars {~v~0.offset=v_~v~0.offset_42, #memory_int=|v_#memory_int_115|, ~v~0.base=v_~v~0.base_42} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_15, ~v~0.offset=v_~v~0.offset_42, #memory_int=|v_#memory_int_115|, ULTIMATE.start_main_#t~mem15=|v_ULTIMATE.start_main_#t~mem15_21|, ~v~0.base=v_~v~0.base_42, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_11|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ULTIMATE.start_main_#t~mem15, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-18 15:43:01,337 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.12 03:43:01 BasicIcfg [2019-12-18 15:43:01,337 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-18 15:43:01,339 INFO L168 Benchmark]: Toolchain (without parser) took 42536.95 ms. Allocated memory was 144.2 MB in the beginning and 910.7 MB in the end (delta: 766.5 MB). Free memory was 99.9 MB in the beginning and 495.5 MB in the end (delta: -395.5 MB). Peak memory consumption was 371.0 MB. Max. memory is 7.1 GB. [2019-12-18 15:43:01,339 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 144.2 MB. Free memory was 120.5 MB in the beginning and 120.3 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. [2019-12-18 15:43:01,339 INFO L168 Benchmark]: CACSL2BoogieTranslator took 982.90 ms. Allocated memory was 144.2 MB in the beginning and 203.9 MB in the end (delta: 59.8 MB). Free memory was 99.5 MB in the beginning and 123.2 MB in the end (delta: -23.7 MB). Peak memory consumption was 44.1 MB. Max. memory is 7.1 GB. [2019-12-18 15:43:01,340 INFO L168 Benchmark]: Boogie Procedure Inliner took 65.55 ms. Allocated memory is still 203.9 MB. Free memory was 123.2 MB in the beginning and 120.5 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. [2019-12-18 15:43:01,340 INFO L168 Benchmark]: Boogie Preprocessor took 44.46 ms. Allocated memory is still 203.9 MB. Free memory was 120.5 MB in the beginning and 119.1 MB in the end (delta: 1.4 MB). Peak memory consumption was 1.4 MB. Max. memory is 7.1 GB. [2019-12-18 15:43:01,340 INFO L168 Benchmark]: RCFGBuilder took 563.75 ms. Allocated memory is still 203.9 MB. Free memory was 119.1 MB in the beginning and 92.8 MB in the end (delta: 26.3 MB). Peak memory consumption was 26.3 MB. Max. memory is 7.1 GB. [2019-12-18 15:43:01,341 INFO L168 Benchmark]: TraceAbstraction took 40869.38 ms. Allocated memory was 203.9 MB in the beginning and 910.7 MB in the end (delta: 706.7 MB). Free memory was 92.1 MB in the beginning and 495.5 MB in the end (delta: -403.4 MB). Peak memory consumption was 303.4 MB. Max. memory is 7.1 GB. [2019-12-18 15:43:01,343 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.23 ms. Allocated memory is still 144.2 MB. Free memory was 120.5 MB in the beginning and 120.3 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 982.90 ms. Allocated memory was 144.2 MB in the beginning and 203.9 MB in the end (delta: 59.8 MB). Free memory was 99.5 MB in the beginning and 123.2 MB in the end (delta: -23.7 MB). Peak memory consumption was 44.1 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 65.55 ms. Allocated memory is still 203.9 MB. Free memory was 123.2 MB in the beginning and 120.5 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 44.46 ms. Allocated memory is still 203.9 MB. Free memory was 120.5 MB in the beginning and 119.1 MB in the end (delta: 1.4 MB). Peak memory consumption was 1.4 MB. Max. memory is 7.1 GB. * RCFGBuilder took 563.75 ms. Allocated memory is still 203.9 MB. Free memory was 119.1 MB in the beginning and 92.8 MB in the end (delta: 26.3 MB). Peak memory consumption was 26.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 40869.38 ms. Allocated memory was 203.9 MB in the beginning and 910.7 MB in the end (delta: 706.7 MB). Free memory was 92.1 MB in the beginning and 495.5 MB in the end (delta: -403.4 MB). Peak memory consumption was 303.4 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, 1461 VarBasedMoverChecksPositive, 12 VarBasedMoverChecksNegative, 2 SemBasedMoverChecksPositive, 10 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 2242 CheckedPairsTotal, 74 TotalNumberOfCompositions - CounterExampleResult [Line: 1088]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L1123] FCALL, FORK 0 pthread_create(&t, 0, thread0, 0) VAL [arg={0:0}, v={0:0}] [L1108] FCALL, FORK 1 pthread_create(&t1, 0, thread1, 0) VAL [arg={0:0}, arg={0:0}, arg={0:0}, t1={9:0}, t2={11:0}, t3={10:0}, t4={8:0}, t5={6: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={9:0}, t2={11:0}, t3={10:0}, t4={8:0}, t5={6: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={9:0}, t2={11:0}, t3={10:0}, t4={8:0}, t5={6: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={9:0}, t2={11:0}, t3={10:0}, t4={8:0}, t5={6: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={9:0}, t2={11:0}, t3={10:0}, t4={8:0}, t5={6: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={9:0}, t2={11:0}, t3={10:0}, t4={8:0}, t5={6: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={9:0}, t2={11:0}, t3={10:0}, t4={8:0}, t5={6: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={9:0}, t2={11:0}, t3={10:0}, t4={8:0}, t5={6: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={9:0}, t2={11:0}, t3={10:0}, t4={8:0}, t5={6: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={9:0}, t2={11:0}, t3={10:0}, t4={8:0}, t5={6: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={9:0}, t2={11:0}, t3={10:0}, t4={8:0}, t5={6: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={9:0}, t2={11:0}, t3={10:0}, t4={8:0}, t5={6: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={9:0}, t2={11:0}, t3={10:0}, t4={8:0}, t5={6:0}, v={1:0}] [L1124] FCALL, JOIN 1 pthread_join(t, 0) VAL [\result={0:0}, \result={0:0}, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={1:0}, v={1:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 92 locations, 1 error locations. Result: UNSAFE, OverallTime: 40.4s, OverallIterations: 47, TraceHistogramMax: 1, AutomataDifference: 24.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 4903 SDtfs, 9208 SDslu, 16145 SDs, 0 SdLazy, 9833 SolverSat, 1377 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 9.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 654 GetRequests, 50 SyntacticMatches, 21 SemanticMatches, 583 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 820 ImplicationChecksByTransitivity, 16.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=4305occurred in iteration=18, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 4.2s AutomataMinimizationTime, 46 MinimizatonAttempts, 44427 StatesRemovedByMinimization, 44 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 7.6s InterpolantComputationTime, 1050 NumberOfCodeBlocks, 1050 NumberOfCodeBlocksAsserted, 47 NumberOfCheckSat, 963 ConstructedInterpolants, 0 QuantifiedInterpolants, 368805 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 46 InterpolantComputations, 46 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...