/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/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/pthread/singleton.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-c7e336b [2020-10-05 22:21:14,529 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-05 22:21:14,532 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-05 22:21:14,572 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-05 22:21:14,572 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-05 22:21:14,581 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-05 22:21:14,584 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-05 22:21:14,589 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-05 22:21:14,592 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-05 22:21:14,595 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-05 22:21:14,596 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-05 22:21:14,597 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-05 22:21:14,598 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-05 22:21:14,601 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-05 22:21:14,604 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-05 22:21:14,606 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-05 22:21:14,608 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-05 22:21:14,609 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-05 22:21:14,611 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-05 22:21:14,621 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-05 22:21:14,624 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-05 22:21:14,625 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-05 22:21:14,626 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-05 22:21:14,627 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-05 22:21:14,640 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-05 22:21:14,641 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-05 22:21:14,641 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-05 22:21:14,645 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-05 22:21:14,645 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-05 22:21:14,649 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-05 22:21:14,650 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-05 22:21:14,650 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-05 22:21:14,651 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-05 22:21:14,652 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-05 22:21:14,656 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-05 22:21:14,656 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-05 22:21:14,659 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-05 22:21:14,659 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-05 22:21:14,659 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-05 22:21:14,660 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-05 22:21:14,661 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-05 22:21:14,662 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2020-10-05 22:21:14,700 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-05 22:21:14,700 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-05 22:21:14,701 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-05 22:21:14,702 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-05 22:21:14,702 INFO L138 SettingsManager]: * Use SBE=true [2020-10-05 22:21:14,702 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-05 22:21:14,702 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-05 22:21:14,703 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-05 22:21:14,703 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-05 22:21:14,703 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-05 22:21:14,703 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-05 22:21:14,703 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-05 22:21:14,704 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-05 22:21:14,704 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-05 22:21:14,704 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-05 22:21:14,704 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-05 22:21:14,704 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-05 22:21:14,705 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-05 22:21:14,705 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-05 22:21:14,705 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-05 22:21:14,705 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-05 22:21:14,706 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-05 22:21:14,706 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-05 22:21:14,706 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-10-05 22:21:14,706 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-05 22:21:14,706 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-05 22:21:14,707 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-05 22:21:14,707 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-10-05 22:21:14,707 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-10-05 22:21:14,707 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-10-05 22:21:15,040 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-05 22:21:15,052 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-05 22:21:15,055 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-05 22:21:15,057 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-05 22:21:15,057 INFO L275 PluginConnector]: CDTParser initialized [2020-10-05 22:21:15,058 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread/singleton.i [2020-10-05 22:21:15,119 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/68278c409/aa16ec787cba4e2b97a789c77e355e96/FLAGe4105d1b6 [2020-10-05 22:21:15,686 INFO L306 CDTParser]: Found 1 translation units. [2020-10-05 22:21:15,686 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread/singleton.i [2020-10-05 22:21:15,708 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/68278c409/aa16ec787cba4e2b97a789c77e355e96/FLAGe4105d1b6 [2020-10-05 22:21:16,004 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/68278c409/aa16ec787cba4e2b97a789c77e355e96 [2020-10-05 22:21:16,015 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-05 22:21:16,017 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-10-05 22:21:16,021 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-05 22:21:16,021 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-05 22:21:16,025 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-05 22:21:16,026 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.10 10:21:16" (1/1) ... [2020-10-05 22:21:16,029 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7ad9dbd9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 10:21:16, skipping insertion in model container [2020-10-05 22:21:16,030 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.10 10:21:16" (1/1) ... [2020-10-05 22:21:16,039 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-05 22:21:16,089 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-05 22:21:16,683 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-05 22:21:16,695 INFO L203 MainTranslator]: Completed pre-run [2020-10-05 22:21:16,746 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-05 22:21:16,937 INFO L208 MainTranslator]: Completed translation [2020-10-05 22:21:16,938 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 10:21:16 WrapperNode [2020-10-05 22:21:16,938 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-05 22:21:16,939 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-05 22:21:16,939 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-05 22:21:16,940 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-05 22:21:16,950 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 10:21:16" (1/1) ... [2020-10-05 22:21:16,974 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 10:21:16" (1/1) ... [2020-10-05 22:21:16,999 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-05 22:21:17,000 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-05 22:21:17,000 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-05 22:21:17,000 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-05 22:21:17,007 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 10:21:16" (1/1) ... [2020-10-05 22:21:17,008 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 10:21:16" (1/1) ... [2020-10-05 22:21:17,011 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 10:21:16" (1/1) ... [2020-10-05 22:21:17,012 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 10:21:16" (1/1) ... [2020-10-05 22:21:17,021 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 10:21:16" (1/1) ... [2020-10-05 22:21:17,023 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 10:21:16" (1/1) ... [2020-10-05 22:21:17,025 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 10:21:16" (1/1) ... [2020-10-05 22:21:17,030 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-05 22:21:17,030 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-05 22:21:17,030 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-05 22:21:17,031 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-05 22:21:17,031 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 10:21:16" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-05 22:21:17,110 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-05 22:21:17,110 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-05 22:21:17,110 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-10-05 22:21:17,111 INFO L130 BoogieDeclarations]: Found specification of procedure thread0 [2020-10-05 22:21:17,111 INFO L138 BoogieDeclarations]: Found implementation of procedure thread0 [2020-10-05 22:21:17,111 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2020-10-05 22:21:17,111 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2020-10-05 22:21:17,111 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2020-10-05 22:21:17,112 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2020-10-05 22:21:17,112 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2020-10-05 22:21:17,112 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2020-10-05 22:21:17,112 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-05 22:21:17,112 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2020-10-05 22:21:17,113 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-05 22:21:17,113 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-05 22:21:17,115 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2020-10-05 22:21:17,545 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-05 22:21:17,545 INFO L298 CfgBuilder]: Removed 6 assume(true) statements. [2020-10-05 22:21:17,547 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.10 10:21:17 BoogieIcfgContainer [2020-10-05 22:21:17,548 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-05 22:21:17,549 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-05 22:21:17,549 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-05 22:21:17,553 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-05 22:21:17,553 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.10 10:21:16" (1/3) ... [2020-10-05 22:21:17,554 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@64a83409 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.10 10:21:17, skipping insertion in model container [2020-10-05 22:21:17,554 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 10:21:16" (2/3) ... [2020-10-05 22:21:17,554 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@64a83409 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.10 10:21:17, skipping insertion in model container [2020-10-05 22:21:17,554 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.10 10:21:17" (3/3) ... [2020-10-05 22:21:17,556 INFO L109 eAbstractionObserver]: Analyzing ICFG singleton.i [2020-10-05 22:21:17,564 WARN L146 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2020-10-05 22:21:17,565 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-10-05 22:21:17,571 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-10-05 22:21:17,572 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-10-05 22:21:17,628 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:21:17,628 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:21:17,628 WARN L313 ript$VariableManager]: TermVariabe thread0Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:21:17,628 WARN L313 ript$VariableManager]: TermVariabe thread0Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:21:17,629 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:21:17,629 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t1~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:21:17,630 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t2~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:21:17,630 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:21:17,630 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:21:17,630 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t3~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:21:17,631 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t4~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:21:17,631 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t4~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:21:17,631 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t5~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:21:17,631 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t5~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:21:17,632 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:21:17,632 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t1~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:21:17,632 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:21:17,633 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:21:17,633 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t1~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:21:17,633 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#t~mem4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:21:17,634 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#t~mem4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:21:17,634 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t2~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:21:17,635 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:21:17,635 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:21:17,635 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:21:17,635 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t3~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:21:17,636 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:21:17,636 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t4~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:21:17,636 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t4~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:21:17,636 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#t~nondet7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:21:17,637 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t5~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:21:17,637 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t5~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:21:17,637 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#t~nondet8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:21:17,637 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t2~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:21:17,638 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:21:17,638 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:21:17,639 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:21:17,639 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:21:17,639 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t3~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:21:17,640 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#t~mem10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:21:17,640 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#t~mem10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:21:17,640 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t4~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:21:17,640 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t4~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:21:17,641 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#t~mem11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:21:17,641 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#t~mem11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:21:17,641 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t5~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:21:17,641 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t5~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:21:17,642 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#t~mem12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:21:17,642 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#t~mem12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:21:17,642 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:21:17,642 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:21:17,643 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:21:17,643 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:21:17,643 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t1~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:21:17,643 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:21:17,644 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:21:17,644 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t2~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:21:17,644 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:21:17,644 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t3~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:21:17,645 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:21:17,645 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t4~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:21:17,645 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t4~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:21:17,645 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t4~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:21:17,645 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t5~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:21:17,646 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t5~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:21:17,646 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t5~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:21:17,646 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork4_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:21:17,647 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork4_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:21:17,647 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork4_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:21:17,647 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork4_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:21:17,647 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork4_#t~malloc2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:21:17,647 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork4_#t~malloc2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:21:17,648 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork4_#t~malloc2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:21:17,648 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork4_#t~malloc2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:21:17,648 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork4_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:21:17,648 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork4_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:21:17,649 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:21:17,649 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:21:17,649 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:21:17,649 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:21:17,650 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:21:17,650 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:21:17,650 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:21:17,650 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:21:17,651 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:21:17,651 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:21:17,651 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:21:17,651 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:21:17,652 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork5_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:21:17,652 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork5_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:21:17,652 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork5_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:21:17,652 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork5_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:21:17,653 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork5_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:21:17,653 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork5_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:21:17,653 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:21:17,654 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:21:17,654 WARN L313 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:21:17,654 WARN L313 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:21:17,654 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:21:17,654 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:21:17,659 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:21:17,659 WARN L313 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:21:17,659 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:21:17,659 WARN L313 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:21:17,671 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:21:17,671 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:21:17,671 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:21:17,672 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:21:17,682 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:21:17,683 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:21:17,683 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:21:17,683 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:21:17,686 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#t~nondet8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:21:17,686 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#t~mem4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:21:17,686 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:21:17,686 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t4~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:21:17,687 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t2~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:21:17,687 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:21:17,687 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:21:17,687 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#t~mem10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:21:17,687 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#t~mem11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:21:17,688 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t4~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:21:17,688 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#t~mem12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:21:17,688 WARN L313 ript$VariableManager]: TermVariabe thread0Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:21:17,688 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t3~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:21:17,688 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:21:17,689 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:21:17,689 WARN L313 ript$VariableManager]: TermVariabe thread0Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:21:17,689 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:21:17,689 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t1~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:21:17,689 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t5~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:21:17,690 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:21:17,690 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t5~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:21:17,691 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:21:17,691 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:21:17,692 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#t~nondet7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:21:17,700 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork4_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:21:17,701 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork4_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:21:17,701 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork4_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:21:17,701 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork4_#t~malloc2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:21:17,701 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork4_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:21:17,702 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork4_#t~malloc2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:21:17,704 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork5_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:21:17,704 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork5_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:21:17,704 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork5_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:21:17,704 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork5_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:21:17,706 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork4_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:21:17,707 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork4_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:21:17,707 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork4_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:21:17,707 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork4_#t~malloc2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:21:17,707 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork4_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:21:17,708 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork4_#t~malloc2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:21:17,710 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork5_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:21:17,710 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork5_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:21:17,710 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork5_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:21:17,711 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork5_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:21:17,712 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:21:17,713 WARN L313 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:21:17,713 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:21:17,713 WARN L313 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:21:17,715 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:21:17,716 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:21:17,716 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:21:17,716 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:21:17,718 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:21:17,718 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:21:17,719 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:21:17,719 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:21:17,887 INFO L251 AbstractCegarLoop]: Starting to check reachability of 12 error locations. [2020-10-05 22:21:17,912 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-10-05 22:21:17,912 INFO L376 AbstractCegarLoop]: Hoare is true [2020-10-05 22:21:17,913 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-10-05 22:21:17,913 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-05 22:21:17,913 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-05 22:21:17,913 INFO L380 AbstractCegarLoop]: Difference is false [2020-10-05 22:21:17,913 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-05 22:21:17,913 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-05 22:21:17,936 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 172 places, 243 transitions, 866 flow [2020-10-05 22:21:17,939 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 172 places, 243 transitions, 866 flow [2020-10-05 22:21:18,044 INFO L129 PetriNetUnfolder]: 61/264 cut-off events. [2020-10-05 22:21:18,044 INFO L130 PetriNetUnfolder]: For 39/39 co-relation queries the response was YES. [2020-10-05 22:21:18,054 INFO L80 FinitePrefix]: Finished finitePrefix Result has 365 conditions, 264 events. 61/264 cut-off events. For 39/39 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 750 event pairs, 0 based on Foata normal form. 0/214 useless extension candidates. Maximal degree in co-relation 353. Up to 24 conditions per place. [2020-10-05 22:21:18,067 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 172 places, 243 transitions, 866 flow [2020-10-05 22:21:18,125 INFO L129 PetriNetUnfolder]: 61/264 cut-off events. [2020-10-05 22:21:18,125 INFO L130 PetriNetUnfolder]: For 39/39 co-relation queries the response was YES. [2020-10-05 22:21:18,132 INFO L80 FinitePrefix]: Finished finitePrefix Result has 365 conditions, 264 events. 61/264 cut-off events. For 39/39 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 750 event pairs, 0 based on Foata normal form. 0/214 useless extension candidates. Maximal degree in co-relation 353. Up to 24 conditions per place. [2020-10-05 22:21:18,147 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 4038 [2020-10-05 22:21:18,148 INFO L170 etLargeBlockEncoding]: Semantic Check. [2020-10-05 22:21:19,889 WARN L193 SmtUtils]: Spent 139.00 ms on a formula simplification that was a NOOP. DAG size: 77 [2020-10-05 22:21:20,009 WARN L193 SmtUtils]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 73 [2020-10-05 22:21:20,251 INFO L206 etLargeBlockEncoding]: Checked pairs total: 2242 [2020-10-05 22:21:20,251 INFO L214 etLargeBlockEncoding]: Total number of compositions: 75 [2020-10-05 22:21:20,255 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 101 places, 173 transitions, 726 flow [2020-10-05 22:21:20,894 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 3502 states. [2020-10-05 22:21:20,896 INFO L276 IsEmpty]: Start isEmpty. Operand 3502 states. [2020-10-05 22:21:20,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-10-05 22:21:20,904 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 22:21:20,907 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 22:21:20,908 INFO L427 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]=== [2020-10-05 22:21:20,915 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 22:21:20,916 INFO L82 PathProgramCache]: Analyzing trace with hash 1069688068, now seen corresponding path program 1 times [2020-10-05 22:21:20,940 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 22:21:20,940 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2091842654] [2020-10-05 22:21:20,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 22:21:21,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 22:21:21,270 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-05 22:21:21,271 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2091842654] [2020-10-05 22:21:21,272 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 22:21:21,272 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-05 22:21:21,273 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [392654727] [2020-10-05 22:21:21,278 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-05 22:21:21,279 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 22:21:21,295 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-05 22:21:21,296 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-10-05 22:21:21,299 INFO L87 Difference]: Start difference. First operand 3502 states. Second operand 6 states. [2020-10-05 22:21:21,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 22:21:21,648 INFO L93 Difference]: Finished difference Result 4760 states and 19900 transitions. [2020-10-05 22:21:21,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-05 22:21:21,650 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 9 [2020-10-05 22:21:21,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 22:21:21,727 INFO L225 Difference]: With dead ends: 4760 [2020-10-05 22:21:21,727 INFO L226 Difference]: Without dead ends: 4272 [2020-10-05 22:21:21,729 INFO L675 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 [2020-10-05 22:21:21,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4272 states. [2020-10-05 22:21:21,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4272 to 3018. [2020-10-05 22:21:21,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3018 states. [2020-10-05 22:21:22,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3018 states to 3018 states and 12272 transitions. [2020-10-05 22:21:22,085 INFO L78 Accepts]: Start accepts. Automaton has 3018 states and 12272 transitions. Word has length 9 [2020-10-05 22:21:22,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 22:21:22,085 INFO L479 AbstractCegarLoop]: Abstraction has 3018 states and 12272 transitions. [2020-10-05 22:21:22,085 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-05 22:21:22,086 INFO L276 IsEmpty]: Start isEmpty. Operand 3018 states and 12272 transitions. [2020-10-05 22:21:22,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-10-05 22:21:22,086 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 22:21:22,087 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 22:21:22,087 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-05 22:21:22,087 INFO L427 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]=== [2020-10-05 22:21:22,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 22:21:22,088 INFO L82 PathProgramCache]: Analyzing trace with hash 1263032832, now seen corresponding path program 2 times [2020-10-05 22:21:22,088 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 22:21:22,088 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [291970296] [2020-10-05 22:21:22,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 22:21:22,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 22:21:22,199 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-05 22:21:22,200 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [291970296] [2020-10-05 22:21:22,200 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 22:21:22,201 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-05 22:21:22,201 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [839108696] [2020-10-05 22:21:22,202 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-05 22:21:22,203 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 22:21:22,203 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-05 22:21:22,203 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-10-05 22:21:22,203 INFO L87 Difference]: Start difference. First operand 3018 states and 12272 transitions. Second operand 6 states. [2020-10-05 22:21:22,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 22:21:22,578 INFO L93 Difference]: Finished difference Result 5518 states and 23821 transitions. [2020-10-05 22:21:22,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-05 22:21:22,579 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 9 [2020-10-05 22:21:22,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 22:21:22,631 INFO L225 Difference]: With dead ends: 5518 [2020-10-05 22:21:22,631 INFO L226 Difference]: Without dead ends: 5518 [2020-10-05 22:21:22,632 INFO L675 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 [2020-10-05 22:21:22,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5518 states. [2020-10-05 22:21:22,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5518 to 3008. [2020-10-05 22:21:22,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3008 states. [2020-10-05 22:21:22,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3008 states to 3008 states and 12255 transitions. [2020-10-05 22:21:22,795 INFO L78 Accepts]: Start accepts. Automaton has 3008 states and 12255 transitions. Word has length 9 [2020-10-05 22:21:22,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 22:21:22,796 INFO L479 AbstractCegarLoop]: Abstraction has 3008 states and 12255 transitions. [2020-10-05 22:21:22,796 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-05 22:21:22,796 INFO L276 IsEmpty]: Start isEmpty. Operand 3008 states and 12255 transitions. [2020-10-05 22:21:22,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-10-05 22:21:22,798 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 22:21:22,798 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 22:21:22,798 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-05 22:21:22,798 INFO L427 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]=== [2020-10-05 22:21:22,799 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 22:21:22,799 INFO L82 PathProgramCache]: Analyzing trace with hash -690496787, now seen corresponding path program 1 times [2020-10-05 22:21:22,799 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 22:21:22,799 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1606523626] [2020-10-05 22:21:22,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 22:21:22,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 22:21:22,895 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-05 22:21:22,895 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1606523626] [2020-10-05 22:21:22,896 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 22:21:22,896 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-05 22:21:22,896 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [813901720] [2020-10-05 22:21:22,896 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-05 22:21:22,897 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 22:21:22,897 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-05 22:21:22,897 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-05 22:21:22,897 INFO L87 Difference]: Start difference. First operand 3008 states and 12255 transitions. Second operand 3 states. [2020-10-05 22:21:22,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 22:21:23,000 INFO L93 Difference]: Finished difference Result 4848 states and 19273 transitions. [2020-10-05 22:21:23,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-05 22:21:23,000 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2020-10-05 22:21:23,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 22:21:23,035 INFO L225 Difference]: With dead ends: 4848 [2020-10-05 22:21:23,035 INFO L226 Difference]: Without dead ends: 3558 [2020-10-05 22:21:23,036 INFO L675 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 [2020-10-05 22:21:23,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3558 states. [2020-10-05 22:21:23,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3558 to 3181. [2020-10-05 22:21:23,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3181 states. [2020-10-05 22:21:23,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3181 states to 3181 states and 12171 transitions. [2020-10-05 22:21:23,245 INFO L78 Accepts]: Start accepts. Automaton has 3181 states and 12171 transitions. Word has length 16 [2020-10-05 22:21:23,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 22:21:23,246 INFO L479 AbstractCegarLoop]: Abstraction has 3181 states and 12171 transitions. [2020-10-05 22:21:23,246 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-05 22:21:23,246 INFO L276 IsEmpty]: Start isEmpty. Operand 3181 states and 12171 transitions. [2020-10-05 22:21:23,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-10-05 22:21:23,248 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 22:21:23,248 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 22:21:23,248 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-05 22:21:23,249 INFO L427 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]=== [2020-10-05 22:21:23,249 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 22:21:23,249 INFO L82 PathProgramCache]: Analyzing trace with hash 69435085, now seen corresponding path program 1 times [2020-10-05 22:21:23,249 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 22:21:23,250 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1615640027] [2020-10-05 22:21:23,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 22:21:23,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 22:21:23,312 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-05 22:21:23,313 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1615640027] [2020-10-05 22:21:23,313 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 22:21:23,313 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-05 22:21:23,314 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [86493786] [2020-10-05 22:21:23,314 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-05 22:21:23,314 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 22:21:23,315 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-05 22:21:23,315 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-10-05 22:21:23,315 INFO L87 Difference]: Start difference. First operand 3181 states and 12171 transitions. Second operand 6 states. [2020-10-05 22:21:23,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 22:21:23,556 INFO L93 Difference]: Finished difference Result 4417 states and 17212 transitions. [2020-10-05 22:21:23,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-05 22:21:23,557 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 17 [2020-10-05 22:21:23,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 22:21:23,583 INFO L225 Difference]: With dead ends: 4417 [2020-10-05 22:21:23,583 INFO L226 Difference]: Without dead ends: 4393 [2020-10-05 22:21:23,584 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2020-10-05 22:21:23,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4393 states. [2020-10-05 22:21:23,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4393 to 3588. [2020-10-05 22:21:23,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3588 states. [2020-10-05 22:21:23,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3588 states to 3588 states and 14085 transitions. [2020-10-05 22:21:23,732 INFO L78 Accepts]: Start accepts. Automaton has 3588 states and 14085 transitions. Word has length 17 [2020-10-05 22:21:23,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 22:21:23,732 INFO L479 AbstractCegarLoop]: Abstraction has 3588 states and 14085 transitions. [2020-10-05 22:21:23,732 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-05 22:21:23,733 INFO L276 IsEmpty]: Start isEmpty. Operand 3588 states and 14085 transitions. [2020-10-05 22:21:23,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-10-05 22:21:23,735 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 22:21:23,735 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 22:21:23,735 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-05 22:21:23,735 INFO L427 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]=== [2020-10-05 22:21:23,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 22:21:23,736 INFO L82 PathProgramCache]: Analyzing trace with hash -954298863, now seen corresponding path program 2 times [2020-10-05 22:21:23,736 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 22:21:23,737 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [127113784] [2020-10-05 22:21:23,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 22:21:23,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 22:21:23,807 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-05 22:21:23,808 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [127113784] [2020-10-05 22:21:23,809 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 22:21:23,809 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-05 22:21:23,809 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1458677826] [2020-10-05 22:21:23,810 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-05 22:21:23,810 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 22:21:23,810 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-05 22:21:23,810 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-10-05 22:21:23,811 INFO L87 Difference]: Start difference. First operand 3588 states and 14085 transitions. Second operand 6 states. [2020-10-05 22:21:23,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 22:21:23,939 INFO L93 Difference]: Finished difference Result 4024 states and 15445 transitions. [2020-10-05 22:21:23,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-05 22:21:23,940 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 17 [2020-10-05 22:21:23,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 22:21:23,961 INFO L225 Difference]: With dead ends: 4024 [2020-10-05 22:21:23,962 INFO L226 Difference]: Without dead ends: 4024 [2020-10-05 22:21:23,962 INFO L675 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 [2020-10-05 22:21:23,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4024 states. [2020-10-05 22:21:24,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4024 to 3573. [2020-10-05 22:21:24,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3573 states. [2020-10-05 22:21:24,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3573 states to 3573 states and 14045 transitions. [2020-10-05 22:21:24,092 INFO L78 Accepts]: Start accepts. Automaton has 3573 states and 14045 transitions. Word has length 17 [2020-10-05 22:21:24,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 22:21:24,093 INFO L479 AbstractCegarLoop]: Abstraction has 3573 states and 14045 transitions. [2020-10-05 22:21:24,093 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-05 22:21:24,093 INFO L276 IsEmpty]: Start isEmpty. Operand 3573 states and 14045 transitions. [2020-10-05 22:21:24,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-10-05 22:21:24,095 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 22:21:24,095 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 22:21:24,095 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-05 22:21:24,096 INFO L427 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]=== [2020-10-05 22:21:24,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 22:21:24,096 INFO L82 PathProgramCache]: Analyzing trace with hash -687500069, now seen corresponding path program 1 times [2020-10-05 22:21:24,096 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 22:21:24,097 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1359432239] [2020-10-05 22:21:24,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 22:21:24,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 22:21:24,163 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-05 22:21:24,163 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1359432239] [2020-10-05 22:21:24,164 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 22:21:24,165 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-05 22:21:24,165 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [239471108] [2020-10-05 22:21:24,165 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-05 22:21:24,166 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 22:21:24,166 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-05 22:21:24,166 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-10-05 22:21:24,167 INFO L87 Difference]: Start difference. First operand 3573 states and 14045 transitions. Second operand 6 states. [2020-10-05 22:21:24,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 22:21:24,485 INFO L93 Difference]: Finished difference Result 4225 states and 16225 transitions. [2020-10-05 22:21:24,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-05 22:21:24,486 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 18 [2020-10-05 22:21:24,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 22:21:24,505 INFO L225 Difference]: With dead ends: 4225 [2020-10-05 22:21:24,505 INFO L226 Difference]: Without dead ends: 4129 [2020-10-05 22:21:24,505 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2020-10-05 22:21:24,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4129 states. [2020-10-05 22:21:24,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4129 to 3713. [2020-10-05 22:21:24,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3713 states. [2020-10-05 22:21:24,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3713 states to 3713 states and 14455 transitions. [2020-10-05 22:21:24,645 INFO L78 Accepts]: Start accepts. Automaton has 3713 states and 14455 transitions. Word has length 18 [2020-10-05 22:21:24,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 22:21:24,646 INFO L479 AbstractCegarLoop]: Abstraction has 3713 states and 14455 transitions. [2020-10-05 22:21:24,646 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-05 22:21:24,646 INFO L276 IsEmpty]: Start isEmpty. Operand 3713 states and 14455 transitions. [2020-10-05 22:21:24,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-10-05 22:21:24,648 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 22:21:24,648 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 22:21:24,648 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-05 22:21:24,648 INFO L427 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]=== [2020-10-05 22:21:24,649 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 22:21:24,649 INFO L82 PathProgramCache]: Analyzing trace with hash -454402421, now seen corresponding path program 2 times [2020-10-05 22:21:24,649 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 22:21:24,649 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [661829976] [2020-10-05 22:21:24,650 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 22:21:24,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 22:21:24,718 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-05 22:21:24,719 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [661829976] [2020-10-05 22:21:24,719 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 22:21:24,719 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-05 22:21:24,719 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1708604067] [2020-10-05 22:21:24,720 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-05 22:21:24,720 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 22:21:24,720 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-05 22:21:24,721 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2020-10-05 22:21:24,721 INFO L87 Difference]: Start difference. First operand 3713 states and 14455 transitions. Second operand 7 states. [2020-10-05 22:21:25,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 22:21:25,017 INFO L93 Difference]: Finished difference Result 4979 states and 19779 transitions. [2020-10-05 22:21:25,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-05 22:21:25,017 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 18 [2020-10-05 22:21:25,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 22:21:25,040 INFO L225 Difference]: With dead ends: 4979 [2020-10-05 22:21:25,040 INFO L226 Difference]: Without dead ends: 4905 [2020-10-05 22:21:25,042 INFO L675 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 [2020-10-05 22:21:25,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4905 states. [2020-10-05 22:21:25,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4905 to 4131. [2020-10-05 22:21:25,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4131 states. [2020-10-05 22:21:25,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4131 states to 4131 states and 16620 transitions. [2020-10-05 22:21:25,198 INFO L78 Accepts]: Start accepts. Automaton has 4131 states and 16620 transitions. Word has length 18 [2020-10-05 22:21:25,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 22:21:25,198 INFO L479 AbstractCegarLoop]: Abstraction has 4131 states and 16620 transitions. [2020-10-05 22:21:25,198 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-05 22:21:25,198 INFO L276 IsEmpty]: Start isEmpty. Operand 4131 states and 16620 transitions. [2020-10-05 22:21:25,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-10-05 22:21:25,200 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 22:21:25,200 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 22:21:25,201 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-10-05 22:21:25,201 INFO L427 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]=== [2020-10-05 22:21:25,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 22:21:25,201 INFO L82 PathProgramCache]: Analyzing trace with hash -1254406997, now seen corresponding path program 3 times [2020-10-05 22:21:25,201 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 22:21:25,202 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1386420054] [2020-10-05 22:21:25,202 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 22:21:25,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 22:21:25,353 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-05 22:21:25,354 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1386420054] [2020-10-05 22:21:25,354 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 22:21:25,354 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-05 22:21:25,354 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [63223440] [2020-10-05 22:21:25,355 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-05 22:21:25,355 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 22:21:25,355 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-05 22:21:25,356 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2020-10-05 22:21:25,356 INFO L87 Difference]: Start difference. First operand 4131 states and 16620 transitions. Second operand 8 states. [2020-10-05 22:21:25,758 WARN L193 SmtUtils]: Spent 358.00 ms on a formula simplification that was a NOOP. DAG size: 20 [2020-10-05 22:21:25,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 22:21:25,983 INFO L93 Difference]: Finished difference Result 6735 states and 27904 transitions. [2020-10-05 22:21:25,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-05 22:21:25,984 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 18 [2020-10-05 22:21:25,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 22:21:26,008 INFO L225 Difference]: With dead ends: 6735 [2020-10-05 22:21:26,008 INFO L226 Difference]: Without dead ends: 6661 [2020-10-05 22:21:26,009 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2020-10-05 22:21:26,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6661 states. [2020-10-05 22:21:26,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6661 to 4129. [2020-10-05 22:21:26,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4129 states. [2020-10-05 22:21:26,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4129 states to 4129 states and 16616 transitions. [2020-10-05 22:21:26,170 INFO L78 Accepts]: Start accepts. Automaton has 4129 states and 16616 transitions. Word has length 18 [2020-10-05 22:21:26,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 22:21:26,170 INFO L479 AbstractCegarLoop]: Abstraction has 4129 states and 16616 transitions. [2020-10-05 22:21:26,170 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-05 22:21:26,170 INFO L276 IsEmpty]: Start isEmpty. Operand 4129 states and 16616 transitions. [2020-10-05 22:21:26,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-10-05 22:21:26,172 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 22:21:26,172 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 22:21:26,173 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-10-05 22:21:26,173 INFO L427 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]=== [2020-10-05 22:21:26,173 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 22:21:26,173 INFO L82 PathProgramCache]: Analyzing trace with hash -164095139, now seen corresponding path program 4 times [2020-10-05 22:21:26,173 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 22:21:26,174 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [544878861] [2020-10-05 22:21:26,174 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 22:21:26,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 22:21:26,307 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-05 22:21:26,308 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [544878861] [2020-10-05 22:21:26,308 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 22:21:26,308 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-10-05 22:21:26,309 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2050023629] [2020-10-05 22:21:26,309 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-10-05 22:21:26,309 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 22:21:26,310 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-10-05 22:21:26,310 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2020-10-05 22:21:26,310 INFO L87 Difference]: Start difference. First operand 4129 states and 16616 transitions. Second operand 10 states. [2020-10-05 22:21:26,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 22:21:26,703 INFO L93 Difference]: Finished difference Result 5374 states and 21882 transitions. [2020-10-05 22:21:26,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-05 22:21:26,703 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 18 [2020-10-05 22:21:26,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 22:21:26,721 INFO L225 Difference]: With dead ends: 5374 [2020-10-05 22:21:26,722 INFO L226 Difference]: Without dead ends: 5300 [2020-10-05 22:21:26,723 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=125, Unknown=0, NotChecked=0, Total=182 [2020-10-05 22:21:26,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5300 states. [2020-10-05 22:21:26,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5300 to 4114. [2020-10-05 22:21:26,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4114 states. [2020-10-05 22:21:26,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4114 states to 4114 states and 16572 transitions. [2020-10-05 22:21:26,858 INFO L78 Accepts]: Start accepts. Automaton has 4114 states and 16572 transitions. Word has length 18 [2020-10-05 22:21:26,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 22:21:26,859 INFO L479 AbstractCegarLoop]: Abstraction has 4114 states and 16572 transitions. [2020-10-05 22:21:26,859 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-10-05 22:21:26,859 INFO L276 IsEmpty]: Start isEmpty. Operand 4114 states and 16572 transitions. [2020-10-05 22:21:26,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-10-05 22:21:26,861 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 22:21:26,861 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 22:21:26,862 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-10-05 22:21:26,862 INFO L427 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]=== [2020-10-05 22:21:26,862 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 22:21:26,862 INFO L82 PathProgramCache]: Analyzing trace with hash 2041625758, now seen corresponding path program 1 times [2020-10-05 22:21:26,862 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 22:21:26,863 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [579921931] [2020-10-05 22:21:26,863 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 22:21:26,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 22:21:26,954 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-05 22:21:26,955 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [579921931] [2020-10-05 22:21:26,956 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 22:21:26,956 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-05 22:21:26,956 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [41513508] [2020-10-05 22:21:26,957 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-05 22:21:26,957 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 22:21:26,957 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-05 22:21:26,958 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2020-10-05 22:21:26,958 INFO L87 Difference]: Start difference. First operand 4114 states and 16572 transitions. Second operand 7 states. [2020-10-05 22:21:27,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 22:21:27,189 INFO L93 Difference]: Finished difference Result 4623 states and 18113 transitions. [2020-10-05 22:21:27,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-05 22:21:27,189 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 19 [2020-10-05 22:21:27,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 22:21:27,205 INFO L225 Difference]: With dead ends: 4623 [2020-10-05 22:21:27,205 INFO L226 Difference]: Without dead ends: 4623 [2020-10-05 22:21:27,206 INFO L675 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 [2020-10-05 22:21:27,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4623 states. [2020-10-05 22:21:27,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4623 to 4076. [2020-10-05 22:21:27,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4076 states. [2020-10-05 22:21:27,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4076 states to 4076 states and 16430 transitions. [2020-10-05 22:21:27,342 INFO L78 Accepts]: Start accepts. Automaton has 4076 states and 16430 transitions. Word has length 19 [2020-10-05 22:21:27,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 22:21:27,343 INFO L479 AbstractCegarLoop]: Abstraction has 4076 states and 16430 transitions. [2020-10-05 22:21:27,343 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-05 22:21:27,343 INFO L276 IsEmpty]: Start isEmpty. Operand 4076 states and 16430 transitions. [2020-10-05 22:21:27,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-10-05 22:21:27,345 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 22:21:27,345 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 22:21:27,346 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-10-05 22:21:27,346 INFO L427 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]=== [2020-10-05 22:21:27,346 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 22:21:27,346 INFO L82 PathProgramCache]: Analyzing trace with hash 898872146, now seen corresponding path program 1 times [2020-10-05 22:21:27,346 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 22:21:27,347 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1480749003] [2020-10-05 22:21:27,347 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 22:21:27,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 22:21:27,529 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-05 22:21:27,529 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1480749003] [2020-10-05 22:21:27,529 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 22:21:27,529 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-10-05 22:21:27,530 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1927959078] [2020-10-05 22:21:27,530 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-10-05 22:21:27,530 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 22:21:27,531 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-10-05 22:21:27,531 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2020-10-05 22:21:27,531 INFO L87 Difference]: Start difference. First operand 4076 states and 16430 transitions. Second operand 11 states. [2020-10-05 22:21:28,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 22:21:28,023 INFO L93 Difference]: Finished difference Result 5825 states and 24230 transitions. [2020-10-05 22:21:28,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-05 22:21:28,024 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2020-10-05 22:21:28,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 22:21:28,041 INFO L225 Difference]: With dead ends: 5825 [2020-10-05 22:21:28,041 INFO L226 Difference]: Without dead ends: 5751 [2020-10-05 22:21:28,041 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2020-10-05 22:21:28,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5751 states. [2020-10-05 22:21:28,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5751 to 4013. [2020-10-05 22:21:28,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4013 states. [2020-10-05 22:21:28,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4013 states to 4013 states and 16198 transitions. [2020-10-05 22:21:28,159 INFO L78 Accepts]: Start accepts. Automaton has 4013 states and 16198 transitions. Word has length 19 [2020-10-05 22:21:28,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 22:21:28,160 INFO L479 AbstractCegarLoop]: Abstraction has 4013 states and 16198 transitions. [2020-10-05 22:21:28,160 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-10-05 22:21:28,160 INFO L276 IsEmpty]: Start isEmpty. Operand 4013 states and 16198 transitions. [2020-10-05 22:21:28,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-10-05 22:21:28,162 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 22:21:28,162 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 22:21:28,162 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-10-05 22:21:28,163 INFO L427 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]=== [2020-10-05 22:21:28,163 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 22:21:28,163 INFO L82 PathProgramCache]: Analyzing trace with hash -1134272272, now seen corresponding path program 1 times [2020-10-05 22:21:28,163 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 22:21:28,164 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [294297257] [2020-10-05 22:21:28,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 22:21:28,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 22:21:28,265 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-05 22:21:28,265 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [294297257] [2020-10-05 22:21:28,265 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 22:21:28,266 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-10-05 22:21:28,266 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1385128174] [2020-10-05 22:21:28,266 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-05 22:21:28,266 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 22:21:28,267 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-05 22:21:28,267 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2020-10-05 22:21:28,267 INFO L87 Difference]: Start difference. First operand 4013 states and 16198 transitions. Second operand 9 states. [2020-10-05 22:21:28,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 22:21:28,651 INFO L93 Difference]: Finished difference Result 5428 states and 21853 transitions. [2020-10-05 22:21:28,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-05 22:21:28,652 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 20 [2020-10-05 22:21:28,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 22:21:28,668 INFO L225 Difference]: With dead ends: 5428 [2020-10-05 22:21:28,669 INFO L226 Difference]: Without dead ends: 5382 [2020-10-05 22:21:28,669 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=106, Unknown=0, NotChecked=0, Total=156 [2020-10-05 22:21:28,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5382 states. [2020-10-05 22:21:28,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5382 to 4166. [2020-10-05 22:21:28,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4166 states. [2020-10-05 22:21:28,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4166 states to 4166 states and 16924 transitions. [2020-10-05 22:21:28,807 INFO L78 Accepts]: Start accepts. Automaton has 4166 states and 16924 transitions. Word has length 20 [2020-10-05 22:21:28,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 22:21:28,807 INFO L479 AbstractCegarLoop]: Abstraction has 4166 states and 16924 transitions. [2020-10-05 22:21:28,807 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-05 22:21:28,808 INFO L276 IsEmpty]: Start isEmpty. Operand 4166 states and 16924 transitions. [2020-10-05 22:21:28,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-10-05 22:21:28,810 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 22:21:28,810 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 22:21:28,810 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-10-05 22:21:28,817 INFO L427 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]=== [2020-10-05 22:21:28,818 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 22:21:28,818 INFO L82 PathProgramCache]: Analyzing trace with hash 1058647793, now seen corresponding path program 1 times [2020-10-05 22:21:28,818 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 22:21:28,818 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [540254369] [2020-10-05 22:21:28,819 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 22:21:28,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 22:21:29,007 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-05 22:21:29,008 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [540254369] [2020-10-05 22:21:29,008 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 22:21:29,008 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-10-05 22:21:29,008 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [221319476] [2020-10-05 22:21:29,009 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-05 22:21:29,009 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 22:21:29,009 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-05 22:21:29,010 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2020-10-05 22:21:29,010 INFO L87 Difference]: Start difference. First operand 4166 states and 16924 transitions. Second operand 9 states. [2020-10-05 22:21:29,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 22:21:29,390 INFO L93 Difference]: Finished difference Result 5500 states and 22434 transitions. [2020-10-05 22:21:29,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-05 22:21:29,391 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 20 [2020-10-05 22:21:29,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 22:21:29,409 INFO L225 Difference]: With dead ends: 5500 [2020-10-05 22:21:29,409 INFO L226 Difference]: Without dead ends: 5454 [2020-10-05 22:21:29,410 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=127, Unknown=0, NotChecked=0, Total=182 [2020-10-05 22:21:29,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5454 states. [2020-10-05 22:21:29,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5454 to 4012. [2020-10-05 22:21:29,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4012 states. [2020-10-05 22:21:29,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4012 states to 4012 states and 16195 transitions. [2020-10-05 22:21:29,540 INFO L78 Accepts]: Start accepts. Automaton has 4012 states and 16195 transitions. Word has length 20 [2020-10-05 22:21:29,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 22:21:29,543 INFO L479 AbstractCegarLoop]: Abstraction has 4012 states and 16195 transitions. [2020-10-05 22:21:29,543 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-05 22:21:29,543 INFO L276 IsEmpty]: Start isEmpty. Operand 4012 states and 16195 transitions. [2020-10-05 22:21:29,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-10-05 22:21:29,548 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 22:21:29,548 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 22:21:29,549 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-10-05 22:21:29,549 INFO L427 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]=== [2020-10-05 22:21:29,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 22:21:29,549 INFO L82 PathProgramCache]: Analyzing trace with hash 2045819536, now seen corresponding path program 2 times [2020-10-05 22:21:29,550 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 22:21:29,552 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1213599099] [2020-10-05 22:21:29,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 22:21:29,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 22:21:29,717 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-05 22:21:29,718 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1213599099] [2020-10-05 22:21:29,718 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 22:21:29,718 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-10-05 22:21:29,719 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [953206271] [2020-10-05 22:21:29,719 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-10-05 22:21:29,719 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 22:21:29,719 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-10-05 22:21:29,720 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2020-10-05 22:21:29,720 INFO L87 Difference]: Start difference. First operand 4012 states and 16195 transitions. Second operand 10 states. [2020-10-05 22:21:30,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 22:21:30,160 INFO L93 Difference]: Finished difference Result 5781 states and 23394 transitions. [2020-10-05 22:21:30,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-05 22:21:30,161 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 20 [2020-10-05 22:21:30,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 22:21:30,178 INFO L225 Difference]: With dead ends: 5781 [2020-10-05 22:21:30,179 INFO L226 Difference]: Without dead ends: 5735 [2020-10-05 22:21:30,179 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2020-10-05 22:21:30,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5735 states. [2020-10-05 22:21:30,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5735 to 4148. [2020-10-05 22:21:30,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4148 states. [2020-10-05 22:21:30,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4148 states to 4148 states and 16836 transitions. [2020-10-05 22:21:30,403 INFO L78 Accepts]: Start accepts. Automaton has 4148 states and 16836 transitions. Word has length 20 [2020-10-05 22:21:30,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 22:21:30,403 INFO L479 AbstractCegarLoop]: Abstraction has 4148 states and 16836 transitions. [2020-10-05 22:21:30,404 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-10-05 22:21:30,404 INFO L276 IsEmpty]: Start isEmpty. Operand 4148 states and 16836 transitions. [2020-10-05 22:21:30,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-10-05 22:21:30,408 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 22:21:30,408 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 22:21:30,409 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-10-05 22:21:30,409 INFO L427 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]=== [2020-10-05 22:21:30,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 22:21:30,409 INFO L82 PathProgramCache]: Analyzing trace with hash 258643217, now seen corresponding path program 2 times [2020-10-05 22:21:30,409 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 22:21:30,410 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1505661794] [2020-10-05 22:21:30,410 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 22:21:30,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 22:21:30,530 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-05 22:21:30,531 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1505661794] [2020-10-05 22:21:30,531 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 22:21:30,531 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-10-05 22:21:30,531 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [40668929] [2020-10-05 22:21:30,532 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-10-05 22:21:30,532 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 22:21:30,532 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-10-05 22:21:30,532 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2020-10-05 22:21:30,532 INFO L87 Difference]: Start difference. First operand 4148 states and 16836 transitions. Second operand 10 states. [2020-10-05 22:21:30,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 22:21:30,999 INFO L93 Difference]: Finished difference Result 6399 states and 26032 transitions. [2020-10-05 22:21:31,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-10-05 22:21:31,000 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 20 [2020-10-05 22:21:31,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 22:21:31,023 INFO L225 Difference]: With dead ends: 6399 [2020-10-05 22:21:31,023 INFO L226 Difference]: Without dead ends: 6353 [2020-10-05 22:21:31,024 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=88, Invalid=184, Unknown=0, NotChecked=0, Total=272 [2020-10-05 22:21:31,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6353 states. [2020-10-05 22:21:31,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6353 to 3978. [2020-10-05 22:21:31,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3978 states. [2020-10-05 22:21:31,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3978 states to 3978 states and 16074 transitions. [2020-10-05 22:21:31,161 INFO L78 Accepts]: Start accepts. Automaton has 3978 states and 16074 transitions. Word has length 20 [2020-10-05 22:21:31,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 22:21:31,161 INFO L479 AbstractCegarLoop]: Abstraction has 3978 states and 16074 transitions. [2020-10-05 22:21:31,161 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-10-05 22:21:31,161 INFO L276 IsEmpty]: Start isEmpty. Operand 3978 states and 16074 transitions. [2020-10-05 22:21:31,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-10-05 22:21:31,164 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 22:21:31,164 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 22:21:31,165 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-10-05 22:21:31,165 INFO L427 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]=== [2020-10-05 22:21:31,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 22:21:31,165 INFO L82 PathProgramCache]: Analyzing trace with hash 657525156, now seen corresponding path program 3 times [2020-10-05 22:21:31,165 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 22:21:31,166 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [601368265] [2020-10-05 22:21:31,166 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 22:21:31,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 22:21:31,238 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-05 22:21:31,238 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [601368265] [2020-10-05 22:21:31,238 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 22:21:31,239 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-05 22:21:31,239 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [714075052] [2020-10-05 22:21:31,241 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-05 22:21:31,242 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 22:21:31,242 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-05 22:21:31,242 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2020-10-05 22:21:31,242 INFO L87 Difference]: Start difference. First operand 3978 states and 16074 transitions. Second operand 7 states. [2020-10-05 22:21:31,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 22:21:31,481 INFO L93 Difference]: Finished difference Result 6325 states and 25457 transitions. [2020-10-05 22:21:31,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-05 22:21:31,482 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 20 [2020-10-05 22:21:31,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 22:21:31,498 INFO L225 Difference]: With dead ends: 6325 [2020-10-05 22:21:31,498 INFO L226 Difference]: Without dead ends: 6279 [2020-10-05 22:21:31,498 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2020-10-05 22:21:31,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6279 states. [2020-10-05 22:21:31,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6279 to 3948. [2020-10-05 22:21:31,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3948 states. [2020-10-05 22:21:31,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3948 states to 3948 states and 16005 transitions. [2020-10-05 22:21:31,634 INFO L78 Accepts]: Start accepts. Automaton has 3948 states and 16005 transitions. Word has length 20 [2020-10-05 22:21:31,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 22:21:31,634 INFO L479 AbstractCegarLoop]: Abstraction has 3948 states and 16005 transitions. [2020-10-05 22:21:31,635 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-05 22:21:31,635 INFO L276 IsEmpty]: Start isEmpty. Operand 3948 states and 16005 transitions. [2020-10-05 22:21:31,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-10-05 22:21:31,638 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 22:21:31,638 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 22:21:31,639 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-10-05 22:21:31,639 INFO L427 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]=== [2020-10-05 22:21:31,639 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 22:21:31,639 INFO L82 PathProgramCache]: Analyzing trace with hash -1935934284, now seen corresponding path program 1 times [2020-10-05 22:21:31,639 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 22:21:31,640 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [759330973] [2020-10-05 22:21:31,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 22:21:31,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 22:21:31,694 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-05 22:21:31,694 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [759330973] [2020-10-05 22:21:31,695 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 22:21:31,695 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-05 22:21:31,695 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1248257208] [2020-10-05 22:21:31,696 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-05 22:21:31,696 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 22:21:31,696 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-05 22:21:31,696 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-10-05 22:21:31,696 INFO L87 Difference]: Start difference. First operand 3948 states and 16005 transitions. Second operand 6 states. [2020-10-05 22:21:31,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 22:21:31,889 INFO L93 Difference]: Finished difference Result 4727 states and 18672 transitions. [2020-10-05 22:21:31,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-05 22:21:31,889 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 21 [2020-10-05 22:21:31,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 22:21:31,905 INFO L225 Difference]: With dead ends: 4727 [2020-10-05 22:21:31,905 INFO L226 Difference]: Without dead ends: 4652 [2020-10-05 22:21:31,906 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2020-10-05 22:21:31,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4652 states. [2020-10-05 22:21:32,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4652 to 4270. [2020-10-05 22:21:32,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4270 states. [2020-10-05 22:21:32,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4270 states to 4270 states and 17192 transitions. [2020-10-05 22:21:32,124 INFO L78 Accepts]: Start accepts. Automaton has 4270 states and 17192 transitions. Word has length 21 [2020-10-05 22:21:32,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 22:21:32,125 INFO L479 AbstractCegarLoop]: Abstraction has 4270 states and 17192 transitions. [2020-10-05 22:21:32,125 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-05 22:21:32,125 INFO L276 IsEmpty]: Start isEmpty. Operand 4270 states and 17192 transitions. [2020-10-05 22:21:32,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-10-05 22:21:32,129 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 22:21:32,129 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 22:21:32,130 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-10-05 22:21:32,130 INFO L427 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]=== [2020-10-05 22:21:32,130 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 22:21:32,130 INFO L82 PathProgramCache]: Analyzing trace with hash 1183087759, now seen corresponding path program 1 times [2020-10-05 22:21:32,130 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 22:21:32,131 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1895022134] [2020-10-05 22:21:32,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 22:21:32,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 22:21:32,216 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-05 22:21:32,216 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1895022134] [2020-10-05 22:21:32,216 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 22:21:32,217 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-05 22:21:32,217 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [835437050] [2020-10-05 22:21:32,217 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-05 22:21:32,217 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 22:21:32,218 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-05 22:21:32,218 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2020-10-05 22:21:32,218 INFO L87 Difference]: Start difference. First operand 4270 states and 17192 transitions. Second operand 8 states. [2020-10-05 22:21:32,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 22:21:32,357 INFO L93 Difference]: Finished difference Result 4820 states and 18862 transitions. [2020-10-05 22:21:32,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-05 22:21:32,357 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 21 [2020-10-05 22:21:32,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 22:21:32,367 INFO L225 Difference]: With dead ends: 4820 [2020-10-05 22:21:32,367 INFO L226 Difference]: Without dead ends: 4296 [2020-10-05 22:21:32,367 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2020-10-05 22:21:32,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4296 states. [2020-10-05 22:21:32,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4296 to 3680. [2020-10-05 22:21:32,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3680 states. [2020-10-05 22:21:32,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3680 states to 3680 states and 14531 transitions. [2020-10-05 22:21:32,429 INFO L78 Accepts]: Start accepts. Automaton has 3680 states and 14531 transitions. Word has length 21 [2020-10-05 22:21:32,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 22:21:32,429 INFO L479 AbstractCegarLoop]: Abstraction has 3680 states and 14531 transitions. [2020-10-05 22:21:32,429 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-05 22:21:32,430 INFO L276 IsEmpty]: Start isEmpty. Operand 3680 states and 14531 transitions. [2020-10-05 22:21:32,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-10-05 22:21:32,432 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 22:21:32,433 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 22:21:32,433 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2020-10-05 22:21:32,433 INFO L427 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]=== [2020-10-05 22:21:32,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 22:21:32,433 INFO L82 PathProgramCache]: Analyzing trace with hash 558787563, now seen corresponding path program 1 times [2020-10-05 22:21:32,433 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 22:21:32,434 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [544395811] [2020-10-05 22:21:32,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 22:21:32,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 22:21:32,582 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-05 22:21:32,583 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [544395811] [2020-10-05 22:21:32,583 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 22:21:32,583 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-10-05 22:21:32,583 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [889421206] [2020-10-05 22:21:32,583 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-10-05 22:21:32,584 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 22:21:32,584 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-10-05 22:21:32,584 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2020-10-05 22:21:32,584 INFO L87 Difference]: Start difference. First operand 3680 states and 14531 transitions. Second operand 11 states. [2020-10-05 22:21:32,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 22:21:32,973 INFO L93 Difference]: Finished difference Result 4556 states and 17623 transitions. [2020-10-05 22:21:32,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-05 22:21:32,974 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 21 [2020-10-05 22:21:32,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 22:21:32,985 INFO L225 Difference]: With dead ends: 4556 [2020-10-05 22:21:32,985 INFO L226 Difference]: Without dead ends: 4507 [2020-10-05 22:21:32,986 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2020-10-05 22:21:33,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4507 states. [2020-10-05 22:21:33,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4507 to 3330. [2020-10-05 22:21:33,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3330 states. [2020-10-05 22:21:33,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3330 states to 3330 states and 12802 transitions. [2020-10-05 22:21:33,075 INFO L78 Accepts]: Start accepts. Automaton has 3330 states and 12802 transitions. Word has length 21 [2020-10-05 22:21:33,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 22:21:33,076 INFO L479 AbstractCegarLoop]: Abstraction has 3330 states and 12802 transitions. [2020-10-05 22:21:33,076 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-10-05 22:21:33,076 INFO L276 IsEmpty]: Start isEmpty. Operand 3330 states and 12802 transitions. [2020-10-05 22:21:33,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-10-05 22:21:33,079 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 22:21:33,079 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 22:21:33,079 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2020-10-05 22:21:33,079 INFO L427 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]=== [2020-10-05 22:21:33,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 22:21:33,080 INFO L82 PathProgramCache]: Analyzing trace with hash 2087336367, now seen corresponding path program 1 times [2020-10-05 22:21:33,080 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 22:21:33,080 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [276701428] [2020-10-05 22:21:33,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 22:21:33,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 22:21:33,241 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-05 22:21:33,242 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [276701428] [2020-10-05 22:21:33,242 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 22:21:33,242 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-10-05 22:21:33,242 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1746013738] [2020-10-05 22:21:33,243 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-10-05 22:21:33,243 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 22:21:33,243 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-10-05 22:21:33,243 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2020-10-05 22:21:33,243 INFO L87 Difference]: Start difference. First operand 3330 states and 12802 transitions. Second operand 12 states. [2020-10-05 22:21:33,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 22:21:33,567 INFO L93 Difference]: Finished difference Result 3991 states and 15112 transitions. [2020-10-05 22:21:33,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-05 22:21:33,567 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 21 [2020-10-05 22:21:33,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 22:21:33,577 INFO L225 Difference]: With dead ends: 3991 [2020-10-05 22:21:33,578 INFO L226 Difference]: Without dead ends: 3835 [2020-10-05 22:21:33,578 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=75, Invalid=197, Unknown=0, NotChecked=0, Total=272 [2020-10-05 22:21:33,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3835 states. [2020-10-05 22:21:33,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3835 to 2831. [2020-10-05 22:21:33,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2831 states. [2020-10-05 22:21:33,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2831 states to 2831 states and 10625 transitions. [2020-10-05 22:21:33,635 INFO L78 Accepts]: Start accepts. Automaton has 2831 states and 10625 transitions. Word has length 21 [2020-10-05 22:21:33,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 22:21:33,635 INFO L479 AbstractCegarLoop]: Abstraction has 2831 states and 10625 transitions. [2020-10-05 22:21:33,635 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-10-05 22:21:33,635 INFO L276 IsEmpty]: Start isEmpty. Operand 2831 states and 10625 transitions. [2020-10-05 22:21:33,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-10-05 22:21:33,638 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 22:21:33,638 INFO L422 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] [2020-10-05 22:21:33,638 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2020-10-05 22:21:33,638 INFO L427 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]=== [2020-10-05 22:21:33,639 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 22:21:33,639 INFO L82 PathProgramCache]: Analyzing trace with hash 1396456954, now seen corresponding path program 1 times [2020-10-05 22:21:33,639 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 22:21:33,639 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1867814649] [2020-10-05 22:21:33,639 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 22:21:33,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 22:21:33,704 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-05 22:21:33,704 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1867814649] [2020-10-05 22:21:33,704 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 22:21:33,704 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-05 22:21:33,705 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1632690316] [2020-10-05 22:21:33,705 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-05 22:21:33,705 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 22:21:33,705 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-05 22:21:33,706 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2020-10-05 22:21:33,706 INFO L87 Difference]: Start difference. First operand 2831 states and 10625 transitions. Second operand 7 states. [2020-10-05 22:21:33,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 22:21:33,879 INFO L93 Difference]: Finished difference Result 3550 states and 13085 transitions. [2020-10-05 22:21:33,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-05 22:21:33,879 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 22 [2020-10-05 22:21:33,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 22:21:33,888 INFO L225 Difference]: With dead ends: 3550 [2020-10-05 22:21:33,889 INFO L226 Difference]: Without dead ends: 3490 [2020-10-05 22:21:33,889 INFO L675 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 [2020-10-05 22:21:33,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3490 states. [2020-10-05 22:21:33,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3490 to 2828. [2020-10-05 22:21:33,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2828 states. [2020-10-05 22:21:33,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2828 states to 2828 states and 10620 transitions. [2020-10-05 22:21:33,944 INFO L78 Accepts]: Start accepts. Automaton has 2828 states and 10620 transitions. Word has length 22 [2020-10-05 22:21:33,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 22:21:33,944 INFO L479 AbstractCegarLoop]: Abstraction has 2828 states and 10620 transitions. [2020-10-05 22:21:33,944 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-05 22:21:33,944 INFO L276 IsEmpty]: Start isEmpty. Operand 2828 states and 10620 transitions. [2020-10-05 22:21:33,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-10-05 22:21:33,947 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 22:21:33,947 INFO L422 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] [2020-10-05 22:21:33,947 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2020-10-05 22:21:33,947 INFO L427 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]=== [2020-10-05 22:21:33,947 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 22:21:33,948 INFO L82 PathProgramCache]: Analyzing trace with hash 644682778, now seen corresponding path program 2 times [2020-10-05 22:21:33,948 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 22:21:33,948 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [684389675] [2020-10-05 22:21:33,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 22:21:33,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 22:21:34,034 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-05 22:21:34,035 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [684389675] [2020-10-05 22:21:34,035 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 22:21:34,035 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-05 22:21:34,035 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [195624733] [2020-10-05 22:21:34,036 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-05 22:21:34,036 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 22:21:34,036 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-05 22:21:34,036 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2020-10-05 22:21:34,036 INFO L87 Difference]: Start difference. First operand 2828 states and 10620 transitions. Second operand 8 states. [2020-10-05 22:21:34,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 22:21:34,345 INFO L93 Difference]: Finished difference Result 3540 states and 13065 transitions. [2020-10-05 22:21:34,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-05 22:21:34,346 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 22 [2020-10-05 22:21:34,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 22:21:34,355 INFO L225 Difference]: With dead ends: 3540 [2020-10-05 22:21:34,355 INFO L226 Difference]: Without dead ends: 3480 [2020-10-05 22:21:34,358 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2020-10-05 22:21:34,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3480 states. [2020-10-05 22:21:34,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3480 to 2822. [2020-10-05 22:21:34,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2822 states. [2020-10-05 22:21:34,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2822 states to 2822 states and 10606 transitions. [2020-10-05 22:21:34,428 INFO L78 Accepts]: Start accepts. Automaton has 2822 states and 10606 transitions. Word has length 22 [2020-10-05 22:21:34,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 22:21:34,428 INFO L479 AbstractCegarLoop]: Abstraction has 2822 states and 10606 transitions. [2020-10-05 22:21:34,428 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-05 22:21:34,428 INFO L276 IsEmpty]: Start isEmpty. Operand 2822 states and 10606 transitions. [2020-10-05 22:21:34,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-10-05 22:21:34,431 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 22:21:34,431 INFO L422 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] [2020-10-05 22:21:34,432 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2020-10-05 22:21:34,432 INFO L427 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]=== [2020-10-05 22:21:34,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 22:21:34,432 INFO L82 PathProgramCache]: Analyzing trace with hash -787433364, now seen corresponding path program 3 times [2020-10-05 22:21:34,432 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 22:21:34,433 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1289072351] [2020-10-05 22:21:34,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 22:21:34,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 22:21:34,519 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-05 22:21:34,519 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1289072351] [2020-10-05 22:21:34,520 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 22:21:34,520 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-10-05 22:21:34,520 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [569978243] [2020-10-05 22:21:34,520 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-05 22:21:34,521 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 22:21:34,521 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-05 22:21:34,521 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2020-10-05 22:21:34,521 INFO L87 Difference]: Start difference. First operand 2822 states and 10606 transitions. Second operand 9 states. [2020-10-05 22:21:34,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 22:21:34,846 INFO L93 Difference]: Finished difference Result 3525 states and 13034 transitions. [2020-10-05 22:21:34,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-05 22:21:34,846 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-10-05 22:21:34,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 22:21:34,857 INFO L225 Difference]: With dead ends: 3525 [2020-10-05 22:21:34,857 INFO L226 Difference]: Without dead ends: 3465 [2020-10-05 22:21:34,857 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=83, Unknown=0, NotChecked=0, Total=132 [2020-10-05 22:21:34,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3465 states. [2020-10-05 22:21:34,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3465 to 2822. [2020-10-05 22:21:34,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2822 states. [2020-10-05 22:21:34,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2822 states to 2822 states and 10606 transitions. [2020-10-05 22:21:34,930 INFO L78 Accepts]: Start accepts. Automaton has 2822 states and 10606 transitions. Word has length 22 [2020-10-05 22:21:34,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 22:21:34,930 INFO L479 AbstractCegarLoop]: Abstraction has 2822 states and 10606 transitions. [2020-10-05 22:21:34,930 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-05 22:21:34,930 INFO L276 IsEmpty]: Start isEmpty. Operand 2822 states and 10606 transitions. [2020-10-05 22:21:34,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-10-05 22:21:34,933 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 22:21:34,933 INFO L422 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] [2020-10-05 22:21:34,933 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2020-10-05 22:21:34,933 INFO L427 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]=== [2020-10-05 22:21:34,934 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 22:21:34,934 INFO L82 PathProgramCache]: Analyzing trace with hash -270857424, now seen corresponding path program 4 times [2020-10-05 22:21:34,934 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 22:21:34,934 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [521107803] [2020-10-05 22:21:34,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 22:21:34,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 22:21:35,067 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-05 22:21:35,067 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [521107803] [2020-10-05 22:21:35,067 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 22:21:35,067 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-10-05 22:21:35,068 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1558176031] [2020-10-05 22:21:35,068 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-10-05 22:21:35,068 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 22:21:35,068 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-10-05 22:21:35,068 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2020-10-05 22:21:35,069 INFO L87 Difference]: Start difference. First operand 2822 states and 10606 transitions. Second operand 11 states. [2020-10-05 22:21:35,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 22:21:35,472 INFO L93 Difference]: Finished difference Result 3740 states and 13820 transitions. [2020-10-05 22:21:35,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-05 22:21:35,473 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 22 [2020-10-05 22:21:35,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 22:21:35,483 INFO L225 Difference]: With dead ends: 3740 [2020-10-05 22:21:35,483 INFO L226 Difference]: Without dead ends: 3680 [2020-10-05 22:21:35,486 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=145, Unknown=0, NotChecked=0, Total=210 [2020-10-05 22:21:35,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3680 states. [2020-10-05 22:21:35,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3680 to 2822. [2020-10-05 22:21:35,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2822 states. [2020-10-05 22:21:35,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2822 states to 2822 states and 10603 transitions. [2020-10-05 22:21:35,547 INFO L78 Accepts]: Start accepts. Automaton has 2822 states and 10603 transitions. Word has length 22 [2020-10-05 22:21:35,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 22:21:35,548 INFO L479 AbstractCegarLoop]: Abstraction has 2822 states and 10603 transitions. [2020-10-05 22:21:35,548 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-10-05 22:21:35,548 INFO L276 IsEmpty]: Start isEmpty. Operand 2822 states and 10603 transitions. [2020-10-05 22:21:35,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-10-05 22:21:35,550 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 22:21:35,550 INFO L422 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] [2020-10-05 22:21:35,550 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2020-10-05 22:21:35,550 INFO L427 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]=== [2020-10-05 22:21:35,550 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 22:21:35,550 INFO L82 PathProgramCache]: Analyzing trace with hash -503603988, now seen corresponding path program 5 times [2020-10-05 22:21:35,551 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 22:21:35,551 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1079091424] [2020-10-05 22:21:35,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 22:21:35,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 22:21:35,638 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-05 22:21:35,638 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1079091424] [2020-10-05 22:21:35,639 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 22:21:35,639 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-10-05 22:21:35,639 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [676276660] [2020-10-05 22:21:35,639 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-05 22:21:35,639 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 22:21:35,640 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-05 22:21:35,640 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2020-10-05 22:21:35,640 INFO L87 Difference]: Start difference. First operand 2822 states and 10603 transitions. Second operand 9 states. [2020-10-05 22:21:35,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 22:21:35,882 INFO L93 Difference]: Finished difference Result 4237 states and 15414 transitions. [2020-10-05 22:21:35,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-05 22:21:35,883 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-10-05 22:21:35,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 22:21:35,893 INFO L225 Difference]: With dead ends: 4237 [2020-10-05 22:21:35,893 INFO L226 Difference]: Without dead ends: 4177 [2020-10-05 22:21:35,893 INFO L675 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 [2020-10-05 22:21:35,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4177 states. [2020-10-05 22:21:35,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4177 to 2670. [2020-10-05 22:21:35,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2670 states. [2020-10-05 22:21:35,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2670 states to 2670 states and 9904 transitions. [2020-10-05 22:21:35,965 INFO L78 Accepts]: Start accepts. Automaton has 2670 states and 9904 transitions. Word has length 22 [2020-10-05 22:21:35,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 22:21:35,965 INFO L479 AbstractCegarLoop]: Abstraction has 2670 states and 9904 transitions. [2020-10-05 22:21:35,965 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-05 22:21:35,965 INFO L276 IsEmpty]: Start isEmpty. Operand 2670 states and 9904 transitions. [2020-10-05 22:21:35,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-10-05 22:21:35,969 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 22:21:35,969 INFO L422 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] [2020-10-05 22:21:35,969 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2020-10-05 22:21:35,969 INFO L427 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]=== [2020-10-05 22:21:35,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 22:21:35,970 INFO L82 PathProgramCache]: Analyzing trace with hash 1684489160, now seen corresponding path program 1 times [2020-10-05 22:21:35,970 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 22:21:35,970 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1545459352] [2020-10-05 22:21:35,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 22:21:35,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 22:21:36,193 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-05 22:21:36,194 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1545459352] [2020-10-05 22:21:36,194 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 22:21:36,194 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-10-05 22:21:36,194 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [12742508] [2020-10-05 22:21:36,194 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-10-05 22:21:36,194 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 22:21:36,195 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-10-05 22:21:36,195 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2020-10-05 22:21:36,195 INFO L87 Difference]: Start difference. First operand 2670 states and 9904 transitions. Second operand 12 states. [2020-10-05 22:21:36,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 22:21:36,521 INFO L93 Difference]: Finished difference Result 3103 states and 11113 transitions. [2020-10-05 22:21:36,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-05 22:21:36,522 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 23 [2020-10-05 22:21:36,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 22:21:36,531 INFO L225 Difference]: With dead ends: 3103 [2020-10-05 22:21:36,532 INFO L226 Difference]: Without dead ends: 3007 [2020-10-05 22:21:36,532 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=76, Invalid=196, Unknown=0, NotChecked=0, Total=272 [2020-10-05 22:21:36,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3007 states. [2020-10-05 22:21:36,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3007 to 2170. [2020-10-05 22:21:36,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2170 states. [2020-10-05 22:21:36,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2170 states to 2170 states and 7789 transitions. [2020-10-05 22:21:36,607 INFO L78 Accepts]: Start accepts. Automaton has 2170 states and 7789 transitions. Word has length 23 [2020-10-05 22:21:36,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 22:21:36,607 INFO L479 AbstractCegarLoop]: Abstraction has 2170 states and 7789 transitions. [2020-10-05 22:21:36,608 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-10-05 22:21:36,608 INFO L276 IsEmpty]: Start isEmpty. Operand 2170 states and 7789 transitions. [2020-10-05 22:21:36,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-10-05 22:21:36,611 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 22:21:36,611 INFO L422 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] [2020-10-05 22:21:36,612 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2020-10-05 22:21:36,612 INFO L427 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]=== [2020-10-05 22:21:36,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 22:21:36,613 INFO L82 PathProgramCache]: Analyzing trace with hash -1357008819, now seen corresponding path program 1 times [2020-10-05 22:21:36,613 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 22:21:36,615 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1505842057] [2020-10-05 22:21:36,615 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 22:21:36,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 22:21:36,840 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-05 22:21:36,841 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1505842057] [2020-10-05 22:21:36,841 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 22:21:36,841 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-10-05 22:21:36,841 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1627898535] [2020-10-05 22:21:36,842 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-10-05 22:21:36,842 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 22:21:36,842 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-10-05 22:21:36,843 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2020-10-05 22:21:36,843 INFO L87 Difference]: Start difference. First operand 2170 states and 7789 transitions. Second operand 10 states. [2020-10-05 22:21:37,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 22:21:37,228 INFO L93 Difference]: Finished difference Result 3115 states and 11153 transitions. [2020-10-05 22:21:37,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-05 22:21:37,229 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 23 [2020-10-05 22:21:37,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 22:21:37,237 INFO L225 Difference]: With dead ends: 3115 [2020-10-05 22:21:37,238 INFO L226 Difference]: Without dead ends: 3058 [2020-10-05 22:21:37,238 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2020-10-05 22:21:37,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3058 states. [2020-10-05 22:21:37,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3058 to 2130. [2020-10-05 22:21:37,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2130 states. [2020-10-05 22:21:37,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2130 states to 2130 states and 7633 transitions. [2020-10-05 22:21:37,287 INFO L78 Accepts]: Start accepts. Automaton has 2130 states and 7633 transitions. Word has length 23 [2020-10-05 22:21:37,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 22:21:37,287 INFO L479 AbstractCegarLoop]: Abstraction has 2130 states and 7633 transitions. [2020-10-05 22:21:37,287 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-10-05 22:21:37,287 INFO L276 IsEmpty]: Start isEmpty. Operand 2130 states and 7633 transitions. [2020-10-05 22:21:37,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-10-05 22:21:37,289 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 22:21:37,289 INFO L422 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] [2020-10-05 22:21:37,290 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2020-10-05 22:21:37,290 INFO L427 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]=== [2020-10-05 22:21:37,290 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 22:21:37,290 INFO L82 PathProgramCache]: Analyzing trace with hash -840432879, now seen corresponding path program 2 times [2020-10-05 22:21:37,290 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 22:21:37,291 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [236697506] [2020-10-05 22:21:37,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 22:21:37,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 22:21:37,483 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-05 22:21:37,484 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [236697506] [2020-10-05 22:21:37,484 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 22:21:37,484 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-10-05 22:21:37,484 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [595068599] [2020-10-05 22:21:37,485 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-10-05 22:21:37,485 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 22:21:37,485 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-10-05 22:21:37,485 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2020-10-05 22:21:37,486 INFO L87 Difference]: Start difference. First operand 2130 states and 7633 transitions. Second operand 12 states. [2020-10-05 22:21:37,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 22:21:37,804 INFO L93 Difference]: Finished difference Result 2799 states and 9853 transitions. [2020-10-05 22:21:37,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-05 22:21:37,805 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 23 [2020-10-05 22:21:37,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 22:21:37,811 INFO L225 Difference]: With dead ends: 2799 [2020-10-05 22:21:37,811 INFO L226 Difference]: Without dead ends: 2682 [2020-10-05 22:21:37,811 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=77, Invalid=195, Unknown=0, NotChecked=0, Total=272 [2020-10-05 22:21:37,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2682 states. [2020-10-05 22:21:37,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2682 to 1794. [2020-10-05 22:21:37,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1794 states. [2020-10-05 22:21:37,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1794 states to 1794 states and 6287 transitions. [2020-10-05 22:21:37,845 INFO L78 Accepts]: Start accepts. Automaton has 1794 states and 6287 transitions. Word has length 23 [2020-10-05 22:21:37,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 22:21:37,845 INFO L479 AbstractCegarLoop]: Abstraction has 1794 states and 6287 transitions. [2020-10-05 22:21:37,845 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-10-05 22:21:37,845 INFO L276 IsEmpty]: Start isEmpty. Operand 1794 states and 6287 transitions. [2020-10-05 22:21:37,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-10-05 22:21:37,847 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 22:21:37,847 INFO L422 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] [2020-10-05 22:21:37,847 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2020-10-05 22:21:37,847 INFO L427 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]=== [2020-10-05 22:21:37,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 22:21:37,848 INFO L82 PathProgramCache]: Analyzing trace with hash -1309010247, now seen corresponding path program 1 times [2020-10-05 22:21:37,848 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 22:21:37,848 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [201153200] [2020-10-05 22:21:37,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 22:21:37,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 22:21:37,916 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-05 22:21:37,916 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [201153200] [2020-10-05 22:21:37,916 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 22:21:37,916 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-05 22:21:37,917 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1884338186] [2020-10-05 22:21:37,917 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-05 22:21:37,917 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 22:21:37,917 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-05 22:21:37,918 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-10-05 22:21:37,918 INFO L87 Difference]: Start difference. First operand 1794 states and 6287 transitions. Second operand 6 states. [2020-10-05 22:21:38,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 22:21:38,064 INFO L93 Difference]: Finished difference Result 2291 states and 7723 transitions. [2020-10-05 22:21:38,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-05 22:21:38,065 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 24 [2020-10-05 22:21:38,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 22:21:38,070 INFO L225 Difference]: With dead ends: 2291 [2020-10-05 22:21:38,070 INFO L226 Difference]: Without dead ends: 2227 [2020-10-05 22:21:38,071 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2020-10-05 22:21:38,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2227 states. [2020-10-05 22:21:38,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2227 to 2106. [2020-10-05 22:21:38,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2106 states. [2020-10-05 22:21:38,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2106 states to 2106 states and 7279 transitions. [2020-10-05 22:21:38,098 INFO L78 Accepts]: Start accepts. Automaton has 2106 states and 7279 transitions. Word has length 24 [2020-10-05 22:21:38,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 22:21:38,099 INFO L479 AbstractCegarLoop]: Abstraction has 2106 states and 7279 transitions. [2020-10-05 22:21:38,099 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-05 22:21:38,099 INFO L276 IsEmpty]: Start isEmpty. Operand 2106 states and 7279 transitions. [2020-10-05 22:21:38,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-10-05 22:21:38,100 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 22:21:38,101 INFO L422 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] [2020-10-05 22:21:38,101 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2020-10-05 22:21:38,101 INFO L427 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]=== [2020-10-05 22:21:38,101 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 22:21:38,101 INFO L82 PathProgramCache]: Analyzing trace with hash 1793125216, now seen corresponding path program 1 times [2020-10-05 22:21:38,101 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 22:21:38,101 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1512068210] [2020-10-05 22:21:38,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 22:21:38,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 22:21:38,189 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-05 22:21:38,189 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1512068210] [2020-10-05 22:21:38,190 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 22:21:38,190 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-10-05 22:21:38,190 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [517245209] [2020-10-05 22:21:38,190 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-05 22:21:38,190 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 22:21:38,190 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-05 22:21:38,191 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2020-10-05 22:21:38,191 INFO L87 Difference]: Start difference. First operand 2106 states and 7279 transitions. Second operand 9 states. [2020-10-05 22:21:38,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 22:21:38,445 INFO L93 Difference]: Finished difference Result 2954 states and 10228 transitions. [2020-10-05 22:21:38,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-05 22:21:38,446 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 24 [2020-10-05 22:21:38,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 22:21:38,457 INFO L225 Difference]: With dead ends: 2954 [2020-10-05 22:21:38,457 INFO L226 Difference]: Without dead ends: 2930 [2020-10-05 22:21:38,458 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=127, Unknown=0, NotChecked=0, Total=182 [2020-10-05 22:21:38,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2930 states. [2020-10-05 22:21:38,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2930 to 2105. [2020-10-05 22:21:38,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2105 states. [2020-10-05 22:21:38,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2105 states to 2105 states and 7278 transitions. [2020-10-05 22:21:38,531 INFO L78 Accepts]: Start accepts. Automaton has 2105 states and 7278 transitions. Word has length 24 [2020-10-05 22:21:38,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 22:21:38,531 INFO L479 AbstractCegarLoop]: Abstraction has 2105 states and 7278 transitions. [2020-10-05 22:21:38,531 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-05 22:21:38,531 INFO L276 IsEmpty]: Start isEmpty. Operand 2105 states and 7278 transitions. [2020-10-05 22:21:38,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-10-05 22:21:38,535 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 22:21:38,535 INFO L422 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] [2020-10-05 22:21:38,536 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2020-10-05 22:21:38,536 INFO L427 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]=== [2020-10-05 22:21:38,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 22:21:38,536 INFO L82 PathProgramCache]: Analyzing trace with hash 1041351040, now seen corresponding path program 2 times [2020-10-05 22:21:38,537 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 22:21:38,537 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [951428710] [2020-10-05 22:21:38,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 22:21:38,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 22:21:38,699 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-05 22:21:38,700 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [951428710] [2020-10-05 22:21:38,700 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 22:21:38,700 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-10-05 22:21:38,700 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [967991475] [2020-10-05 22:21:38,702 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-10-05 22:21:38,702 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 22:21:38,702 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-10-05 22:21:38,703 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2020-10-05 22:21:38,703 INFO L87 Difference]: Start difference. First operand 2105 states and 7278 transitions. Second operand 10 states. [2020-10-05 22:21:38,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 22:21:38,980 INFO L93 Difference]: Finished difference Result 2941 states and 10205 transitions. [2020-10-05 22:21:38,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-10-05 22:21:38,980 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 24 [2020-10-05 22:21:38,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 22:21:38,987 INFO L225 Difference]: With dead ends: 2941 [2020-10-05 22:21:38,987 INFO L226 Difference]: Without dead ends: 2917 [2020-10-05 22:21:38,987 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=168, Unknown=0, NotChecked=0, Total=240 [2020-10-05 22:21:38,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2917 states. [2020-10-05 22:21:39,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2917 to 2102. [2020-10-05 22:21:39,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2102 states. [2020-10-05 22:21:39,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2102 states to 2102 states and 7274 transitions. [2020-10-05 22:21:39,018 INFO L78 Accepts]: Start accepts. Automaton has 2102 states and 7274 transitions. Word has length 24 [2020-10-05 22:21:39,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 22:21:39,018 INFO L479 AbstractCegarLoop]: Abstraction has 2102 states and 7274 transitions. [2020-10-05 22:21:39,018 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-10-05 22:21:39,018 INFO L276 IsEmpty]: Start isEmpty. Operand 2102 states and 7274 transitions. [2020-10-05 22:21:39,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-10-05 22:21:39,020 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 22:21:39,020 INFO L422 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] [2020-10-05 22:21:39,020 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2020-10-05 22:21:39,020 INFO L427 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]=== [2020-10-05 22:21:39,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 22:21:39,021 INFO L82 PathProgramCache]: Analyzing trace with hash -106935726, now seen corresponding path program 3 times [2020-10-05 22:21:39,021 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 22:21:39,021 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1645355447] [2020-10-05 22:21:39,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 22:21:39,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 22:21:39,161 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-05 22:21:39,161 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1645355447] [2020-10-05 22:21:39,162 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 22:21:39,162 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-10-05 22:21:39,162 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1131821390] [2020-10-05 22:21:39,163 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-10-05 22:21:39,163 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 22:21:39,163 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-10-05 22:21:39,163 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2020-10-05 22:21:39,163 INFO L87 Difference]: Start difference. First operand 2102 states and 7274 transitions. Second operand 11 states. [2020-10-05 22:21:39,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 22:21:39,503 INFO L93 Difference]: Finished difference Result 3197 states and 11098 transitions. [2020-10-05 22:21:39,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-10-05 22:21:39,504 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 24 [2020-10-05 22:21:39,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 22:21:39,511 INFO L225 Difference]: With dead ends: 3197 [2020-10-05 22:21:39,511 INFO L226 Difference]: Without dead ends: 3173 [2020-10-05 22:21:39,512 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=100, Invalid=206, Unknown=0, NotChecked=0, Total=306 [2020-10-05 22:21:39,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3173 states. [2020-10-05 22:21:39,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3173 to 1742. [2020-10-05 22:21:39,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1742 states. [2020-10-05 22:21:39,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1742 states to 1742 states and 5952 transitions. [2020-10-05 22:21:39,562 INFO L78 Accepts]: Start accepts. Automaton has 1742 states and 5952 transitions. Word has length 24 [2020-10-05 22:21:39,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 22:21:39,563 INFO L479 AbstractCegarLoop]: Abstraction has 1742 states and 5952 transitions. [2020-10-05 22:21:39,563 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-10-05 22:21:39,563 INFO L276 IsEmpty]: Start isEmpty. Operand 1742 states and 5952 transitions. [2020-10-05 22:21:39,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-10-05 22:21:39,566 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 22:21:39,566 INFO L422 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] [2020-10-05 22:21:39,567 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2020-10-05 22:21:39,567 INFO L427 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]=== [2020-10-05 22:21:39,567 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 22:21:39,567 INFO L82 PathProgramCache]: Analyzing trace with hash -408101783, now seen corresponding path program 2 times [2020-10-05 22:21:39,568 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 22:21:39,568 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2075502549] [2020-10-05 22:21:39,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 22:21:39,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 22:21:39,632 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-05 22:21:39,632 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2075502549] [2020-10-05 22:21:39,633 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 22:21:39,633 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-05 22:21:39,633 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1596370256] [2020-10-05 22:21:39,633 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-05 22:21:39,633 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 22:21:39,634 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-05 22:21:39,634 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2020-10-05 22:21:39,634 INFO L87 Difference]: Start difference. First operand 1742 states and 5952 transitions. Second operand 7 states. [2020-10-05 22:21:39,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 22:21:39,802 INFO L93 Difference]: Finished difference Result 2236 states and 7383 transitions. [2020-10-05 22:21:39,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-05 22:21:39,803 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 24 [2020-10-05 22:21:39,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 22:21:39,809 INFO L225 Difference]: With dead ends: 2236 [2020-10-05 22:21:39,809 INFO L226 Difference]: Without dead ends: 2172 [2020-10-05 22:21:39,809 INFO L675 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 [2020-10-05 22:21:39,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2172 states. [2020-10-05 22:21:39,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2172 to 1739. [2020-10-05 22:21:39,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1739 states. [2020-10-05 22:21:39,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1739 states to 1739 states and 5947 transitions. [2020-10-05 22:21:39,840 INFO L78 Accepts]: Start accepts. Automaton has 1739 states and 5947 transitions. Word has length 24 [2020-10-05 22:21:39,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 22:21:39,840 INFO L479 AbstractCegarLoop]: Abstraction has 1739 states and 5947 transitions. [2020-10-05 22:21:39,840 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-05 22:21:39,841 INFO L276 IsEmpty]: Start isEmpty. Operand 1739 states and 5947 transitions. [2020-10-05 22:21:39,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-10-05 22:21:39,844 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 22:21:39,844 INFO L422 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] [2020-10-05 22:21:39,844 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2020-10-05 22:21:39,844 INFO L427 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]=== [2020-10-05 22:21:39,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 22:21:39,844 INFO L82 PathProgramCache]: Analyzing trace with hash -1308579191, now seen corresponding path program 3 times [2020-10-05 22:21:39,845 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 22:21:39,845 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1465351373] [2020-10-05 22:21:39,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 22:21:39,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 22:21:39,942 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-05 22:21:39,943 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1465351373] [2020-10-05 22:21:39,943 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 22:21:39,943 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-05 22:21:39,943 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [199685026] [2020-10-05 22:21:39,943 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-05 22:21:39,943 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 22:21:39,944 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-05 22:21:39,944 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2020-10-05 22:21:39,949 INFO L87 Difference]: Start difference. First operand 1739 states and 5947 transitions. Second operand 8 states. [2020-10-05 22:21:40,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 22:21:40,146 INFO L93 Difference]: Finished difference Result 2226 states and 7363 transitions. [2020-10-05 22:21:40,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-05 22:21:40,147 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 24 [2020-10-05 22:21:40,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 22:21:40,152 INFO L225 Difference]: With dead ends: 2226 [2020-10-05 22:21:40,152 INFO L226 Difference]: Without dead ends: 2162 [2020-10-05 22:21:40,153 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2020-10-05 22:21:40,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2162 states. [2020-10-05 22:21:40,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2162 to 1733. [2020-10-05 22:21:40,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1733 states. [2020-10-05 22:21:40,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1733 states to 1733 states and 5933 transitions. [2020-10-05 22:21:40,180 INFO L78 Accepts]: Start accepts. Automaton has 1733 states and 5933 transitions. Word has length 24 [2020-10-05 22:21:40,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 22:21:40,180 INFO L479 AbstractCegarLoop]: Abstraction has 1733 states and 5933 transitions. [2020-10-05 22:21:40,180 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-05 22:21:40,181 INFO L276 IsEmpty]: Start isEmpty. Operand 1733 states and 5933 transitions. [2020-10-05 22:21:40,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-10-05 22:21:40,182 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 22:21:40,182 INFO L422 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] [2020-10-05 22:21:40,183 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2020-10-05 22:21:40,183 INFO L427 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]=== [2020-10-05 22:21:40,183 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 22:21:40,183 INFO L82 PathProgramCache]: Analyzing trace with hash -1370549309, now seen corresponding path program 4 times [2020-10-05 22:21:40,183 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 22:21:40,183 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1070136473] [2020-10-05 22:21:40,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 22:21:40,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 22:21:40,301 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-05 22:21:40,301 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1070136473] [2020-10-05 22:21:40,301 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 22:21:40,301 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-10-05 22:21:40,302 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [234610589] [2020-10-05 22:21:40,302 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-10-05 22:21:40,302 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 22:21:40,302 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-10-05 22:21:40,302 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2020-10-05 22:21:40,303 INFO L87 Difference]: Start difference. First operand 1733 states and 5933 transitions. Second operand 10 states. [2020-10-05 22:21:40,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 22:21:40,503 INFO L93 Difference]: Finished difference Result 2175 states and 7230 transitions. [2020-10-05 22:21:40,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-05 22:21:40,503 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 24 [2020-10-05 22:21:40,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 22:21:40,509 INFO L225 Difference]: With dead ends: 2175 [2020-10-05 22:21:40,509 INFO L226 Difference]: Without dead ends: 2111 [2020-10-05 22:21:40,509 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=98, Unknown=0, NotChecked=0, Total=156 [2020-10-05 22:21:40,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2111 states. [2020-10-05 22:21:40,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2111 to 1733. [2020-10-05 22:21:40,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1733 states. [2020-10-05 22:21:40,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1733 states to 1733 states and 5933 transitions. [2020-10-05 22:21:40,539 INFO L78 Accepts]: Start accepts. Automaton has 1733 states and 5933 transitions. Word has length 24 [2020-10-05 22:21:40,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 22:21:40,540 INFO L479 AbstractCegarLoop]: Abstraction has 1733 states and 5933 transitions. [2020-10-05 22:21:40,540 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-10-05 22:21:40,540 INFO L276 IsEmpty]: Start isEmpty. Operand 1733 states and 5933 transitions. [2020-10-05 22:21:40,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-10-05 22:21:40,542 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 22:21:40,542 INFO L422 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] [2020-10-05 22:21:40,542 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2020-10-05 22:21:40,542 INFO L427 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]=== [2020-10-05 22:21:40,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 22:21:40,543 INFO L82 PathProgramCache]: Analyzing trace with hash -1607134461, now seen corresponding path program 5 times [2020-10-05 22:21:40,543 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 22:21:40,543 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [328416004] [2020-10-05 22:21:40,543 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 22:21:40,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 22:21:40,720 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-05 22:21:40,720 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [328416004] [2020-10-05 22:21:40,720 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 22:21:40,720 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-10-05 22:21:40,720 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1357284350] [2020-10-05 22:21:40,721 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-10-05 22:21:40,721 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 22:21:40,721 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-10-05 22:21:40,721 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2020-10-05 22:21:40,721 INFO L87 Difference]: Start difference. First operand 1733 states and 5933 transitions. Second operand 12 states. [2020-10-05 22:21:41,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 22:21:41,019 INFO L93 Difference]: Finished difference Result 2400 states and 7955 transitions. [2020-10-05 22:21:41,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-05 22:21:41,019 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 24 [2020-10-05 22:21:41,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 22:21:41,025 INFO L225 Difference]: With dead ends: 2400 [2020-10-05 22:21:41,025 INFO L226 Difference]: Without dead ends: 2272 [2020-10-05 22:21:41,026 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=89, Invalid=217, Unknown=0, NotChecked=0, Total=306 [2020-10-05 22:21:41,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2272 states. [2020-10-05 22:21:41,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2272 to 1669. [2020-10-05 22:21:41,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1669 states. [2020-10-05 22:21:41,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1669 states to 1669 states and 5719 transitions. [2020-10-05 22:21:41,060 INFO L78 Accepts]: Start accepts. Automaton has 1669 states and 5719 transitions. Word has length 24 [2020-10-05 22:21:41,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 22:21:41,061 INFO L479 AbstractCegarLoop]: Abstraction has 1669 states and 5719 transitions. [2020-10-05 22:21:41,061 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-10-05 22:21:41,061 INFO L276 IsEmpty]: Start isEmpty. Operand 1669 states and 5719 transitions. [2020-10-05 22:21:41,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-10-05 22:21:41,063 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 22:21:41,064 INFO L422 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] [2020-10-05 22:21:41,064 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2020-10-05 22:21:41,064 INFO L427 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]=== [2020-10-05 22:21:41,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 22:21:41,064 INFO L82 PathProgramCache]: Analyzing trace with hash 1497656527, now seen corresponding path program 6 times [2020-10-05 22:21:41,064 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 22:21:41,065 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [327454779] [2020-10-05 22:21:41,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 22:21:41,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 22:21:41,174 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-05 22:21:41,175 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [327454779] [2020-10-05 22:21:41,175 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 22:21:41,175 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-10-05 22:21:41,176 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [52046961] [2020-10-05 22:21:41,176 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-10-05 22:21:41,176 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 22:21:41,176 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-10-05 22:21:41,176 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2020-10-05 22:21:41,177 INFO L87 Difference]: Start difference. First operand 1669 states and 5719 transitions. Second operand 10 states. [2020-10-05 22:21:41,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 22:21:41,494 INFO L93 Difference]: Finished difference Result 2576 states and 8317 transitions. [2020-10-05 22:21:41,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-05 22:21:41,495 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 24 [2020-10-05 22:21:41,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 22:21:41,499 INFO L225 Difference]: With dead ends: 2576 [2020-10-05 22:21:41,499 INFO L226 Difference]: Without dead ends: 2512 [2020-10-05 22:21:41,500 INFO L675 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 [2020-10-05 22:21:41,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2512 states. [2020-10-05 22:21:41,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2512 to 1489. [2020-10-05 22:21:41,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1489 states. [2020-10-05 22:21:41,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1489 states to 1489 states and 5033 transitions. [2020-10-05 22:21:41,523 INFO L78 Accepts]: Start accepts. Automaton has 1489 states and 5033 transitions. Word has length 24 [2020-10-05 22:21:41,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 22:21:41,523 INFO L479 AbstractCegarLoop]: Abstraction has 1489 states and 5033 transitions. [2020-10-05 22:21:41,523 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-10-05 22:21:41,524 INFO L276 IsEmpty]: Start isEmpty. Operand 1489 states and 5033 transitions. [2020-10-05 22:21:41,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-10-05 22:21:41,525 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 22:21:41,525 INFO L422 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] [2020-10-05 22:21:41,525 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2020-10-05 22:21:41,525 INFO L427 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]=== [2020-10-05 22:21:41,526 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 22:21:41,526 INFO L82 PathProgramCache]: Analyzing trace with hash -1461991345, now seen corresponding path program 1 times [2020-10-05 22:21:41,526 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 22:21:41,526 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [373302583] [2020-10-05 22:21:41,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 22:21:41,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 22:21:41,625 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-05 22:21:41,625 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [373302583] [2020-10-05 22:21:41,625 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 22:21:41,625 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-10-05 22:21:41,626 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1002052062] [2020-10-05 22:21:41,626 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-05 22:21:41,626 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 22:21:41,626 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-05 22:21:41,627 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2020-10-05 22:21:41,627 INFO L87 Difference]: Start difference. First operand 1489 states and 5033 transitions. Second operand 9 states. [2020-10-05 22:21:41,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 22:21:41,836 INFO L93 Difference]: Finished difference Result 2106 states and 6852 transitions. [2020-10-05 22:21:41,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-05 22:21:41,836 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 26 [2020-10-05 22:21:41,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 22:21:41,842 INFO L225 Difference]: With dead ends: 2106 [2020-10-05 22:21:41,843 INFO L226 Difference]: Without dead ends: 2084 [2020-10-05 22:21:41,843 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=127, Unknown=0, NotChecked=0, Total=182 [2020-10-05 22:21:41,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2084 states. [2020-10-05 22:21:41,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2084 to 1488. [2020-10-05 22:21:41,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1488 states. [2020-10-05 22:21:41,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1488 states to 1488 states and 5032 transitions. [2020-10-05 22:21:41,879 INFO L78 Accepts]: Start accepts. Automaton has 1488 states and 5032 transitions. Word has length 26 [2020-10-05 22:21:41,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 22:21:41,879 INFO L479 AbstractCegarLoop]: Abstraction has 1488 states and 5032 transitions. [2020-10-05 22:21:41,879 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-05 22:21:41,880 INFO L276 IsEmpty]: Start isEmpty. Operand 1488 states and 5032 transitions. [2020-10-05 22:21:41,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-10-05 22:21:41,883 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 22:21:41,883 INFO L422 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] [2020-10-05 22:21:41,883 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2020-10-05 22:21:41,884 INFO L427 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]=== [2020-10-05 22:21:41,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 22:21:41,884 INFO L82 PathProgramCache]: Analyzing trace with hash 1932498543, now seen corresponding path program 2 times [2020-10-05 22:21:41,884 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 22:21:41,884 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1167325966] [2020-10-05 22:21:41,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 22:21:41,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 22:21:42,034 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-05 22:21:42,034 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1167325966] [2020-10-05 22:21:42,035 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 22:21:42,035 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-10-05 22:21:42,035 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [861444893] [2020-10-05 22:21:42,035 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-10-05 22:21:42,035 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 22:21:42,036 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-10-05 22:21:42,036 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2020-10-05 22:21:42,036 INFO L87 Difference]: Start difference. First operand 1488 states and 5032 transitions. Second operand 10 states. [2020-10-05 22:21:42,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 22:21:42,292 INFO L93 Difference]: Finished difference Result 2093 states and 6829 transitions. [2020-10-05 22:21:42,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-10-05 22:21:42,293 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 26 [2020-10-05 22:21:42,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 22:21:42,298 INFO L225 Difference]: With dead ends: 2093 [2020-10-05 22:21:42,298 INFO L226 Difference]: Without dead ends: 2071 [2020-10-05 22:21:42,298 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=168, Unknown=0, NotChecked=0, Total=240 [2020-10-05 22:21:42,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2071 states. [2020-10-05 22:21:42,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2071 to 1485. [2020-10-05 22:21:42,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1485 states. [2020-10-05 22:21:42,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1485 states to 1485 states and 5028 transitions. [2020-10-05 22:21:42,319 INFO L78 Accepts]: Start accepts. Automaton has 1485 states and 5028 transitions. Word has length 26 [2020-10-05 22:21:42,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 22:21:42,319 INFO L479 AbstractCegarLoop]: Abstraction has 1485 states and 5028 transitions. [2020-10-05 22:21:42,319 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-10-05 22:21:42,319 INFO L276 IsEmpty]: Start isEmpty. Operand 1485 states and 5028 transitions. [2020-10-05 22:21:42,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-10-05 22:21:42,321 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 22:21:42,321 INFO L422 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] [2020-10-05 22:21:42,321 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2020-10-05 22:21:42,321 INFO L427 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]=== [2020-10-05 22:21:42,321 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 22:21:42,321 INFO L82 PathProgramCache]: Analyzing trace with hash 443766965, now seen corresponding path program 3 times [2020-10-05 22:21:42,321 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 22:21:42,322 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [321027801] [2020-10-05 22:21:42,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 22:21:42,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 22:21:42,476 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-05 22:21:42,476 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [321027801] [2020-10-05 22:21:42,476 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 22:21:42,476 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-10-05 22:21:42,476 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [258198526] [2020-10-05 22:21:42,477 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-10-05 22:21:42,477 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 22:21:42,477 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-10-05 22:21:42,477 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2020-10-05 22:21:42,477 INFO L87 Difference]: Start difference. First operand 1485 states and 5028 transitions. Second operand 12 states. [2020-10-05 22:21:42,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 22:21:42,867 INFO L93 Difference]: Finished difference Result 1538 states and 4992 transitions. [2020-10-05 22:21:42,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-10-05 22:21:42,868 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 26 [2020-10-05 22:21:42,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 22:21:42,872 INFO L225 Difference]: With dead ends: 1538 [2020-10-05 22:21:42,872 INFO L226 Difference]: Without dead ends: 1494 [2020-10-05 22:21:42,872 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=123, Invalid=257, Unknown=0, NotChecked=0, Total=380 [2020-10-05 22:21:42,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1494 states. [2020-10-05 22:21:42,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1494 to 885. [2020-10-05 22:21:42,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 885 states. [2020-10-05 22:21:42,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 885 states to 885 states and 3033 transitions. [2020-10-05 22:21:42,887 INFO L78 Accepts]: Start accepts. Automaton has 885 states and 3033 transitions. Word has length 26 [2020-10-05 22:21:42,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 22:21:42,888 INFO L479 AbstractCegarLoop]: Abstraction has 885 states and 3033 transitions. [2020-10-05 22:21:42,888 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-10-05 22:21:42,888 INFO L276 IsEmpty]: Start isEmpty. Operand 885 states and 3033 transitions. [2020-10-05 22:21:42,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2020-10-05 22:21:42,889 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 22:21:42,890 INFO L422 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] [2020-10-05 22:21:42,890 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2020-10-05 22:21:42,890 INFO L427 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]=== [2020-10-05 22:21:42,890 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 22:21:42,890 INFO L82 PathProgramCache]: Analyzing trace with hash -416507732, now seen corresponding path program 1 times [2020-10-05 22:21:42,890 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 22:21:42,890 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [419244883] [2020-10-05 22:21:42,890 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 22:21:42,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 22:21:42,983 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-05 22:21:42,983 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [419244883] [2020-10-05 22:21:42,984 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 22:21:42,984 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-10-05 22:21:42,984 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [450650180] [2020-10-05 22:21:42,984 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-05 22:21:42,985 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 22:21:42,985 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-05 22:21:42,985 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2020-10-05 22:21:42,985 INFO L87 Difference]: Start difference. First operand 885 states and 3033 transitions. Second operand 8 states. [2020-10-05 22:21:43,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 22:21:43,168 INFO L93 Difference]: Finished difference Result 885 states and 3029 transitions. [2020-10-05 22:21:43,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-05 22:21:43,168 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 41 [2020-10-05 22:21:43,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 22:21:43,172 INFO L225 Difference]: With dead ends: 885 [2020-10-05 22:21:43,172 INFO L226 Difference]: Without dead ends: 879 [2020-10-05 22:21:43,173 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2020-10-05 22:21:43,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 879 states. [2020-10-05 22:21:43,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 879 to 879. [2020-10-05 22:21:43,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 879 states. [2020-10-05 22:21:43,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 879 states to 879 states and 3010 transitions. [2020-10-05 22:21:43,196 INFO L78 Accepts]: Start accepts. Automaton has 879 states and 3010 transitions. Word has length 41 [2020-10-05 22:21:43,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 22:21:43,197 INFO L479 AbstractCegarLoop]: Abstraction has 879 states and 3010 transitions. [2020-10-05 22:21:43,197 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-05 22:21:43,197 INFO L276 IsEmpty]: Start isEmpty. Operand 879 states and 3010 transitions. [2020-10-05 22:21:43,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2020-10-05 22:21:43,201 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 22:21:43,201 INFO L422 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] [2020-10-05 22:21:43,201 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2020-10-05 22:21:43,201 INFO L427 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]=== [2020-10-05 22:21:43,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 22:21:43,202 INFO L82 PathProgramCache]: Analyzing trace with hash 829092404, now seen corresponding path program 1 times [2020-10-05 22:21:43,202 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 22:21:43,202 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [647930843] [2020-10-05 22:21:43,202 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 22:21:43,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 22:21:43,299 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-05 22:21:43,300 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [647930843] [2020-10-05 22:21:43,300 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 22:21:43,300 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-10-05 22:21:43,300 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1311027569] [2020-10-05 22:21:43,301 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-05 22:21:43,301 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 22:21:43,301 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-05 22:21:43,301 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2020-10-05 22:21:43,302 INFO L87 Difference]: Start difference. First operand 879 states and 3010 transitions. Second operand 8 states. [2020-10-05 22:21:43,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 22:21:43,456 INFO L93 Difference]: Finished difference Result 879 states and 3006 transitions. [2020-10-05 22:21:43,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-05 22:21:43,457 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 41 [2020-10-05 22:21:43,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 22:21:43,460 INFO L225 Difference]: With dead ends: 879 [2020-10-05 22:21:43,460 INFO L226 Difference]: Without dead ends: 819 [2020-10-05 22:21:43,460 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2020-10-05 22:21:43,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 819 states. [2020-10-05 22:21:43,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 819 to 819. [2020-10-05 22:21:43,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 819 states. [2020-10-05 22:21:43,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 819 states to 819 states and 2784 transitions. [2020-10-05 22:21:43,477 INFO L78 Accepts]: Start accepts. Automaton has 819 states and 2784 transitions. Word has length 41 [2020-10-05 22:21:43,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 22:21:43,477 INFO L479 AbstractCegarLoop]: Abstraction has 819 states and 2784 transitions. [2020-10-05 22:21:43,477 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-05 22:21:43,477 INFO L276 IsEmpty]: Start isEmpty. Operand 819 states and 2784 transitions. [2020-10-05 22:21:43,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2020-10-05 22:21:43,480 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 22:21:43,480 INFO L422 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] [2020-10-05 22:21:43,480 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2020-10-05 22:21:43,480 INFO L427 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]=== [2020-10-05 22:21:43,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 22:21:43,480 INFO L82 PathProgramCache]: Analyzing trace with hash 1378914744, now seen corresponding path program 1 times [2020-10-05 22:21:43,481 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 22:21:43,481 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [347887271] [2020-10-05 22:21:43,481 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 22:21:43,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-05 22:21:43,503 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-05 22:21:43,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-05 22:21:43,524 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-05 22:21:43,571 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-05 22:21:43,572 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-10-05 22:21:43,572 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2020-10-05 22:21:43,690 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.10 10:21:43 BasicIcfg [2020-10-05 22:21:43,690 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-05 22:21:43,698 INFO L168 Benchmark]: Toolchain (without parser) took 27678.82 ms. Allocated memory was 138.4 MB in the beginning and 952.1 MB in the end (delta: 813.7 MB). Free memory was 99.3 MB in the beginning and 772.4 MB in the end (delta: -673.1 MB). Peak memory consumption was 140.6 MB. Max. memory is 7.1 GB. [2020-10-05 22:21:43,698 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 138.4 MB. Free memory was 119.9 MB in the beginning and 119.7 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2020-10-05 22:21:43,699 INFO L168 Benchmark]: CACSL2BoogieTranslator took 917.93 ms. Allocated memory was 138.4 MB in the beginning and 201.3 MB in the end (delta: 62.9 MB). Free memory was 99.1 MB in the beginning and 120.3 MB in the end (delta: -21.2 MB). Peak memory consumption was 46.9 MB. Max. memory is 7.1 GB. [2020-10-05 22:21:43,699 INFO L168 Benchmark]: Boogie Procedure Inliner took 60.46 ms. Allocated memory is still 201.3 MB. Free memory was 120.3 MB in the beginning and 118.3 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. [2020-10-05 22:21:43,699 INFO L168 Benchmark]: Boogie Preprocessor took 29.88 ms. Allocated memory is still 201.3 MB. Free memory was 118.3 MB in the beginning and 116.2 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. [2020-10-05 22:21:43,700 INFO L168 Benchmark]: RCFGBuilder took 517.69 ms. Allocated memory is still 201.3 MB. Free memory was 116.2 MB in the beginning and 89.3 MB in the end (delta: 27.0 MB). Peak memory consumption was 27.0 MB. Max. memory is 7.1 GB. [2020-10-05 22:21:43,700 INFO L168 Benchmark]: TraceAbstraction took 26141.16 ms. Allocated memory was 201.3 MB in the beginning and 952.1 MB in the end (delta: 750.8 MB). Free memory was 89.3 MB in the beginning and 772.4 MB in the end (delta: -683.2 MB). Peak memory consumption was 67.6 MB. Max. memory is 7.1 GB. [2020-10-05 22:21:43,705 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.24 ms. Allocated memory is still 138.4 MB. Free memory was 119.9 MB in the beginning and 119.7 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 917.93 ms. Allocated memory was 138.4 MB in the beginning and 201.3 MB in the end (delta: 62.9 MB). Free memory was 99.1 MB in the beginning and 120.3 MB in the end (delta: -21.2 MB). Peak memory consumption was 46.9 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 60.46 ms. Allocated memory is still 201.3 MB. Free memory was 120.3 MB in the beginning and 118.3 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 29.88 ms. Allocated memory is still 201.3 MB. Free memory was 118.3 MB in the beginning and 116.2 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 517.69 ms. Allocated memory is still 201.3 MB. Free memory was 116.2 MB in the beginning and 89.3 MB in the end (delta: 27.0 MB). Peak memory consumption was 27.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 26141.16 ms. Allocated memory was 201.3 MB in the beginning and 952.1 MB in the end (delta: 750.8 MB). Free memory was 89.3 MB in the beginning and 772.4 MB in the end (delta: -683.2 MB). Peak memory consumption was 67.6 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 2.3s, 172 ProgramPointsBefore, 101 ProgramPointsAfterwards, 243 TransitionsBefore, 173 TransitionsAfterwards, 4038 CoEnabledTransitionPairs, 6 FixpointIterations, 23 TrivialSequentialCompositions, 48 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 4 ConcurrentYvCompositions, 1 ChoiceCompositions, 1507 VarBasedMoverChecksPositive, 11 VarBasedMoverChecksNegative, 2 SemBasedMoverChecksPositive, 9 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 2242 CheckedPairsTotal, 75 TotalNumberOfCompositions - CounterExampleResult [Line: 1088]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L1089] 0 char *v; [L1122] 0 pthread_t t; [L1123] FCALL, FORK 0 pthread_create(&t, 0, thread0, 0) VAL [arg={0:0}, v={0:0}] [L1107] 1 pthread_t t1, t2, t3, t4, t5; [L1108] FCALL, FORK 1 pthread_create(&t1, 0, thread1, 0) VAL [arg={0:0}, arg={0:0}, arg={0:0}, t1={8:0}, t2={11:0}, t3={10:0}, t4={13:0}, t5={12:0}, v={0:0}] [L1109] 1 \read(t1) VAL [\read(t1)=0, arg={0:0}, arg={0:0}, arg={0:0}, t1={8:0}, t2={11:0}, t3={10:0}, t4={13:0}, t5={12:0}, v={0:0}] [L1124] 0 \read(t) VAL [\read(t1)=0, arg={0:0}, arg={0:0}, arg={0:0}, t1={8:0}, t2={11:0}, t3={10:0}, t4={13:0}, t5={12:0}, v={0:0}] [L1092] 2 v = malloc(sizeof(char)) [L1093] 2 return 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))={6:0}, t1={8:0}, t2={11:0}, t3={10:0}, t4={13:0}, t5={12:0}, v={6: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))={6:0}, t1={8:0}, t2={11:0}, t3={10:0}, t4={13:0}, t5={12:0}, v={6:0}] [L1097] 3 v[0] = 'X' [L1098] 3 return 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))={6:0}, t1={8:0}, t2={11:0}, t3={10:0}, t4={13:0}, t5={12:0}, v={6: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))={6:0}, t1={8:0}, t2={11:0}, t3={10:0}, t4={13:0}, t5={12:0}, v={6: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))={6:0}, t1={8:0}, t2={11:0}, t3={10:0}, t4={13:0}, t5={12:0}, v={6:0}] [L1114] 1 \read(t2) 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))={6:0}, t1={8:0}, t2={11:0}, t3={10:0}, t4={13:0}, t5={12:0}, v={6: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))={6:0}, t1={8:0}, t2={11:0}, t3={10:0}, t4={13:0}, t5={12:0}, v={6: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))={6:0}, t1={8:0}, t2={11:0}, t3={10:0}, t4={13:0}, t5={12:0}, v={6:0}] [L1097] 6 v[0] = 'X' [L1098] 6 return 0; [L1097] 5 v[0] = 'X' [L1098] 5 return 0; [L1102] 4 v[0] = 'Y' [L1103] 4 return 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))={6:0}, t1={8:0}, t2={11:0}, t3={10:0}, t4={13:0}, t5={12:0}, v={6: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))={6:0}, t1={8:0}, t2={11:0}, t3={10:0}, t4={13:0}, t5={12:0}, v={6: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))={6:0}, t1={8:0}, t2={11:0}, t3={10:0}, t4={13:0}, t5={12:0}, v={6: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))={6:0}, t1={8:0}, t2={11:0}, t3={10:0}, t4={13:0}, t5={12:0}, v={6: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))={6:0}, t1={8:0}, t2={11:0}, t3={10:0}, t4={13:0}, t5={12:0}, v={6:0}] [L1118] 1 return 0; [L1118] 1 return 0; [L1118] 1 return 0; [L1118] 1 return 0; [L1118] 1 return 0; [L1118] 1 return 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))={6:0}, v={6:0}] [L1125] 0 v[0] [L1088] COND TRUE 0 !expression [L1088] 0 __VERIFIER_error() 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))={6:0}, v={6:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 92 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 25.6s, OverallIterations: 43, TraceHistogramMax: 1, AutomataDifference: 13.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 2.9s, HoareTripleCheckerStatistics: 4482 SDtfs, 7573 SDslu, 12200 SDs, 0 SdLazy, 7382 SolverSat, 970 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 6.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 505 GetRequests, 46 SyntacticMatches, 7 SemanticMatches, 452 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 374 ImplicationChecksByTransitivity, 5.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=4270occurred in iteration=17, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 3.9s AutomataMinimizationTime, 42 MinimizatonAttempts, 39550 StatesRemovedByMinimization, 40 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 4.1s InterpolantComputationTime, 958 NumberOfCodeBlocks, 958 NumberOfCodeBlocksAsserted, 43 NumberOfCheckSat, 875 ConstructedInterpolants, 0 QuantifiedInterpolants, 209371 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 42 InterpolantComputations, 42 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...