/usr/bin/java -Xmx16000000000 -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-11af1e5 [2020-10-09 11:02:57,762 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-09 11:02:57,764 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-09 11:02:57,791 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-09 11:02:57,791 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-09 11:02:57,792 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-09 11:02:57,794 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-09 11:02:57,796 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-09 11:02:57,798 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-09 11:02:57,798 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-09 11:02:57,799 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-09 11:02:57,800 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-09 11:02:57,801 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-09 11:02:57,802 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-09 11:02:57,803 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-09 11:02:57,804 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-09 11:02:57,805 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-09 11:02:57,806 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-09 11:02:57,807 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-09 11:02:57,810 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-09 11:02:57,811 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-09 11:02:57,813 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-09 11:02:57,814 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-09 11:02:57,815 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-09 11:02:57,818 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-09 11:02:57,818 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-09 11:02:57,818 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-09 11:02:57,819 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-09 11:02:57,820 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-09 11:02:57,821 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-09 11:02:57,821 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-09 11:02:57,822 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-09 11:02:57,823 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-09 11:02:57,824 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-09 11:02:57,825 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-09 11:02:57,825 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-09 11:02:57,826 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-09 11:02:57,826 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-09 11:02:57,826 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-09 11:02:57,827 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-09 11:02:57,828 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-09 11:02:57,828 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-09 11:02:57,852 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-09 11:02:57,852 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-09 11:02:57,853 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-09 11:02:57,854 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-09 11:02:57,854 INFO L138 SettingsManager]: * Use SBE=true [2020-10-09 11:02:57,854 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-09 11:02:57,854 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-09 11:02:57,854 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-09 11:02:57,855 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-09 11:02:57,855 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-09 11:02:57,855 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-09 11:02:57,855 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-09 11:02:57,855 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-09 11:02:57,856 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-09 11:02:57,856 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-09 11:02:57,856 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-09 11:02:57,856 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-09 11:02:57,856 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-09 11:02:57,856 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-09 11:02:57,857 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-09 11:02:57,857 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-09 11:02:57,857 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-09 11:02:57,857 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-09 11:02:57,857 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-10-09 11:02:57,858 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-09 11:02:57,858 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-09 11:02:57,858 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-09 11:02:57,858 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-10-09 11:02:57,858 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-10-09 11:02:57,859 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-10-09 11:02:58,167 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-09 11:02:58,179 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-09 11:02:58,183 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-09 11:02:58,185 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-09 11:02:58,185 INFO L275 PluginConnector]: CDTParser initialized [2020-10-09 11:02:58,186 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread/singleton.i [2020-10-09 11:02:58,250 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d4f4d0e5f/f2ddc90307d14e299adaa48dc37c84bc/FLAG01510e869 [2020-10-09 11:02:58,812 INFO L306 CDTParser]: Found 1 translation units. [2020-10-09 11:02:58,813 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread/singleton.i [2020-10-09 11:02:58,848 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d4f4d0e5f/f2ddc90307d14e299adaa48dc37c84bc/FLAG01510e869 [2020-10-09 11:02:59,114 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d4f4d0e5f/f2ddc90307d14e299adaa48dc37c84bc [2020-10-09 11:02:59,125 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-09 11:02:59,127 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-10-09 11:02:59,129 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-09 11:02:59,129 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-09 11:02:59,133 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-09 11:02:59,134 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.10 11:02:59" (1/1) ... [2020-10-09 11:02:59,136 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4f4500e1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.10 11:02:59, skipping insertion in model container [2020-10-09 11:02:59,137 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.10 11:02:59" (1/1) ... [2020-10-09 11:02:59,144 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-09 11:02:59,195 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-09 11:02:59,797 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-09 11:02:59,808 INFO L203 MainTranslator]: Completed pre-run [2020-10-09 11:02:59,863 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-09 11:03:00,046 INFO L208 MainTranslator]: Completed translation [2020-10-09 11:03:00,046 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.10 11:03:00 WrapperNode [2020-10-09 11:03:00,046 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-09 11:03:00,047 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-09 11:03:00,047 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-09 11:03:00,048 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-09 11:03:00,058 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.10 11:03:00" (1/1) ... [2020-10-09 11:03:00,081 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.10 11:03:00" (1/1) ... [2020-10-09 11:03:00,109 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-09 11:03:00,110 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-09 11:03:00,110 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-09 11:03:00,110 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-09 11:03:00,124 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.10 11:03:00" (1/1) ... [2020-10-09 11:03:00,124 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.10 11:03:00" (1/1) ... [2020-10-09 11:03:00,128 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.10 11:03:00" (1/1) ... [2020-10-09 11:03:00,128 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.10 11:03:00" (1/1) ... [2020-10-09 11:03:00,137 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.10 11:03:00" (1/1) ... [2020-10-09 11:03:00,140 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.10 11:03:00" (1/1) ... [2020-10-09 11:03:00,142 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.10 11:03:00" (1/1) ... [2020-10-09 11:03:00,146 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-09 11:03:00,147 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-09 11:03:00,147 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-09 11:03:00,147 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-09 11:03:00,148 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.10 11:03:00" (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-09 11:03:00,231 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-09 11:03:00,231 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-09 11:03:00,231 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-10-09 11:03:00,231 INFO L130 BoogieDeclarations]: Found specification of procedure thread0 [2020-10-09 11:03:00,231 INFO L138 BoogieDeclarations]: Found implementation of procedure thread0 [2020-10-09 11:03:00,232 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2020-10-09 11:03:00,232 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2020-10-09 11:03:00,232 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2020-10-09 11:03:00,232 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2020-10-09 11:03:00,233 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2020-10-09 11:03:00,233 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2020-10-09 11:03:00,233 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-09 11:03:00,233 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2020-10-09 11:03:00,233 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-09 11:03:00,234 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-09 11:03:00,235 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2020-10-09 11:03:00,633 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-09 11:03:00,634 INFO L298 CfgBuilder]: Removed 6 assume(true) statements. [2020-10-09 11:03:00,636 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.10 11:03:00 BoogieIcfgContainer [2020-10-09 11:03:00,636 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-09 11:03:00,637 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-09 11:03:00,638 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-09 11:03:00,641 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-09 11:03:00,641 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.10 11:02:59" (1/3) ... [2020-10-09 11:03:00,642 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@14b603bc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.10 11:03:00, skipping insertion in model container [2020-10-09 11:03:00,642 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.10 11:03:00" (2/3) ... [2020-10-09 11:03:00,643 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@14b603bc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.10 11:03:00, skipping insertion in model container [2020-10-09 11:03:00,643 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.10 11:03:00" (3/3) ... [2020-10-09 11:03:00,645 INFO L111 eAbstractionObserver]: Analyzing ICFG singleton.i [2020-10-09 11:03:00,658 WARN L153 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2020-10-09 11:03:00,659 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-10-09 11:03:00,668 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-10-09 11:03:00,669 INFO L348 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-10-09 11:03:00,714 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 11:03:00,714 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 11:03:00,714 WARN L313 ript$VariableManager]: TermVariabe thread0Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 11:03:00,715 WARN L313 ript$VariableManager]: TermVariabe thread0Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 11:03:00,715 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 11:03:00,715 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t1~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 11:03:00,716 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t2~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 11:03:00,716 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 11:03:00,716 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 11:03:00,717 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t3~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 11:03:00,717 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t4~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 11:03:00,717 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t4~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 11:03:00,718 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t5~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 11:03:00,718 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t5~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 11:03:00,718 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 11:03:00,719 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t1~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 11:03:00,719 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 11:03:00,719 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 11:03:00,720 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t1~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 11:03:00,720 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#t~mem4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 11:03:00,721 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#t~mem4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 11:03:00,721 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t2~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 11:03:00,721 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 11:03:00,722 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 11:03:00,722 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 11:03:00,722 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t3~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 11:03:00,723 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 11:03:00,723 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t4~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 11:03:00,723 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t4~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 11:03:00,723 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#t~nondet7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 11:03:00,724 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t5~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 11:03:00,724 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t5~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 11:03:00,724 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#t~nondet8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 11:03:00,724 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t2~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 11:03:00,725 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 11:03:00,725 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 11:03:00,725 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 11:03:00,726 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 11:03:00,726 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t3~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 11:03:00,726 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#t~mem10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 11:03:00,726 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#t~mem10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 11:03:00,727 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t4~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 11:03:00,727 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t4~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 11:03:00,727 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#t~mem11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 11:03:00,727 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#t~mem11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 11:03:00,728 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t5~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 11:03:00,728 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t5~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 11:03:00,728 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#t~mem12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 11:03:00,729 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#t~mem12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 11:03:00,729 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 11:03:00,729 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 11:03:00,729 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 11:03:00,730 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 11:03:00,730 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t1~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 11:03:00,730 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 11:03:00,731 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 11:03:00,731 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t2~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 11:03:00,731 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 11:03:00,731 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t3~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 11:03:00,732 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 11:03:00,732 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t4~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 11:03:00,732 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t4~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 11:03:00,732 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t4~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 11:03:00,733 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t5~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 11:03:00,733 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t5~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 11:03:00,733 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t5~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 11:03:00,734 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork4_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 11:03:00,734 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork4_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 11:03:00,734 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork4_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 11:03:00,734 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork4_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 11:03:00,734 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork4_#t~malloc2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 11:03:00,734 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork4_#t~malloc2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 11:03:00,735 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork4_#t~malloc2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 11:03:00,735 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork4_#t~malloc2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 11:03:00,735 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork4_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 11:03:00,735 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork4_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 11:03:00,736 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 11:03:00,736 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 11:03:00,736 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 11:03:00,736 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 11:03:00,737 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 11:03:00,737 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 11:03:00,738 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 11:03:00,738 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 11:03:00,738 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 11:03:00,738 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 11:03:00,739 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 11:03:00,739 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 11:03:00,739 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork5_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 11:03:00,739 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork5_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 11:03:00,740 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork5_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 11:03:00,740 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork5_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 11:03:00,740 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork5_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 11:03:00,740 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork5_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 11:03:00,741 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 11:03:00,741 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 11:03:00,741 WARN L313 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 11:03:00,741 WARN L313 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 11:03:00,742 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 11:03:00,742 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 11:03:00,746 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 11:03:00,746 WARN L313 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 11:03:00,747 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 11:03:00,747 WARN L313 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 11:03:00,753 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 11:03:00,753 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 11:03:00,753 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 11:03:00,754 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 11:03:00,756 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 11:03:00,756 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 11:03:00,757 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 11:03:00,757 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 11:03:00,759 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#t~nondet8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 11:03:00,760 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#t~mem4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 11:03:00,760 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 11:03:00,760 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t4~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 11:03:00,761 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t2~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 11:03:00,761 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 11:03:00,761 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 11:03:00,761 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#t~mem10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 11:03:00,762 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#t~mem11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 11:03:00,762 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t4~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 11:03:00,762 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#t~mem12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 11:03:00,762 WARN L313 ript$VariableManager]: TermVariabe thread0Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 11:03:00,762 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t3~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 11:03:00,763 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 11:03:00,763 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 11:03:00,763 WARN L313 ript$VariableManager]: TermVariabe thread0Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 11:03:00,763 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 11:03:00,764 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t1~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 11:03:00,764 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t5~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 11:03:00,764 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 11:03:00,764 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t5~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 11:03:00,765 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 11:03:00,765 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 11:03:00,765 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#t~nondet7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 11:03:00,778 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork4_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 11:03:00,778 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork4_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 11:03:00,779 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork4_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 11:03:00,779 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork4_#t~malloc2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 11:03:00,779 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork4_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 11:03:00,779 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork4_#t~malloc2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 11:03:00,785 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork5_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 11:03:00,785 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork5_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 11:03:00,786 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork5_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 11:03:00,786 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork5_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 11:03:00,796 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork4_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 11:03:00,796 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork4_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 11:03:00,796 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork4_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 11:03:00,797 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork4_#t~malloc2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 11:03:00,797 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork4_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 11:03:00,797 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork4_#t~malloc2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 11:03:00,800 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork5_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 11:03:00,800 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork5_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 11:03:00,800 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork5_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 11:03:00,801 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork5_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 11:03:00,806 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 11:03:00,807 WARN L313 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 11:03:00,807 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 11:03:00,807 WARN L313 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 11:03:00,810 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 11:03:00,810 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 11:03:00,810 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 11:03:00,810 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 11:03:00,814 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 11:03:00,814 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 11:03:00,814 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 11:03:00,814 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 11:03:01,106 INFO L253 AbstractCegarLoop]: Starting to check reachability of 12 error locations. [2020-10-09 11:03:01,125 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-09 11:03:01,125 INFO L378 AbstractCegarLoop]: Hoare is true [2020-10-09 11:03:01,125 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-10-09 11:03:01,125 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-09 11:03:01,125 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-09 11:03:01,125 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-09 11:03:01,125 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-09 11:03:01,126 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-09 11:03:01,146 INFO L129 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2020-10-09 11:03:01,149 INFO L144 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 172 places, 243 transitions, 866 flow [2020-10-09 11:03:01,152 INFO L111 LiptonReduction]: Starting Lipton reduction on Petri net that has 172 places, 243 transitions, 866 flow [2020-10-09 11:03:01,154 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 172 places, 243 transitions, 866 flow [2020-10-09 11:03:01,257 INFO L129 PetriNetUnfolder]: 61/264 cut-off events. [2020-10-09 11:03:01,257 INFO L130 PetriNetUnfolder]: For 39/39 co-relation queries the response was YES. [2020-10-09 11:03:01,268 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-09 11:03:01,279 INFO L117 LiptonReduction]: Number of co-enabled transitions 4038 [2020-10-09 11:03:03,103 WARN L193 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 77 [2020-10-09 11:03:03,218 WARN L193 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 73 [2020-10-09 11:03:03,495 INFO L132 LiptonReduction]: Checked pairs total: 47722 [2020-10-09 11:03:03,495 INFO L134 LiptonReduction]: Total number of compositions: 76 [2020-10-09 11:03:03,502 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 101 places, 173 transitions, 726 flow [2020-10-09 11:03:04,126 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 3502 states. [2020-10-09 11:03:04,129 INFO L276 IsEmpty]: Start isEmpty. Operand 3502 states. [2020-10-09 11:03:04,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-10-09 11:03:04,135 INFO L413 BasicCegarLoop]: Found error trace [2020-10-09 11:03:04,136 INFO L421 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 11:03:04,137 INFO L429 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-09 11:03:04,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 11:03:04,143 INFO L82 PathProgramCache]: Analyzing trace with hash 1069688068, now seen corresponding path program 1 times [2020-10-09 11:03:04,154 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-09 11:03:04,154 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1639073912] [2020-10-09 11:03:04,155 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-09 11:03:04,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 11:03:04,422 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-09 11:03:04,423 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1639073912] [2020-10-09 11:03:04,424 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-09 11:03:04,424 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-09 11:03:04,424 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2103389813] [2020-10-09 11:03:04,430 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-09 11:03:04,430 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-09 11:03:04,446 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-09 11:03:04,447 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-10-09 11:03:04,449 INFO L87 Difference]: Start difference. First operand 3502 states. Second operand 6 states. [2020-10-09 11:03:04,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-09 11:03:04,840 INFO L93 Difference]: Finished difference Result 4760 states and 19900 transitions. [2020-10-09 11:03:04,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-09 11:03:04,842 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 9 [2020-10-09 11:03:04,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-09 11:03:04,907 INFO L225 Difference]: With dead ends: 4760 [2020-10-09 11:03:04,907 INFO L226 Difference]: Without dead ends: 4272 [2020-10-09 11:03:04,908 INFO L673 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-09 11:03:04,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4272 states. [2020-10-09 11:03:05,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4272 to 3018. [2020-10-09 11:03:05,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3018 states. [2020-10-09 11:03:05,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3018 states to 3018 states and 12272 transitions. [2020-10-09 11:03:05,212 INFO L78 Accepts]: Start accepts. Automaton has 3018 states and 12272 transitions. Word has length 9 [2020-10-09 11:03:05,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-09 11:03:05,213 INFO L481 AbstractCegarLoop]: Abstraction has 3018 states and 12272 transitions. [2020-10-09 11:03:05,214 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-09 11:03:05,217 INFO L276 IsEmpty]: Start isEmpty. Operand 3018 states and 12272 transitions. [2020-10-09 11:03:05,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-10-09 11:03:05,218 INFO L413 BasicCegarLoop]: Found error trace [2020-10-09 11:03:05,218 INFO L421 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 11:03:05,227 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-09 11:03:05,227 INFO L429 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-09 11:03:05,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 11:03:05,228 INFO L82 PathProgramCache]: Analyzing trace with hash 1263032832, now seen corresponding path program 2 times [2020-10-09 11:03:05,230 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-09 11:03:05,230 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2085188257] [2020-10-09 11:03:05,231 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-09 11:03:05,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 11:03:05,414 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-09 11:03:05,415 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2085188257] [2020-10-09 11:03:05,415 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-09 11:03:05,415 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-09 11:03:05,416 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [462189086] [2020-10-09 11:03:05,417 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-09 11:03:05,417 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-09 11:03:05,418 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-09 11:03:05,418 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-10-09 11:03:05,418 INFO L87 Difference]: Start difference. First operand 3018 states and 12272 transitions. Second operand 6 states. [2020-10-09 11:03:05,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-09 11:03:05,843 INFO L93 Difference]: Finished difference Result 5518 states and 23821 transitions. [2020-10-09 11:03:05,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-09 11:03:05,843 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 9 [2020-10-09 11:03:05,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-09 11:03:05,900 INFO L225 Difference]: With dead ends: 5518 [2020-10-09 11:03:05,901 INFO L226 Difference]: Without dead ends: 5518 [2020-10-09 11:03:05,902 INFO L673 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-09 11:03:05,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5518 states. [2020-10-09 11:03:06,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5518 to 3008. [2020-10-09 11:03:06,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3008 states. [2020-10-09 11:03:06,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3008 states to 3008 states and 12255 transitions. [2020-10-09 11:03:06,137 INFO L78 Accepts]: Start accepts. Automaton has 3008 states and 12255 transitions. Word has length 9 [2020-10-09 11:03:06,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-09 11:03:06,137 INFO L481 AbstractCegarLoop]: Abstraction has 3008 states and 12255 transitions. [2020-10-09 11:03:06,137 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-09 11:03:06,137 INFO L276 IsEmpty]: Start isEmpty. Operand 3008 states and 12255 transitions. [2020-10-09 11:03:06,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-10-09 11:03:06,139 INFO L413 BasicCegarLoop]: Found error trace [2020-10-09 11:03:06,139 INFO L421 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 11:03:06,140 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-09 11:03:06,140 INFO L429 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-09 11:03:06,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 11:03:06,140 INFO L82 PathProgramCache]: Analyzing trace with hash -690496787, now seen corresponding path program 1 times [2020-10-09 11:03:06,141 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-09 11:03:06,141 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1789147312] [2020-10-09 11:03:06,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-09 11:03:06,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 11:03:06,202 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-09 11:03:06,202 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1789147312] [2020-10-09 11:03:06,202 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-09 11:03:06,203 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-09 11:03:06,203 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [629225372] [2020-10-09 11:03:06,203 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 11:03:06,203 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-09 11:03:06,204 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 11:03:06,204 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 11:03:06,204 INFO L87 Difference]: Start difference. First operand 3008 states and 12255 transitions. Second operand 3 states. [2020-10-09 11:03:06,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-09 11:03:06,323 INFO L93 Difference]: Finished difference Result 4848 states and 19273 transitions. [2020-10-09 11:03:06,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 11:03:06,323 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2020-10-09 11:03:06,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-09 11:03:06,354 INFO L225 Difference]: With dead ends: 4848 [2020-10-09 11:03:06,354 INFO L226 Difference]: Without dead ends: 3558 [2020-10-09 11:03:06,355 INFO L673 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-09 11:03:06,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3558 states. [2020-10-09 11:03:06,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3558 to 3181. [2020-10-09 11:03:06,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3181 states. [2020-10-09 11:03:06,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3181 states to 3181 states and 12171 transitions. [2020-10-09 11:03:06,501 INFO L78 Accepts]: Start accepts. Automaton has 3181 states and 12171 transitions. Word has length 16 [2020-10-09 11:03:06,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-09 11:03:06,501 INFO L481 AbstractCegarLoop]: Abstraction has 3181 states and 12171 transitions. [2020-10-09 11:03:06,501 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 11:03:06,501 INFO L276 IsEmpty]: Start isEmpty. Operand 3181 states and 12171 transitions. [2020-10-09 11:03:06,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-10-09 11:03:06,503 INFO L413 BasicCegarLoop]: Found error trace [2020-10-09 11:03:06,503 INFO L421 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 11:03:06,504 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-09 11:03:06,504 INFO L429 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-09 11:03:06,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 11:03:06,504 INFO L82 PathProgramCache]: Analyzing trace with hash 69435085, now seen corresponding path program 1 times [2020-10-09 11:03:06,504 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-09 11:03:06,505 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1869959345] [2020-10-09 11:03:06,505 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-09 11:03:06,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 11:03:06,583 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-09 11:03:06,583 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1869959345] [2020-10-09 11:03:06,583 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-09 11:03:06,583 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-09 11:03:06,584 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1329032764] [2020-10-09 11:03:06,587 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-09 11:03:06,587 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-09 11:03:06,587 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-09 11:03:06,588 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-10-09 11:03:06,588 INFO L87 Difference]: Start difference. First operand 3181 states and 12171 transitions. Second operand 6 states. [2020-10-09 11:03:06,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-09 11:03:06,805 INFO L93 Difference]: Finished difference Result 4417 states and 17212 transitions. [2020-10-09 11:03:06,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-09 11:03:06,806 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 17 [2020-10-09 11:03:06,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-09 11:03:06,832 INFO L225 Difference]: With dead ends: 4417 [2020-10-09 11:03:06,832 INFO L226 Difference]: Without dead ends: 4393 [2020-10-09 11:03:06,833 INFO L673 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-09 11:03:06,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4393 states. [2020-10-09 11:03:07,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4393 to 3588. [2020-10-09 11:03:07,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3588 states. [2020-10-09 11:03:07,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3588 states to 3588 states and 14085 transitions. [2020-10-09 11:03:07,092 INFO L78 Accepts]: Start accepts. Automaton has 3588 states and 14085 transitions. Word has length 17 [2020-10-09 11:03:07,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-09 11:03:07,092 INFO L481 AbstractCegarLoop]: Abstraction has 3588 states and 14085 transitions. [2020-10-09 11:03:07,093 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-09 11:03:07,093 INFO L276 IsEmpty]: Start isEmpty. Operand 3588 states and 14085 transitions. [2020-10-09 11:03:07,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-10-09 11:03:07,099 INFO L413 BasicCegarLoop]: Found error trace [2020-10-09 11:03:07,099 INFO L421 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 11:03:07,099 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-09 11:03:07,100 INFO L429 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-09 11:03:07,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 11:03:07,100 INFO L82 PathProgramCache]: Analyzing trace with hash -954298863, now seen corresponding path program 2 times [2020-10-09 11:03:07,100 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-09 11:03:07,101 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [915055897] [2020-10-09 11:03:07,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-09 11:03:07,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 11:03:07,222 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-09 11:03:07,222 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [915055897] [2020-10-09 11:03:07,223 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-09 11:03:07,223 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-09 11:03:07,223 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1218466287] [2020-10-09 11:03:07,223 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-09 11:03:07,224 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-09 11:03:07,224 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-09 11:03:07,224 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-10-09 11:03:07,224 INFO L87 Difference]: Start difference. First operand 3588 states and 14085 transitions. Second operand 6 states. [2020-10-09 11:03:07,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-09 11:03:07,395 INFO L93 Difference]: Finished difference Result 4024 states and 15445 transitions. [2020-10-09 11:03:07,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-09 11:03:07,396 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 17 [2020-10-09 11:03:07,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-09 11:03:07,421 INFO L225 Difference]: With dead ends: 4024 [2020-10-09 11:03:07,422 INFO L226 Difference]: Without dead ends: 4024 [2020-10-09 11:03:07,422 INFO L673 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-09 11:03:07,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4024 states. [2020-10-09 11:03:07,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4024 to 3573. [2020-10-09 11:03:07,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3573 states. [2020-10-09 11:03:07,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3573 states to 3573 states and 14045 transitions. [2020-10-09 11:03:07,601 INFO L78 Accepts]: Start accepts. Automaton has 3573 states and 14045 transitions. Word has length 17 [2020-10-09 11:03:07,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-09 11:03:07,601 INFO L481 AbstractCegarLoop]: Abstraction has 3573 states and 14045 transitions. [2020-10-09 11:03:07,601 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-09 11:03:07,601 INFO L276 IsEmpty]: Start isEmpty. Operand 3573 states and 14045 transitions. [2020-10-09 11:03:07,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-10-09 11:03:07,603 INFO L413 BasicCegarLoop]: Found error trace [2020-10-09 11:03:07,604 INFO L421 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 11:03:07,604 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-09 11:03:07,604 INFO L429 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-09 11:03:07,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 11:03:07,605 INFO L82 PathProgramCache]: Analyzing trace with hash -687500069, now seen corresponding path program 1 times [2020-10-09 11:03:07,605 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-09 11:03:07,605 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1870852080] [2020-10-09 11:03:07,606 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-09 11:03:07,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 11:03:07,698 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-09 11:03:07,698 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1870852080] [2020-10-09 11:03:07,699 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-09 11:03:07,699 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-09 11:03:07,699 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [619329204] [2020-10-09 11:03:07,700 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-09 11:03:07,700 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-09 11:03:07,701 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-09 11:03:07,701 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-10-09 11:03:07,701 INFO L87 Difference]: Start difference. First operand 3573 states and 14045 transitions. Second operand 6 states. [2020-10-09 11:03:07,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-09 11:03:07,927 INFO L93 Difference]: Finished difference Result 4225 states and 16225 transitions. [2020-10-09 11:03:07,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-09 11:03:07,928 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 18 [2020-10-09 11:03:07,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-09 11:03:07,947 INFO L225 Difference]: With dead ends: 4225 [2020-10-09 11:03:07,948 INFO L226 Difference]: Without dead ends: 4129 [2020-10-09 11:03:07,948 INFO L673 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-09 11:03:07,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4129 states. [2020-10-09 11:03:08,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4129 to 3713. [2020-10-09 11:03:08,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3713 states. [2020-10-09 11:03:08,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3713 states to 3713 states and 14455 transitions. [2020-10-09 11:03:08,173 INFO L78 Accepts]: Start accepts. Automaton has 3713 states and 14455 transitions. Word has length 18 [2020-10-09 11:03:08,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-09 11:03:08,174 INFO L481 AbstractCegarLoop]: Abstraction has 3713 states and 14455 transitions. [2020-10-09 11:03:08,174 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-09 11:03:08,174 INFO L276 IsEmpty]: Start isEmpty. Operand 3713 states and 14455 transitions. [2020-10-09 11:03:08,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-10-09 11:03:08,182 INFO L413 BasicCegarLoop]: Found error trace [2020-10-09 11:03:08,182 INFO L421 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 11:03:08,182 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-09 11:03:08,183 INFO L429 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-09 11:03:08,183 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 11:03:08,183 INFO L82 PathProgramCache]: Analyzing trace with hash -454402421, now seen corresponding path program 2 times [2020-10-09 11:03:08,184 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-09 11:03:08,185 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2091724286] [2020-10-09 11:03:08,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-09 11:03:08,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 11:03:08,351 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-09 11:03:08,352 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2091724286] [2020-10-09 11:03:08,353 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-09 11:03:08,353 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-09 11:03:08,354 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2045596544] [2020-10-09 11:03:08,355 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-09 11:03:08,355 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-09 11:03:08,356 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-09 11:03:08,356 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2020-10-09 11:03:08,357 INFO L87 Difference]: Start difference. First operand 3713 states and 14455 transitions. Second operand 7 states. [2020-10-09 11:03:08,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-09 11:03:08,785 INFO L93 Difference]: Finished difference Result 4979 states and 19779 transitions. [2020-10-09 11:03:08,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-10-09 11:03:08,786 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 18 [2020-10-09 11:03:08,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-09 11:03:08,813 INFO L225 Difference]: With dead ends: 4979 [2020-10-09 11:03:08,813 INFO L226 Difference]: Without dead ends: 4905 [2020-10-09 11:03:08,814 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2020-10-09 11:03:08,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4905 states. [2020-10-09 11:03:08,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4905 to 4131. [2020-10-09 11:03:08,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4131 states. [2020-10-09 11:03:09,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4131 states to 4131 states and 16620 transitions. [2020-10-09 11:03:09,016 INFO L78 Accepts]: Start accepts. Automaton has 4131 states and 16620 transitions. Word has length 18 [2020-10-09 11:03:09,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-09 11:03:09,017 INFO L481 AbstractCegarLoop]: Abstraction has 4131 states and 16620 transitions. [2020-10-09 11:03:09,017 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-09 11:03:09,017 INFO L276 IsEmpty]: Start isEmpty. Operand 4131 states and 16620 transitions. [2020-10-09 11:03:09,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-10-09 11:03:09,019 INFO L413 BasicCegarLoop]: Found error trace [2020-10-09 11:03:09,019 INFO L421 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 11:03:09,019 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-10-09 11:03:09,019 INFO L429 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-09 11:03:09,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 11:03:09,020 INFO L82 PathProgramCache]: Analyzing trace with hash -1254406997, now seen corresponding path program 3 times [2020-10-09 11:03:09,020 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-09 11:03:09,020 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1863406842] [2020-10-09 11:03:09,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-09 11:03:09,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 11:03:09,133 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-09 11:03:09,133 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1863406842] [2020-10-09 11:03:09,134 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-09 11:03:09,134 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-09 11:03:09,134 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1526811969] [2020-10-09 11:03:09,134 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-09 11:03:09,135 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-09 11:03:09,135 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-09 11:03:09,135 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2020-10-09 11:03:09,135 INFO L87 Difference]: Start difference. First operand 4131 states and 16620 transitions. Second operand 8 states. [2020-10-09 11:03:09,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-09 11:03:09,482 INFO L93 Difference]: Finished difference Result 6735 states and 27904 transitions. [2020-10-09 11:03:09,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-09 11:03:09,483 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 18 [2020-10-09 11:03:09,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-09 11:03:09,520 INFO L225 Difference]: With dead ends: 6735 [2020-10-09 11:03:09,520 INFO L226 Difference]: Without dead ends: 6661 [2020-10-09 11:03:09,521 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2020-10-09 11:03:09,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6661 states. [2020-10-09 11:03:09,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6661 to 4129. [2020-10-09 11:03:09,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4129 states. [2020-10-09 11:03:09,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4129 states to 4129 states and 16616 transitions. [2020-10-09 11:03:09,731 INFO L78 Accepts]: Start accepts. Automaton has 4129 states and 16616 transitions. Word has length 18 [2020-10-09 11:03:09,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-09 11:03:09,732 INFO L481 AbstractCegarLoop]: Abstraction has 4129 states and 16616 transitions. [2020-10-09 11:03:09,732 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-09 11:03:09,732 INFO L276 IsEmpty]: Start isEmpty. Operand 4129 states and 16616 transitions. [2020-10-09 11:03:09,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-10-09 11:03:09,734 INFO L413 BasicCegarLoop]: Found error trace [2020-10-09 11:03:09,734 INFO L421 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 11:03:09,734 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-10-09 11:03:09,735 INFO L429 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-09 11:03:09,735 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 11:03:09,735 INFO L82 PathProgramCache]: Analyzing trace with hash -164095139, now seen corresponding path program 4 times [2020-10-09 11:03:09,735 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-09 11:03:09,736 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1870153909] [2020-10-09 11:03:09,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-09 11:03:09,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 11:03:09,909 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-09 11:03:09,910 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1870153909] [2020-10-09 11:03:09,910 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-09 11:03:09,910 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-10-09 11:03:09,910 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2069253107] [2020-10-09 11:03:09,911 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-10-09 11:03:09,913 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-09 11:03:09,913 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-10-09 11:03:09,914 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2020-10-09 11:03:09,914 INFO L87 Difference]: Start difference. First operand 4129 states and 16616 transitions. Second operand 10 states. [2020-10-09 11:03:10,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-09 11:03:10,500 INFO L93 Difference]: Finished difference Result 6639 states and 26238 transitions. [2020-10-09 11:03:10,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-09 11:03:10,501 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 18 [2020-10-09 11:03:10,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-09 11:03:10,530 INFO L225 Difference]: With dead ends: 6639 [2020-10-09 11:03:10,530 INFO L226 Difference]: Without dead ends: 6491 [2020-10-09 11:03:10,531 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2020-10-09 11:03:10,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6491 states. [2020-10-09 11:03:10,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6491 to 3873. [2020-10-09 11:03:10,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3873 states. [2020-10-09 11:03:10,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3873 states to 3873 states and 15364 transitions. [2020-10-09 11:03:10,699 INFO L78 Accepts]: Start accepts. Automaton has 3873 states and 15364 transitions. Word has length 18 [2020-10-09 11:03:10,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-09 11:03:10,701 INFO L481 AbstractCegarLoop]: Abstraction has 3873 states and 15364 transitions. [2020-10-09 11:03:10,701 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-10-09 11:03:10,702 INFO L276 IsEmpty]: Start isEmpty. Operand 3873 states and 15364 transitions. [2020-10-09 11:03:10,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-10-09 11:03:10,703 INFO L413 BasicCegarLoop]: Found error trace [2020-10-09 11:03:10,703 INFO L421 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 11:03:10,704 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-10-09 11:03:10,704 INFO L429 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-09 11:03:10,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 11:03:10,704 INFO L82 PathProgramCache]: Analyzing trace with hash 2041625758, now seen corresponding path program 1 times [2020-10-09 11:03:10,705 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-09 11:03:10,705 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [980615218] [2020-10-09 11:03:10,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-09 11:03:10,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 11:03:10,798 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-09 11:03:10,799 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [980615218] [2020-10-09 11:03:10,799 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-09 11:03:10,799 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-09 11:03:10,800 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [769354481] [2020-10-09 11:03:10,801 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-09 11:03:10,801 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-09 11:03:10,801 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-09 11:03:10,801 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2020-10-09 11:03:10,802 INFO L87 Difference]: Start difference. First operand 3873 states and 15364 transitions. Second operand 7 states. [2020-10-09 11:03:10,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-09 11:03:10,939 INFO L93 Difference]: Finished difference Result 4264 states and 16502 transitions. [2020-10-09 11:03:10,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-09 11:03:10,940 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 19 [2020-10-09 11:03:10,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-09 11:03:10,958 INFO L225 Difference]: With dead ends: 4264 [2020-10-09 11:03:10,958 INFO L226 Difference]: Without dead ends: 4264 [2020-10-09 11:03:10,959 INFO L673 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-09 11:03:10,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4264 states. [2020-10-09 11:03:11,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4264 to 3841. [2020-10-09 11:03:11,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3841 states. [2020-10-09 11:03:11,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3841 states to 3841 states and 15250 transitions. [2020-10-09 11:03:11,088 INFO L78 Accepts]: Start accepts. Automaton has 3841 states and 15250 transitions. Word has length 19 [2020-10-09 11:03:11,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-09 11:03:11,088 INFO L481 AbstractCegarLoop]: Abstraction has 3841 states and 15250 transitions. [2020-10-09 11:03:11,089 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-09 11:03:11,089 INFO L276 IsEmpty]: Start isEmpty. Operand 3841 states and 15250 transitions. [2020-10-09 11:03:11,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-10-09 11:03:11,091 INFO L413 BasicCegarLoop]: Found error trace [2020-10-09 11:03:11,091 INFO L421 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-09 11:03:11,091 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-10-09 11:03:11,091 INFO L429 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-09 11:03:11,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 11:03:11,092 INFO L82 PathProgramCache]: Analyzing trace with hash -1134272272, now seen corresponding path program 1 times [2020-10-09 11:03:11,092 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-09 11:03:11,092 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1420539271] [2020-10-09 11:03:11,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-09 11:03:11,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 11:03:11,235 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-09 11:03:11,235 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1420539271] [2020-10-09 11:03:11,236 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-09 11:03:11,236 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-10-09 11:03:11,236 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [482688809] [2020-10-09 11:03:11,236 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-09 11:03:11,237 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-09 11:03:11,237 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-09 11:03:11,237 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2020-10-09 11:03:11,238 INFO L87 Difference]: Start difference. First operand 3841 states and 15250 transitions. Second operand 9 states. [2020-10-09 11:03:11,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-09 11:03:11,593 INFO L93 Difference]: Finished difference Result 5256 states and 20905 transitions. [2020-10-09 11:03:11,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-09 11:03:11,594 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 20 [2020-10-09 11:03:11,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-09 11:03:11,617 INFO L225 Difference]: With dead ends: 5256 [2020-10-09 11:03:11,617 INFO L226 Difference]: Without dead ends: 5210 [2020-10-09 11:03:11,617 INFO L673 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-09 11:03:11,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5210 states. [2020-10-09 11:03:11,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5210 to 3994. [2020-10-09 11:03:11,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3994 states. [2020-10-09 11:03:11,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3994 states to 3994 states and 15976 transitions. [2020-10-09 11:03:11,754 INFO L78 Accepts]: Start accepts. Automaton has 3994 states and 15976 transitions. Word has length 20 [2020-10-09 11:03:11,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-09 11:03:11,755 INFO L481 AbstractCegarLoop]: Abstraction has 3994 states and 15976 transitions. [2020-10-09 11:03:11,755 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-09 11:03:11,755 INFO L276 IsEmpty]: Start isEmpty. Operand 3994 states and 15976 transitions. [2020-10-09 11:03:11,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-10-09 11:03:11,758 INFO L413 BasicCegarLoop]: Found error trace [2020-10-09 11:03:11,758 INFO L421 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-09 11:03:11,758 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-10-09 11:03:11,758 INFO L429 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-09 11:03:11,759 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 11:03:11,759 INFO L82 PathProgramCache]: Analyzing trace with hash 1058647793, now seen corresponding path program 1 times [2020-10-09 11:03:11,759 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-09 11:03:11,759 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1746129797] [2020-10-09 11:03:11,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-09 11:03:11,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 11:03:11,855 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-09 11:03:11,855 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1746129797] [2020-10-09 11:03:11,855 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-09 11:03:11,856 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-10-09 11:03:11,856 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1026529960] [2020-10-09 11:03:11,856 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-09 11:03:11,857 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-09 11:03:11,857 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-09 11:03:11,857 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2020-10-09 11:03:11,857 INFO L87 Difference]: Start difference. First operand 3994 states and 15976 transitions. Second operand 9 states. [2020-10-09 11:03:12,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-09 11:03:12,247 INFO L93 Difference]: Finished difference Result 5328 states and 21486 transitions. [2020-10-09 11:03:12,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-09 11:03:12,248 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 20 [2020-10-09 11:03:12,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-09 11:03:12,270 INFO L225 Difference]: With dead ends: 5328 [2020-10-09 11:03:12,270 INFO L226 Difference]: Without dead ends: 5282 [2020-10-09 11:03:12,271 INFO L673 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-09 11:03:12,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5282 states. [2020-10-09 11:03:12,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5282 to 3840. [2020-10-09 11:03:12,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3840 states. [2020-10-09 11:03:12,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3840 states to 3840 states and 15247 transitions. [2020-10-09 11:03:12,412 INFO L78 Accepts]: Start accepts. Automaton has 3840 states and 15247 transitions. Word has length 20 [2020-10-09 11:03:12,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-09 11:03:12,413 INFO L481 AbstractCegarLoop]: Abstraction has 3840 states and 15247 transitions. [2020-10-09 11:03:12,413 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-09 11:03:12,413 INFO L276 IsEmpty]: Start isEmpty. Operand 3840 states and 15247 transitions. [2020-10-09 11:03:12,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-10-09 11:03:12,415 INFO L413 BasicCegarLoop]: Found error trace [2020-10-09 11:03:12,416 INFO L421 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-09 11:03:12,416 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-10-09 11:03:12,416 INFO L429 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-09 11:03:12,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 11:03:12,416 INFO L82 PathProgramCache]: Analyzing trace with hash 2045819536, now seen corresponding path program 2 times [2020-10-09 11:03:12,417 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-09 11:03:12,417 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1887157858] [2020-10-09 11:03:12,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-09 11:03:12,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 11:03:12,550 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-09 11:03:12,551 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1887157858] [2020-10-09 11:03:12,551 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-09 11:03:12,551 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-10-09 11:03:12,551 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [189929742] [2020-10-09 11:03:12,552 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-10-09 11:03:12,552 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-09 11:03:12,552 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-10-09 11:03:12,552 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2020-10-09 11:03:12,553 INFO L87 Difference]: Start difference. First operand 3840 states and 15247 transitions. Second operand 10 states. [2020-10-09 11:03:13,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-09 11:03:13,014 INFO L93 Difference]: Finished difference Result 5284 states and 20663 transitions. [2020-10-09 11:03:13,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-10-09 11:03:13,015 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 20 [2020-10-09 11:03:13,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-09 11:03:13,038 INFO L225 Difference]: With dead ends: 5284 [2020-10-09 11:03:13,038 INFO L226 Difference]: Without dead ends: 5192 [2020-10-09 11:03:13,038 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=69, Invalid=171, Unknown=0, NotChecked=0, Total=240 [2020-10-09 11:03:13,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5192 states. [2020-10-09 11:03:13,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5192 to 3734. [2020-10-09 11:03:13,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3734 states. [2020-10-09 11:03:13,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3734 states to 3734 states and 14462 transitions. [2020-10-09 11:03:13,170 INFO L78 Accepts]: Start accepts. Automaton has 3734 states and 14462 transitions. Word has length 20 [2020-10-09 11:03:13,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-09 11:03:13,171 INFO L481 AbstractCegarLoop]: Abstraction has 3734 states and 14462 transitions. [2020-10-09 11:03:13,171 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-10-09 11:03:13,171 INFO L276 IsEmpty]: Start isEmpty. Operand 3734 states and 14462 transitions. [2020-10-09 11:03:13,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-10-09 11:03:13,173 INFO L413 BasicCegarLoop]: Found error trace [2020-10-09 11:03:13,173 INFO L421 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-09 11:03:13,173 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-10-09 11:03:13,174 INFO L429 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-09 11:03:13,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 11:03:13,174 INFO L82 PathProgramCache]: Analyzing trace with hash 258643217, now seen corresponding path program 2 times [2020-10-09 11:03:13,174 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-09 11:03:13,175 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [880579405] [2020-10-09 11:03:13,175 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-09 11:03:13,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 11:03:13,306 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-09 11:03:13,306 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [880579405] [2020-10-09 11:03:13,307 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-09 11:03:13,307 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-10-09 11:03:13,307 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1431236419] [2020-10-09 11:03:13,307 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-10-09 11:03:13,308 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-09 11:03:13,308 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-10-09 11:03:13,308 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2020-10-09 11:03:13,308 INFO L87 Difference]: Start difference. First operand 3734 states and 14462 transitions. Second operand 10 states. [2020-10-09 11:03:13,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-09 11:03:13,733 INFO L93 Difference]: Finished difference Result 6322 states and 24832 transitions. [2020-10-09 11:03:13,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-10-09 11:03:13,733 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 20 [2020-10-09 11:03:13,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-09 11:03:13,766 INFO L225 Difference]: With dead ends: 6322 [2020-10-09 11:03:13,766 INFO L226 Difference]: Without dead ends: 6276 [2020-10-09 11:03:13,767 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=88, Invalid=184, Unknown=0, NotChecked=0, Total=272 [2020-10-09 11:03:13,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6276 states. [2020-10-09 11:03:13,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6276 to 3733. [2020-10-09 11:03:13,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3733 states. [2020-10-09 11:03:13,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3733 states to 3733 states and 14461 transitions. [2020-10-09 11:03:13,968 INFO L78 Accepts]: Start accepts. Automaton has 3733 states and 14461 transitions. Word has length 20 [2020-10-09 11:03:13,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-09 11:03:13,969 INFO L481 AbstractCegarLoop]: Abstraction has 3733 states and 14461 transitions. [2020-10-09 11:03:13,969 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-10-09 11:03:13,969 INFO L276 IsEmpty]: Start isEmpty. Operand 3733 states and 14461 transitions. [2020-10-09 11:03:13,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-10-09 11:03:13,974 INFO L413 BasicCegarLoop]: Found error trace [2020-10-09 11:03:13,974 INFO L421 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-09 11:03:13,975 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-10-09 11:03:13,975 INFO L429 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-09 11:03:13,975 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 11:03:13,975 INFO L82 PathProgramCache]: Analyzing trace with hash 1348955075, now seen corresponding path program 3 times [2020-10-09 11:03:13,976 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-09 11:03:13,976 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [490272845] [2020-10-09 11:03:13,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-09 11:03:14,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 11:03:14,201 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-09 11:03:14,201 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [490272845] [2020-10-09 11:03:14,201 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-09 11:03:14,201 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-10-09 11:03:14,202 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1873520179] [2020-10-09 11:03:14,202 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-10-09 11:03:14,202 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-09 11:03:14,203 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-10-09 11:03:14,203 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2020-10-09 11:03:14,204 INFO L87 Difference]: Start difference. First operand 3733 states and 14461 transitions. Second operand 11 states. [2020-10-09 11:03:14,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-09 11:03:14,923 INFO L93 Difference]: Finished difference Result 4743 states and 18376 transitions. [2020-10-09 11:03:14,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-10-09 11:03:14,923 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 20 [2020-10-09 11:03:14,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-09 11:03:14,943 INFO L225 Difference]: With dead ends: 4743 [2020-10-09 11:03:14,944 INFO L226 Difference]: Without dead ends: 4709 [2020-10-09 11:03:14,946 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=100, Invalid=242, Unknown=0, NotChecked=0, Total=342 [2020-10-09 11:03:14,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4709 states. [2020-10-09 11:03:15,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4709 to 3733. [2020-10-09 11:03:15,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3733 states. [2020-10-09 11:03:15,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3733 states to 3733 states and 14461 transitions. [2020-10-09 11:03:15,061 INFO L78 Accepts]: Start accepts. Automaton has 3733 states and 14461 transitions. Word has length 20 [2020-10-09 11:03:15,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-09 11:03:15,062 INFO L481 AbstractCegarLoop]: Abstraction has 3733 states and 14461 transitions. [2020-10-09 11:03:15,062 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-10-09 11:03:15,062 INFO L276 IsEmpty]: Start isEmpty. Operand 3733 states and 14461 transitions. [2020-10-09 11:03:15,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-10-09 11:03:15,064 INFO L413 BasicCegarLoop]: Found error trace [2020-10-09 11:03:15,065 INFO L421 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-09 11:03:15,065 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-10-09 11:03:15,065 INFO L429 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-09 11:03:15,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 11:03:15,065 INFO L82 PathProgramCache]: Analyzing trace with hash 1331080475, now seen corresponding path program 4 times [2020-10-09 11:03:15,066 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-09 11:03:15,066 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1335273529] [2020-10-09 11:03:15,066 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-09 11:03:15,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 11:03:15,234 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-09 11:03:15,234 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1335273529] [2020-10-09 11:03:15,234 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-09 11:03:15,235 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-10-09 11:03:15,235 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [23869190] [2020-10-09 11:03:15,235 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-10-09 11:03:15,235 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-09 11:03:15,236 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-10-09 11:03:15,236 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2020-10-09 11:03:15,236 INFO L87 Difference]: Start difference. First operand 3733 states and 14461 transitions. Second operand 10 states. [2020-10-09 11:03:15,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-09 11:03:15,581 INFO L93 Difference]: Finished difference Result 4987 states and 19433 transitions. [2020-10-09 11:03:15,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-09 11:03:15,581 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 20 [2020-10-09 11:03:15,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-09 11:03:15,597 INFO L225 Difference]: With dead ends: 4987 [2020-10-09 11:03:15,597 INFO L226 Difference]: Without dead ends: 4941 [2020-10-09 11:03:15,598 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=117, Unknown=0, NotChecked=0, Total=182 [2020-10-09 11:03:15,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4941 states. [2020-10-09 11:03:15,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4941 to 3727. [2020-10-09 11:03:15,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3727 states. [2020-10-09 11:03:15,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3727 states to 3727 states and 14449 transitions. [2020-10-09 11:03:15,716 INFO L78 Accepts]: Start accepts. Automaton has 3727 states and 14449 transitions. Word has length 20 [2020-10-09 11:03:15,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-09 11:03:15,717 INFO L481 AbstractCegarLoop]: Abstraction has 3727 states and 14449 transitions. [2020-10-09 11:03:15,717 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-10-09 11:03:15,717 INFO L276 IsEmpty]: Start isEmpty. Operand 3727 states and 14449 transitions. [2020-10-09 11:03:15,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-10-09 11:03:15,719 INFO L413 BasicCegarLoop]: Found error trace [2020-10-09 11:03:15,719 INFO L421 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-09 11:03:15,719 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-10-09 11:03:15,720 INFO L429 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-09 11:03:15,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 11:03:15,720 INFO L82 PathProgramCache]: Analyzing trace with hash 657525156, now seen corresponding path program 3 times [2020-10-09 11:03:15,720 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-09 11:03:15,721 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1120686994] [2020-10-09 11:03:15,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-09 11:03:15,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 11:03:15,779 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-09 11:03:15,779 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1120686994] [2020-10-09 11:03:15,780 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-09 11:03:15,780 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-09 11:03:15,780 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1248731048] [2020-10-09 11:03:15,780 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-09 11:03:15,781 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-09 11:03:15,781 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-09 11:03:15,781 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2020-10-09 11:03:15,781 INFO L87 Difference]: Start difference. First operand 3727 states and 14449 transitions. Second operand 7 states. [2020-10-09 11:03:16,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-09 11:03:16,003 INFO L93 Difference]: Finished difference Result 5325 states and 20419 transitions. [2020-10-09 11:03:16,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-09 11:03:16,003 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 20 [2020-10-09 11:03:16,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-09 11:03:16,019 INFO L225 Difference]: With dead ends: 5325 [2020-10-09 11:03:16,019 INFO L226 Difference]: Without dead ends: 5279 [2020-10-09 11:03:16,020 INFO L673 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-09 11:03:16,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5279 states. [2020-10-09 11:03:16,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5279 to 2948. [2020-10-09 11:03:16,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2948 states. [2020-10-09 11:03:16,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2948 states to 2948 states and 10967 transitions. [2020-10-09 11:03:16,140 INFO L78 Accepts]: Start accepts. Automaton has 2948 states and 10967 transitions. Word has length 20 [2020-10-09 11:03:16,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-09 11:03:16,141 INFO L481 AbstractCegarLoop]: Abstraction has 2948 states and 10967 transitions. [2020-10-09 11:03:16,141 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-09 11:03:16,141 INFO L276 IsEmpty]: Start isEmpty. Operand 2948 states and 10967 transitions. [2020-10-09 11:03:16,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-10-09 11:03:16,144 INFO L413 BasicCegarLoop]: Found error trace [2020-10-09 11:03:16,144 INFO L421 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-09 11:03:16,144 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-10-09 11:03:16,145 INFO L429 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-09 11:03:16,145 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 11:03:16,145 INFO L82 PathProgramCache]: Analyzing trace with hash -1935934284, now seen corresponding path program 1 times [2020-10-09 11:03:16,146 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-09 11:03:16,146 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1302141356] [2020-10-09 11:03:16,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-09 11:03:16,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 11:03:16,207 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-09 11:03:16,207 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1302141356] [2020-10-09 11:03:16,208 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-09 11:03:16,208 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-09 11:03:16,208 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [599411762] [2020-10-09 11:03:16,209 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-09 11:03:16,209 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-09 11:03:16,209 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-09 11:03:16,209 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-10-09 11:03:16,209 INFO L87 Difference]: Start difference. First operand 2948 states and 10967 transitions. Second operand 6 states. [2020-10-09 11:03:16,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-09 11:03:16,396 INFO L93 Difference]: Finished difference Result 3727 states and 13634 transitions. [2020-10-09 11:03:16,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-09 11:03:16,397 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 21 [2020-10-09 11:03:16,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-09 11:03:16,407 INFO L225 Difference]: With dead ends: 3727 [2020-10-09 11:03:16,407 INFO L226 Difference]: Without dead ends: 3652 [2020-10-09 11:03:16,408 INFO L673 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-09 11:03:16,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3652 states. [2020-10-09 11:03:16,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3652 to 3270. [2020-10-09 11:03:16,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3270 states. [2020-10-09 11:03:16,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3270 states to 3270 states and 12154 transitions. [2020-10-09 11:03:16,522 INFO L78 Accepts]: Start accepts. Automaton has 3270 states and 12154 transitions. Word has length 21 [2020-10-09 11:03:16,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-09 11:03:16,523 INFO L481 AbstractCegarLoop]: Abstraction has 3270 states and 12154 transitions. [2020-10-09 11:03:16,523 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-09 11:03:16,523 INFO L276 IsEmpty]: Start isEmpty. Operand 3270 states and 12154 transitions. [2020-10-09 11:03:16,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-10-09 11:03:16,527 INFO L413 BasicCegarLoop]: Found error trace [2020-10-09 11:03:16,527 INFO L421 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-09 11:03:16,527 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2020-10-09 11:03:16,528 INFO L429 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-09 11:03:16,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 11:03:16,528 INFO L82 PathProgramCache]: Analyzing trace with hash 558788524, now seen corresponding path program 1 times [2020-10-09 11:03:16,528 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-09 11:03:16,529 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [677516506] [2020-10-09 11:03:16,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-09 11:03:16,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 11:03:16,780 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-09 11:03:16,780 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [677516506] [2020-10-09 11:03:16,780 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-09 11:03:16,781 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-10-09 11:03:16,781 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [989154570] [2020-10-09 11:03:16,781 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-10-09 11:03:16,781 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-09 11:03:16,782 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-10-09 11:03:16,782 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2020-10-09 11:03:16,782 INFO L87 Difference]: Start difference. First operand 3270 states and 12154 transitions. Second operand 12 states. [2020-10-09 11:03:17,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-09 11:03:17,494 INFO L93 Difference]: Finished difference Result 4405 states and 16600 transitions. [2020-10-09 11:03:17,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-10-09 11:03:17,495 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 21 [2020-10-09 11:03:17,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-09 11:03:17,507 INFO L225 Difference]: With dead ends: 4405 [2020-10-09 11:03:17,507 INFO L226 Difference]: Without dead ends: 4371 [2020-10-09 11:03:17,508 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=98, Invalid=244, Unknown=0, NotChecked=0, Total=342 [2020-10-09 11:03:17,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4371 states. [2020-10-09 11:03:17,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4371 to 3270. [2020-10-09 11:03:17,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3270 states. [2020-10-09 11:03:17,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3270 states to 3270 states and 12154 transitions. [2020-10-09 11:03:17,604 INFO L78 Accepts]: Start accepts. Automaton has 3270 states and 12154 transitions. Word has length 21 [2020-10-09 11:03:17,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-09 11:03:17,604 INFO L481 AbstractCegarLoop]: Abstraction has 3270 states and 12154 transitions. [2020-10-09 11:03:17,604 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-10-09 11:03:17,604 INFO L276 IsEmpty]: Start isEmpty. Operand 3270 states and 12154 transitions. [2020-10-09 11:03:17,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-10-09 11:03:17,607 INFO L413 BasicCegarLoop]: Found error trace [2020-10-09 11:03:17,607 INFO L421 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-09 11:03:17,607 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2020-10-09 11:03:17,608 INFO L429 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-09 11:03:17,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 11:03:17,608 INFO L82 PathProgramCache]: Analyzing trace with hash 540913924, now seen corresponding path program 2 times [2020-10-09 11:03:17,608 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-09 11:03:17,608 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1801028948] [2020-10-09 11:03:17,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-09 11:03:17,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 11:03:17,779 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-09 11:03:17,779 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1801028948] [2020-10-09 11:03:17,779 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-09 11:03:17,780 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-10-09 11:03:17,780 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [438720729] [2020-10-09 11:03:17,780 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-10-09 11:03:17,781 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-09 11:03:17,781 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-10-09 11:03:17,781 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2020-10-09 11:03:17,782 INFO L87 Difference]: Start difference. First operand 3270 states and 12154 transitions. Second operand 11 states. [2020-10-09 11:03:18,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-09 11:03:18,267 INFO L93 Difference]: Finished difference Result 4064 states and 15268 transitions. [2020-10-09 11:03:18,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-10-09 11:03:18,268 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 21 [2020-10-09 11:03:18,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-09 11:03:18,277 INFO L225 Difference]: With dead ends: 4064 [2020-10-09 11:03:18,277 INFO L226 Difference]: Without dead ends: 3972 [2020-10-09 11:03:18,277 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=81, Invalid=191, Unknown=0, NotChecked=0, Total=272 [2020-10-09 11:03:18,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3972 states. [2020-10-09 11:03:18,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3972 to 2499. [2020-10-09 11:03:18,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2499 states. [2020-10-09 11:03:18,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2499 states to 2499 states and 9076 transitions. [2020-10-09 11:03:18,352 INFO L78 Accepts]: Start accepts. Automaton has 2499 states and 9076 transitions. Word has length 21 [2020-10-09 11:03:18,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-09 11:03:18,352 INFO L481 AbstractCegarLoop]: Abstraction has 2499 states and 9076 transitions. [2020-10-09 11:03:18,353 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-10-09 11:03:18,353 INFO L276 IsEmpty]: Start isEmpty. Operand 2499 states and 9076 transitions. [2020-10-09 11:03:18,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-10-09 11:03:18,355 INFO L413 BasicCegarLoop]: Found error trace [2020-10-09 11:03:18,355 INFO L421 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-09 11:03:18,356 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2020-10-09 11:03:18,356 INFO L429 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-09 11:03:18,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 11:03:18,356 INFO L82 PathProgramCache]: Analyzing trace with hash 1608946948, now seen corresponding path program 2 times [2020-10-09 11:03:18,357 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-09 11:03:18,357 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1455988340] [2020-10-09 11:03:18,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-09 11:03:18,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 11:03:18,415 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-09 11:03:18,415 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1455988340] [2020-10-09 11:03:18,415 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-09 11:03:18,416 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-09 11:03:18,416 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [675672193] [2020-10-09 11:03:18,416 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-09 11:03:18,416 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-09 11:03:18,416 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-09 11:03:18,417 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-10-09 11:03:18,417 INFO L87 Difference]: Start difference. First operand 2499 states and 9076 transitions. Second operand 6 states. [2020-10-09 11:03:18,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-09 11:03:18,533 INFO L93 Difference]: Finished difference Result 2874 states and 10132 transitions. [2020-10-09 11:03:18,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-09 11:03:18,533 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 21 [2020-10-09 11:03:18,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-09 11:03:18,540 INFO L225 Difference]: With dead ends: 2874 [2020-10-09 11:03:18,540 INFO L226 Difference]: Without dead ends: 2650 [2020-10-09 11:03:18,541 INFO L673 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-09 11:03:18,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2650 states. [2020-10-09 11:03:18,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2650 to 2211. [2020-10-09 11:03:18,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2211 states. [2020-10-09 11:03:18,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2211 states to 2211 states and 7918 transitions. [2020-10-09 11:03:18,600 INFO L78 Accepts]: Start accepts. Automaton has 2211 states and 7918 transitions. Word has length 21 [2020-10-09 11:03:18,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-09 11:03:18,600 INFO L481 AbstractCegarLoop]: Abstraction has 2211 states and 7918 transitions. [2020-10-09 11:03:18,600 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-09 11:03:18,600 INFO L276 IsEmpty]: Start isEmpty. Operand 2211 states and 7918 transitions. [2020-10-09 11:03:18,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-10-09 11:03:18,603 INFO L413 BasicCegarLoop]: Found error trace [2020-10-09 11:03:18,603 INFO L421 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-09 11:03:18,604 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2020-10-09 11:03:18,604 INFO L429 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-09 11:03:18,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 11:03:18,604 INFO L82 PathProgramCache]: Analyzing trace with hash 1396456954, now seen corresponding path program 1 times [2020-10-09 11:03:18,604 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-09 11:03:18,604 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1399058164] [2020-10-09 11:03:18,605 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-09 11:03:18,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 11:03:18,738 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-09 11:03:18,738 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1399058164] [2020-10-09 11:03:18,738 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-09 11:03:18,739 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-09 11:03:18,739 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [917547563] [2020-10-09 11:03:18,739 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-09 11:03:18,739 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-09 11:03:18,740 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-09 11:03:18,740 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2020-10-09 11:03:18,740 INFO L87 Difference]: Start difference. First operand 2211 states and 7918 transitions. Second operand 7 states. [2020-10-09 11:03:18,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-09 11:03:18,990 INFO L93 Difference]: Finished difference Result 2930 states and 10378 transitions. [2020-10-09 11:03:18,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-10-09 11:03:18,991 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 22 [2020-10-09 11:03:18,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-09 11:03:18,997 INFO L225 Difference]: With dead ends: 2930 [2020-10-09 11:03:18,998 INFO L226 Difference]: Without dead ends: 2870 [2020-10-09 11:03:18,998 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2020-10-09 11:03:19,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2870 states. [2020-10-09 11:03:19,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2870 to 2208. [2020-10-09 11:03:19,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2208 states. [2020-10-09 11:03:19,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2208 states to 2208 states and 7913 transitions. [2020-10-09 11:03:19,052 INFO L78 Accepts]: Start accepts. Automaton has 2208 states and 7913 transitions. Word has length 22 [2020-10-09 11:03:19,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-09 11:03:19,052 INFO L481 AbstractCegarLoop]: Abstraction has 2208 states and 7913 transitions. [2020-10-09 11:03:19,052 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-09 11:03:19,052 INFO L276 IsEmpty]: Start isEmpty. Operand 2208 states and 7913 transitions. [2020-10-09 11:03:19,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-10-09 11:03:19,055 INFO L413 BasicCegarLoop]: Found error trace [2020-10-09 11:03:19,055 INFO L421 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-09 11:03:19,056 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2020-10-09 11:03:19,056 INFO L429 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-09 11:03:19,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 11:03:19,056 INFO L82 PathProgramCache]: Analyzing trace with hash 644682778, now seen corresponding path program 2 times [2020-10-09 11:03:19,056 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-09 11:03:19,057 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [204029129] [2020-10-09 11:03:19,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-09 11:03:19,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 11:03:19,153 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-09 11:03:19,154 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [204029129] [2020-10-09 11:03:19,154 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-09 11:03:19,154 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-09 11:03:19,154 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1675245381] [2020-10-09 11:03:19,154 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-09 11:03:19,155 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-09 11:03:19,155 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-09 11:03:19,156 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2020-10-09 11:03:19,156 INFO L87 Difference]: Start difference. First operand 2208 states and 7913 transitions. Second operand 8 states. [2020-10-09 11:03:19,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-09 11:03:19,405 INFO L93 Difference]: Finished difference Result 2920 states and 10358 transitions. [2020-10-09 11:03:19,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-10-09 11:03:19,405 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 22 [2020-10-09 11:03:19,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-09 11:03:19,411 INFO L225 Difference]: With dead ends: 2920 [2020-10-09 11:03:19,411 INFO L226 Difference]: Without dead ends: 2860 [2020-10-09 11:03:19,412 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=109, Unknown=0, NotChecked=0, Total=156 [2020-10-09 11:03:19,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2860 states. [2020-10-09 11:03:19,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2860 to 2202. [2020-10-09 11:03:19,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2202 states. [2020-10-09 11:03:19,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2202 states to 2202 states and 7899 transitions. [2020-10-09 11:03:19,467 INFO L78 Accepts]: Start accepts. Automaton has 2202 states and 7899 transitions. Word has length 22 [2020-10-09 11:03:19,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-09 11:03:19,467 INFO L481 AbstractCegarLoop]: Abstraction has 2202 states and 7899 transitions. [2020-10-09 11:03:19,467 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-09 11:03:19,467 INFO L276 IsEmpty]: Start isEmpty. Operand 2202 states and 7899 transitions. [2020-10-09 11:03:19,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-10-09 11:03:19,470 INFO L413 BasicCegarLoop]: Found error trace [2020-10-09 11:03:19,470 INFO L421 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-09 11:03:19,470 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2020-10-09 11:03:19,471 INFO L429 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-09 11:03:19,471 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 11:03:19,471 INFO L82 PathProgramCache]: Analyzing trace with hash -787433364, now seen corresponding path program 3 times [2020-10-09 11:03:19,471 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-09 11:03:19,471 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [110179514] [2020-10-09 11:03:19,471 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-09 11:03:19,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 11:03:19,563 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-09 11:03:19,563 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [110179514] [2020-10-09 11:03:19,563 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-09 11:03:19,564 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-10-09 11:03:19,564 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [721304400] [2020-10-09 11:03:19,564 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-09 11:03:19,564 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-09 11:03:19,565 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-09 11:03:19,565 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2020-10-09 11:03:19,565 INFO L87 Difference]: Start difference. First operand 2202 states and 7899 transitions. Second operand 9 states. [2020-10-09 11:03:19,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-09 11:03:19,757 INFO L93 Difference]: Finished difference Result 2905 states and 10327 transitions. [2020-10-09 11:03:19,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-09 11:03:19,758 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-10-09 11:03:19,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-09 11:03:19,765 INFO L225 Difference]: With dead ends: 2905 [2020-10-09 11:03:19,765 INFO L226 Difference]: Without dead ends: 2845 [2020-10-09 11:03:19,765 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=49, Invalid=83, Unknown=0, NotChecked=0, Total=132 [2020-10-09 11:03:19,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2845 states. [2020-10-09 11:03:19,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2845 to 2202. [2020-10-09 11:03:19,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2202 states. [2020-10-09 11:03:19,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2202 states to 2202 states and 7899 transitions. [2020-10-09 11:03:19,819 INFO L78 Accepts]: Start accepts. Automaton has 2202 states and 7899 transitions. Word has length 22 [2020-10-09 11:03:19,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-09 11:03:19,820 INFO L481 AbstractCegarLoop]: Abstraction has 2202 states and 7899 transitions. [2020-10-09 11:03:19,820 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-09 11:03:19,820 INFO L276 IsEmpty]: Start isEmpty. Operand 2202 states and 7899 transitions. [2020-10-09 11:03:19,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-10-09 11:03:19,822 INFO L413 BasicCegarLoop]: Found error trace [2020-10-09 11:03:19,822 INFO L421 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-09 11:03:19,823 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2020-10-09 11:03:19,823 INFO L429 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-09 11:03:19,823 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 11:03:19,823 INFO L82 PathProgramCache]: Analyzing trace with hash -270857424, now seen corresponding path program 4 times [2020-10-09 11:03:19,823 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-09 11:03:19,823 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1326387711] [2020-10-09 11:03:19,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-09 11:03:19,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 11:03:20,012 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-09 11:03:20,012 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1326387711] [2020-10-09 11:03:20,012 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-09 11:03:20,013 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-10-09 11:03:20,013 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [493573430] [2020-10-09 11:03:20,013 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-10-09 11:03:20,013 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-09 11:03:20,014 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-10-09 11:03:20,014 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2020-10-09 11:03:20,014 INFO L87 Difference]: Start difference. First operand 2202 states and 7899 transitions. Second operand 11 states. [2020-10-09 11:03:20,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-09 11:03:20,387 INFO L93 Difference]: Finished difference Result 3120 states and 11113 transitions. [2020-10-09 11:03:20,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-09 11:03:20,388 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 22 [2020-10-09 11:03:20,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-09 11:03:20,395 INFO L225 Difference]: With dead ends: 3120 [2020-10-09 11:03:20,395 INFO L226 Difference]: Without dead ends: 3060 [2020-10-09 11:03:20,396 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=65, Invalid=145, Unknown=0, NotChecked=0, Total=210 [2020-10-09 11:03:20,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3060 states. [2020-10-09 11:03:20,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3060 to 2202. [2020-10-09 11:03:20,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2202 states. [2020-10-09 11:03:20,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2202 states to 2202 states and 7896 transitions. [2020-10-09 11:03:20,442 INFO L78 Accepts]: Start accepts. Automaton has 2202 states and 7896 transitions. Word has length 22 [2020-10-09 11:03:20,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-09 11:03:20,442 INFO L481 AbstractCegarLoop]: Abstraction has 2202 states and 7896 transitions. [2020-10-09 11:03:20,442 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-10-09 11:03:20,443 INFO L276 IsEmpty]: Start isEmpty. Operand 2202 states and 7896 transitions. [2020-10-09 11:03:20,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-10-09 11:03:20,445 INFO L413 BasicCegarLoop]: Found error trace [2020-10-09 11:03:20,445 INFO L421 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-09 11:03:20,445 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2020-10-09 11:03:20,445 INFO L429 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-09 11:03:20,445 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 11:03:20,445 INFO L82 PathProgramCache]: Analyzing trace with hash -503603988, now seen corresponding path program 5 times [2020-10-09 11:03:20,446 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-09 11:03:20,446 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [725289780] [2020-10-09 11:03:20,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-09 11:03:20,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 11:03:20,537 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-09 11:03:20,537 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [725289780] [2020-10-09 11:03:20,537 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-09 11:03:20,538 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-10-09 11:03:20,538 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [393183438] [2020-10-09 11:03:20,538 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-09 11:03:20,538 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-09 11:03:20,539 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-09 11:03:20,539 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2020-10-09 11:03:20,539 INFO L87 Difference]: Start difference. First operand 2202 states and 7896 transitions. Second operand 9 states. [2020-10-09 11:03:20,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-09 11:03:20,871 INFO L93 Difference]: Finished difference Result 3737 states and 13299 transitions. [2020-10-09 11:03:20,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-09 11:03:20,872 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-10-09 11:03:20,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-09 11:03:20,880 INFO L225 Difference]: With dead ends: 3737 [2020-10-09 11:03:20,880 INFO L226 Difference]: Without dead ends: 3677 [2020-10-09 11:03:20,881 INFO L673 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-09 11:03:20,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3677 states. [2020-10-09 11:03:20,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3677 to 2170. [2020-10-09 11:03:20,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2170 states. [2020-10-09 11:03:20,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2170 states to 2170 states and 7789 transitions. [2020-10-09 11:03:20,937 INFO L78 Accepts]: Start accepts. Automaton has 2170 states and 7789 transitions. Word has length 22 [2020-10-09 11:03:20,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-09 11:03:20,938 INFO L481 AbstractCegarLoop]: Abstraction has 2170 states and 7789 transitions. [2020-10-09 11:03:20,938 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-09 11:03:20,938 INFO L276 IsEmpty]: Start isEmpty. Operand 2170 states and 7789 transitions. [2020-10-09 11:03:20,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-10-09 11:03:20,941 INFO L413 BasicCegarLoop]: Found error trace [2020-10-09 11:03:20,941 INFO L421 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-09 11:03:20,941 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2020-10-09 11:03:20,941 INFO L429 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-09 11:03:20,941 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 11:03:20,941 INFO L82 PathProgramCache]: Analyzing trace with hash -1357008819, now seen corresponding path program 1 times [2020-10-09 11:03:20,942 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-09 11:03:20,942 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [6966174] [2020-10-09 11:03:20,942 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-09 11:03:20,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 11:03:21,059 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-09 11:03:21,059 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [6966174] [2020-10-09 11:03:21,059 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-09 11:03:21,059 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-10-09 11:03:21,060 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1517905104] [2020-10-09 11:03:21,060 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-10-09 11:03:21,060 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-09 11:03:21,060 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-10-09 11:03:21,061 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2020-10-09 11:03:21,061 INFO L87 Difference]: Start difference. First operand 2170 states and 7789 transitions. Second operand 10 states. [2020-10-09 11:03:21,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-09 11:03:21,595 INFO L93 Difference]: Finished difference Result 3595 states and 12502 transitions. [2020-10-09 11:03:21,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-10-09 11:03:21,595 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 23 [2020-10-09 11:03:21,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-09 11:03:21,604 INFO L225 Difference]: With dead ends: 3595 [2020-10-09 11:03:21,604 INFO L226 Difference]: Without dead ends: 3478 [2020-10-09 11:03:21,604 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=65, Invalid=145, Unknown=0, NotChecked=0, Total=210 [2020-10-09 11:03:21,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3478 states. [2020-10-09 11:03:21,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3478 to 1979. [2020-10-09 11:03:21,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1979 states. [2020-10-09 11:03:21,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1979 states to 1979 states and 7017 transitions. [2020-10-09 11:03:21,649 INFO L78 Accepts]: Start accepts. Automaton has 1979 states and 7017 transitions. Word has length 23 [2020-10-09 11:03:21,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-09 11:03:21,650 INFO L481 AbstractCegarLoop]: Abstraction has 1979 states and 7017 transitions. [2020-10-09 11:03:21,650 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-10-09 11:03:21,650 INFO L276 IsEmpty]: Start isEmpty. Operand 1979 states and 7017 transitions. [2020-10-09 11:03:21,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-10-09 11:03:21,652 INFO L413 BasicCegarLoop]: Found error trace [2020-10-09 11:03:21,653 INFO L421 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-09 11:03:21,653 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2020-10-09 11:03:21,653 INFO L429 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-09 11:03:21,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 11:03:21,653 INFO L82 PathProgramCache]: Analyzing trace with hash -1309010247, now seen corresponding path program 1 times [2020-10-09 11:03:21,653 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-09 11:03:21,653 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [67802224] [2020-10-09 11:03:21,654 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-09 11:03:21,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 11:03:21,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-09 11:03:21,717 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [67802224] [2020-10-09 11:03:21,717 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-09 11:03:21,717 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-09 11:03:21,717 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [667930182] [2020-10-09 11:03:21,718 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-09 11:03:21,718 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-09 11:03:21,718 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-09 11:03:21,718 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-10-09 11:03:21,718 INFO L87 Difference]: Start difference. First operand 1979 states and 7017 transitions. Second operand 6 states. [2020-10-09 11:03:21,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-09 11:03:21,875 INFO L93 Difference]: Finished difference Result 2476 states and 8453 transitions. [2020-10-09 11:03:21,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-09 11:03:21,876 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 24 [2020-10-09 11:03:21,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-09 11:03:21,882 INFO L225 Difference]: With dead ends: 2476 [2020-10-09 11:03:21,882 INFO L226 Difference]: Without dead ends: 2412 [2020-10-09 11:03:21,883 INFO L673 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-09 11:03:21,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2412 states. [2020-10-09 11:03:21,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2412 to 2291. [2020-10-09 11:03:21,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2291 states. [2020-10-09 11:03:21,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2291 states to 2291 states and 8009 transitions. [2020-10-09 11:03:21,915 INFO L78 Accepts]: Start accepts. Automaton has 2291 states and 8009 transitions. Word has length 24 [2020-10-09 11:03:21,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-09 11:03:21,915 INFO L481 AbstractCegarLoop]: Abstraction has 2291 states and 8009 transitions. [2020-10-09 11:03:21,915 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-09 11:03:21,915 INFO L276 IsEmpty]: Start isEmpty. Operand 2291 states and 8009 transitions. [2020-10-09 11:03:21,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-10-09 11:03:21,917 INFO L413 BasicCegarLoop]: Found error trace [2020-10-09 11:03:21,917 INFO L421 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-09 11:03:21,918 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2020-10-09 11:03:21,918 INFO L429 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-09 11:03:21,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 11:03:21,918 INFO L82 PathProgramCache]: Analyzing trace with hash 1793125216, now seen corresponding path program 1 times [2020-10-09 11:03:21,918 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-09 11:03:21,919 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2139581603] [2020-10-09 11:03:21,919 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-09 11:03:21,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 11:03:22,013 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-09 11:03:22,014 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2139581603] [2020-10-09 11:03:22,014 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-09 11:03:22,014 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-10-09 11:03:22,014 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1650803057] [2020-10-09 11:03:22,014 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-09 11:03:22,015 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-09 11:03:22,015 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-09 11:03:22,015 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2020-10-09 11:03:22,015 INFO L87 Difference]: Start difference. First operand 2291 states and 8009 transitions. Second operand 9 states. [2020-10-09 11:03:22,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-09 11:03:22,225 INFO L93 Difference]: Finished difference Result 3139 states and 10958 transitions. [2020-10-09 11:03:22,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-09 11:03:22,225 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 24 [2020-10-09 11:03:22,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-09 11:03:22,233 INFO L225 Difference]: With dead ends: 3139 [2020-10-09 11:03:22,233 INFO L226 Difference]: Without dead ends: 3115 [2020-10-09 11:03:22,233 INFO L673 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-09 11:03:22,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3115 states. [2020-10-09 11:03:22,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3115 to 2290. [2020-10-09 11:03:22,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2290 states. [2020-10-09 11:03:22,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2290 states to 2290 states and 8008 transitions. [2020-10-09 11:03:22,274 INFO L78 Accepts]: Start accepts. Automaton has 2290 states and 8008 transitions. Word has length 24 [2020-10-09 11:03:22,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-09 11:03:22,274 INFO L481 AbstractCegarLoop]: Abstraction has 2290 states and 8008 transitions. [2020-10-09 11:03:22,275 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-09 11:03:22,275 INFO L276 IsEmpty]: Start isEmpty. Operand 2290 states and 8008 transitions. [2020-10-09 11:03:22,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-10-09 11:03:22,278 INFO L413 BasicCegarLoop]: Found error trace [2020-10-09 11:03:22,278 INFO L421 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-09 11:03:22,278 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2020-10-09 11:03:22,278 INFO L429 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-09 11:03:22,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 11:03:22,279 INFO L82 PathProgramCache]: Analyzing trace with hash 1041351040, now seen corresponding path program 2 times [2020-10-09 11:03:22,279 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-09 11:03:22,279 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [693705247] [2020-10-09 11:03:22,279 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-09 11:03:22,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 11:03:22,393 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-09 11:03:22,394 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [693705247] [2020-10-09 11:03:22,394 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-09 11:03:22,394 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-10-09 11:03:22,394 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1052605691] [2020-10-09 11:03:22,395 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-10-09 11:03:22,395 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-09 11:03:22,395 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-10-09 11:03:22,395 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2020-10-09 11:03:22,395 INFO L87 Difference]: Start difference. First operand 2290 states and 8008 transitions. Second operand 10 states. [2020-10-09 11:03:22,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-09 11:03:22,797 INFO L93 Difference]: Finished difference Result 3138 states and 10954 transitions. [2020-10-09 11:03:22,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-10-09 11:03:22,798 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 24 [2020-10-09 11:03:22,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-09 11:03:22,805 INFO L225 Difference]: With dead ends: 3138 [2020-10-09 11:03:22,805 INFO L226 Difference]: Without dead ends: 3114 [2020-10-09 11:03:22,806 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=79, Invalid=193, Unknown=0, NotChecked=0, Total=272 [2020-10-09 11:03:22,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3114 states. [2020-10-09 11:03:22,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3114 to 2293. [2020-10-09 11:03:22,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2293 states. [2020-10-09 11:03:22,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2293 states to 2293 states and 8015 transitions. [2020-10-09 11:03:22,848 INFO L78 Accepts]: Start accepts. Automaton has 2293 states and 8015 transitions. Word has length 24 [2020-10-09 11:03:22,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-09 11:03:22,848 INFO L481 AbstractCegarLoop]: Abstraction has 2293 states and 8015 transitions. [2020-10-09 11:03:22,848 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-10-09 11:03:22,848 INFO L276 IsEmpty]: Start isEmpty. Operand 2293 states and 8015 transitions. [2020-10-09 11:03:22,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-10-09 11:03:22,851 INFO L413 BasicCegarLoop]: Found error trace [2020-10-09 11:03:22,851 INFO L421 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-09 11:03:22,851 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2020-10-09 11:03:22,851 INFO L429 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-09 11:03:22,851 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 11:03:22,851 INFO L82 PathProgramCache]: Analyzing trace with hash -106935726, now seen corresponding path program 3 times [2020-10-09 11:03:22,851 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-09 11:03:22,851 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [709749379] [2020-10-09 11:03:22,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-09 11:03:22,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 11:03:22,987 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-09 11:03:22,987 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [709749379] [2020-10-09 11:03:22,988 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-09 11:03:22,988 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-10-09 11:03:22,988 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [23174863] [2020-10-09 11:03:22,988 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-10-09 11:03:22,989 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-09 11:03:22,989 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-10-09 11:03:22,989 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2020-10-09 11:03:22,989 INFO L87 Difference]: Start difference. First operand 2293 states and 8015 transitions. Second operand 11 states. [2020-10-09 11:03:23,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-09 11:03:23,333 INFO L93 Difference]: Finished difference Result 3732 states and 13122 transitions. [2020-10-09 11:03:23,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-10-09 11:03:23,333 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 24 [2020-10-09 11:03:23,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-09 11:03:23,342 INFO L225 Difference]: With dead ends: 3732 [2020-10-09 11:03:23,342 INFO L226 Difference]: Without dead ends: 3708 [2020-10-09 11:03:23,343 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=100, Invalid=206, Unknown=0, NotChecked=0, Total=306 [2020-10-09 11:03:23,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3708 states. [2020-10-09 11:03:23,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3708 to 2271. [2020-10-09 11:03:23,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2271 states. [2020-10-09 11:03:23,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2271 states to 2271 states and 7965 transitions. [2020-10-09 11:03:23,410 INFO L78 Accepts]: Start accepts. Automaton has 2271 states and 7965 transitions. Word has length 24 [2020-10-09 11:03:23,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-09 11:03:23,410 INFO L481 AbstractCegarLoop]: Abstraction has 2271 states and 7965 transitions. [2020-10-09 11:03:23,410 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-10-09 11:03:23,411 INFO L276 IsEmpty]: Start isEmpty. Operand 2271 states and 7965 transitions. [2020-10-09 11:03:23,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-10-09 11:03:23,414 INFO L413 BasicCegarLoop]: Found error trace [2020-10-09 11:03:23,414 INFO L421 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-09 11:03:23,414 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2020-10-09 11:03:23,414 INFO L429 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-09 11:03:23,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 11:03:23,415 INFO L82 PathProgramCache]: Analyzing trace with hash -408101783, now seen corresponding path program 2 times [2020-10-09 11:03:23,415 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-09 11:03:23,415 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1865777600] [2020-10-09 11:03:23,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-09 11:03:23,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 11:03:23,475 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-09 11:03:23,476 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1865777600] [2020-10-09 11:03:23,476 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-09 11:03:23,476 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-09 11:03:23,476 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [434700052] [2020-10-09 11:03:23,476 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-09 11:03:23,477 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-09 11:03:23,477 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-09 11:03:23,477 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2020-10-09 11:03:23,477 INFO L87 Difference]: Start difference. First operand 2271 states and 7965 transitions. Second operand 7 states. [2020-10-09 11:03:23,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-09 11:03:23,694 INFO L93 Difference]: Finished difference Result 2765 states and 9396 transitions. [2020-10-09 11:03:23,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-10-09 11:03:23,694 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 24 [2020-10-09 11:03:23,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-09 11:03:23,699 INFO L225 Difference]: With dead ends: 2765 [2020-10-09 11:03:23,700 INFO L226 Difference]: Without dead ends: 2701 [2020-10-09 11:03:23,700 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2020-10-09 11:03:23,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2701 states. [2020-10-09 11:03:23,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2701 to 2268. [2020-10-09 11:03:23,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2268 states. [2020-10-09 11:03:23,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2268 states to 2268 states and 7960 transitions. [2020-10-09 11:03:23,737 INFO L78 Accepts]: Start accepts. Automaton has 2268 states and 7960 transitions. Word has length 24 [2020-10-09 11:03:23,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-09 11:03:23,737 INFO L481 AbstractCegarLoop]: Abstraction has 2268 states and 7960 transitions. [2020-10-09 11:03:23,737 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-09 11:03:23,737 INFO L276 IsEmpty]: Start isEmpty. Operand 2268 states and 7960 transitions. [2020-10-09 11:03:23,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-10-09 11:03:23,741 INFO L413 BasicCegarLoop]: Found error trace [2020-10-09 11:03:23,741 INFO L421 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-09 11:03:23,741 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2020-10-09 11:03:23,741 INFO L429 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-09 11:03:23,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 11:03:23,741 INFO L82 PathProgramCache]: Analyzing trace with hash -1308579191, now seen corresponding path program 3 times [2020-10-09 11:03:23,741 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-09 11:03:23,742 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1543129949] [2020-10-09 11:03:23,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-09 11:03:23,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 11:03:23,849 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-09 11:03:23,850 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1543129949] [2020-10-09 11:03:23,850 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-09 11:03:23,850 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-09 11:03:23,850 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1211880291] [2020-10-09 11:03:23,850 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-09 11:03:23,851 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-09 11:03:23,851 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-09 11:03:23,851 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2020-10-09 11:03:23,851 INFO L87 Difference]: Start difference. First operand 2268 states and 7960 transitions. Second operand 8 states. [2020-10-09 11:03:24,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-09 11:03:24,092 INFO L93 Difference]: Finished difference Result 2755 states and 9376 transitions. [2020-10-09 11:03:24,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-10-09 11:03:24,093 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 24 [2020-10-09 11:03:24,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-09 11:03:24,099 INFO L225 Difference]: With dead ends: 2755 [2020-10-09 11:03:24,099 INFO L226 Difference]: Without dead ends: 2691 [2020-10-09 11:03:24,100 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=109, Unknown=0, NotChecked=0, Total=156 [2020-10-09 11:03:24,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2691 states. [2020-10-09 11:03:24,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2691 to 2262. [2020-10-09 11:03:24,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2262 states. [2020-10-09 11:03:24,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2262 states to 2262 states and 7946 transitions. [2020-10-09 11:03:24,137 INFO L78 Accepts]: Start accepts. Automaton has 2262 states and 7946 transitions. Word has length 24 [2020-10-09 11:03:24,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-09 11:03:24,138 INFO L481 AbstractCegarLoop]: Abstraction has 2262 states and 7946 transitions. [2020-10-09 11:03:24,138 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-09 11:03:24,138 INFO L276 IsEmpty]: Start isEmpty. Operand 2262 states and 7946 transitions. [2020-10-09 11:03:24,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-10-09 11:03:24,187 INFO L413 BasicCegarLoop]: Found error trace [2020-10-09 11:03:24,187 INFO L421 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-09 11:03:24,188 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2020-10-09 11:03:24,188 INFO L429 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-09 11:03:24,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 11:03:24,188 INFO L82 PathProgramCache]: Analyzing trace with hash -1370549309, now seen corresponding path program 4 times [2020-10-09 11:03:24,188 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-09 11:03:24,188 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [972124414] [2020-10-09 11:03:24,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-09 11:03:24,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 11:03:24,297 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-09 11:03:24,297 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [972124414] [2020-10-09 11:03:24,297 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-09 11:03:24,297 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-10-09 11:03:24,298 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2035467581] [2020-10-09 11:03:24,298 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-10-09 11:03:24,298 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-09 11:03:24,298 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-10-09 11:03:24,299 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2020-10-09 11:03:24,299 INFO L87 Difference]: Start difference. First operand 2262 states and 7946 transitions. Second operand 10 states. [2020-10-09 11:03:24,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-09 11:03:24,518 INFO L93 Difference]: Finished difference Result 2704 states and 9243 transitions. [2020-10-09 11:03:24,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-09 11:03:24,519 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 24 [2020-10-09 11:03:24,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-09 11:03:24,525 INFO L225 Difference]: With dead ends: 2704 [2020-10-09 11:03:24,525 INFO L226 Difference]: Without dead ends: 2640 [2020-10-09 11:03:24,525 INFO L673 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-09 11:03:24,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2640 states. [2020-10-09 11:03:24,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2640 to 2262. [2020-10-09 11:03:24,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2262 states. [2020-10-09 11:03:24,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2262 states to 2262 states and 7946 transitions. [2020-10-09 11:03:24,578 INFO L78 Accepts]: Start accepts. Automaton has 2262 states and 7946 transitions. Word has length 24 [2020-10-09 11:03:24,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-09 11:03:24,579 INFO L481 AbstractCegarLoop]: Abstraction has 2262 states and 7946 transitions. [2020-10-09 11:03:24,579 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-10-09 11:03:24,579 INFO L276 IsEmpty]: Start isEmpty. Operand 2262 states and 7946 transitions. [2020-10-09 11:03:24,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-10-09 11:03:24,583 INFO L413 BasicCegarLoop]: Found error trace [2020-10-09 11:03:24,583 INFO L421 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-09 11:03:24,583 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2020-10-09 11:03:24,583 INFO L429 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-09 11:03:24,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 11:03:24,584 INFO L82 PathProgramCache]: Analyzing trace with hash -1607134461, now seen corresponding path program 5 times [2020-10-09 11:03:24,584 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-09 11:03:24,584 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1500380097] [2020-10-09 11:03:24,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-09 11:03:24,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 11:03:24,809 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-09 11:03:24,809 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1500380097] [2020-10-09 11:03:24,809 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-09 11:03:24,810 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-10-09 11:03:24,810 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1769598635] [2020-10-09 11:03:24,810 INFO L461 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-10-09 11:03:24,810 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-09 11:03:24,810 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-10-09 11:03:24,811 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2020-10-09 11:03:24,811 INFO L87 Difference]: Start difference. First operand 2262 states and 7946 transitions. Second operand 13 states. [2020-10-09 11:03:25,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-09 11:03:25,333 INFO L93 Difference]: Finished difference Result 4164 states and 14122 transitions. [2020-10-09 11:03:25,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-09 11:03:25,334 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 24 [2020-10-09 11:03:25,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-09 11:03:25,342 INFO L225 Difference]: With dead ends: 4164 [2020-10-09 11:03:25,342 INFO L226 Difference]: Without dead ends: 4036 [2020-10-09 11:03:25,343 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=86, Invalid=220, Unknown=0, NotChecked=0, Total=306 [2020-10-09 11:03:25,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4036 states. [2020-10-09 11:03:25,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4036 to 2451. [2020-10-09 11:03:25,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2451 states. [2020-10-09 11:03:25,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2451 states to 2451 states and 8748 transitions. [2020-10-09 11:03:25,393 INFO L78 Accepts]: Start accepts. Automaton has 2451 states and 8748 transitions. Word has length 24 [2020-10-09 11:03:25,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-09 11:03:25,393 INFO L481 AbstractCegarLoop]: Abstraction has 2451 states and 8748 transitions. [2020-10-09 11:03:25,393 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-10-09 11:03:25,393 INFO L276 IsEmpty]: Start isEmpty. Operand 2451 states and 8748 transitions. [2020-10-09 11:03:25,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-10-09 11:03:25,396 INFO L413 BasicCegarLoop]: Found error trace [2020-10-09 11:03:25,397 INFO L421 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-09 11:03:25,397 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2020-10-09 11:03:25,397 INFO L429 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-09 11:03:25,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 11:03:25,397 INFO L82 PathProgramCache]: Analyzing trace with hash 1497656527, now seen corresponding path program 6 times [2020-10-09 11:03:25,397 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-09 11:03:25,398 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1525777538] [2020-10-09 11:03:25,398 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-09 11:03:25,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 11:03:25,506 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-09 11:03:25,507 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1525777538] [2020-10-09 11:03:25,507 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-09 11:03:25,507 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-10-09 11:03:25,507 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [726001398] [2020-10-09 11:03:25,507 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-10-09 11:03:25,508 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-09 11:03:25,508 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-10-09 11:03:25,508 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2020-10-09 11:03:25,508 INFO L87 Difference]: Start difference. First operand 2451 states and 8748 transitions. Second operand 10 states. [2020-10-09 11:03:25,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-09 11:03:25,798 INFO L93 Difference]: Finished difference Result 3358 states and 11346 transitions. [2020-10-09 11:03:25,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-09 11:03:25,798 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 24 [2020-10-09 11:03:25,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-09 11:03:25,806 INFO L225 Difference]: With dead ends: 3358 [2020-10-09 11:03:25,806 INFO L226 Difference]: Without dead ends: 3294 [2020-10-09 11:03:25,807 INFO L673 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-09 11:03:25,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3294 states. [2020-10-09 11:03:25,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3294 to 2271. [2020-10-09 11:03:25,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2271 states. [2020-10-09 11:03:25,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2271 states to 2271 states and 8062 transitions. [2020-10-09 11:03:25,843 INFO L78 Accepts]: Start accepts. Automaton has 2271 states and 8062 transitions. Word has length 24 [2020-10-09 11:03:25,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-09 11:03:25,843 INFO L481 AbstractCegarLoop]: Abstraction has 2271 states and 8062 transitions. [2020-10-09 11:03:25,843 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-10-09 11:03:25,843 INFO L276 IsEmpty]: Start isEmpty. Operand 2271 states and 8062 transitions. [2020-10-09 11:03:25,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-10-09 11:03:25,846 INFO L413 BasicCegarLoop]: Found error trace [2020-10-09 11:03:25,846 INFO L421 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] [2020-10-09 11:03:25,846 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2020-10-09 11:03:25,846 INFO L429 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-09 11:03:25,846 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 11:03:25,846 INFO L82 PathProgramCache]: Analyzing trace with hash -1945194585, now seen corresponding path program 1 times [2020-10-09 11:03:25,846 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-09 11:03:25,846 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [591423343] [2020-10-09 11:03:25,846 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-09 11:03:25,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 11:03:26,027 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-09 11:03:26,027 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [591423343] [2020-10-09 11:03:26,027 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-09 11:03:26,027 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-10-09 11:03:26,027 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [935422598] [2020-10-09 11:03:26,028 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-10-09 11:03:26,028 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-09 11:03:26,028 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-10-09 11:03:26,028 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2020-10-09 11:03:26,028 INFO L87 Difference]: Start difference. First operand 2271 states and 8062 transitions. Second operand 12 states. [2020-10-09 11:03:26,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-09 11:03:26,463 INFO L93 Difference]: Finished difference Result 2789 states and 9626 transitions. [2020-10-09 11:03:26,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-10-09 11:03:26,464 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 25 [2020-10-09 11:03:26,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-09 11:03:26,471 INFO L225 Difference]: With dead ends: 2789 [2020-10-09 11:03:26,471 INFO L226 Difference]: Without dead ends: 2742 [2020-10-09 11:03:26,471 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=92, Invalid=214, Unknown=0, NotChecked=0, Total=306 [2020-10-09 11:03:26,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2742 states. [2020-10-09 11:03:26,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2742 to 1742. [2020-10-09 11:03:26,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1742 states. [2020-10-09 11:03:26,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1742 states to 1742 states and 6049 transitions. [2020-10-09 11:03:26,504 INFO L78 Accepts]: Start accepts. Automaton has 1742 states and 6049 transitions. Word has length 25 [2020-10-09 11:03:26,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-09 11:03:26,504 INFO L481 AbstractCegarLoop]: Abstraction has 1742 states and 6049 transitions. [2020-10-09 11:03:26,504 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-10-09 11:03:26,504 INFO L276 IsEmpty]: Start isEmpty. Operand 1742 states and 6049 transitions. [2020-10-09 11:03:26,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-10-09 11:03:26,506 INFO L413 BasicCegarLoop]: Found error trace [2020-10-09 11:03:26,506 INFO L421 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-09 11:03:26,507 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2020-10-09 11:03:26,507 INFO L429 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-09 11:03:26,507 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 11:03:26,507 INFO L82 PathProgramCache]: Analyzing trace with hash -1461991345, now seen corresponding path program 1 times [2020-10-09 11:03:26,507 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-09 11:03:26,507 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2147416019] [2020-10-09 11:03:26,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-09 11:03:26,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 11:03:26,605 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-09 11:03:26,605 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2147416019] [2020-10-09 11:03:26,606 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-09 11:03:26,606 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-10-09 11:03:26,606 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2003205739] [2020-10-09 11:03:26,606 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-09 11:03:26,606 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-09 11:03:26,607 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-09 11:03:26,607 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2020-10-09 11:03:26,611 INFO L87 Difference]: Start difference. First operand 1742 states and 6049 transitions. Second operand 9 states. [2020-10-09 11:03:26,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-09 11:03:26,894 INFO L93 Difference]: Finished difference Result 2359 states and 7868 transitions. [2020-10-09 11:03:26,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-09 11:03:26,895 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 26 [2020-10-09 11:03:26,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-09 11:03:26,900 INFO L225 Difference]: With dead ends: 2359 [2020-10-09 11:03:26,900 INFO L226 Difference]: Without dead ends: 2337 [2020-10-09 11:03:26,900 INFO L673 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-09 11:03:26,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2337 states. [2020-10-09 11:03:26,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2337 to 1741. [2020-10-09 11:03:26,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1741 states. [2020-10-09 11:03:26,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1741 states to 1741 states and 6048 transitions. [2020-10-09 11:03:26,931 INFO L78 Accepts]: Start accepts. Automaton has 1741 states and 6048 transitions. Word has length 26 [2020-10-09 11:03:26,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-09 11:03:26,932 INFO L481 AbstractCegarLoop]: Abstraction has 1741 states and 6048 transitions. [2020-10-09 11:03:26,932 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-09 11:03:26,932 INFO L276 IsEmpty]: Start isEmpty. Operand 1741 states and 6048 transitions. [2020-10-09 11:03:26,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-10-09 11:03:26,935 INFO L413 BasicCegarLoop]: Found error trace [2020-10-09 11:03:26,935 INFO L421 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-09 11:03:26,935 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2020-10-09 11:03:26,936 INFO L429 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-09 11:03:26,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 11:03:26,936 INFO L82 PathProgramCache]: Analyzing trace with hash 1932498543, now seen corresponding path program 2 times [2020-10-09 11:03:26,936 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-09 11:03:26,936 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2024349249] [2020-10-09 11:03:26,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-09 11:03:26,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 11:03:27,064 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-09 11:03:27,065 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2024349249] [2020-10-09 11:03:27,065 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-09 11:03:27,065 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-10-09 11:03:27,065 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1571525676] [2020-10-09 11:03:27,065 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-10-09 11:03:27,065 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-09 11:03:27,066 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-10-09 11:03:27,066 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2020-10-09 11:03:27,066 INFO L87 Difference]: Start difference. First operand 1741 states and 6048 transitions. Second operand 10 states. [2020-10-09 11:03:27,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-09 11:03:27,416 INFO L93 Difference]: Finished difference Result 2355 states and 7860 transitions. [2020-10-09 11:03:27,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-10-09 11:03:27,417 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 26 [2020-10-09 11:03:27,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-09 11:03:27,423 INFO L225 Difference]: With dead ends: 2355 [2020-10-09 11:03:27,423 INFO L226 Difference]: Without dead ends: 2333 [2020-10-09 11:03:27,424 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=79, Invalid=193, Unknown=0, NotChecked=0, Total=272 [2020-10-09 11:03:27,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2333 states. [2020-10-09 11:03:27,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2333 to 1744. [2020-10-09 11:03:27,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1744 states. [2020-10-09 11:03:27,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1744 states to 1744 states and 6055 transitions. [2020-10-09 11:03:27,450 INFO L78 Accepts]: Start accepts. Automaton has 1744 states and 6055 transitions. Word has length 26 [2020-10-09 11:03:27,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-09 11:03:27,450 INFO L481 AbstractCegarLoop]: Abstraction has 1744 states and 6055 transitions. [2020-10-09 11:03:27,451 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-10-09 11:03:27,451 INFO L276 IsEmpty]: Start isEmpty. Operand 1744 states and 6055 transitions. [2020-10-09 11:03:27,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-10-09 11:03:27,453 INFO L413 BasicCegarLoop]: Found error trace [2020-10-09 11:03:27,453 INFO L421 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-09 11:03:27,453 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2020-10-09 11:03:27,453 INFO L429 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-09 11:03:27,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 11:03:27,454 INFO L82 PathProgramCache]: Analyzing trace with hash 1870528425, now seen corresponding path program 3 times [2020-10-09 11:03:27,454 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-09 11:03:27,454 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1608573384] [2020-10-09 11:03:27,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-09 11:03:27,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 11:03:27,659 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-09 11:03:27,660 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1608573384] [2020-10-09 11:03:27,660 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-09 11:03:27,660 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-10-09 11:03:27,660 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [249999740] [2020-10-09 11:03:27,660 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-10-09 11:03:27,660 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-09 11:03:27,661 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-10-09 11:03:27,661 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2020-10-09 11:03:27,661 INFO L87 Difference]: Start difference. First operand 1744 states and 6055 transitions. Second operand 12 states. [2020-10-09 11:03:28,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-09 11:03:28,012 INFO L93 Difference]: Finished difference Result 2375 states and 7965 transitions. [2020-10-09 11:03:28,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-09 11:03:28,012 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 26 [2020-10-09 11:03:28,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-09 11:03:28,019 INFO L225 Difference]: With dead ends: 2375 [2020-10-09 11:03:28,019 INFO L226 Difference]: Without dead ends: 2287 [2020-10-09 11:03:28,019 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=101, Invalid=205, Unknown=0, NotChecked=0, Total=306 [2020-10-09 11:03:28,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2287 states. [2020-10-09 11:03:28,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2287 to 1491. [2020-10-09 11:03:28,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1491 states. [2020-10-09 11:03:28,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1491 states to 1491 states and 5039 transitions. [2020-10-09 11:03:28,044 INFO L78 Accepts]: Start accepts. Automaton has 1491 states and 5039 transitions. Word has length 26 [2020-10-09 11:03:28,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-09 11:03:28,045 INFO L481 AbstractCegarLoop]: Abstraction has 1491 states and 5039 transitions. [2020-10-09 11:03:28,045 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-10-09 11:03:28,045 INFO L276 IsEmpty]: Start isEmpty. Operand 1491 states and 5039 transitions. [2020-10-09 11:03:28,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-10-09 11:03:28,047 INFO L413 BasicCegarLoop]: Found error trace [2020-10-09 11:03:28,047 INFO L421 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-09 11:03:28,047 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2020-10-09 11:03:28,047 INFO L429 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-09 11:03:28,047 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 11:03:28,047 INFO L82 PathProgramCache]: Analyzing trace with hash 443766965, now seen corresponding path program 4 times [2020-10-09 11:03:28,047 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-09 11:03:28,047 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1426592987] [2020-10-09 11:03:28,047 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-09 11:03:28,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 11:03:28,195 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-09 11:03:28,195 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1426592987] [2020-10-09 11:03:28,195 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-09 11:03:28,195 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-10-09 11:03:28,196 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [165398980] [2020-10-09 11:03:28,196 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-10-09 11:03:28,196 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-09 11:03:28,196 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-10-09 11:03:28,197 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2020-10-09 11:03:28,197 INFO L87 Difference]: Start difference. First operand 1491 states and 5039 transitions. Second operand 12 states. [2020-10-09 11:03:28,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-09 11:03:28,625 INFO L93 Difference]: Finished difference Result 1544 states and 5003 transitions. [2020-10-09 11:03:28,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-10-09 11:03:28,626 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 26 [2020-10-09 11:03:28,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-09 11:03:28,631 INFO L225 Difference]: With dead ends: 1544 [2020-10-09 11:03:28,631 INFO L226 Difference]: Without dead ends: 1500 [2020-10-09 11:03:28,632 INFO L673 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-09 11:03:28,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1500 states. [2020-10-09 11:03:28,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1500 to 885. [2020-10-09 11:03:28,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 885 states. [2020-10-09 11:03:28,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 885 states to 885 states and 3033 transitions. [2020-10-09 11:03:28,664 INFO L78 Accepts]: Start accepts. Automaton has 885 states and 3033 transitions. Word has length 26 [2020-10-09 11:03:28,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-09 11:03:28,664 INFO L481 AbstractCegarLoop]: Abstraction has 885 states and 3033 transitions. [2020-10-09 11:03:28,664 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-10-09 11:03:28,664 INFO L276 IsEmpty]: Start isEmpty. Operand 885 states and 3033 transitions. [2020-10-09 11:03:28,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2020-10-09 11:03:28,667 INFO L413 BasicCegarLoop]: Found error trace [2020-10-09 11:03:28,667 INFO L421 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-09 11:03:28,667 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2020-10-09 11:03:28,667 INFO L429 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-09 11:03:28,669 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 11:03:28,669 INFO L82 PathProgramCache]: Analyzing trace with hash -416507732, now seen corresponding path program 1 times [2020-10-09 11:03:28,670 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-09 11:03:28,670 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [888155412] [2020-10-09 11:03:28,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-09 11:03:28,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 11:03:28,784 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-09 11:03:28,784 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [888155412] [2020-10-09 11:03:28,785 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-09 11:03:28,785 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-10-09 11:03:28,785 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [705196045] [2020-10-09 11:03:28,786 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-09 11:03:28,786 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-09 11:03:28,786 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-09 11:03:28,786 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2020-10-09 11:03:28,787 INFO L87 Difference]: Start difference. First operand 885 states and 3033 transitions. Second operand 8 states. [2020-10-09 11:03:28,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-09 11:03:28,962 INFO L93 Difference]: Finished difference Result 885 states and 3029 transitions. [2020-10-09 11:03:28,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-09 11:03:28,963 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 41 [2020-10-09 11:03:28,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-09 11:03:28,966 INFO L225 Difference]: With dead ends: 885 [2020-10-09 11:03:28,966 INFO L226 Difference]: Without dead ends: 879 [2020-10-09 11:03:28,967 INFO L673 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-09 11:03:28,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 879 states. [2020-10-09 11:03:28,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 879 to 879. [2020-10-09 11:03:28,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 879 states. [2020-10-09 11:03:28,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 879 states to 879 states and 3010 transitions. [2020-10-09 11:03:28,995 INFO L78 Accepts]: Start accepts. Automaton has 879 states and 3010 transitions. Word has length 41 [2020-10-09 11:03:28,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-09 11:03:28,996 INFO L481 AbstractCegarLoop]: Abstraction has 879 states and 3010 transitions. [2020-10-09 11:03:28,996 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-09 11:03:28,996 INFO L276 IsEmpty]: Start isEmpty. Operand 879 states and 3010 transitions. [2020-10-09 11:03:28,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2020-10-09 11:03:28,999 INFO L413 BasicCegarLoop]: Found error trace [2020-10-09 11:03:28,999 INFO L421 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-09 11:03:28,999 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2020-10-09 11:03:29,000 INFO L429 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-09 11:03:29,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 11:03:29,000 INFO L82 PathProgramCache]: Analyzing trace with hash 829092404, now seen corresponding path program 1 times [2020-10-09 11:03:29,000 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-09 11:03:29,001 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [855438692] [2020-10-09 11:03:29,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-09 11:03:29,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 11:03:29,112 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-09 11:03:29,113 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [855438692] [2020-10-09 11:03:29,115 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-09 11:03:29,115 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-10-09 11:03:29,115 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1961938213] [2020-10-09 11:03:29,116 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-09 11:03:29,116 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-09 11:03:29,117 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-09 11:03:29,117 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2020-10-09 11:03:29,118 INFO L87 Difference]: Start difference. First operand 879 states and 3010 transitions. Second operand 8 states. [2020-10-09 11:03:29,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-09 11:03:29,304 INFO L93 Difference]: Finished difference Result 879 states and 3006 transitions. [2020-10-09 11:03:29,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-09 11:03:29,305 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 41 [2020-10-09 11:03:29,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-09 11:03:29,308 INFO L225 Difference]: With dead ends: 879 [2020-10-09 11:03:29,308 INFO L226 Difference]: Without dead ends: 819 [2020-10-09 11:03:29,309 INFO L673 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-09 11:03:29,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 819 states. [2020-10-09 11:03:29,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 819 to 819. [2020-10-09 11:03:29,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 819 states. [2020-10-09 11:03:29,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 819 states to 819 states and 2784 transitions. [2020-10-09 11:03:29,330 INFO L78 Accepts]: Start accepts. Automaton has 819 states and 2784 transitions. Word has length 41 [2020-10-09 11:03:29,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-09 11:03:29,331 INFO L481 AbstractCegarLoop]: Abstraction has 819 states and 2784 transitions. [2020-10-09 11:03:29,331 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-09 11:03:29,332 INFO L276 IsEmpty]: Start isEmpty. Operand 819 states and 2784 transitions. [2020-10-09 11:03:29,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2020-10-09 11:03:29,334 INFO L413 BasicCegarLoop]: Found error trace [2020-10-09 11:03:29,334 INFO L421 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-09 11:03:29,334 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2020-10-09 11:03:29,334 INFO L429 AbstractCegarLoop]: === Iteration 44 === [thread0Err1INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Err4INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5INUSE_VIOLATION, thread0Thread1of1ForFork3Err8INUSE_VIOLATION, thread0Thread1of1ForFork3Err9INUSE_VIOLATION, thread0Thread1of1ForFork3Err7INUSE_VIOLATION, thread0Thread1of1ForFork3Err6INUSE_VIOLATION, thread0Thread1of1ForFork3Err10INUSE_VIOLATION]=== [2020-10-09 11:03:29,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 11:03:29,335 INFO L82 PathProgramCache]: Analyzing trace with hash 1378914744, now seen corresponding path program 1 times [2020-10-09 11:03:29,335 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-09 11:03:29,335 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [368875263] [2020-10-09 11:03:29,335 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-09 11:03:29,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-09 11:03:29,357 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-09 11:03:29,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-09 11:03:29,376 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-09 11:03:29,429 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-09 11:03:29,429 INFO L519 BasicCegarLoop]: Counterexample might be feasible [2020-10-09 11:03:29,430 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2020-10-09 11:03:29,587 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.10 11:03:29 BasicIcfg [2020-10-09 11:03:29,588 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-09 11:03:29,590 INFO L168 Benchmark]: Toolchain (without parser) took 30462.60 ms. Allocated memory was 249.0 MB in the beginning and 945.3 MB in the end (delta: 696.3 MB). Free memory was 204.2 MB in the beginning and 583.7 MB in the end (delta: -379.5 MB). Peak memory consumption was 316.8 MB. Max. memory is 14.2 GB. [2020-10-09 11:03:29,590 INFO L168 Benchmark]: CDTParser took 0.35 ms. Allocated memory is still 249.0 MB. Free memory is still 225.4 MB. There was no memory consumed. Max. memory is 14.2 GB. [2020-10-09 11:03:29,591 INFO L168 Benchmark]: CACSL2BoogieTranslator took 917.98 ms. Allocated memory was 249.0 MB in the beginning and 306.2 MB in the end (delta: 57.1 MB). Free memory was 204.2 MB in the beginning and 221.2 MB in the end (delta: -17.0 MB). Peak memory consumption was 50.3 MB. Max. memory is 14.2 GB. [2020-10-09 11:03:29,591 INFO L168 Benchmark]: Boogie Procedure Inliner took 62.14 ms. Allocated memory is still 306.2 MB. Free memory was 221.2 MB in the beginning and 218.7 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB. [2020-10-09 11:03:29,592 INFO L168 Benchmark]: Boogie Preprocessor took 36.75 ms. Allocated memory is still 306.2 MB. Free memory was 218.7 MB in the beginning and 216.2 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB. [2020-10-09 11:03:29,592 INFO L168 Benchmark]: RCFGBuilder took 489.29 ms. Allocated memory is still 306.2 MB. Free memory was 216.2 MB in the beginning and 189.3 MB in the end (delta: 26.9 MB). Peak memory consumption was 26.9 MB. Max. memory is 14.2 GB. [2020-10-09 11:03:29,592 INFO L168 Benchmark]: TraceAbstraction took 28950.31 ms. Allocated memory was 306.2 MB in the beginning and 945.3 MB in the end (delta: 639.1 MB). Free memory was 189.3 MB in the beginning and 583.7 MB in the end (delta: -394.4 MB). Peak memory consumption was 244.7 MB. Max. memory is 14.2 GB. [2020-10-09 11:03:29,595 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.35 ms. Allocated memory is still 249.0 MB. Free memory is still 225.4 MB. There was no memory consumed. Max. memory is 14.2 GB. * CACSL2BoogieTranslator took 917.98 ms. Allocated memory was 249.0 MB in the beginning and 306.2 MB in the end (delta: 57.1 MB). Free memory was 204.2 MB in the beginning and 221.2 MB in the end (delta: -17.0 MB). Peak memory consumption was 50.3 MB. Max. memory is 14.2 GB. * Boogie Procedure Inliner took 62.14 ms. Allocated memory is still 306.2 MB. Free memory was 221.2 MB in the beginning and 218.7 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB. * Boogie Preprocessor took 36.75 ms. Allocated memory is still 306.2 MB. Free memory was 218.7 MB in the beginning and 216.2 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB. * RCFGBuilder took 489.29 ms. Allocated memory is still 306.2 MB. Free memory was 216.2 MB in the beginning and 189.3 MB in the end (delta: 26.9 MB). Peak memory consumption was 26.9 MB. Max. memory is 14.2 GB. * TraceAbstraction took 28950.31 ms. Allocated memory was 306.2 MB in the beginning and 945.3 MB in the end (delta: 639.1 MB). Free memory was 189.3 MB in the beginning and 583.7 MB in the end (delta: -394.4 MB). Peak memory consumption was 244.7 MB. Max. memory is 14.2 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks 3325 VarBasedMoverChecksPositive, 40 VarBasedMoverChecksNegative, 2 SemBasedMoverChecksPositive, 38 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.2s, 1147 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 2.3s, 172 PlacesBefore, 101 PlacesAfterwards, 243 TransitionsBefore, 173 TransitionsAfterwards, 4038 CoEnabledTransitionPairs, 5 FixpointIterations, 23 TrivialSequentialCompositions, 48 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 4 ConcurrentYvCompositions, 1 ChoiceCompositions, 76 TotalNumberOfCompositions, 47722 MoverChecksTotal - 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={11:0}, t2={13:0}, t3={10:0}, t4={8: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={11:0}, t2={13:0}, t3={10:0}, t4={8: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={11:0}, t2={13:0}, t3={10:0}, t4={8: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={11:0}, t2={13:0}, t3={10:0}, t4={8: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={11:0}, t2={13:0}, t3={10:0}, t4={8: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={11:0}, t2={13:0}, t3={10:0}, t4={8: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={11:0}, t2={13:0}, t3={10:0}, t4={8: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={11:0}, t2={13:0}, t3={10:0}, t4={8: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={11:0}, t2={13:0}, t3={10:0}, t4={8: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={11:0}, t2={13:0}, t3={10:0}, t4={8: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={11:0}, t2={13:0}, t3={10:0}, t4={8: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={11:0}, t2={13:0}, t3={10:0}, t4={8: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={11:0}, t2={13:0}, t3={10:0}, t4={8: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={11:0}, t2={13:0}, t3={10:0}, t4={8: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={11:0}, t2={13:0}, t3={10:0}, t4={8: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={11:0}, t2={13:0}, t3={10:0}, t4={8: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: 28.3s, OverallIterations: 44, TraceHistogramMax: 1, AutomataDifference: 14.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.0s, HoareTripleCheckerStatistics: 4657 SDtfs, 7459 SDslu, 14204 SDs, 0 SdLazy, 8536 SolverSat, 1019 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 6.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 534 GetRequests, 45 SyntacticMatches, 5 SemanticMatches, 484 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 479 ImplicationChecksByTransitivity, 6.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=4131occurred in iteration=7, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 4.2s AutomataMinimizationTime, 43 MinimizatonAttempts, 43210 StatesRemovedByMinimization, 41 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 4.5s InterpolantComputationTime, 984 NumberOfCodeBlocks, 984 NumberOfCodeBlocksAsserted, 44 NumberOfCheckSat, 900 ConstructedInterpolants, 0 QuantifiedInterpolants, 216521 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 43 InterpolantComputations, 43 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...