/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-7bb8cbd [2020-10-15 16:40:42,774 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-15 16:40:42,776 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-15 16:40:42,800 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-15 16:40:42,800 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-15 16:40:42,801 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-15 16:40:42,803 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-15 16:40:42,809 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-15 16:40:42,813 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-15 16:40:42,814 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-15 16:40:42,817 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-15 16:40:42,819 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-15 16:40:42,819 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-15 16:40:42,820 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-15 16:40:42,823 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-15 16:40:42,824 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-15 16:40:42,825 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-15 16:40:42,829 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-15 16:40:42,831 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-15 16:40:42,837 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-15 16:40:42,841 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-15 16:40:42,844 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-15 16:40:42,845 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-15 16:40:42,846 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-15 16:40:42,850 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-15 16:40:42,850 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-15 16:40:42,851 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-15 16:40:42,852 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-15 16:40:42,852 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-15 16:40:42,853 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-15 16:40:42,854 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-15 16:40:42,854 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-15 16:40:42,856 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-15 16:40:42,857 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-15 16:40:42,859 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-15 16:40:42,859 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-15 16:40:42,859 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-15 16:40:42,860 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-15 16:40:42,860 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-15 16:40:42,861 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-15 16:40:42,862 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-15 16:40:42,863 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-15 16:40:42,903 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-15 16:40:42,903 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-15 16:40:42,905 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-15 16:40:42,905 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-15 16:40:42,905 INFO L138 SettingsManager]: * Use SBE=true [2020-10-15 16:40:42,906 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-15 16:40:42,906 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-15 16:40:42,906 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-15 16:40:42,906 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-15 16:40:42,906 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-15 16:40:42,908 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-15 16:40:42,908 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-15 16:40:42,908 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-15 16:40:42,908 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-15 16:40:42,909 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-15 16:40:42,909 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-15 16:40:42,909 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-15 16:40:42,909 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-15 16:40:42,909 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-15 16:40:42,910 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-15 16:40:42,910 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-15 16:40:42,910 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-15 16:40:42,910 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-15 16:40:42,910 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-10-15 16:40:42,911 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-15 16:40:42,911 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-15 16:40:42,911 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-15 16:40:42,911 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-10-15 16:40:42,911 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-10-15 16:40:42,911 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-10-15 16:40:43,231 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-15 16:40:43,248 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-15 16:40:43,253 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-15 16:40:43,255 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-15 16:40:43,255 INFO L275 PluginConnector]: CDTParser initialized [2020-10-15 16:40:43,256 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread/singleton.i [2020-10-15 16:40:43,329 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1156542ab/239e337653084a18874be4e8542a16ea/FLAGf694a6f29 [2020-10-15 16:40:43,879 INFO L306 CDTParser]: Found 1 translation units. [2020-10-15 16:40:43,880 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread/singleton.i [2020-10-15 16:40:43,909 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1156542ab/239e337653084a18874be4e8542a16ea/FLAGf694a6f29 [2020-10-15 16:40:44,159 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1156542ab/239e337653084a18874be4e8542a16ea [2020-10-15 16:40:44,170 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-15 16:40:44,172 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-10-15 16:40:44,173 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-15 16:40:44,173 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-15 16:40:44,177 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-15 16:40:44,178 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 04:40:44" (1/1) ... [2020-10-15 16:40:44,181 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7267ed8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:40:44, skipping insertion in model container [2020-10-15 16:40:44,181 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 04:40:44" (1/1) ... [2020-10-15 16:40:44,189 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-15 16:40:44,235 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-15 16:40:44,808 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-15 16:40:44,819 INFO L203 MainTranslator]: Completed pre-run [2020-10-15 16:40:44,867 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-15 16:40:45,067 INFO L208 MainTranslator]: Completed translation [2020-10-15 16:40:45,068 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:40:45 WrapperNode [2020-10-15 16:40:45,068 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-15 16:40:45,069 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-15 16:40:45,069 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-15 16:40:45,069 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-15 16:40:45,078 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:40:45" (1/1) ... [2020-10-15 16:40:45,109 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:40:45" (1/1) ... [2020-10-15 16:40:45,132 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-15 16:40:45,132 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-15 16:40:45,132 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-15 16:40:45,132 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-15 16:40:45,142 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:40:45" (1/1) ... [2020-10-15 16:40:45,142 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:40:45" (1/1) ... [2020-10-15 16:40:45,145 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:40:45" (1/1) ... [2020-10-15 16:40:45,146 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:40:45" (1/1) ... [2020-10-15 16:40:45,154 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:40:45" (1/1) ... [2020-10-15 16:40:45,157 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:40:45" (1/1) ... [2020-10-15 16:40:45,159 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:40:45" (1/1) ... [2020-10-15 16:40:45,163 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-15 16:40:45,163 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-15 16:40:45,163 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-15 16:40:45,164 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-15 16:40:45,165 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:40:45" (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-15 16:40:45,222 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-15 16:40:45,222 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-15 16:40:45,222 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-10-15 16:40:45,222 INFO L130 BoogieDeclarations]: Found specification of procedure thread0 [2020-10-15 16:40:45,222 INFO L138 BoogieDeclarations]: Found implementation of procedure thread0 [2020-10-15 16:40:45,223 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2020-10-15 16:40:45,223 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2020-10-15 16:40:45,223 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2020-10-15 16:40:45,223 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2020-10-15 16:40:45,223 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2020-10-15 16:40:45,224 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2020-10-15 16:40:45,224 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-15 16:40:45,224 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2020-10-15 16:40:45,224 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-15 16:40:45,224 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-15 16:40:45,226 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2020-10-15 16:40:45,635 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-15 16:40:45,635 INFO L298 CfgBuilder]: Removed 6 assume(true) statements. [2020-10-15 16:40:45,640 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 04:40:45 BoogieIcfgContainer [2020-10-15 16:40:45,641 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-15 16:40:45,642 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-15 16:40:45,642 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-15 16:40:45,647 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-15 16:40:45,647 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.10 04:40:44" (1/3) ... [2020-10-15 16:40:45,648 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@107e995f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 04:40:45, skipping insertion in model container [2020-10-15 16:40:45,648 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:40:45" (2/3) ... [2020-10-15 16:40:45,649 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@107e995f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 04:40:45, skipping insertion in model container [2020-10-15 16:40:45,649 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 04:40:45" (3/3) ... [2020-10-15 16:40:45,651 INFO L111 eAbstractionObserver]: Analyzing ICFG singleton.i [2020-10-15 16:40:45,663 WARN L153 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2020-10-15 16:40:45,664 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-10-15 16:40:45,673 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-10-15 16:40:45,673 INFO L348 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-10-15 16:40:45,712 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 16:40:45,713 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 16:40:45,713 WARN L313 ript$VariableManager]: TermVariabe thread0Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 16:40:45,713 WARN L313 ript$VariableManager]: TermVariabe thread0Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 16:40:45,714 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 16:40:45,714 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t1~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 16:40:45,714 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t2~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 16:40:45,714 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 16:40:45,715 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 16:40:45,715 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t3~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 16:40:45,716 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t4~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 16:40:45,716 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t4~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 16:40:45,716 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t5~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 16:40:45,716 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t5~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 16:40:45,717 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 16:40:45,717 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t1~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 16:40:45,718 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 16:40:45,718 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 16:40:45,718 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t1~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 16:40:45,718 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#t~mem4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 16:40:45,719 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#t~mem4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 16:40:45,719 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t2~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 16:40:45,720 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 16:40:45,720 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 16:40:45,720 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 16:40:45,720 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t3~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 16:40:45,721 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 16:40:45,721 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t4~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 16:40:45,721 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t4~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 16:40:45,722 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#t~nondet7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 16:40:45,722 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t5~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 16:40:45,722 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t5~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 16:40:45,723 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#t~nondet8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 16:40:45,723 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t2~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 16:40:45,723 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 16:40:45,723 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 16:40:45,724 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 16:40:45,724 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 16:40:45,724 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t3~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 16:40:45,724 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#t~mem10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 16:40:45,725 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#t~mem10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 16:40:45,725 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t4~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 16:40:45,725 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t4~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 16:40:45,725 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#t~mem11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 16:40:45,726 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#t~mem11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 16:40:45,726 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t5~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 16:40:45,726 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t5~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 16:40:45,726 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#t~mem12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 16:40:45,727 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#t~mem12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 16:40:45,727 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 16:40:45,727 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 16:40:45,728 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 16:40:45,728 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 16:40:45,728 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t1~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 16:40:45,728 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 16:40:45,729 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 16:40:45,729 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t2~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 16:40:45,729 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 16:40:45,729 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t3~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 16:40:45,730 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 16:40:45,730 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t4~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 16:40:45,730 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t4~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 16:40:45,730 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t4~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 16:40:45,731 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t5~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 16:40:45,731 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t5~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 16:40:45,731 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t5~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 16:40:45,731 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork4_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 16:40:45,732 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork4_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 16:40:45,732 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork4_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 16:40:45,732 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork4_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 16:40:45,732 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork4_#t~malloc2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 16:40:45,733 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork4_#t~malloc2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 16:40:45,733 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork4_#t~malloc2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 16:40:45,733 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork4_#t~malloc2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 16:40:45,733 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork4_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 16:40:45,734 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork4_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 16:40:45,734 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 16:40:45,734 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 16:40:45,735 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 16:40:45,735 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 16:40:45,735 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 16:40:45,735 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 16:40:45,736 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 16:40:45,736 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 16:40:45,736 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 16:40:45,736 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 16:40:45,737 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 16:40:45,737 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 16:40:45,737 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork5_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 16:40:45,738 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork5_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 16:40:45,738 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork5_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 16:40:45,738 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork5_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 16:40:45,738 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork5_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 16:40:45,739 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork5_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 16:40:45,739 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 16:40:45,739 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 16:40:45,739 WARN L313 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 16:40:45,740 WARN L313 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 16:40:45,740 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 16:40:45,740 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 16:40:45,744 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 16:40:45,744 WARN L313 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 16:40:45,745 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 16:40:45,745 WARN L313 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 16:40:45,751 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 16:40:45,751 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 16:40:45,751 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 16:40:45,752 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 16:40:45,754 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 16:40:45,755 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 16:40:45,755 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 16:40:45,755 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 16:40:45,759 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#t~nondet8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 16:40:45,759 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#t~mem4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 16:40:45,759 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 16:40:45,759 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t4~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 16:40:45,760 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t2~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 16:40:45,760 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 16:40:45,760 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 16:40:45,760 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#t~mem10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 16:40:45,761 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#t~mem11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 16:40:45,761 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t4~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 16:40:45,761 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#t~mem12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 16:40:45,761 WARN L313 ript$VariableManager]: TermVariabe thread0Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 16:40:45,761 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t3~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 16:40:45,762 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 16:40:45,762 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 16:40:45,762 WARN L313 ript$VariableManager]: TermVariabe thread0Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 16:40:45,762 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 16:40:45,763 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t1~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 16:40:45,763 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t5~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 16:40:45,763 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 16:40:45,763 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t5~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 16:40:45,763 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 16:40:45,764 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 16:40:45,764 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#t~nondet7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 16:40:45,767 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork4_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 16:40:45,767 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork4_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 16:40:45,767 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork4_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 16:40:45,767 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork4_#t~malloc2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 16:40:45,768 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork4_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 16:40:45,768 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork4_#t~malloc2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 16:40:45,770 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork5_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 16:40:45,770 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork5_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 16:40:45,771 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork5_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 16:40:45,771 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork5_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 16:40:45,773 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork4_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 16:40:45,773 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork4_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 16:40:45,774 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork4_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 16:40:45,774 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork4_#t~malloc2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 16:40:45,774 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork4_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 16:40:45,774 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork4_#t~malloc2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 16:40:45,777 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork5_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 16:40:45,777 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork5_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 16:40:45,777 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork5_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 16:40:45,777 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork5_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 16:40:45,779 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 16:40:45,780 WARN L313 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 16:40:45,780 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 16:40:45,780 WARN L313 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 16:40:45,783 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 16:40:45,783 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 16:40:45,783 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 16:40:45,783 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 16:40:45,785 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 16:40:45,786 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 16:40:45,786 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 16:40:45,786 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 16:40:45,967 INFO L253 AbstractCegarLoop]: Starting to check reachability of 12 error locations. [2020-10-15 16:40:45,994 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-15 16:40:45,994 INFO L378 AbstractCegarLoop]: Hoare is true [2020-10-15 16:40:45,995 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-10-15 16:40:45,995 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-15 16:40:45,995 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-15 16:40:45,995 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-15 16:40:45,995 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-15 16:40:45,995 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-15 16:40:46,025 INFO L129 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2020-10-15 16:40:46,028 INFO L144 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 172 places, 243 transitions, 866 flow [2020-10-15 16:40:46,031 INFO L111 LiptonReduction]: Starting Lipton reduction on Petri net that has 172 places, 243 transitions, 866 flow [2020-10-15 16:40:46,034 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 172 places, 243 transitions, 866 flow [2020-10-15 16:40:46,192 INFO L129 PetriNetUnfolder]: 61/264 cut-off events. [2020-10-15 16:40:46,192 INFO L130 PetriNetUnfolder]: For 39/39 co-relation queries the response was YES. [2020-10-15 16:40:46,207 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-15 16:40:46,224 INFO L117 LiptonReduction]: Number of co-enabled transitions 4038 [2020-10-15 16:40:47,512 WARN L193 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 61 [2020-10-15 16:40:47,958 WARN L193 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 77 [2020-10-15 16:40:48,068 WARN L193 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 73 [2020-10-15 16:40:48,329 INFO L132 LiptonReduction]: Checked pairs total: 47722 [2020-10-15 16:40:48,329 INFO L134 LiptonReduction]: Total number of compositions: 76 [2020-10-15 16:40:48,337 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 101 places, 173 transitions, 726 flow [2020-10-15 16:40:48,880 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 3502 states. [2020-10-15 16:40:48,883 INFO L276 IsEmpty]: Start isEmpty. Operand 3502 states. [2020-10-15 16:40:48,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-10-15 16:40:48,890 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 16:40:48,891 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-15 16:40:48,891 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-15 16:40:48,898 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 16:40:48,898 INFO L82 PathProgramCache]: Analyzing trace with hash 1069688068, now seen corresponding path program 1 times [2020-10-15 16:40:48,909 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 16:40:48,909 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1812100458] [2020-10-15 16:40:48,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 16:40:49,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 16:40:49,177 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-15 16:40:49,178 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1812100458] [2020-10-15 16:40:49,181 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 16:40:49,181 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-15 16:40:49,182 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1324651140] [2020-10-15 16:40:49,187 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-15 16:40:49,188 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 16:40:49,202 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-15 16:40:49,203 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-10-15 16:40:49,205 INFO L87 Difference]: Start difference. First operand 3502 states. Second operand 6 states. [2020-10-15 16:40:49,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 16:40:49,599 INFO L93 Difference]: Finished difference Result 4760 states and 19900 transitions. [2020-10-15 16:40:49,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-15 16:40:49,602 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 9 [2020-10-15 16:40:49,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 16:40:49,676 INFO L225 Difference]: With dead ends: 4760 [2020-10-15 16:40:49,676 INFO L226 Difference]: Without dead ends: 4272 [2020-10-15 16:40:49,678 INFO L677 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-15 16:40:49,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4272 states. [2020-10-15 16:40:49,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4272 to 3018. [2020-10-15 16:40:49,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3018 states. [2020-10-15 16:40:49,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3018 states to 3018 states and 12272 transitions. [2020-10-15 16:40:49,999 INFO L78 Accepts]: Start accepts. Automaton has 3018 states and 12272 transitions. Word has length 9 [2020-10-15 16:40:50,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 16:40:50,000 INFO L481 AbstractCegarLoop]: Abstraction has 3018 states and 12272 transitions. [2020-10-15 16:40:50,003 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-15 16:40:50,003 INFO L276 IsEmpty]: Start isEmpty. Operand 3018 states and 12272 transitions. [2020-10-15 16:40:50,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-10-15 16:40:50,004 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 16:40:50,011 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-15 16:40:50,012 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-15 16:40:50,012 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-15 16:40:50,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 16:40:50,013 INFO L82 PathProgramCache]: Analyzing trace with hash 1263032832, now seen corresponding path program 2 times [2020-10-15 16:40:50,013 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 16:40:50,013 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [236065628] [2020-10-15 16:40:50,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 16:40:50,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 16:40:50,143 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-15 16:40:50,144 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [236065628] [2020-10-15 16:40:50,144 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 16:40:50,145 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-15 16:40:50,145 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2014896252] [2020-10-15 16:40:50,147 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-15 16:40:50,147 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 16:40:50,147 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-15 16:40:50,148 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-10-15 16:40:50,148 INFO L87 Difference]: Start difference. First operand 3018 states and 12272 transitions. Second operand 6 states. [2020-10-15 16:40:50,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 16:40:50,483 INFO L93 Difference]: Finished difference Result 5518 states and 23821 transitions. [2020-10-15 16:40:50,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-15 16:40:50,483 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 9 [2020-10-15 16:40:50,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 16:40:50,533 INFO L225 Difference]: With dead ends: 5518 [2020-10-15 16:40:50,533 INFO L226 Difference]: Without dead ends: 5518 [2020-10-15 16:40:50,534 INFO L677 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-15 16:40:50,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5518 states. [2020-10-15 16:40:50,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5518 to 3008. [2020-10-15 16:40:50,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3008 states. [2020-10-15 16:40:50,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3008 states to 3008 states and 12255 transitions. [2020-10-15 16:40:50,682 INFO L78 Accepts]: Start accepts. Automaton has 3008 states and 12255 transitions. Word has length 9 [2020-10-15 16:40:50,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 16:40:50,682 INFO L481 AbstractCegarLoop]: Abstraction has 3008 states and 12255 transitions. [2020-10-15 16:40:50,683 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-15 16:40:50,683 INFO L276 IsEmpty]: Start isEmpty. Operand 3008 states and 12255 transitions. [2020-10-15 16:40:50,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-10-15 16:40:50,684 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 16:40:50,684 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-15 16:40:50,684 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-15 16:40:50,685 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-15 16:40:50,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 16:40:50,685 INFO L82 PathProgramCache]: Analyzing trace with hash -690496787, now seen corresponding path program 1 times [2020-10-15 16:40:50,685 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 16:40:50,686 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1076868874] [2020-10-15 16:40:50,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 16:40:50,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 16:40:50,734 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-15 16:40:50,735 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1076868874] [2020-10-15 16:40:50,735 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 16:40:50,735 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-15 16:40:50,735 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1991219804] [2020-10-15 16:40:50,736 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-15 16:40:50,736 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 16:40:50,736 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-15 16:40:50,736 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-15 16:40:50,737 INFO L87 Difference]: Start difference. First operand 3008 states and 12255 transitions. Second operand 3 states. [2020-10-15 16:40:50,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 16:40:50,814 INFO L93 Difference]: Finished difference Result 4848 states and 19273 transitions. [2020-10-15 16:40:50,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-15 16:40:50,814 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2020-10-15 16:40:50,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 16:40:50,842 INFO L225 Difference]: With dead ends: 4848 [2020-10-15 16:40:50,842 INFO L226 Difference]: Without dead ends: 3558 [2020-10-15 16:40:50,843 INFO L677 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-15 16:40:50,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3558 states. [2020-10-15 16:40:50,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3558 to 3181. [2020-10-15 16:40:50,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3181 states. [2020-10-15 16:40:50,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3181 states to 3181 states and 12171 transitions. [2020-10-15 16:40:50,956 INFO L78 Accepts]: Start accepts. Automaton has 3181 states and 12171 transitions. Word has length 16 [2020-10-15 16:40:50,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 16:40:50,957 INFO L481 AbstractCegarLoop]: Abstraction has 3181 states and 12171 transitions. [2020-10-15 16:40:50,957 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-15 16:40:50,957 INFO L276 IsEmpty]: Start isEmpty. Operand 3181 states and 12171 transitions. [2020-10-15 16:40:50,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-10-15 16:40:50,959 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 16:40:50,959 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-15 16:40:50,959 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-15 16:40:50,960 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-15 16:40:50,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 16:40:50,960 INFO L82 PathProgramCache]: Analyzing trace with hash 69435085, now seen corresponding path program 1 times [2020-10-15 16:40:50,960 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 16:40:50,961 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1617575683] [2020-10-15 16:40:50,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 16:40:50,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 16:40:51,042 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-15 16:40:51,043 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1617575683] [2020-10-15 16:40:51,043 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 16:40:51,043 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-15 16:40:51,044 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [421327937] [2020-10-15 16:40:51,044 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-15 16:40:51,044 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 16:40:51,044 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-15 16:40:51,091 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-10-15 16:40:51,091 INFO L87 Difference]: Start difference. First operand 3181 states and 12171 transitions. Second operand 6 states. [2020-10-15 16:40:51,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 16:40:51,289 INFO L93 Difference]: Finished difference Result 4417 states and 17212 transitions. [2020-10-15 16:40:51,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-15 16:40:51,290 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 17 [2020-10-15 16:40:51,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 16:40:51,317 INFO L225 Difference]: With dead ends: 4417 [2020-10-15 16:40:51,318 INFO L226 Difference]: Without dead ends: 4393 [2020-10-15 16:40:51,318 INFO L677 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-15 16:40:51,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4393 states. [2020-10-15 16:40:51,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4393 to 3588. [2020-10-15 16:40:51,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3588 states. [2020-10-15 16:40:51,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3588 states to 3588 states and 14085 transitions. [2020-10-15 16:40:51,451 INFO L78 Accepts]: Start accepts. Automaton has 3588 states and 14085 transitions. Word has length 17 [2020-10-15 16:40:51,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 16:40:51,452 INFO L481 AbstractCegarLoop]: Abstraction has 3588 states and 14085 transitions. [2020-10-15 16:40:51,452 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-15 16:40:51,452 INFO L276 IsEmpty]: Start isEmpty. Operand 3588 states and 14085 transitions. [2020-10-15 16:40:51,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-10-15 16:40:51,454 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 16:40:51,454 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-15 16:40:51,454 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-15 16:40:51,455 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-15 16:40:51,455 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 16:40:51,455 INFO L82 PathProgramCache]: Analyzing trace with hash -954298863, now seen corresponding path program 2 times [2020-10-15 16:40:51,455 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 16:40:51,456 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [814101180] [2020-10-15 16:40:51,456 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 16:40:51,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 16:40:51,543 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-15 16:40:51,543 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [814101180] [2020-10-15 16:40:51,544 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 16:40:51,544 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-15 16:40:51,544 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2012436841] [2020-10-15 16:40:51,544 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-15 16:40:51,545 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 16:40:51,545 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-15 16:40:51,546 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-10-15 16:40:51,546 INFO L87 Difference]: Start difference. First operand 3588 states and 14085 transitions. Second operand 6 states. [2020-10-15 16:40:51,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 16:40:51,668 INFO L93 Difference]: Finished difference Result 4024 states and 15445 transitions. [2020-10-15 16:40:51,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-15 16:40:51,669 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 17 [2020-10-15 16:40:51,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 16:40:51,691 INFO L225 Difference]: With dead ends: 4024 [2020-10-15 16:40:51,691 INFO L226 Difference]: Without dead ends: 4024 [2020-10-15 16:40:51,692 INFO L677 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-15 16:40:51,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4024 states. [2020-10-15 16:40:51,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4024 to 3573. [2020-10-15 16:40:51,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3573 states. [2020-10-15 16:40:51,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3573 states to 3573 states and 14045 transitions. [2020-10-15 16:40:51,828 INFO L78 Accepts]: Start accepts. Automaton has 3573 states and 14045 transitions. Word has length 17 [2020-10-15 16:40:51,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 16:40:51,829 INFO L481 AbstractCegarLoop]: Abstraction has 3573 states and 14045 transitions. [2020-10-15 16:40:51,829 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-15 16:40:51,829 INFO L276 IsEmpty]: Start isEmpty. Operand 3573 states and 14045 transitions. [2020-10-15 16:40:51,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-10-15 16:40:51,833 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 16:40:51,833 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-15 16:40:51,833 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-15 16:40:51,834 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-15 16:40:51,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 16:40:51,836 INFO L82 PathProgramCache]: Analyzing trace with hash -687500069, now seen corresponding path program 1 times [2020-10-15 16:40:51,837 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 16:40:51,837 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1649963044] [2020-10-15 16:40:51,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 16:40:51,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 16:40:51,908 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-15 16:40:51,908 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1649963044] [2020-10-15 16:40:51,909 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 16:40:51,909 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-15 16:40:51,909 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [549706793] [2020-10-15 16:40:51,910 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-15 16:40:51,910 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 16:40:51,910 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-15 16:40:51,910 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-10-15 16:40:51,910 INFO L87 Difference]: Start difference. First operand 3573 states and 14045 transitions. Second operand 6 states. [2020-10-15 16:40:52,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 16:40:52,108 INFO L93 Difference]: Finished difference Result 4225 states and 16225 transitions. [2020-10-15 16:40:52,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-15 16:40:52,109 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 18 [2020-10-15 16:40:52,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 16:40:52,127 INFO L225 Difference]: With dead ends: 4225 [2020-10-15 16:40:52,128 INFO L226 Difference]: Without dead ends: 4129 [2020-10-15 16:40:52,128 INFO L677 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-15 16:40:52,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4129 states. [2020-10-15 16:40:52,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4129 to 3713. [2020-10-15 16:40:52,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3713 states. [2020-10-15 16:40:52,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3713 states to 3713 states and 14455 transitions. [2020-10-15 16:40:52,272 INFO L78 Accepts]: Start accepts. Automaton has 3713 states and 14455 transitions. Word has length 18 [2020-10-15 16:40:52,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 16:40:52,272 INFO L481 AbstractCegarLoop]: Abstraction has 3713 states and 14455 transitions. [2020-10-15 16:40:52,273 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-15 16:40:52,273 INFO L276 IsEmpty]: Start isEmpty. Operand 3713 states and 14455 transitions. [2020-10-15 16:40:52,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-10-15 16:40:52,274 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 16:40:52,274 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-15 16:40:52,275 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-15 16:40:52,275 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-15 16:40:52,275 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 16:40:52,275 INFO L82 PathProgramCache]: Analyzing trace with hash -454402421, now seen corresponding path program 2 times [2020-10-15 16:40:52,276 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 16:40:52,276 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1818711064] [2020-10-15 16:40:52,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 16:40:52,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 16:40:52,473 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-15 16:40:52,473 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1818711064] [2020-10-15 16:40:52,474 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 16:40:52,474 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-15 16:40:52,474 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1695378131] [2020-10-15 16:40:52,474 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-15 16:40:52,475 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 16:40:52,475 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-15 16:40:52,475 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2020-10-15 16:40:52,475 INFO L87 Difference]: Start difference. First operand 3713 states and 14455 transitions. Second operand 7 states. [2020-10-15 16:40:52,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 16:40:52,769 INFO L93 Difference]: Finished difference Result 4979 states and 19779 transitions. [2020-10-15 16:40:52,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-10-15 16:40:52,770 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 18 [2020-10-15 16:40:52,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 16:40:52,792 INFO L225 Difference]: With dead ends: 4979 [2020-10-15 16:40:52,792 INFO L226 Difference]: Without dead ends: 4905 [2020-10-15 16:40:52,793 INFO L677 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-15 16:40:52,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4905 states. [2020-10-15 16:40:52,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4905 to 4131. [2020-10-15 16:40:52,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4131 states. [2020-10-15 16:40:52,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4131 states to 4131 states and 16620 transitions. [2020-10-15 16:40:52,934 INFO L78 Accepts]: Start accepts. Automaton has 4131 states and 16620 transitions. Word has length 18 [2020-10-15 16:40:52,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 16:40:52,934 INFO L481 AbstractCegarLoop]: Abstraction has 4131 states and 16620 transitions. [2020-10-15 16:40:52,934 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-15 16:40:52,934 INFO L276 IsEmpty]: Start isEmpty. Operand 4131 states and 16620 transitions. [2020-10-15 16:40:52,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-10-15 16:40:52,936 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 16:40:52,936 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-15 16:40:52,936 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-10-15 16:40:52,936 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-15 16:40:52,937 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 16:40:52,937 INFO L82 PathProgramCache]: Analyzing trace with hash -1254406997, now seen corresponding path program 3 times [2020-10-15 16:40:52,937 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 16:40:52,937 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1440370431] [2020-10-15 16:40:52,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 16:40:52,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 16:40:53,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-15 16:40:53,028 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1440370431] [2020-10-15 16:40:53,028 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 16:40:53,028 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-15 16:40:53,029 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [111410936] [2020-10-15 16:40:53,029 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-15 16:40:53,029 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 16:40:53,030 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-15 16:40:53,030 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2020-10-15 16:40:53,030 INFO L87 Difference]: Start difference. First operand 4131 states and 16620 transitions. Second operand 8 states. [2020-10-15 16:40:53,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 16:40:53,347 INFO L93 Difference]: Finished difference Result 6735 states and 27904 transitions. [2020-10-15 16:40:53,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-15 16:40:53,348 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 18 [2020-10-15 16:40:53,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 16:40:53,369 INFO L225 Difference]: With dead ends: 6735 [2020-10-15 16:40:53,370 INFO L226 Difference]: Without dead ends: 6661 [2020-10-15 16:40:53,370 INFO L677 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-15 16:40:53,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6661 states. [2020-10-15 16:40:53,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6661 to 4129. [2020-10-15 16:40:53,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4129 states. [2020-10-15 16:40:53,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4129 states to 4129 states and 16616 transitions. [2020-10-15 16:40:53,519 INFO L78 Accepts]: Start accepts. Automaton has 4129 states and 16616 transitions. Word has length 18 [2020-10-15 16:40:53,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 16:40:53,519 INFO L481 AbstractCegarLoop]: Abstraction has 4129 states and 16616 transitions. [2020-10-15 16:40:53,519 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-15 16:40:53,520 INFO L276 IsEmpty]: Start isEmpty. Operand 4129 states and 16616 transitions. [2020-10-15 16:40:53,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-10-15 16:40:53,521 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 16:40:53,521 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-15 16:40:53,521 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-10-15 16:40:53,522 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-15 16:40:53,522 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 16:40:53,522 INFO L82 PathProgramCache]: Analyzing trace with hash -164095139, now seen corresponding path program 4 times [2020-10-15 16:40:53,522 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 16:40:53,522 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [794518857] [2020-10-15 16:40:53,523 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 16:40:53,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 16:40:53,734 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-15 16:40:53,734 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [794518857] [2020-10-15 16:40:53,735 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 16:40:53,735 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-10-15 16:40:53,735 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1842211392] [2020-10-15 16:40:53,735 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-10-15 16:40:53,736 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 16:40:53,736 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-10-15 16:40:53,736 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2020-10-15 16:40:53,736 INFO L87 Difference]: Start difference. First operand 4129 states and 16616 transitions. Second operand 10 states. [2020-10-15 16:40:54,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 16:40:54,214 INFO L93 Difference]: Finished difference Result 6639 states and 26238 transitions. [2020-10-15 16:40:54,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-15 16:40:54,214 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 18 [2020-10-15 16:40:54,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 16:40:54,229 INFO L225 Difference]: With dead ends: 6639 [2020-10-15 16:40:54,229 INFO L226 Difference]: Without dead ends: 6491 [2020-10-15 16:40:54,230 INFO L677 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-15 16:40:54,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6491 states. [2020-10-15 16:40:54,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6491 to 3873. [2020-10-15 16:40:54,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3873 states. [2020-10-15 16:40:54,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3873 states to 3873 states and 15364 transitions. [2020-10-15 16:40:54,357 INFO L78 Accepts]: Start accepts. Automaton has 3873 states and 15364 transitions. Word has length 18 [2020-10-15 16:40:54,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 16:40:54,358 INFO L481 AbstractCegarLoop]: Abstraction has 3873 states and 15364 transitions. [2020-10-15 16:40:54,359 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-10-15 16:40:54,359 INFO L276 IsEmpty]: Start isEmpty. Operand 3873 states and 15364 transitions. [2020-10-15 16:40:54,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-10-15 16:40:54,360 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 16:40:54,360 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-15 16:40:54,360 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-10-15 16:40:54,361 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-15 16:40:54,361 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 16:40:54,361 INFO L82 PathProgramCache]: Analyzing trace with hash 2041625758, now seen corresponding path program 1 times [2020-10-15 16:40:54,361 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 16:40:54,361 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [498768619] [2020-10-15 16:40:54,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 16:40:54,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 16:40:54,436 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-15 16:40:54,436 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [498768619] [2020-10-15 16:40:54,436 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 16:40:54,437 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-15 16:40:54,437 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [15820853] [2020-10-15 16:40:54,437 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-15 16:40:54,437 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 16:40:54,438 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-15 16:40:54,438 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2020-10-15 16:40:54,438 INFO L87 Difference]: Start difference. First operand 3873 states and 15364 transitions. Second operand 7 states. [2020-10-15 16:40:54,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 16:40:54,565 INFO L93 Difference]: Finished difference Result 4264 states and 16502 transitions. [2020-10-15 16:40:54,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-15 16:40:54,566 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 19 [2020-10-15 16:40:54,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 16:40:54,577 INFO L225 Difference]: With dead ends: 4264 [2020-10-15 16:40:54,577 INFO L226 Difference]: Without dead ends: 4264 [2020-10-15 16:40:54,578 INFO L677 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-15 16:40:54,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4264 states. [2020-10-15 16:40:54,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4264 to 3841. [2020-10-15 16:40:54,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3841 states. [2020-10-15 16:40:54,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3841 states to 3841 states and 15250 transitions. [2020-10-15 16:40:54,677 INFO L78 Accepts]: Start accepts. Automaton has 3841 states and 15250 transitions. Word has length 19 [2020-10-15 16:40:54,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 16:40:54,677 INFO L481 AbstractCegarLoop]: Abstraction has 3841 states and 15250 transitions. [2020-10-15 16:40:54,677 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-15 16:40:54,677 INFO L276 IsEmpty]: Start isEmpty. Operand 3841 states and 15250 transitions. [2020-10-15 16:40:54,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-10-15 16:40:54,679 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 16:40:54,680 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-15 16:40:54,680 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-10-15 16:40:54,680 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-15 16:40:54,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 16:40:54,680 INFO L82 PathProgramCache]: Analyzing trace with hash -1134272272, now seen corresponding path program 1 times [2020-10-15 16:40:54,680 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 16:40:54,681 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1819343735] [2020-10-15 16:40:54,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 16:40:54,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 16:40:54,778 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-15 16:40:54,778 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1819343735] [2020-10-15 16:40:54,779 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 16:40:54,779 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-10-15 16:40:54,779 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [226264125] [2020-10-15 16:40:54,779 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-15 16:40:54,780 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 16:40:54,780 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-15 16:40:54,780 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2020-10-15 16:40:54,780 INFO L87 Difference]: Start difference. First operand 3841 states and 15250 transitions. Second operand 9 states. [2020-10-15 16:40:55,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 16:40:55,117 INFO L93 Difference]: Finished difference Result 5256 states and 20905 transitions. [2020-10-15 16:40:55,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-15 16:40:55,118 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 20 [2020-10-15 16:40:55,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 16:40:55,131 INFO L225 Difference]: With dead ends: 5256 [2020-10-15 16:40:55,132 INFO L226 Difference]: Without dead ends: 5210 [2020-10-15 16:40:55,132 INFO L677 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-15 16:40:55,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5210 states. [2020-10-15 16:40:55,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5210 to 3994. [2020-10-15 16:40:55,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3994 states. [2020-10-15 16:40:55,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3994 states to 3994 states and 15976 transitions. [2020-10-15 16:40:55,330 INFO L78 Accepts]: Start accepts. Automaton has 3994 states and 15976 transitions. Word has length 20 [2020-10-15 16:40:55,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 16:40:55,330 INFO L481 AbstractCegarLoop]: Abstraction has 3994 states and 15976 transitions. [2020-10-15 16:40:55,330 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-15 16:40:55,330 INFO L276 IsEmpty]: Start isEmpty. Operand 3994 states and 15976 transitions. [2020-10-15 16:40:55,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-10-15 16:40:55,332 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 16:40:55,332 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-15 16:40:55,333 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-10-15 16:40:55,333 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-15 16:40:55,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 16:40:55,333 INFO L82 PathProgramCache]: Analyzing trace with hash 1058647793, now seen corresponding path program 1 times [2020-10-15 16:40:55,333 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 16:40:55,334 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [701655421] [2020-10-15 16:40:55,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 16:40:55,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 16:40:55,447 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-15 16:40:55,448 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [701655421] [2020-10-15 16:40:55,448 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 16:40:55,448 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-10-15 16:40:55,448 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2022913505] [2020-10-15 16:40:55,449 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-15 16:40:55,449 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 16:40:55,450 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-15 16:40:55,450 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2020-10-15 16:40:55,450 INFO L87 Difference]: Start difference. First operand 3994 states and 15976 transitions. Second operand 9 states. [2020-10-15 16:40:55,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 16:40:55,753 INFO L93 Difference]: Finished difference Result 5328 states and 21486 transitions. [2020-10-15 16:40:55,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-15 16:40:55,754 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 20 [2020-10-15 16:40:55,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 16:40:55,766 INFO L225 Difference]: With dead ends: 5328 [2020-10-15 16:40:55,767 INFO L226 Difference]: Without dead ends: 5282 [2020-10-15 16:40:55,767 INFO L677 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-15 16:40:55,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5282 states. [2020-10-15 16:40:55,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5282 to 3840. [2020-10-15 16:40:55,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3840 states. [2020-10-15 16:40:55,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3840 states to 3840 states and 15247 transitions. [2020-10-15 16:40:55,880 INFO L78 Accepts]: Start accepts. Automaton has 3840 states and 15247 transitions. Word has length 20 [2020-10-15 16:40:55,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 16:40:55,881 INFO L481 AbstractCegarLoop]: Abstraction has 3840 states and 15247 transitions. [2020-10-15 16:40:55,881 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-15 16:40:55,881 INFO L276 IsEmpty]: Start isEmpty. Operand 3840 states and 15247 transitions. [2020-10-15 16:40:55,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-10-15 16:40:55,884 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 16:40:55,884 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-15 16:40:55,885 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-10-15 16:40:55,885 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-15 16:40:55,885 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 16:40:55,885 INFO L82 PathProgramCache]: Analyzing trace with hash 2045819536, now seen corresponding path program 2 times [2020-10-15 16:40:55,886 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 16:40:55,886 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [169030497] [2020-10-15 16:40:55,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 16:40:55,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 16:40:56,057 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-15 16:40:56,058 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [169030497] [2020-10-15 16:40:56,058 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 16:40:56,059 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-10-15 16:40:56,059 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [960150866] [2020-10-15 16:40:56,059 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-10-15 16:40:56,060 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 16:40:56,060 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-10-15 16:40:56,063 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2020-10-15 16:40:56,064 INFO L87 Difference]: Start difference. First operand 3840 states and 15247 transitions. Second operand 10 states. [2020-10-15 16:40:56,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 16:40:56,587 INFO L93 Difference]: Finished difference Result 5284 states and 20663 transitions. [2020-10-15 16:40:56,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-10-15 16:40:56,587 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 20 [2020-10-15 16:40:56,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 16:40:56,602 INFO L225 Difference]: With dead ends: 5284 [2020-10-15 16:40:56,602 INFO L226 Difference]: Without dead ends: 5192 [2020-10-15 16:40:56,602 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=69, Invalid=171, Unknown=0, NotChecked=0, Total=240 [2020-10-15 16:40:56,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5192 states. [2020-10-15 16:40:56,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5192 to 3734. [2020-10-15 16:40:56,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3734 states. [2020-10-15 16:40:56,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3734 states to 3734 states and 14462 transitions. [2020-10-15 16:40:56,707 INFO L78 Accepts]: Start accepts. Automaton has 3734 states and 14462 transitions. Word has length 20 [2020-10-15 16:40:56,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 16:40:56,710 INFO L481 AbstractCegarLoop]: Abstraction has 3734 states and 14462 transitions. [2020-10-15 16:40:56,710 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-10-15 16:40:56,710 INFO L276 IsEmpty]: Start isEmpty. Operand 3734 states and 14462 transitions. [2020-10-15 16:40:56,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-10-15 16:40:56,718 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 16:40:56,718 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-15 16:40:56,718 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-10-15 16:40:56,719 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-15 16:40:56,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 16:40:56,719 INFO L82 PathProgramCache]: Analyzing trace with hash 258643217, now seen corresponding path program 2 times [2020-10-15 16:40:56,719 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 16:40:56,720 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [99105659] [2020-10-15 16:40:56,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 16:40:56,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 16:40:56,952 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-15 16:40:56,953 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [99105659] [2020-10-15 16:40:56,953 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 16:40:56,953 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-10-15 16:40:56,953 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [681978342] [2020-10-15 16:40:56,954 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-10-15 16:40:56,954 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 16:40:56,954 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-10-15 16:40:56,954 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2020-10-15 16:40:56,954 INFO L87 Difference]: Start difference. First operand 3734 states and 14462 transitions. Second operand 10 states. [2020-10-15 16:40:57,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 16:40:57,395 INFO L93 Difference]: Finished difference Result 6322 states and 24832 transitions. [2020-10-15 16:40:57,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-10-15 16:40:57,396 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 20 [2020-10-15 16:40:57,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 16:40:57,409 INFO L225 Difference]: With dead ends: 6322 [2020-10-15 16:40:57,409 INFO L226 Difference]: Without dead ends: 6276 [2020-10-15 16:40:57,410 INFO L677 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-15 16:40:57,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6276 states. [2020-10-15 16:40:57,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6276 to 3733. [2020-10-15 16:40:57,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3733 states. [2020-10-15 16:40:57,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3733 states to 3733 states and 14461 transitions. [2020-10-15 16:40:57,518 INFO L78 Accepts]: Start accepts. Automaton has 3733 states and 14461 transitions. Word has length 20 [2020-10-15 16:40:57,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 16:40:57,519 INFO L481 AbstractCegarLoop]: Abstraction has 3733 states and 14461 transitions. [2020-10-15 16:40:57,519 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-10-15 16:40:57,519 INFO L276 IsEmpty]: Start isEmpty. Operand 3733 states and 14461 transitions. [2020-10-15 16:40:57,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-10-15 16:40:57,521 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 16:40:57,521 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-15 16:40:57,521 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-10-15 16:40:57,521 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-15 16:40:57,522 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 16:40:57,522 INFO L82 PathProgramCache]: Analyzing trace with hash 1348955075, now seen corresponding path program 3 times [2020-10-15 16:40:57,522 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 16:40:57,522 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1546565570] [2020-10-15 16:40:57,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 16:40:57,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 16:40:57,697 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-15 16:40:57,698 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1546565570] [2020-10-15 16:40:57,698 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 16:40:57,698 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-10-15 16:40:57,698 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1983450549] [2020-10-15 16:40:57,699 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-10-15 16:40:57,699 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 16:40:57,699 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-10-15 16:40:57,699 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2020-10-15 16:40:57,699 INFO L87 Difference]: Start difference. First operand 3733 states and 14461 transitions. Second operand 11 states. [2020-10-15 16:40:58,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 16:40:58,419 INFO L93 Difference]: Finished difference Result 4743 states and 18376 transitions. [2020-10-15 16:40:58,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-10-15 16:40:58,420 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 20 [2020-10-15 16:40:58,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 16:40:58,430 INFO L225 Difference]: With dead ends: 4743 [2020-10-15 16:40:58,430 INFO L226 Difference]: Without dead ends: 4709 [2020-10-15 16:40:58,431 INFO L677 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-15 16:40:58,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4709 states. [2020-10-15 16:40:58,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4709 to 3733. [2020-10-15 16:40:58,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3733 states. [2020-10-15 16:40:58,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3733 states to 3733 states and 14461 transitions. [2020-10-15 16:40:58,524 INFO L78 Accepts]: Start accepts. Automaton has 3733 states and 14461 transitions. Word has length 20 [2020-10-15 16:40:58,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 16:40:58,524 INFO L481 AbstractCegarLoop]: Abstraction has 3733 states and 14461 transitions. [2020-10-15 16:40:58,524 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-10-15 16:40:58,524 INFO L276 IsEmpty]: Start isEmpty. Operand 3733 states and 14461 transitions. [2020-10-15 16:40:58,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-10-15 16:40:58,526 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 16:40:58,527 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-15 16:40:58,527 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-10-15 16:40:58,527 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-15 16:40:58,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 16:40:58,527 INFO L82 PathProgramCache]: Analyzing trace with hash 1331080475, now seen corresponding path program 4 times [2020-10-15 16:40:58,527 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 16:40:58,528 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [98458779] [2020-10-15 16:40:58,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 16:40:58,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 16:40:58,656 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-15 16:40:58,657 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [98458779] [2020-10-15 16:40:58,657 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 16:40:58,657 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-10-15 16:40:58,658 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [314532826] [2020-10-15 16:40:58,658 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-10-15 16:40:58,658 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 16:40:58,658 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-10-15 16:40:58,659 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2020-10-15 16:40:58,659 INFO L87 Difference]: Start difference. First operand 3733 states and 14461 transitions. Second operand 10 states. [2020-10-15 16:40:59,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 16:40:59,003 INFO L93 Difference]: Finished difference Result 4987 states and 19433 transitions. [2020-10-15 16:40:59,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-15 16:40:59,004 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 20 [2020-10-15 16:40:59,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 16:40:59,016 INFO L225 Difference]: With dead ends: 4987 [2020-10-15 16:40:59,016 INFO L226 Difference]: Without dead ends: 4941 [2020-10-15 16:40:59,017 INFO L677 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-15 16:40:59,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4941 states. [2020-10-15 16:40:59,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4941 to 3727. [2020-10-15 16:40:59,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3727 states. [2020-10-15 16:40:59,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3727 states to 3727 states and 14449 transitions. [2020-10-15 16:40:59,153 INFO L78 Accepts]: Start accepts. Automaton has 3727 states and 14449 transitions. Word has length 20 [2020-10-15 16:40:59,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 16:40:59,153 INFO L481 AbstractCegarLoop]: Abstraction has 3727 states and 14449 transitions. [2020-10-15 16:40:59,154 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-10-15 16:40:59,154 INFO L276 IsEmpty]: Start isEmpty. Operand 3727 states and 14449 transitions. [2020-10-15 16:40:59,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-10-15 16:40:59,156 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 16:40:59,156 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-15 16:40:59,156 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-10-15 16:40:59,156 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-15 16:40:59,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 16:40:59,157 INFO L82 PathProgramCache]: Analyzing trace with hash 657525156, now seen corresponding path program 3 times [2020-10-15 16:40:59,157 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 16:40:59,157 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1091589758] [2020-10-15 16:40:59,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 16:40:59,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 16:40:59,206 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-15 16:40:59,206 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1091589758] [2020-10-15 16:40:59,207 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 16:40:59,207 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-15 16:40:59,207 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [49471810] [2020-10-15 16:40:59,207 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-15 16:40:59,207 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 16:40:59,208 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-15 16:40:59,208 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2020-10-15 16:40:59,208 INFO L87 Difference]: Start difference. First operand 3727 states and 14449 transitions. Second operand 7 states. [2020-10-15 16:40:59,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 16:40:59,414 INFO L93 Difference]: Finished difference Result 5325 states and 20419 transitions. [2020-10-15 16:40:59,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-15 16:40:59,414 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 20 [2020-10-15 16:40:59,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 16:40:59,429 INFO L225 Difference]: With dead ends: 5325 [2020-10-15 16:40:59,429 INFO L226 Difference]: Without dead ends: 5279 [2020-10-15 16:40:59,429 INFO L677 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-15 16:40:59,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5279 states. [2020-10-15 16:40:59,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5279 to 2948. [2020-10-15 16:40:59,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2948 states. [2020-10-15 16:40:59,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2948 states to 2948 states and 10967 transitions. [2020-10-15 16:40:59,519 INFO L78 Accepts]: Start accepts. Automaton has 2948 states and 10967 transitions. Word has length 20 [2020-10-15 16:40:59,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 16:40:59,519 INFO L481 AbstractCegarLoop]: Abstraction has 2948 states and 10967 transitions. [2020-10-15 16:40:59,519 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-15 16:40:59,519 INFO L276 IsEmpty]: Start isEmpty. Operand 2948 states and 10967 transitions. [2020-10-15 16:40:59,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-10-15 16:40:59,521 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 16:40:59,521 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-15 16:40:59,522 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-10-15 16:40:59,522 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-15 16:40:59,522 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 16:40:59,522 INFO L82 PathProgramCache]: Analyzing trace with hash -1935934284, now seen corresponding path program 1 times [2020-10-15 16:40:59,522 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 16:40:59,523 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1678618865] [2020-10-15 16:40:59,523 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 16:40:59,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 16:40:59,564 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-15 16:40:59,565 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1678618865] [2020-10-15 16:40:59,565 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 16:40:59,565 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-15 16:40:59,565 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1262550679] [2020-10-15 16:40:59,566 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-15 16:40:59,566 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 16:40:59,566 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-15 16:40:59,566 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-10-15 16:40:59,566 INFO L87 Difference]: Start difference. First operand 2948 states and 10967 transitions. Second operand 6 states. [2020-10-15 16:40:59,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 16:40:59,707 INFO L93 Difference]: Finished difference Result 3727 states and 13634 transitions. [2020-10-15 16:40:59,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-15 16:40:59,708 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 21 [2020-10-15 16:40:59,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 16:40:59,717 INFO L225 Difference]: With dead ends: 3727 [2020-10-15 16:40:59,717 INFO L226 Difference]: Without dead ends: 3652 [2020-10-15 16:40:59,717 INFO L677 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-15 16:40:59,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3652 states. [2020-10-15 16:40:59,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3652 to 3270. [2020-10-15 16:40:59,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3270 states. [2020-10-15 16:40:59,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3270 states to 3270 states and 12154 transitions. [2020-10-15 16:40:59,779 INFO L78 Accepts]: Start accepts. Automaton has 3270 states and 12154 transitions. Word has length 21 [2020-10-15 16:40:59,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 16:40:59,779 INFO L481 AbstractCegarLoop]: Abstraction has 3270 states and 12154 transitions. [2020-10-15 16:40:59,779 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-15 16:40:59,780 INFO L276 IsEmpty]: Start isEmpty. Operand 3270 states and 12154 transitions. [2020-10-15 16:40:59,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-10-15 16:40:59,782 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 16:40:59,782 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-15 16:40:59,782 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2020-10-15 16:40:59,782 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-15 16:40:59,783 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 16:40:59,783 INFO L82 PathProgramCache]: Analyzing trace with hash 558788524, now seen corresponding path program 1 times [2020-10-15 16:40:59,783 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 16:40:59,783 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [85360392] [2020-10-15 16:40:59,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 16:40:59,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 16:40:59,988 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-15 16:40:59,989 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [85360392] [2020-10-15 16:40:59,989 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 16:40:59,989 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-10-15 16:40:59,989 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1301650157] [2020-10-15 16:40:59,990 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-10-15 16:40:59,990 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 16:40:59,990 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-10-15 16:40:59,990 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2020-10-15 16:40:59,991 INFO L87 Difference]: Start difference. First operand 3270 states and 12154 transitions. Second operand 12 states. [2020-10-15 16:41:00,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 16:41:00,714 INFO L93 Difference]: Finished difference Result 4405 states and 16600 transitions. [2020-10-15 16:41:00,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-10-15 16:41:00,715 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 21 [2020-10-15 16:41:00,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 16:41:00,725 INFO L225 Difference]: With dead ends: 4405 [2020-10-15 16:41:00,725 INFO L226 Difference]: Without dead ends: 4371 [2020-10-15 16:41:00,725 INFO L677 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-15 16:41:00,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4371 states. [2020-10-15 16:41:00,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4371 to 3270. [2020-10-15 16:41:00,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3270 states. [2020-10-15 16:41:00,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3270 states to 3270 states and 12154 transitions. [2020-10-15 16:41:00,784 INFO L78 Accepts]: Start accepts. Automaton has 3270 states and 12154 transitions. Word has length 21 [2020-10-15 16:41:00,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 16:41:00,784 INFO L481 AbstractCegarLoop]: Abstraction has 3270 states and 12154 transitions. [2020-10-15 16:41:00,784 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-10-15 16:41:00,784 INFO L276 IsEmpty]: Start isEmpty. Operand 3270 states and 12154 transitions. [2020-10-15 16:41:00,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-10-15 16:41:00,786 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 16:41:00,787 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-15 16:41:00,787 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2020-10-15 16:41:00,787 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-15 16:41:00,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 16:41:00,787 INFO L82 PathProgramCache]: Analyzing trace with hash 540913924, now seen corresponding path program 2 times [2020-10-15 16:41:00,787 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 16:41:00,788 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2135083448] [2020-10-15 16:41:00,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 16:41:00,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 16:41:01,018 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-15 16:41:01,019 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2135083448] [2020-10-15 16:41:01,019 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 16:41:01,019 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-10-15 16:41:01,019 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [488686508] [2020-10-15 16:41:01,019 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-10-15 16:41:01,020 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 16:41:01,020 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-10-15 16:41:01,020 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2020-10-15 16:41:01,020 INFO L87 Difference]: Start difference. First operand 3270 states and 12154 transitions. Second operand 11 states. [2020-10-15 16:41:01,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 16:41:01,468 INFO L93 Difference]: Finished difference Result 4064 states and 15268 transitions. [2020-10-15 16:41:01,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-10-15 16:41:01,468 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 21 [2020-10-15 16:41:01,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 16:41:01,477 INFO L225 Difference]: With dead ends: 4064 [2020-10-15 16:41:01,477 INFO L226 Difference]: Without dead ends: 3972 [2020-10-15 16:41:01,478 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=81, Invalid=191, Unknown=0, NotChecked=0, Total=272 [2020-10-15 16:41:01,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3972 states. [2020-10-15 16:41:01,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3972 to 2499. [2020-10-15 16:41:01,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2499 states. [2020-10-15 16:41:01,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2499 states to 2499 states and 9076 transitions. [2020-10-15 16:41:01,521 INFO L78 Accepts]: Start accepts. Automaton has 2499 states and 9076 transitions. Word has length 21 [2020-10-15 16:41:01,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 16:41:01,521 INFO L481 AbstractCegarLoop]: Abstraction has 2499 states and 9076 transitions. [2020-10-15 16:41:01,521 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-10-15 16:41:01,521 INFO L276 IsEmpty]: Start isEmpty. Operand 2499 states and 9076 transitions. [2020-10-15 16:41:01,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-10-15 16:41:01,525 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 16:41:01,525 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-15 16:41:01,525 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2020-10-15 16:41:01,525 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-15 16:41:01,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 16:41:01,525 INFO L82 PathProgramCache]: Analyzing trace with hash 1608946948, now seen corresponding path program 2 times [2020-10-15 16:41:01,526 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 16:41:01,526 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [91847555] [2020-10-15 16:41:01,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 16:41:01,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 16:41:01,570 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-15 16:41:01,571 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [91847555] [2020-10-15 16:41:01,571 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 16:41:01,571 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-15 16:41:01,571 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [189384549] [2020-10-15 16:41:01,572 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-15 16:41:01,572 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 16:41:01,572 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-15 16:41:01,572 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-10-15 16:41:01,572 INFO L87 Difference]: Start difference. First operand 2499 states and 9076 transitions. Second operand 6 states. [2020-10-15 16:41:01,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 16:41:01,672 INFO L93 Difference]: Finished difference Result 2874 states and 10132 transitions. [2020-10-15 16:41:01,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-15 16:41:01,673 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 21 [2020-10-15 16:41:01,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 16:41:01,678 INFO L225 Difference]: With dead ends: 2874 [2020-10-15 16:41:01,678 INFO L226 Difference]: Without dead ends: 2650 [2020-10-15 16:41:01,679 INFO L677 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-15 16:41:01,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2650 states. [2020-10-15 16:41:01,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2650 to 2211. [2020-10-15 16:41:01,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2211 states. [2020-10-15 16:41:01,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2211 states to 2211 states and 7918 transitions. [2020-10-15 16:41:01,712 INFO L78 Accepts]: Start accepts. Automaton has 2211 states and 7918 transitions. Word has length 21 [2020-10-15 16:41:01,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 16:41:01,713 INFO L481 AbstractCegarLoop]: Abstraction has 2211 states and 7918 transitions. [2020-10-15 16:41:01,713 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-15 16:41:01,713 INFO L276 IsEmpty]: Start isEmpty. Operand 2211 states and 7918 transitions. [2020-10-15 16:41:01,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-10-15 16:41:01,715 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 16:41:01,715 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-15 16:41:01,715 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2020-10-15 16:41:01,715 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-15 16:41:01,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 16:41:01,716 INFO L82 PathProgramCache]: Analyzing trace with hash 1396456954, now seen corresponding path program 1 times [2020-10-15 16:41:01,716 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 16:41:01,716 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [752081116] [2020-10-15 16:41:01,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 16:41:01,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 16:41:01,783 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-15 16:41:01,783 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [752081116] [2020-10-15 16:41:01,784 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 16:41:01,784 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-15 16:41:01,784 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1879944398] [2020-10-15 16:41:01,784 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-15 16:41:01,785 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 16:41:01,785 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-15 16:41:01,785 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2020-10-15 16:41:01,785 INFO L87 Difference]: Start difference. First operand 2211 states and 7918 transitions. Second operand 7 states. [2020-10-15 16:41:01,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 16:41:01,994 INFO L93 Difference]: Finished difference Result 2930 states and 10378 transitions. [2020-10-15 16:41:01,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-10-15 16:41:01,995 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 22 [2020-10-15 16:41:01,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 16:41:02,002 INFO L225 Difference]: With dead ends: 2930 [2020-10-15 16:41:02,002 INFO L226 Difference]: Without dead ends: 2870 [2020-10-15 16:41:02,002 INFO L677 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-15 16:41:02,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2870 states. [2020-10-15 16:41:02,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2870 to 2208. [2020-10-15 16:41:02,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2208 states. [2020-10-15 16:41:02,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2208 states to 2208 states and 7913 transitions. [2020-10-15 16:41:02,039 INFO L78 Accepts]: Start accepts. Automaton has 2208 states and 7913 transitions. Word has length 22 [2020-10-15 16:41:02,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 16:41:02,039 INFO L481 AbstractCegarLoop]: Abstraction has 2208 states and 7913 transitions. [2020-10-15 16:41:02,039 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-15 16:41:02,039 INFO L276 IsEmpty]: Start isEmpty. Operand 2208 states and 7913 transitions. [2020-10-15 16:41:02,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-10-15 16:41:02,041 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 16:41:02,041 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-15 16:41:02,041 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2020-10-15 16:41:02,042 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-15 16:41:02,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 16:41:02,042 INFO L82 PathProgramCache]: Analyzing trace with hash 644682778, now seen corresponding path program 2 times [2020-10-15 16:41:02,042 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 16:41:02,042 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [108888024] [2020-10-15 16:41:02,042 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 16:41:02,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 16:41:02,105 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-15 16:41:02,106 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [108888024] [2020-10-15 16:41:02,106 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 16:41:02,106 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-15 16:41:02,106 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [869810397] [2020-10-15 16:41:02,107 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-15 16:41:02,107 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 16:41:02,107 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-15 16:41:02,107 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2020-10-15 16:41:02,107 INFO L87 Difference]: Start difference. First operand 2208 states and 7913 transitions. Second operand 8 states. [2020-10-15 16:41:02,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 16:41:02,343 INFO L93 Difference]: Finished difference Result 2920 states and 10358 transitions. [2020-10-15 16:41:02,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-10-15 16:41:02,343 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 22 [2020-10-15 16:41:02,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 16:41:02,350 INFO L225 Difference]: With dead ends: 2920 [2020-10-15 16:41:02,350 INFO L226 Difference]: Without dead ends: 2860 [2020-10-15 16:41:02,351 INFO L677 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-15 16:41:02,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2860 states. [2020-10-15 16:41:02,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2860 to 2202. [2020-10-15 16:41:02,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2202 states. [2020-10-15 16:41:02,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2202 states to 2202 states and 7899 transitions. [2020-10-15 16:41:02,393 INFO L78 Accepts]: Start accepts. Automaton has 2202 states and 7899 transitions. Word has length 22 [2020-10-15 16:41:02,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 16:41:02,393 INFO L481 AbstractCegarLoop]: Abstraction has 2202 states and 7899 transitions. [2020-10-15 16:41:02,393 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-15 16:41:02,393 INFO L276 IsEmpty]: Start isEmpty. Operand 2202 states and 7899 transitions. [2020-10-15 16:41:02,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-10-15 16:41:02,395 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 16:41:02,395 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-15 16:41:02,395 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2020-10-15 16:41:02,395 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-15 16:41:02,395 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 16:41:02,395 INFO L82 PathProgramCache]: Analyzing trace with hash -787433364, now seen corresponding path program 3 times [2020-10-15 16:41:02,396 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 16:41:02,396 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [144248077] [2020-10-15 16:41:02,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 16:41:02,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 16:41:02,497 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-15 16:41:02,498 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [144248077] [2020-10-15 16:41:02,498 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 16:41:02,498 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-10-15 16:41:02,498 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1821055161] [2020-10-15 16:41:02,498 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-15 16:41:02,498 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 16:41:02,499 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-15 16:41:02,499 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2020-10-15 16:41:02,499 INFO L87 Difference]: Start difference. First operand 2202 states and 7899 transitions. Second operand 9 states. [2020-10-15 16:41:02,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 16:41:02,670 INFO L93 Difference]: Finished difference Result 2905 states and 10327 transitions. [2020-10-15 16:41:02,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-15 16:41:02,670 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-10-15 16:41:02,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 16:41:02,678 INFO L225 Difference]: With dead ends: 2905 [2020-10-15 16:41:02,678 INFO L226 Difference]: Without dead ends: 2845 [2020-10-15 16:41:02,679 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=83, Unknown=0, NotChecked=0, Total=132 [2020-10-15 16:41:02,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2845 states. [2020-10-15 16:41:02,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2845 to 2202. [2020-10-15 16:41:02,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2202 states. [2020-10-15 16:41:02,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2202 states to 2202 states and 7899 transitions. [2020-10-15 16:41:02,735 INFO L78 Accepts]: Start accepts. Automaton has 2202 states and 7899 transitions. Word has length 22 [2020-10-15 16:41:02,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 16:41:02,735 INFO L481 AbstractCegarLoop]: Abstraction has 2202 states and 7899 transitions. [2020-10-15 16:41:02,735 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-15 16:41:02,735 INFO L276 IsEmpty]: Start isEmpty. Operand 2202 states and 7899 transitions. [2020-10-15 16:41:02,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-10-15 16:41:02,738 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 16:41:02,738 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-15 16:41:02,738 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2020-10-15 16:41:02,738 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-15 16:41:02,738 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 16:41:02,738 INFO L82 PathProgramCache]: Analyzing trace with hash -270857424, now seen corresponding path program 4 times [2020-10-15 16:41:02,739 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 16:41:02,739 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [376390655] [2020-10-15 16:41:02,739 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 16:41:02,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 16:41:02,932 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-15 16:41:02,933 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [376390655] [2020-10-15 16:41:02,933 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 16:41:02,933 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-10-15 16:41:02,933 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1821662955] [2020-10-15 16:41:02,933 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-10-15 16:41:02,934 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 16:41:02,934 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-10-15 16:41:02,934 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2020-10-15 16:41:02,934 INFO L87 Difference]: Start difference. First operand 2202 states and 7899 transitions. Second operand 11 states. [2020-10-15 16:41:03,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 16:41:03,300 INFO L93 Difference]: Finished difference Result 3120 states and 11113 transitions. [2020-10-15 16:41:03,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-15 16:41:03,301 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 22 [2020-10-15 16:41:03,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 16:41:03,309 INFO L225 Difference]: With dead ends: 3120 [2020-10-15 16:41:03,309 INFO L226 Difference]: Without dead ends: 3060 [2020-10-15 16:41:03,309 INFO L677 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-15 16:41:03,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3060 states. [2020-10-15 16:41:03,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3060 to 2202. [2020-10-15 16:41:03,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2202 states. [2020-10-15 16:41:03,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2202 states to 2202 states and 7896 transitions. [2020-10-15 16:41:03,424 INFO L78 Accepts]: Start accepts. Automaton has 2202 states and 7896 transitions. Word has length 22 [2020-10-15 16:41:03,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 16:41:03,424 INFO L481 AbstractCegarLoop]: Abstraction has 2202 states and 7896 transitions. [2020-10-15 16:41:03,424 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-10-15 16:41:03,424 INFO L276 IsEmpty]: Start isEmpty. Operand 2202 states and 7896 transitions. [2020-10-15 16:41:03,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-10-15 16:41:03,426 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 16:41:03,426 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-15 16:41:03,426 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2020-10-15 16:41:03,426 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-15 16:41:03,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 16:41:03,426 INFO L82 PathProgramCache]: Analyzing trace with hash -503603988, now seen corresponding path program 5 times [2020-10-15 16:41:03,427 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 16:41:03,427 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [612124856] [2020-10-15 16:41:03,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 16:41:03,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 16:41:03,524 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-15 16:41:03,524 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [612124856] [2020-10-15 16:41:03,525 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 16:41:03,525 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-10-15 16:41:03,525 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [209017306] [2020-10-15 16:41:03,525 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-15 16:41:03,525 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 16:41:03,526 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-15 16:41:03,526 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2020-10-15 16:41:03,526 INFO L87 Difference]: Start difference. First operand 2202 states and 7896 transitions. Second operand 9 states. [2020-10-15 16:41:03,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 16:41:03,835 INFO L93 Difference]: Finished difference Result 3737 states and 13299 transitions. [2020-10-15 16:41:03,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-15 16:41:03,835 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-10-15 16:41:03,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 16:41:03,843 INFO L225 Difference]: With dead ends: 3737 [2020-10-15 16:41:03,843 INFO L226 Difference]: Without dead ends: 3677 [2020-10-15 16:41:03,844 INFO L677 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-15 16:41:03,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3677 states. [2020-10-15 16:41:03,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3677 to 2170. [2020-10-15 16:41:03,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2170 states. [2020-10-15 16:41:03,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2170 states to 2170 states and 7789 transitions. [2020-10-15 16:41:03,882 INFO L78 Accepts]: Start accepts. Automaton has 2170 states and 7789 transitions. Word has length 22 [2020-10-15 16:41:03,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 16:41:03,882 INFO L481 AbstractCegarLoop]: Abstraction has 2170 states and 7789 transitions. [2020-10-15 16:41:03,882 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-15 16:41:03,883 INFO L276 IsEmpty]: Start isEmpty. Operand 2170 states and 7789 transitions. [2020-10-15 16:41:03,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-10-15 16:41:03,885 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 16:41:03,885 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-15 16:41:03,885 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2020-10-15 16:41:03,885 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-15 16:41:03,885 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 16:41:03,885 INFO L82 PathProgramCache]: Analyzing trace with hash -1357008819, now seen corresponding path program 1 times [2020-10-15 16:41:03,885 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 16:41:03,885 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1502747184] [2020-10-15 16:41:03,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 16:41:03,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 16:41:03,994 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-15 16:41:03,994 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1502747184] [2020-10-15 16:41:03,994 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 16:41:03,994 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-10-15 16:41:03,995 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [263884033] [2020-10-15 16:41:03,995 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-10-15 16:41:03,995 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 16:41:03,995 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-10-15 16:41:03,995 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2020-10-15 16:41:03,995 INFO L87 Difference]: Start difference. First operand 2170 states and 7789 transitions. Second operand 10 states. [2020-10-15 16:41:04,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 16:41:04,463 INFO L93 Difference]: Finished difference Result 3595 states and 12502 transitions. [2020-10-15 16:41:04,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-10-15 16:41:04,464 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 23 [2020-10-15 16:41:04,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 16:41:04,472 INFO L225 Difference]: With dead ends: 3595 [2020-10-15 16:41:04,472 INFO L226 Difference]: Without dead ends: 3478 [2020-10-15 16:41:04,473 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=145, Unknown=0, NotChecked=0, Total=210 [2020-10-15 16:41:04,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3478 states. [2020-10-15 16:41:04,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3478 to 1979. [2020-10-15 16:41:04,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1979 states. [2020-10-15 16:41:04,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1979 states to 1979 states and 7017 transitions. [2020-10-15 16:41:04,507 INFO L78 Accepts]: Start accepts. Automaton has 1979 states and 7017 transitions. Word has length 23 [2020-10-15 16:41:04,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 16:41:04,507 INFO L481 AbstractCegarLoop]: Abstraction has 1979 states and 7017 transitions. [2020-10-15 16:41:04,507 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-10-15 16:41:04,507 INFO L276 IsEmpty]: Start isEmpty. Operand 1979 states and 7017 transitions. [2020-10-15 16:41:04,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-10-15 16:41:04,509 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 16:41:04,509 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-15 16:41:04,509 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2020-10-15 16:41:04,510 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-15 16:41:04,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 16:41:04,510 INFO L82 PathProgramCache]: Analyzing trace with hash -1309010247, now seen corresponding path program 1 times [2020-10-15 16:41:04,510 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 16:41:04,510 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1661060664] [2020-10-15 16:41:04,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 16:41:04,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 16:41:04,562 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-15 16:41:04,562 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1661060664] [2020-10-15 16:41:04,563 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 16:41:04,563 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-15 16:41:04,563 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1403349176] [2020-10-15 16:41:04,563 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-15 16:41:04,563 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 16:41:04,563 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-15 16:41:04,564 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-10-15 16:41:04,564 INFO L87 Difference]: Start difference. First operand 1979 states and 7017 transitions. Second operand 6 states. [2020-10-15 16:41:04,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 16:41:04,726 INFO L93 Difference]: Finished difference Result 2476 states and 8453 transitions. [2020-10-15 16:41:04,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-15 16:41:04,727 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 24 [2020-10-15 16:41:04,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 16:41:04,732 INFO L225 Difference]: With dead ends: 2476 [2020-10-15 16:41:04,732 INFO L226 Difference]: Without dead ends: 2412 [2020-10-15 16:41:04,732 INFO L677 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-15 16:41:04,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2412 states. [2020-10-15 16:41:04,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2412 to 2291. [2020-10-15 16:41:04,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2291 states. [2020-10-15 16:41:04,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2291 states to 2291 states and 8009 transitions. [2020-10-15 16:41:04,765 INFO L78 Accepts]: Start accepts. Automaton has 2291 states and 8009 transitions. Word has length 24 [2020-10-15 16:41:04,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 16:41:04,765 INFO L481 AbstractCegarLoop]: Abstraction has 2291 states and 8009 transitions. [2020-10-15 16:41:04,765 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-15 16:41:04,765 INFO L276 IsEmpty]: Start isEmpty. Operand 2291 states and 8009 transitions. [2020-10-15 16:41:04,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-10-15 16:41:04,768 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 16:41:04,768 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-15 16:41:04,768 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2020-10-15 16:41:04,768 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-15 16:41:04,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 16:41:04,769 INFO L82 PathProgramCache]: Analyzing trace with hash 1793125216, now seen corresponding path program 1 times [2020-10-15 16:41:04,769 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 16:41:04,769 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [942406059] [2020-10-15 16:41:04,769 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 16:41:04,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 16:41:04,867 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-15 16:41:04,867 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [942406059] [2020-10-15 16:41:04,867 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 16:41:04,867 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-10-15 16:41:04,867 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [65831628] [2020-10-15 16:41:04,868 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-15 16:41:04,868 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 16:41:04,868 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-15 16:41:04,868 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2020-10-15 16:41:04,868 INFO L87 Difference]: Start difference. First operand 2291 states and 8009 transitions. Second operand 9 states. [2020-10-15 16:41:05,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 16:41:05,069 INFO L93 Difference]: Finished difference Result 3139 states and 10958 transitions. [2020-10-15 16:41:05,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-15 16:41:05,069 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 24 [2020-10-15 16:41:05,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 16:41:05,076 INFO L225 Difference]: With dead ends: 3139 [2020-10-15 16:41:05,077 INFO L226 Difference]: Without dead ends: 3115 [2020-10-15 16:41:05,077 INFO L677 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-15 16:41:05,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3115 states. [2020-10-15 16:41:05,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3115 to 2290. [2020-10-15 16:41:05,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2290 states. [2020-10-15 16:41:05,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2290 states to 2290 states and 8008 transitions. [2020-10-15 16:41:05,113 INFO L78 Accepts]: Start accepts. Automaton has 2290 states and 8008 transitions. Word has length 24 [2020-10-15 16:41:05,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 16:41:05,113 INFO L481 AbstractCegarLoop]: Abstraction has 2290 states and 8008 transitions. [2020-10-15 16:41:05,113 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-15 16:41:05,113 INFO L276 IsEmpty]: Start isEmpty. Operand 2290 states and 8008 transitions. [2020-10-15 16:41:05,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-10-15 16:41:05,115 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 16:41:05,115 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-15 16:41:05,116 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2020-10-15 16:41:05,116 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-15 16:41:05,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 16:41:05,116 INFO L82 PathProgramCache]: Analyzing trace with hash 1041351040, now seen corresponding path program 2 times [2020-10-15 16:41:05,116 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 16:41:05,116 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1809847978] [2020-10-15 16:41:05,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 16:41:05,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 16:41:05,230 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-15 16:41:05,230 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1809847978] [2020-10-15 16:41:05,231 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 16:41:05,231 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-10-15 16:41:05,231 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1732235689] [2020-10-15 16:41:05,231 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-10-15 16:41:05,231 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 16:41:05,232 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-10-15 16:41:05,232 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2020-10-15 16:41:05,232 INFO L87 Difference]: Start difference. First operand 2290 states and 8008 transitions. Second operand 10 states. [2020-10-15 16:41:05,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 16:41:05,605 INFO L93 Difference]: Finished difference Result 3138 states and 10954 transitions. [2020-10-15 16:41:05,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-10-15 16:41:05,606 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 24 [2020-10-15 16:41:05,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 16:41:05,612 INFO L225 Difference]: With dead ends: 3138 [2020-10-15 16:41:05,612 INFO L226 Difference]: Without dead ends: 3114 [2020-10-15 16:41:05,615 INFO L677 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-15 16:41:05,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3114 states. [2020-10-15 16:41:05,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3114 to 2293. [2020-10-15 16:41:05,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2293 states. [2020-10-15 16:41:05,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2293 states to 2293 states and 8015 transitions. [2020-10-15 16:41:05,653 INFO L78 Accepts]: Start accepts. Automaton has 2293 states and 8015 transitions. Word has length 24 [2020-10-15 16:41:05,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 16:41:05,654 INFO L481 AbstractCegarLoop]: Abstraction has 2293 states and 8015 transitions. [2020-10-15 16:41:05,654 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-10-15 16:41:05,654 INFO L276 IsEmpty]: Start isEmpty. Operand 2293 states and 8015 transitions. [2020-10-15 16:41:05,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-10-15 16:41:05,656 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 16:41:05,656 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-15 16:41:05,656 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2020-10-15 16:41:05,656 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-15 16:41:05,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 16:41:05,656 INFO L82 PathProgramCache]: Analyzing trace with hash -106935726, now seen corresponding path program 3 times [2020-10-15 16:41:05,657 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 16:41:05,657 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [187485011] [2020-10-15 16:41:05,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 16:41:05,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 16:41:05,792 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-15 16:41:05,792 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [187485011] [2020-10-15 16:41:05,792 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 16:41:05,792 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-10-15 16:41:05,792 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1102205422] [2020-10-15 16:41:05,793 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-10-15 16:41:05,793 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 16:41:05,793 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-10-15 16:41:05,793 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2020-10-15 16:41:05,793 INFO L87 Difference]: Start difference. First operand 2293 states and 8015 transitions. Second operand 11 states. [2020-10-15 16:41:06,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 16:41:06,151 INFO L93 Difference]: Finished difference Result 3732 states and 13122 transitions. [2020-10-15 16:41:06,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-10-15 16:41:06,151 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 24 [2020-10-15 16:41:06,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 16:41:06,159 INFO L225 Difference]: With dead ends: 3732 [2020-10-15 16:41:06,159 INFO L226 Difference]: Without dead ends: 3708 [2020-10-15 16:41:06,160 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=100, Invalid=206, Unknown=0, NotChecked=0, Total=306 [2020-10-15 16:41:06,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3708 states. [2020-10-15 16:41:06,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3708 to 2271. [2020-10-15 16:41:06,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2271 states. [2020-10-15 16:41:06,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2271 states to 2271 states and 7965 transitions. [2020-10-15 16:41:06,197 INFO L78 Accepts]: Start accepts. Automaton has 2271 states and 7965 transitions. Word has length 24 [2020-10-15 16:41:06,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 16:41:06,197 INFO L481 AbstractCegarLoop]: Abstraction has 2271 states and 7965 transitions. [2020-10-15 16:41:06,197 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-10-15 16:41:06,197 INFO L276 IsEmpty]: Start isEmpty. Operand 2271 states and 7965 transitions. [2020-10-15 16:41:06,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-10-15 16:41:06,199 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 16:41:06,199 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-15 16:41:06,199 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2020-10-15 16:41:06,200 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-15 16:41:06,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 16:41:06,200 INFO L82 PathProgramCache]: Analyzing trace with hash -408101783, now seen corresponding path program 2 times [2020-10-15 16:41:06,200 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 16:41:06,200 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1876020714] [2020-10-15 16:41:06,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 16:41:06,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 16:41:06,264 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-15 16:41:06,265 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1876020714] [2020-10-15 16:41:06,265 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 16:41:06,265 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-15 16:41:06,265 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1383257639] [2020-10-15 16:41:06,265 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-15 16:41:06,265 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 16:41:06,266 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-15 16:41:06,266 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2020-10-15 16:41:06,266 INFO L87 Difference]: Start difference. First operand 2271 states and 7965 transitions. Second operand 7 states. [2020-10-15 16:41:06,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 16:41:06,511 INFO L93 Difference]: Finished difference Result 2765 states and 9396 transitions. [2020-10-15 16:41:06,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-10-15 16:41:06,512 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 24 [2020-10-15 16:41:06,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 16:41:06,520 INFO L225 Difference]: With dead ends: 2765 [2020-10-15 16:41:06,520 INFO L226 Difference]: Without dead ends: 2701 [2020-10-15 16:41:06,521 INFO L677 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-15 16:41:06,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2701 states. [2020-10-15 16:41:06,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2701 to 2268. [2020-10-15 16:41:06,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2268 states. [2020-10-15 16:41:06,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2268 states to 2268 states and 7960 transitions. [2020-10-15 16:41:06,580 INFO L78 Accepts]: Start accepts. Automaton has 2268 states and 7960 transitions. Word has length 24 [2020-10-15 16:41:06,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 16:41:06,581 INFO L481 AbstractCegarLoop]: Abstraction has 2268 states and 7960 transitions. [2020-10-15 16:41:06,581 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-15 16:41:06,581 INFO L276 IsEmpty]: Start isEmpty. Operand 2268 states and 7960 transitions. [2020-10-15 16:41:06,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-10-15 16:41:06,584 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 16:41:06,584 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-15 16:41:06,584 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2020-10-15 16:41:06,584 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-15 16:41:06,585 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 16:41:06,585 INFO L82 PathProgramCache]: Analyzing trace with hash -1308579191, now seen corresponding path program 3 times [2020-10-15 16:41:06,585 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 16:41:06,585 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1618938196] [2020-10-15 16:41:06,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 16:41:06,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 16:41:06,657 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-15 16:41:06,658 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1618938196] [2020-10-15 16:41:06,658 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 16:41:06,658 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-15 16:41:06,658 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [719167327] [2020-10-15 16:41:06,658 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-15 16:41:06,659 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 16:41:06,659 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-15 16:41:06,659 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2020-10-15 16:41:06,659 INFO L87 Difference]: Start difference. First operand 2268 states and 7960 transitions. Second operand 8 states. [2020-10-15 16:41:06,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 16:41:06,877 INFO L93 Difference]: Finished difference Result 2755 states and 9376 transitions. [2020-10-15 16:41:06,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-10-15 16:41:06,878 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 24 [2020-10-15 16:41:06,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 16:41:06,884 INFO L225 Difference]: With dead ends: 2755 [2020-10-15 16:41:06,884 INFO L226 Difference]: Without dead ends: 2691 [2020-10-15 16:41:06,885 INFO L677 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-15 16:41:06,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2691 states. [2020-10-15 16:41:06,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2691 to 2262. [2020-10-15 16:41:06,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2262 states. [2020-10-15 16:41:06,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2262 states to 2262 states and 7946 transitions. [2020-10-15 16:41:06,937 INFO L78 Accepts]: Start accepts. Automaton has 2262 states and 7946 transitions. Word has length 24 [2020-10-15 16:41:06,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 16:41:06,937 INFO L481 AbstractCegarLoop]: Abstraction has 2262 states and 7946 transitions. [2020-10-15 16:41:06,937 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-15 16:41:06,937 INFO L276 IsEmpty]: Start isEmpty. Operand 2262 states and 7946 transitions. [2020-10-15 16:41:06,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-10-15 16:41:06,940 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 16:41:06,941 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-15 16:41:06,941 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2020-10-15 16:41:06,941 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-15 16:41:06,941 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 16:41:06,941 INFO L82 PathProgramCache]: Analyzing trace with hash -1370549309, now seen corresponding path program 4 times [2020-10-15 16:41:06,941 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 16:41:06,941 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [943006646] [2020-10-15 16:41:06,942 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 16:41:06,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 16:41:07,038 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-15 16:41:07,038 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [943006646] [2020-10-15 16:41:07,038 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 16:41:07,039 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-10-15 16:41:07,039 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [517484018] [2020-10-15 16:41:07,039 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-10-15 16:41:07,039 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 16:41:07,040 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-10-15 16:41:07,040 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2020-10-15 16:41:07,040 INFO L87 Difference]: Start difference. First operand 2262 states and 7946 transitions. Second operand 10 states. [2020-10-15 16:41:07,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 16:41:07,242 INFO L93 Difference]: Finished difference Result 2704 states and 9243 transitions. [2020-10-15 16:41:07,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-15 16:41:07,243 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 24 [2020-10-15 16:41:07,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 16:41:07,248 INFO L225 Difference]: With dead ends: 2704 [2020-10-15 16:41:07,249 INFO L226 Difference]: Without dead ends: 2640 [2020-10-15 16:41:07,249 INFO L677 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-15 16:41:07,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2640 states. [2020-10-15 16:41:07,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2640 to 2262. [2020-10-15 16:41:07,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2262 states. [2020-10-15 16:41:07,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2262 states to 2262 states and 7946 transitions. [2020-10-15 16:41:07,286 INFO L78 Accepts]: Start accepts. Automaton has 2262 states and 7946 transitions. Word has length 24 [2020-10-15 16:41:07,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 16:41:07,286 INFO L481 AbstractCegarLoop]: Abstraction has 2262 states and 7946 transitions. [2020-10-15 16:41:07,286 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-10-15 16:41:07,286 INFO L276 IsEmpty]: Start isEmpty. Operand 2262 states and 7946 transitions. [2020-10-15 16:41:07,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-10-15 16:41:07,289 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 16:41:07,289 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-15 16:41:07,289 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2020-10-15 16:41:07,290 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-15 16:41:07,290 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 16:41:07,290 INFO L82 PathProgramCache]: Analyzing trace with hash -1607134461, now seen corresponding path program 5 times [2020-10-15 16:41:07,290 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 16:41:07,290 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1614421554] [2020-10-15 16:41:07,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 16:41:07,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 16:41:07,472 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-15 16:41:07,472 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1614421554] [2020-10-15 16:41:07,472 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 16:41:07,472 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-10-15 16:41:07,473 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [415047583] [2020-10-15 16:41:07,473 INFO L461 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-10-15 16:41:07,474 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 16:41:07,474 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-10-15 16:41:07,474 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2020-10-15 16:41:07,474 INFO L87 Difference]: Start difference. First operand 2262 states and 7946 transitions. Second operand 13 states. [2020-10-15 16:41:07,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 16:41:07,965 INFO L93 Difference]: Finished difference Result 4164 states and 14122 transitions. [2020-10-15 16:41:07,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-15 16:41:07,965 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 24 [2020-10-15 16:41:07,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 16:41:07,975 INFO L225 Difference]: With dead ends: 4164 [2020-10-15 16:41:07,975 INFO L226 Difference]: Without dead ends: 4036 [2020-10-15 16:41:07,975 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=86, Invalid=220, Unknown=0, NotChecked=0, Total=306 [2020-10-15 16:41:07,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4036 states. [2020-10-15 16:41:08,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4036 to 2451. [2020-10-15 16:41:08,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2451 states. [2020-10-15 16:41:08,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2451 states to 2451 states and 8748 transitions. [2020-10-15 16:41:08,020 INFO L78 Accepts]: Start accepts. Automaton has 2451 states and 8748 transitions. Word has length 24 [2020-10-15 16:41:08,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 16:41:08,020 INFO L481 AbstractCegarLoop]: Abstraction has 2451 states and 8748 transitions. [2020-10-15 16:41:08,020 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-10-15 16:41:08,020 INFO L276 IsEmpty]: Start isEmpty. Operand 2451 states and 8748 transitions. [2020-10-15 16:41:08,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-10-15 16:41:08,023 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 16:41:08,023 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-15 16:41:08,023 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2020-10-15 16:41:08,023 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-15 16:41:08,023 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 16:41:08,023 INFO L82 PathProgramCache]: Analyzing trace with hash 1497656527, now seen corresponding path program 6 times [2020-10-15 16:41:08,024 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 16:41:08,024 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1123801528] [2020-10-15 16:41:08,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 16:41:08,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 16:41:08,130 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-15 16:41:08,130 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1123801528] [2020-10-15 16:41:08,130 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 16:41:08,131 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-10-15 16:41:08,131 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [760700870] [2020-10-15 16:41:08,131 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-10-15 16:41:08,131 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 16:41:08,131 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-10-15 16:41:08,131 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2020-10-15 16:41:08,131 INFO L87 Difference]: Start difference. First operand 2451 states and 8748 transitions. Second operand 10 states. [2020-10-15 16:41:08,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 16:41:08,400 INFO L93 Difference]: Finished difference Result 3358 states and 11346 transitions. [2020-10-15 16:41:08,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-15 16:41:08,400 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 24 [2020-10-15 16:41:08,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 16:41:08,407 INFO L225 Difference]: With dead ends: 3358 [2020-10-15 16:41:08,407 INFO L226 Difference]: Without dead ends: 3294 [2020-10-15 16:41:08,407 INFO L677 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-15 16:41:08,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3294 states. [2020-10-15 16:41:08,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3294 to 2271. [2020-10-15 16:41:08,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2271 states. [2020-10-15 16:41:08,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2271 states to 2271 states and 8062 transitions. [2020-10-15 16:41:08,442 INFO L78 Accepts]: Start accepts. Automaton has 2271 states and 8062 transitions. Word has length 24 [2020-10-15 16:41:08,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 16:41:08,443 INFO L481 AbstractCegarLoop]: Abstraction has 2271 states and 8062 transitions. [2020-10-15 16:41:08,443 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-10-15 16:41:08,443 INFO L276 IsEmpty]: Start isEmpty. Operand 2271 states and 8062 transitions. [2020-10-15 16:41:08,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-10-15 16:41:08,446 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 16:41:08,446 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-15 16:41:08,446 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2020-10-15 16:41:08,446 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-15 16:41:08,446 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 16:41:08,446 INFO L82 PathProgramCache]: Analyzing trace with hash -1945194585, now seen corresponding path program 1 times [2020-10-15 16:41:08,446 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 16:41:08,446 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1374523671] [2020-10-15 16:41:08,447 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 16:41:08,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 16:41:08,654 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-15 16:41:08,655 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1374523671] [2020-10-15 16:41:08,655 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 16:41:08,655 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-10-15 16:41:08,656 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1057525349] [2020-10-15 16:41:08,656 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-10-15 16:41:08,656 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 16:41:08,656 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-10-15 16:41:08,657 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2020-10-15 16:41:08,657 INFO L87 Difference]: Start difference. First operand 2271 states and 8062 transitions. Second operand 12 states. [2020-10-15 16:41:09,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 16:41:09,248 INFO L93 Difference]: Finished difference Result 2789 states and 9626 transitions. [2020-10-15 16:41:09,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-10-15 16:41:09,248 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 25 [2020-10-15 16:41:09,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 16:41:09,259 INFO L225 Difference]: With dead ends: 2789 [2020-10-15 16:41:09,259 INFO L226 Difference]: Without dead ends: 2742 [2020-10-15 16:41:09,260 INFO L677 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-15 16:41:09,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2742 states. [2020-10-15 16:41:09,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2742 to 1742. [2020-10-15 16:41:09,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1742 states. [2020-10-15 16:41:09,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1742 states to 1742 states and 6049 transitions. [2020-10-15 16:41:09,410 INFO L78 Accepts]: Start accepts. Automaton has 1742 states and 6049 transitions. Word has length 25 [2020-10-15 16:41:09,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 16:41:09,411 INFO L481 AbstractCegarLoop]: Abstraction has 1742 states and 6049 transitions. [2020-10-15 16:41:09,411 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-10-15 16:41:09,411 INFO L276 IsEmpty]: Start isEmpty. Operand 1742 states and 6049 transitions. [2020-10-15 16:41:09,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-10-15 16:41:09,415 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 16:41:09,416 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-15 16:41:09,416 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2020-10-15 16:41:09,416 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-15 16:41:09,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 16:41:09,417 INFO L82 PathProgramCache]: Analyzing trace with hash -1461991345, now seen corresponding path program 1 times [2020-10-15 16:41:09,417 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 16:41:09,417 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1324817518] [2020-10-15 16:41:09,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 16:41:09,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 16:41:09,539 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-15 16:41:09,539 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1324817518] [2020-10-15 16:41:09,539 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 16:41:09,540 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-10-15 16:41:09,540 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [110253979] [2020-10-15 16:41:09,542 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-15 16:41:09,542 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 16:41:09,542 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-15 16:41:09,542 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2020-10-15 16:41:09,543 INFO L87 Difference]: Start difference. First operand 1742 states and 6049 transitions. Second operand 9 states. [2020-10-15 16:41:09,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 16:41:09,885 INFO L93 Difference]: Finished difference Result 2359 states and 7868 transitions. [2020-10-15 16:41:09,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-15 16:41:09,886 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 26 [2020-10-15 16:41:09,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 16:41:09,891 INFO L225 Difference]: With dead ends: 2359 [2020-10-15 16:41:09,891 INFO L226 Difference]: Without dead ends: 2337 [2020-10-15 16:41:09,892 INFO L677 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-15 16:41:09,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2337 states. [2020-10-15 16:41:09,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2337 to 1741. [2020-10-15 16:41:09,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1741 states. [2020-10-15 16:41:09,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1741 states to 1741 states and 6048 transitions. [2020-10-15 16:41:09,930 INFO L78 Accepts]: Start accepts. Automaton has 1741 states and 6048 transitions. Word has length 26 [2020-10-15 16:41:09,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 16:41:09,930 INFO L481 AbstractCegarLoop]: Abstraction has 1741 states and 6048 transitions. [2020-10-15 16:41:09,931 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-15 16:41:09,931 INFO L276 IsEmpty]: Start isEmpty. Operand 1741 states and 6048 transitions. [2020-10-15 16:41:09,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-10-15 16:41:09,934 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 16:41:09,934 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-15 16:41:09,934 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2020-10-15 16:41:09,934 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-15 16:41:09,934 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 16:41:09,934 INFO L82 PathProgramCache]: Analyzing trace with hash 1932498543, now seen corresponding path program 2 times [2020-10-15 16:41:09,934 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 16:41:09,935 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1314168318] [2020-10-15 16:41:09,935 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 16:41:09,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 16:41:10,050 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-15 16:41:10,051 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1314168318] [2020-10-15 16:41:10,051 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 16:41:10,051 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-10-15 16:41:10,051 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [325704688] [2020-10-15 16:41:10,051 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-10-15 16:41:10,052 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 16:41:10,052 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-10-15 16:41:10,053 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2020-10-15 16:41:10,053 INFO L87 Difference]: Start difference. First operand 1741 states and 6048 transitions. Second operand 10 states. [2020-10-15 16:41:10,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 16:41:10,363 INFO L93 Difference]: Finished difference Result 2355 states and 7860 transitions. [2020-10-15 16:41:10,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-10-15 16:41:10,364 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 26 [2020-10-15 16:41:10,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 16:41:10,369 INFO L225 Difference]: With dead ends: 2355 [2020-10-15 16:41:10,370 INFO L226 Difference]: Without dead ends: 2333 [2020-10-15 16:41:10,370 INFO L677 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-15 16:41:10,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2333 states. [2020-10-15 16:41:10,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2333 to 1744. [2020-10-15 16:41:10,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1744 states. [2020-10-15 16:41:10,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1744 states to 1744 states and 6055 transitions. [2020-10-15 16:41:10,395 INFO L78 Accepts]: Start accepts. Automaton has 1744 states and 6055 transitions. Word has length 26 [2020-10-15 16:41:10,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 16:41:10,395 INFO L481 AbstractCegarLoop]: Abstraction has 1744 states and 6055 transitions. [2020-10-15 16:41:10,395 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-10-15 16:41:10,396 INFO L276 IsEmpty]: Start isEmpty. Operand 1744 states and 6055 transitions. [2020-10-15 16:41:10,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-10-15 16:41:10,398 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 16:41:10,398 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-15 16:41:10,398 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2020-10-15 16:41:10,398 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-15 16:41:10,398 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 16:41:10,398 INFO L82 PathProgramCache]: Analyzing trace with hash 1870528425, now seen corresponding path program 3 times [2020-10-15 16:41:10,398 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 16:41:10,398 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [84576123] [2020-10-15 16:41:10,398 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 16:41:10,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 16:41:10,561 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-15 16:41:10,561 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [84576123] [2020-10-15 16:41:10,561 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 16:41:10,561 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-10-15 16:41:10,562 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [562604822] [2020-10-15 16:41:10,562 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-10-15 16:41:10,562 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 16:41:10,562 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-10-15 16:41:10,562 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2020-10-15 16:41:10,562 INFO L87 Difference]: Start difference. First operand 1744 states and 6055 transitions. Second operand 12 states. [2020-10-15 16:41:10,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 16:41:10,866 INFO L93 Difference]: Finished difference Result 2375 states and 7965 transitions. [2020-10-15 16:41:10,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-15 16:41:10,867 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 26 [2020-10-15 16:41:10,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 16:41:10,872 INFO L225 Difference]: With dead ends: 2375 [2020-10-15 16:41:10,872 INFO L226 Difference]: Without dead ends: 2287 [2020-10-15 16:41:10,872 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=101, Invalid=205, Unknown=0, NotChecked=0, Total=306 [2020-10-15 16:41:10,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2287 states. [2020-10-15 16:41:10,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2287 to 1491. [2020-10-15 16:41:10,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1491 states. [2020-10-15 16:41:10,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1491 states to 1491 states and 5039 transitions. [2020-10-15 16:41:10,895 INFO L78 Accepts]: Start accepts. Automaton has 1491 states and 5039 transitions. Word has length 26 [2020-10-15 16:41:10,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 16:41:10,895 INFO L481 AbstractCegarLoop]: Abstraction has 1491 states and 5039 transitions. [2020-10-15 16:41:10,895 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-10-15 16:41:10,895 INFO L276 IsEmpty]: Start isEmpty. Operand 1491 states and 5039 transitions. [2020-10-15 16:41:10,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-10-15 16:41:10,897 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 16:41:10,897 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-15 16:41:10,897 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2020-10-15 16:41:10,897 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-15 16:41:10,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 16:41:10,897 INFO L82 PathProgramCache]: Analyzing trace with hash 443766965, now seen corresponding path program 4 times [2020-10-15 16:41:10,897 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 16:41:10,897 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1406873543] [2020-10-15 16:41:10,897 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 16:41:10,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 16:41:11,047 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-15 16:41:11,047 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1406873543] [2020-10-15 16:41:11,047 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 16:41:11,048 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-10-15 16:41:11,048 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1263380482] [2020-10-15 16:41:11,048 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-10-15 16:41:11,048 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 16:41:11,048 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-10-15 16:41:11,048 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2020-10-15 16:41:11,049 INFO L87 Difference]: Start difference. First operand 1491 states and 5039 transitions. Second operand 12 states. [2020-10-15 16:41:11,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 16:41:11,372 INFO L93 Difference]: Finished difference Result 1544 states and 5003 transitions. [2020-10-15 16:41:11,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-10-15 16:41:11,372 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 26 [2020-10-15 16:41:11,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 16:41:11,375 INFO L225 Difference]: With dead ends: 1544 [2020-10-15 16:41:11,376 INFO L226 Difference]: Without dead ends: 1500 [2020-10-15 16:41:11,377 INFO L677 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-15 16:41:11,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1500 states. [2020-10-15 16:41:11,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1500 to 885. [2020-10-15 16:41:11,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 885 states. [2020-10-15 16:41:11,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 885 states to 885 states and 3033 transitions. [2020-10-15 16:41:11,398 INFO L78 Accepts]: Start accepts. Automaton has 885 states and 3033 transitions. Word has length 26 [2020-10-15 16:41:11,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 16:41:11,398 INFO L481 AbstractCegarLoop]: Abstraction has 885 states and 3033 transitions. [2020-10-15 16:41:11,398 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-10-15 16:41:11,398 INFO L276 IsEmpty]: Start isEmpty. Operand 885 states and 3033 transitions. [2020-10-15 16:41:11,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2020-10-15 16:41:11,400 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 16:41:11,400 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-15 16:41:11,401 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2020-10-15 16:41:11,401 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-15 16:41:11,402 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 16:41:11,402 INFO L82 PathProgramCache]: Analyzing trace with hash -416507732, now seen corresponding path program 1 times [2020-10-15 16:41:11,402 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 16:41:11,402 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [368922626] [2020-10-15 16:41:11,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 16:41:11,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 16:41:11,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-15 16:41:11,475 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [368922626] [2020-10-15 16:41:11,476 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 16:41:11,476 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-10-15 16:41:11,476 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [285101555] [2020-10-15 16:41:11,476 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-15 16:41:11,476 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 16:41:11,476 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-15 16:41:11,476 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2020-10-15 16:41:11,477 INFO L87 Difference]: Start difference. First operand 885 states and 3033 transitions. Second operand 8 states. [2020-10-15 16:41:11,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 16:41:11,619 INFO L93 Difference]: Finished difference Result 885 states and 3029 transitions. [2020-10-15 16:41:11,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-15 16:41:11,619 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 41 [2020-10-15 16:41:11,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 16:41:11,623 INFO L225 Difference]: With dead ends: 885 [2020-10-15 16:41:11,623 INFO L226 Difference]: Without dead ends: 879 [2020-10-15 16:41:11,623 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2020-10-15 16:41:11,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 879 states. [2020-10-15 16:41:11,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 879 to 879. [2020-10-15 16:41:11,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 879 states. [2020-10-15 16:41:11,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 879 states to 879 states and 3010 transitions. [2020-10-15 16:41:11,645 INFO L78 Accepts]: Start accepts. Automaton has 879 states and 3010 transitions. Word has length 41 [2020-10-15 16:41:11,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 16:41:11,646 INFO L481 AbstractCegarLoop]: Abstraction has 879 states and 3010 transitions. [2020-10-15 16:41:11,646 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-15 16:41:11,646 INFO L276 IsEmpty]: Start isEmpty. Operand 879 states and 3010 transitions. [2020-10-15 16:41:11,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2020-10-15 16:41:11,648 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 16:41:11,648 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-15 16:41:11,649 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2020-10-15 16:41:11,649 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-15 16:41:11,649 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 16:41:11,649 INFO L82 PathProgramCache]: Analyzing trace with hash 829092404, now seen corresponding path program 1 times [2020-10-15 16:41:11,650 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 16:41:11,650 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [929230032] [2020-10-15 16:41:11,650 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 16:41:11,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 16:41:11,746 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-15 16:41:11,746 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [929230032] [2020-10-15 16:41:11,748 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 16:41:11,748 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-10-15 16:41:11,750 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [986809214] [2020-10-15 16:41:11,750 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-15 16:41:11,750 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 16:41:11,751 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-15 16:41:11,751 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2020-10-15 16:41:11,752 INFO L87 Difference]: Start difference. First operand 879 states and 3010 transitions. Second operand 8 states. [2020-10-15 16:41:11,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 16:41:11,899 INFO L93 Difference]: Finished difference Result 879 states and 3006 transitions. [2020-10-15 16:41:11,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-15 16:41:11,899 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 41 [2020-10-15 16:41:11,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 16:41:11,901 INFO L225 Difference]: With dead ends: 879 [2020-10-15 16:41:11,901 INFO L226 Difference]: Without dead ends: 819 [2020-10-15 16:41:11,902 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2020-10-15 16:41:11,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 819 states. [2020-10-15 16:41:11,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 819 to 819. [2020-10-15 16:41:11,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 819 states. [2020-10-15 16:41:11,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 819 states to 819 states and 2784 transitions. [2020-10-15 16:41:11,919 INFO L78 Accepts]: Start accepts. Automaton has 819 states and 2784 transitions. Word has length 41 [2020-10-15 16:41:11,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 16:41:11,920 INFO L481 AbstractCegarLoop]: Abstraction has 819 states and 2784 transitions. [2020-10-15 16:41:11,920 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-15 16:41:11,920 INFO L276 IsEmpty]: Start isEmpty. Operand 819 states and 2784 transitions. [2020-10-15 16:41:11,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2020-10-15 16:41:11,923 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 16:41:11,923 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-15 16:41:11,923 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2020-10-15 16:41:11,923 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-15 16:41:11,923 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 16:41:11,923 INFO L82 PathProgramCache]: Analyzing trace with hash 1378914744, now seen corresponding path program 1 times [2020-10-15 16:41:11,923 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 16:41:11,924 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [604358180] [2020-10-15 16:41:11,924 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 16:41:11,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-15 16:41:11,942 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-15 16:41:11,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-15 16:41:11,971 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-15 16:41:12,023 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-15 16:41:12,023 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-10-15 16:41:12,024 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2020-10-15 16:41:12,140 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.10 04:41:12 BasicIcfg [2020-10-15 16:41:12,140 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-15 16:41:12,142 INFO L168 Benchmark]: Toolchain (without parser) took 27970.71 ms. Allocated memory was 256.9 MB in the beginning and 963.6 MB in the end (delta: 706.7 MB). Free memory was 211.8 MB in the beginning and 305.2 MB in the end (delta: -93.4 MB). Peak memory consumption was 613.3 MB. Max. memory is 14.2 GB. [2020-10-15 16:41:12,142 INFO L168 Benchmark]: CDTParser took 0.54 ms. Allocated memory is still 256.9 MB. Free memory is still 233.3 MB. There was no memory consumed. Max. memory is 14.2 GB. [2020-10-15 16:41:12,142 INFO L168 Benchmark]: CACSL2BoogieTranslator took 895.13 ms. Allocated memory was 256.9 MB in the beginning and 327.2 MB in the end (delta: 70.3 MB). Free memory was 211.8 MB in the beginning and 244.4 MB in the end (delta: -32.6 MB). Peak memory consumption was 48.2 MB. Max. memory is 14.2 GB. [2020-10-15 16:41:12,143 INFO L168 Benchmark]: Boogie Procedure Inliner took 63.26 ms. Allocated memory is still 327.2 MB. Free memory was 244.4 MB in the beginning and 241.9 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB. [2020-10-15 16:41:12,143 INFO L168 Benchmark]: Boogie Preprocessor took 30.75 ms. Allocated memory is still 327.2 MB. Free memory was 241.9 MB in the beginning and 239.4 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB. [2020-10-15 16:41:12,143 INFO L168 Benchmark]: RCFGBuilder took 477.53 ms. Allocated memory is still 327.2 MB. Free memory was 239.4 MB in the beginning and 212.5 MB in the end (delta: 26.9 MB). Peak memory consumption was 26.9 MB. Max. memory is 14.2 GB. [2020-10-15 16:41:12,144 INFO L168 Benchmark]: TraceAbstraction took 26498.50 ms. Allocated memory was 327.2 MB in the beginning and 963.6 MB in the end (delta: 636.5 MB). Free memory was 212.5 MB in the beginning and 305.2 MB in the end (delta: -92.8 MB). Peak memory consumption was 543.7 MB. Max. memory is 14.2 GB. [2020-10-15 16:41:12,146 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.54 ms. Allocated memory is still 256.9 MB. Free memory is still 233.3 MB. There was no memory consumed. Max. memory is 14.2 GB. * CACSL2BoogieTranslator took 895.13 ms. Allocated memory was 256.9 MB in the beginning and 327.2 MB in the end (delta: 70.3 MB). Free memory was 211.8 MB in the beginning and 244.4 MB in the end (delta: -32.6 MB). Peak memory consumption was 48.2 MB. Max. memory is 14.2 GB. * Boogie Procedure Inliner took 63.26 ms. Allocated memory is still 327.2 MB. Free memory was 244.4 MB in the beginning and 241.9 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB. * Boogie Preprocessor took 30.75 ms. Allocated memory is still 327.2 MB. Free memory was 241.9 MB in the beginning and 239.4 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB. * RCFGBuilder took 477.53 ms. Allocated memory is still 327.2 MB. Free memory was 239.4 MB in the beginning and 212.5 MB in the end (delta: 26.9 MB). Peak memory consumption was 26.9 MB. Max. memory is 14.2 GB. * TraceAbstraction took 26498.50 ms. Allocated memory was 327.2 MB in the beginning and 963.6 MB in the end (delta: 636.5 MB). Free memory was 212.5 MB in the beginning and 305.2 MB in the end (delta: -92.8 MB). Peak memory consumption was 543.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.2s, 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: 26.0s, OverallIterations: 44, TraceHistogramMax: 1, AutomataDifference: 13.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 2.8s, HoareTripleCheckerStatistics: 4657 SDtfs, 7459 SDslu, 14204 SDs, 0 SdLazy, 8536 SolverSat, 1019 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 6.6s 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: 3.5s AutomataMinimizationTime, 43 MinimizatonAttempts, 43210 StatesRemovedByMinimization, 41 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 4.3s 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...