/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/pthread/singleton.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-11af1e5 [2020-10-11 13:11:38,157 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-11 13:11:38,160 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-11 13:11:38,199 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-11 13:11:38,200 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-11 13:11:38,208 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-11 13:11:38,210 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-11 13:11:38,214 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-11 13:11:38,216 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-11 13:11:38,220 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-11 13:11:38,221 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-11 13:11:38,222 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-11 13:11:38,222 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-11 13:11:38,225 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-11 13:11:38,227 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-11 13:11:38,228 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-11 13:11:38,229 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-11 13:11:38,230 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-11 13:11:38,232 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-11 13:11:38,239 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-11 13:11:38,241 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-11 13:11:38,242 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-11 13:11:38,243 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-11 13:11:38,244 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-11 13:11:38,255 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-11 13:11:38,255 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-11 13:11:38,255 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-11 13:11:38,256 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-11 13:11:38,259 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-11 13:11:38,261 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-11 13:11:38,262 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-11 13:11:38,262 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-11 13:11:38,263 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-11 13:11:38,264 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-11 13:11:38,264 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-11 13:11:38,265 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-11 13:11:38,265 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-11 13:11:38,265 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-11 13:11:38,266 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-11 13:11:38,273 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-11 13:11:38,274 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-11 13:11:38,274 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-11 13:11:38,297 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-11 13:11:38,297 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-11 13:11:38,298 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-11 13:11:38,299 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-11 13:11:38,299 INFO L138 SettingsManager]: * Use SBE=true [2020-10-11 13:11:38,299 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-11 13:11:38,299 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-11 13:11:38,299 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-11 13:11:38,300 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-11 13:11:38,300 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-11 13:11:38,300 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-11 13:11:38,300 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-11 13:11:38,300 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-11 13:11:38,300 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-11 13:11:38,301 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-11 13:11:38,301 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-11 13:11:38,301 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-11 13:11:38,301 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-11 13:11:38,301 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-11 13:11:38,302 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-11 13:11:38,302 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-11 13:11:38,302 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-11 13:11:38,302 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-11 13:11:38,302 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-10-11 13:11:38,302 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-11 13:11:38,303 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-11 13:11:38,303 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-11 13:11:38,303 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-10-11 13:11:38,303 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-10-11 13:11:38,303 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-10-11 13:11:38,631 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-11 13:11:38,649 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-11 13:11:38,652 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-11 13:11:38,654 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-11 13:11:38,654 INFO L275 PluginConnector]: CDTParser initialized [2020-10-11 13:11:38,655 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread/singleton.i [2020-10-11 13:11:38,728 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d438daeb5/6994bd470e62412aa226a2e2363e71e9/FLAG8f2db1ac9 [2020-10-11 13:11:39,319 INFO L306 CDTParser]: Found 1 translation units. [2020-10-11 13:11:39,320 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread/singleton.i [2020-10-11 13:11:39,338 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d438daeb5/6994bd470e62412aa226a2e2363e71e9/FLAG8f2db1ac9 [2020-10-11 13:11:39,553 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d438daeb5/6994bd470e62412aa226a2e2363e71e9 [2020-10-11 13:11:39,561 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-11 13:11:39,564 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-10-11 13:11:39,565 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-11 13:11:39,565 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-11 13:11:39,569 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-11 13:11:39,570 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 01:11:39" (1/1) ... [2020-10-11 13:11:39,572 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4bbcc866 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:11:39, skipping insertion in model container [2020-10-11 13:11:39,573 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 01:11:39" (1/1) ... [2020-10-11 13:11:39,580 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-11 13:11:39,634 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-11 13:11:40,251 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-11 13:11:40,266 INFO L203 MainTranslator]: Completed pre-run [2020-10-11 13:11:40,342 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-11 13:11:40,518 INFO L208 MainTranslator]: Completed translation [2020-10-11 13:11:40,519 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:11:40 WrapperNode [2020-10-11 13:11:40,519 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-11 13:11:40,520 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-11 13:11:40,520 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-11 13:11:40,520 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-11 13:11:40,529 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:11:40" (1/1) ... [2020-10-11 13:11:40,551 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:11:40" (1/1) ... [2020-10-11 13:11:40,581 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-11 13:11:40,582 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-11 13:11:40,582 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-11 13:11:40,582 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-11 13:11:40,588 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:11:40" (1/1) ... [2020-10-11 13:11:40,589 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:11:40" (1/1) ... [2020-10-11 13:11:40,592 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:11:40" (1/1) ... [2020-10-11 13:11:40,593 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:11:40" (1/1) ... [2020-10-11 13:11:40,601 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:11:40" (1/1) ... [2020-10-11 13:11:40,603 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:11:40" (1/1) ... [2020-10-11 13:11:40,606 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:11:40" (1/1) ... [2020-10-11 13:11:40,609 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-11 13:11:40,610 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-11 13:11:40,610 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-11 13:11:40,610 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-11 13:11:40,611 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:11:40" (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-11 13:11:40,671 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-11 13:11:40,672 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-11 13:11:40,672 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-10-11 13:11:40,672 INFO L130 BoogieDeclarations]: Found specification of procedure thread0 [2020-10-11 13:11:40,672 INFO L138 BoogieDeclarations]: Found implementation of procedure thread0 [2020-10-11 13:11:40,673 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2020-10-11 13:11:40,673 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2020-10-11 13:11:40,673 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2020-10-11 13:11:40,678 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2020-10-11 13:11:40,679 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2020-10-11 13:11:40,679 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2020-10-11 13:11:40,679 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-11 13:11:40,680 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2020-10-11 13:11:40,680 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-11 13:11:40,680 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-11 13:11:40,682 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2020-10-11 13:11:41,113 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-11 13:11:41,113 INFO L298 CfgBuilder]: Removed 6 assume(true) statements. [2020-10-11 13:11:41,115 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 01:11:41 BoogieIcfgContainer [2020-10-11 13:11:41,115 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-11 13:11:41,117 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-11 13:11:41,117 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-11 13:11:41,121 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-11 13:11:41,121 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 01:11:39" (1/3) ... [2020-10-11 13:11:41,122 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@21e79c8a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 01:11:41, skipping insertion in model container [2020-10-11 13:11:41,122 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:11:40" (2/3) ... [2020-10-11 13:11:41,123 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@21e79c8a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 01:11:41, skipping insertion in model container [2020-10-11 13:11:41,123 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 01:11:41" (3/3) ... [2020-10-11 13:11:41,124 INFO L111 eAbstractionObserver]: Analyzing ICFG singleton.i [2020-10-11 13:11:41,136 WARN L153 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2020-10-11 13:11:41,137 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-10-11 13:11:41,145 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-10-11 13:11:41,146 INFO L348 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-10-11 13:11:41,187 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 13:11:41,187 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 13:11:41,188 WARN L313 ript$VariableManager]: TermVariabe thread0Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 13:11:41,188 WARN L313 ript$VariableManager]: TermVariabe thread0Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 13:11:41,188 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 13:11:41,188 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t1~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 13:11:41,189 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t2~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 13:11:41,189 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 13:11:41,189 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 13:11:41,190 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t3~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 13:11:41,190 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t4~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 13:11:41,190 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t4~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 13:11:41,190 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t5~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 13:11:41,191 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t5~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 13:11:41,191 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 13:11:41,191 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t1~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 13:11:41,192 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 13:11:41,192 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 13:11:41,192 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t1~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 13:11:41,192 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#t~mem4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 13:11:41,193 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#t~mem4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 13:11:41,193 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t2~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 13:11:41,193 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 13:11:41,193 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 13:11:41,193 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 13:11:41,194 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t3~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 13:11:41,194 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 13:11:41,194 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t4~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 13:11:41,194 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t4~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 13:11:41,195 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#t~nondet7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 13:11:41,195 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t5~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 13:11:41,195 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t5~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 13:11:41,195 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#t~nondet8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 13:11:41,195 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t2~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 13:11:41,196 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 13:11:41,196 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 13:11:41,196 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 13:11:41,197 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 13:11:41,197 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t3~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 13:11:41,197 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#t~mem10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 13:11:41,197 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#t~mem10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 13:11:41,198 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t4~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 13:11:41,198 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t4~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 13:11:41,198 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#t~mem11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 13:11:41,198 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#t~mem11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 13:11:41,199 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t5~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 13:11:41,199 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t5~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 13:11:41,199 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#t~mem12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 13:11:41,199 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#t~mem12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 13:11:41,200 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 13:11:41,200 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 13:11:41,200 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 13:11:41,200 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 13:11:41,201 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t1~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 13:11:41,201 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 13:11:41,201 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 13:11:41,201 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t2~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 13:11:41,202 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 13:11:41,202 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t3~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 13:11:41,202 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 13:11:41,202 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t4~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 13:11:41,203 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t4~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 13:11:41,203 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t4~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 13:11:41,203 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t5~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 13:11:41,203 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t5~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 13:11:41,204 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t5~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 13:11:41,204 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork4_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 13:11:41,204 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork4_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 13:11:41,204 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork4_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 13:11:41,205 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork4_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 13:11:41,205 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork4_#t~malloc2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 13:11:41,205 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork4_#t~malloc2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 13:11:41,205 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork4_#t~malloc2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 13:11:41,206 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork4_#t~malloc2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 13:11:41,206 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork4_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 13:11:41,206 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork4_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 13:11:41,207 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 13:11:41,207 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 13:11:41,207 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 13:11:41,207 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 13:11:41,208 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 13:11:41,208 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 13:11:41,208 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 13:11:41,208 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 13:11:41,209 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 13:11:41,209 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 13:11:41,209 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 13:11:41,209 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 13:11:41,210 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork5_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 13:11:41,210 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork5_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 13:11:41,210 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork5_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 13:11:41,210 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork5_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 13:11:41,211 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork5_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 13:11:41,211 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork5_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 13:11:41,211 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 13:11:41,212 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 13:11:41,212 WARN L313 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 13:11:41,212 WARN L313 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 13:11:41,212 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 13:11:41,213 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 13:11:41,217 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 13:11:41,217 WARN L313 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 13:11:41,217 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 13:11:41,217 WARN L313 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 13:11:41,223 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 13:11:41,223 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 13:11:41,223 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 13:11:41,224 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 13:11:41,226 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 13:11:41,227 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 13:11:41,227 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 13:11:41,227 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 13:11:41,231 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#t~nondet8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 13:11:41,231 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#t~mem4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 13:11:41,231 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 13:11:41,231 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t4~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 13:11:41,232 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t2~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 13:11:41,232 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 13:11:41,232 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 13:11:41,232 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#t~mem10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 13:11:41,233 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#t~mem11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 13:11:41,233 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t4~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 13:11:41,233 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#t~mem12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 13:11:41,233 WARN L313 ript$VariableManager]: TermVariabe thread0Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 13:11:41,233 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t3~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 13:11:41,234 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 13:11:41,234 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 13:11:41,234 WARN L313 ript$VariableManager]: TermVariabe thread0Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 13:11:41,234 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 13:11:41,235 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t1~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 13:11:41,235 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t5~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 13:11:41,235 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 13:11:41,235 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t5~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 13:11:41,235 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 13:11:41,236 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 13:11:41,236 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#t~nondet7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 13:11:41,242 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork4_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 13:11:41,242 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork4_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 13:11:41,242 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork4_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 13:11:41,242 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork4_#t~malloc2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 13:11:41,243 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork4_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 13:11:41,243 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork4_#t~malloc2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 13:11:41,245 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork5_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 13:11:41,245 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork5_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 13:11:41,246 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork5_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 13:11:41,246 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork5_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 13:11:41,248 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork4_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 13:11:41,248 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork4_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 13:11:41,249 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork4_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 13:11:41,249 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork4_#t~malloc2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 13:11:41,249 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork4_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 13:11:41,249 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork4_#t~malloc2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 13:11:41,251 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork5_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 13:11:41,252 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork5_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 13:11:41,252 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork5_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 13:11:41,252 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork5_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 13:11:41,254 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 13:11:41,254 WARN L313 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 13:11:41,255 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 13:11:41,255 WARN L313 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 13:11:41,257 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 13:11:41,257 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 13:11:41,258 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 13:11:41,258 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 13:11:41,260 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 13:11:41,260 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 13:11:41,261 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 13:11:41,261 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 13:11:41,415 INFO L253 AbstractCegarLoop]: Starting to check reachability of 12 error locations. [2020-10-11 13:11:41,438 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-11 13:11:41,438 INFO L378 AbstractCegarLoop]: Hoare is true [2020-10-11 13:11:41,438 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-10-11 13:11:41,438 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-11 13:11:41,438 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-11 13:11:41,439 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-11 13:11:41,439 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-11 13:11:41,439 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-11 13:11:41,458 INFO L129 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2020-10-11 13:11:41,461 INFO L144 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 172 places, 243 transitions, 866 flow [2020-10-11 13:11:41,464 INFO L111 LiptonReduction]: Starting Lipton reduction on Petri net that has 172 places, 243 transitions, 866 flow [2020-10-11 13:11:41,466 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 172 places, 243 transitions, 866 flow [2020-10-11 13:11:41,564 INFO L129 PetriNetUnfolder]: 61/264 cut-off events. [2020-10-11 13:11:41,564 INFO L130 PetriNetUnfolder]: For 39/39 co-relation queries the response was YES. [2020-10-11 13:11:41,575 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-11 13:11:41,588 INFO L117 LiptonReduction]: Number of co-enabled transitions 4038 [2020-10-11 13:11:43,342 WARN L193 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 77 [2020-10-11 13:11:43,682 INFO L132 LiptonReduction]: Checked pairs total: 47722 [2020-10-11 13:11:43,682 INFO L134 LiptonReduction]: Total number of compositions: 76 [2020-10-11 13:11:43,687 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 101 places, 173 transitions, 726 flow [2020-10-11 13:11:44,235 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 3502 states. [2020-10-11 13:11:44,238 INFO L276 IsEmpty]: Start isEmpty. Operand 3502 states. [2020-10-11 13:11:44,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-10-11 13:11:44,252 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 13:11:44,253 INFO L421 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 13:11:44,253 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-11 13:11:44,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 13:11:44,261 INFO L82 PathProgramCache]: Analyzing trace with hash 1069688068, now seen corresponding path program 1 times [2020-10-11 13:11:44,273 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 13:11:44,274 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [632623992] [2020-10-11 13:11:44,274 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 13:11:44,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 13:11:44,600 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-11 13:11:44,602 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [632623992] [2020-10-11 13:11:44,603 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 13:11:44,604 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-11 13:11:44,604 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1526252591] [2020-10-11 13:11:44,612 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-11 13:11:44,612 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 13:11:44,628 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-11 13:11:44,629 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-10-11 13:11:44,631 INFO L87 Difference]: Start difference. First operand 3502 states. Second operand 6 states. [2020-10-11 13:11:45,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 13:11:45,037 INFO L93 Difference]: Finished difference Result 4760 states and 19900 transitions. [2020-10-11 13:11:45,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-11 13:11:45,039 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 9 [2020-10-11 13:11:45,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 13:11:45,103 INFO L225 Difference]: With dead ends: 4760 [2020-10-11 13:11:45,103 INFO L226 Difference]: Without dead ends: 4272 [2020-10-11 13:11:45,104 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2020-10-11 13:11:45,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4272 states. [2020-10-11 13:11:45,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4272 to 3018. [2020-10-11 13:11:45,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3018 states. [2020-10-11 13:11:45,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3018 states to 3018 states and 12272 transitions. [2020-10-11 13:11:45,350 INFO L78 Accepts]: Start accepts. Automaton has 3018 states and 12272 transitions. Word has length 9 [2020-10-11 13:11:45,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 13:11:45,350 INFO L481 AbstractCegarLoop]: Abstraction has 3018 states and 12272 transitions. [2020-10-11 13:11:45,350 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-11 13:11:45,351 INFO L276 IsEmpty]: Start isEmpty. Operand 3018 states and 12272 transitions. [2020-10-11 13:11:45,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-10-11 13:11:45,351 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 13:11:45,352 INFO L421 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 13:11:45,352 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-11 13:11:45,352 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-11 13:11:45,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 13:11:45,353 INFO L82 PathProgramCache]: Analyzing trace with hash 1263032832, now seen corresponding path program 2 times [2020-10-11 13:11:45,353 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 13:11:45,354 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [673314819] [2020-10-11 13:11:45,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 13:11:45,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 13:11:45,467 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-11 13:11:45,468 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [673314819] [2020-10-11 13:11:45,468 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 13:11:45,468 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-11 13:11:45,469 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [165994464] [2020-10-11 13:11:45,470 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-11 13:11:45,471 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 13:11:45,471 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-11 13:11:45,471 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-10-11 13:11:45,472 INFO L87 Difference]: Start difference. First operand 3018 states and 12272 transitions. Second operand 6 states. [2020-10-11 13:11:45,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 13:11:45,838 INFO L93 Difference]: Finished difference Result 5518 states and 23821 transitions. [2020-10-11 13:11:45,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-11 13:11:45,839 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 9 [2020-10-11 13:11:45,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 13:11:45,905 INFO L225 Difference]: With dead ends: 5518 [2020-10-11 13:11:45,906 INFO L226 Difference]: Without dead ends: 5518 [2020-10-11 13:11:45,907 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2020-10-11 13:11:45,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5518 states. [2020-10-11 13:11:46,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5518 to 3008. [2020-10-11 13:11:46,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3008 states. [2020-10-11 13:11:46,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3008 states to 3008 states and 12255 transitions. [2020-10-11 13:11:46,100 INFO L78 Accepts]: Start accepts. Automaton has 3008 states and 12255 transitions. Word has length 9 [2020-10-11 13:11:46,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 13:11:46,100 INFO L481 AbstractCegarLoop]: Abstraction has 3008 states and 12255 transitions. [2020-10-11 13:11:46,100 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-11 13:11:46,100 INFO L276 IsEmpty]: Start isEmpty. Operand 3008 states and 12255 transitions. [2020-10-11 13:11:46,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-10-11 13:11:46,102 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 13:11:46,102 INFO L421 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 13:11:46,102 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-11 13:11:46,102 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-11 13:11:46,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 13:11:46,103 INFO L82 PathProgramCache]: Analyzing trace with hash -690496787, now seen corresponding path program 1 times [2020-10-11 13:11:46,103 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 13:11:46,103 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [939563797] [2020-10-11 13:11:46,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 13:11:46,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 13:11:46,162 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-11 13:11:46,162 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [939563797] [2020-10-11 13:11:46,163 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 13:11:46,163 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-11 13:11:46,163 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [992093872] [2020-10-11 13:11:46,163 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-11 13:11:46,164 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 13:11:46,164 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-11 13:11:46,164 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-11 13:11:46,164 INFO L87 Difference]: Start difference. First operand 3008 states and 12255 transitions. Second operand 3 states. [2020-10-11 13:11:46,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 13:11:46,244 INFO L93 Difference]: Finished difference Result 4848 states and 19273 transitions. [2020-10-11 13:11:46,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-11 13:11:46,245 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2020-10-11 13:11:46,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 13:11:46,273 INFO L225 Difference]: With dead ends: 4848 [2020-10-11 13:11:46,273 INFO L226 Difference]: Without dead ends: 3558 [2020-10-11 13:11:46,274 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-11 13:11:46,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3558 states. [2020-10-11 13:11:46,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3558 to 3181. [2020-10-11 13:11:46,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3181 states. [2020-10-11 13:11:46,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3181 states to 3181 states and 12171 transitions. [2020-10-11 13:11:46,411 INFO L78 Accepts]: Start accepts. Automaton has 3181 states and 12171 transitions. Word has length 16 [2020-10-11 13:11:46,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 13:11:46,412 INFO L481 AbstractCegarLoop]: Abstraction has 3181 states and 12171 transitions. [2020-10-11 13:11:46,412 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-11 13:11:46,412 INFO L276 IsEmpty]: Start isEmpty. Operand 3181 states and 12171 transitions. [2020-10-11 13:11:46,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-10-11 13:11:46,414 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 13:11:46,414 INFO L421 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 13:11:46,414 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-11 13:11:46,414 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-11 13:11:46,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 13:11:46,415 INFO L82 PathProgramCache]: Analyzing trace with hash 69435085, now seen corresponding path program 1 times [2020-10-11 13:11:46,415 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 13:11:46,415 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [375318442] [2020-10-11 13:11:46,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 13:11:46,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 13:11:46,478 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-11 13:11:46,478 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [375318442] [2020-10-11 13:11:46,479 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 13:11:46,479 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-11 13:11:46,479 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2147109859] [2020-10-11 13:11:46,479 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-11 13:11:46,480 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 13:11:46,480 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-11 13:11:46,480 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-10-11 13:11:46,480 INFO L87 Difference]: Start difference. First operand 3181 states and 12171 transitions. Second operand 6 states. [2020-10-11 13:11:46,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 13:11:46,712 INFO L93 Difference]: Finished difference Result 4417 states and 17212 transitions. [2020-10-11 13:11:46,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-11 13:11:46,712 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 17 [2020-10-11 13:11:46,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 13:11:46,731 INFO L225 Difference]: With dead ends: 4417 [2020-10-11 13:11:46,732 INFO L226 Difference]: Without dead ends: 4393 [2020-10-11 13:11:46,732 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2020-10-11 13:11:46,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4393 states. [2020-10-11 13:11:46,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4393 to 3588. [2020-10-11 13:11:46,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3588 states. [2020-10-11 13:11:46,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3588 states to 3588 states and 14085 transitions. [2020-10-11 13:11:46,878 INFO L78 Accepts]: Start accepts. Automaton has 3588 states and 14085 transitions. Word has length 17 [2020-10-11 13:11:46,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 13:11:46,878 INFO L481 AbstractCegarLoop]: Abstraction has 3588 states and 14085 transitions. [2020-10-11 13:11:46,878 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-11 13:11:46,879 INFO L276 IsEmpty]: Start isEmpty. Operand 3588 states and 14085 transitions. [2020-10-11 13:11:46,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-10-11 13:11:46,880 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 13:11:46,881 INFO L421 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 13:11:46,881 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-11 13:11:46,881 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-11 13:11:46,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 13:11:46,881 INFO L82 PathProgramCache]: Analyzing trace with hash -954298863, now seen corresponding path program 2 times [2020-10-11 13:11:46,882 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 13:11:46,882 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1464179103] [2020-10-11 13:11:46,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 13:11:46,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 13:11:46,944 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-11 13:11:46,944 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1464179103] [2020-10-11 13:11:46,944 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 13:11:46,945 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-11 13:11:46,945 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [640945961] [2020-10-11 13:11:46,945 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-11 13:11:46,945 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 13:11:46,946 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-11 13:11:46,946 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-10-11 13:11:46,946 INFO L87 Difference]: Start difference. First operand 3588 states and 14085 transitions. Second operand 6 states. [2020-10-11 13:11:47,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 13:11:47,050 INFO L93 Difference]: Finished difference Result 4024 states and 15445 transitions. [2020-10-11 13:11:47,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-11 13:11:47,050 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 17 [2020-10-11 13:11:47,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 13:11:47,066 INFO L225 Difference]: With dead ends: 4024 [2020-10-11 13:11:47,067 INFO L226 Difference]: Without dead ends: 4024 [2020-10-11 13:11:47,067 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2020-10-11 13:11:47,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4024 states. [2020-10-11 13:11:47,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4024 to 3573. [2020-10-11 13:11:47,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3573 states. [2020-10-11 13:11:47,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3573 states to 3573 states and 14045 transitions. [2020-10-11 13:11:47,186 INFO L78 Accepts]: Start accepts. Automaton has 3573 states and 14045 transitions. Word has length 17 [2020-10-11 13:11:47,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 13:11:47,187 INFO L481 AbstractCegarLoop]: Abstraction has 3573 states and 14045 transitions. [2020-10-11 13:11:47,187 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-11 13:11:47,187 INFO L276 IsEmpty]: Start isEmpty. Operand 3573 states and 14045 transitions. [2020-10-11 13:11:47,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-10-11 13:11:47,188 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 13:11:47,188 INFO L421 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 13:11:47,189 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-11 13:11:47,189 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-11 13:11:47,189 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 13:11:47,189 INFO L82 PathProgramCache]: Analyzing trace with hash -687500069, now seen corresponding path program 1 times [2020-10-11 13:11:47,189 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 13:11:47,190 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1834475344] [2020-10-11 13:11:47,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 13:11:47,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 13:11:47,240 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-11 13:11:47,240 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1834475344] [2020-10-11 13:11:47,241 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 13:11:47,241 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-11 13:11:47,241 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2131976360] [2020-10-11 13:11:47,241 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-11 13:11:47,242 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 13:11:47,242 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-11 13:11:47,242 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-10-11 13:11:47,242 INFO L87 Difference]: Start difference. First operand 3573 states and 14045 transitions. Second operand 6 states. [2020-10-11 13:11:47,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 13:11:47,422 INFO L93 Difference]: Finished difference Result 4225 states and 16225 transitions. [2020-10-11 13:11:47,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-11 13:11:47,422 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 18 [2020-10-11 13:11:47,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 13:11:47,442 INFO L225 Difference]: With dead ends: 4225 [2020-10-11 13:11:47,442 INFO L226 Difference]: Without dead ends: 4129 [2020-10-11 13:11:47,442 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2020-10-11 13:11:47,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4129 states. [2020-10-11 13:11:47,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4129 to 3713. [2020-10-11 13:11:47,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3713 states. [2020-10-11 13:11:47,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3713 states to 3713 states and 14455 transitions. [2020-10-11 13:11:47,561 INFO L78 Accepts]: Start accepts. Automaton has 3713 states and 14455 transitions. Word has length 18 [2020-10-11 13:11:47,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 13:11:47,562 INFO L481 AbstractCegarLoop]: Abstraction has 3713 states and 14455 transitions. [2020-10-11 13:11:47,562 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-11 13:11:47,562 INFO L276 IsEmpty]: Start isEmpty. Operand 3713 states and 14455 transitions. [2020-10-11 13:11:47,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-10-11 13:11:47,563 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 13:11:47,563 INFO L421 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 13:11:47,564 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-11 13:11:47,564 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-11 13:11:47,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 13:11:47,564 INFO L82 PathProgramCache]: Analyzing trace with hash -454402421, now seen corresponding path program 2 times [2020-10-11 13:11:47,565 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 13:11:47,565 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1873653995] [2020-10-11 13:11:47,565 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 13:11:47,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 13:11:47,641 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-11 13:11:47,642 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1873653995] [2020-10-11 13:11:47,642 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 13:11:47,642 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-11 13:11:47,643 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1618422373] [2020-10-11 13:11:47,643 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-11 13:11:47,643 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 13:11:47,644 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-11 13:11:47,644 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2020-10-11 13:11:47,644 INFO L87 Difference]: Start difference. First operand 3713 states and 14455 transitions. Second operand 7 states. [2020-10-11 13:11:48,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 13:11:48,011 INFO L93 Difference]: Finished difference Result 4979 states and 19779 transitions. [2020-10-11 13:11:48,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-10-11 13:11:48,012 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 18 [2020-10-11 13:11:48,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 13:11:48,036 INFO L225 Difference]: With dead ends: 4979 [2020-10-11 13:11:48,036 INFO L226 Difference]: Without dead ends: 4905 [2020-10-11 13:11:48,037 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2020-10-11 13:11:48,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4905 states. [2020-10-11 13:11:48,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4905 to 4131. [2020-10-11 13:11:48,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4131 states. [2020-10-11 13:11:48,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4131 states to 4131 states and 16620 transitions. [2020-10-11 13:11:48,173 INFO L78 Accepts]: Start accepts. Automaton has 4131 states and 16620 transitions. Word has length 18 [2020-10-11 13:11:48,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 13:11:48,173 INFO L481 AbstractCegarLoop]: Abstraction has 4131 states and 16620 transitions. [2020-10-11 13:11:48,173 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-11 13:11:48,173 INFO L276 IsEmpty]: Start isEmpty. Operand 4131 states and 16620 transitions. [2020-10-11 13:11:48,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-10-11 13:11:48,175 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 13:11:48,175 INFO L421 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 13:11:48,175 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-10-11 13:11:48,175 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-11 13:11:48,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 13:11:48,176 INFO L82 PathProgramCache]: Analyzing trace with hash -1254406997, now seen corresponding path program 3 times [2020-10-11 13:11:48,176 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 13:11:48,176 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [592032553] [2020-10-11 13:11:48,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 13:11:48,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 13:11:48,260 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-11 13:11:48,260 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [592032553] [2020-10-11 13:11:48,260 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 13:11:48,260 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-11 13:11:48,261 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1379113713] [2020-10-11 13:11:48,261 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-11 13:11:48,261 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 13:11:48,262 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-11 13:11:48,262 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2020-10-11 13:11:48,262 INFO L87 Difference]: Start difference. First operand 4131 states and 16620 transitions. Second operand 8 states. [2020-10-11 13:11:48,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 13:11:48,593 INFO L93 Difference]: Finished difference Result 6735 states and 27904 transitions. [2020-10-11 13:11:48,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-11 13:11:48,594 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 18 [2020-10-11 13:11:48,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 13:11:48,618 INFO L225 Difference]: With dead ends: 6735 [2020-10-11 13:11:48,619 INFO L226 Difference]: Without dead ends: 6661 [2020-10-11 13:11:48,619 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2020-10-11 13:11:48,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6661 states. [2020-10-11 13:11:48,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6661 to 4129. [2020-10-11 13:11:48,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4129 states. [2020-10-11 13:11:48,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4129 states to 4129 states and 16616 transitions. [2020-10-11 13:11:48,795 INFO L78 Accepts]: Start accepts. Automaton has 4129 states and 16616 transitions. Word has length 18 [2020-10-11 13:11:48,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 13:11:48,796 INFO L481 AbstractCegarLoop]: Abstraction has 4129 states and 16616 transitions. [2020-10-11 13:11:48,796 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-11 13:11:48,797 INFO L276 IsEmpty]: Start isEmpty. Operand 4129 states and 16616 transitions. [2020-10-11 13:11:48,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-10-11 13:11:48,799 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 13:11:48,799 INFO L421 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 13:11:48,799 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-10-11 13:11:48,799 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-11 13:11:48,799 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 13:11:48,800 INFO L82 PathProgramCache]: Analyzing trace with hash -164095139, now seen corresponding path program 4 times [2020-10-11 13:11:48,800 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 13:11:48,800 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1825396930] [2020-10-11 13:11:48,801 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 13:11:48,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 13:11:48,986 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-11 13:11:48,987 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1825396930] [2020-10-11 13:11:48,987 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 13:11:48,987 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-10-11 13:11:48,987 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [475904288] [2020-10-11 13:11:48,988 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-10-11 13:11:48,988 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 13:11:48,989 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-10-11 13:11:48,990 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2020-10-11 13:11:48,990 INFO L87 Difference]: Start difference. First operand 4129 states and 16616 transitions. Second operand 10 states. [2020-10-11 13:11:49,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 13:11:49,505 INFO L93 Difference]: Finished difference Result 6639 states and 26238 transitions. [2020-10-11 13:11:49,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-11 13:11:49,506 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 18 [2020-10-11 13:11:49,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 13:11:49,528 INFO L225 Difference]: With dead ends: 6639 [2020-10-11 13:11:49,528 INFO L226 Difference]: Without dead ends: 6491 [2020-10-11 13:11:49,530 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2020-10-11 13:11:49,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6491 states. [2020-10-11 13:11:49,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6491 to 3873. [2020-10-11 13:11:49,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3873 states. [2020-10-11 13:11:49,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3873 states to 3873 states and 15364 transitions. [2020-10-11 13:11:49,686 INFO L78 Accepts]: Start accepts. Automaton has 3873 states and 15364 transitions. Word has length 18 [2020-10-11 13:11:49,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 13:11:49,689 INFO L481 AbstractCegarLoop]: Abstraction has 3873 states and 15364 transitions. [2020-10-11 13:11:49,689 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-10-11 13:11:49,689 INFO L276 IsEmpty]: Start isEmpty. Operand 3873 states and 15364 transitions. [2020-10-11 13:11:49,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-10-11 13:11:49,691 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 13:11:49,691 INFO L421 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 13:11:49,691 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-10-11 13:11:49,691 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-11 13:11:49,691 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 13:11:49,692 INFO L82 PathProgramCache]: Analyzing trace with hash 2041625758, now seen corresponding path program 1 times [2020-10-11 13:11:49,692 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 13:11:49,692 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1544352714] [2020-10-11 13:11:49,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 13:11:49,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 13:11:49,776 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-11 13:11:49,776 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1544352714] [2020-10-11 13:11:49,777 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 13:11:49,777 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-11 13:11:49,777 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [492536498] [2020-10-11 13:11:49,778 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-11 13:11:49,778 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 13:11:49,778 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-11 13:11:49,778 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2020-10-11 13:11:49,778 INFO L87 Difference]: Start difference. First operand 3873 states and 15364 transitions. Second operand 7 states. [2020-10-11 13:11:49,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 13:11:49,908 INFO L93 Difference]: Finished difference Result 4264 states and 16502 transitions. [2020-10-11 13:11:49,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-11 13:11:49,909 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 19 [2020-10-11 13:11:49,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 13:11:49,921 INFO L225 Difference]: With dead ends: 4264 [2020-10-11 13:11:49,921 INFO L226 Difference]: Without dead ends: 4264 [2020-10-11 13:11:49,921 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2020-10-11 13:11:49,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4264 states. [2020-10-11 13:11:50,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4264 to 3841. [2020-10-11 13:11:50,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3841 states. [2020-10-11 13:11:50,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3841 states to 3841 states and 15250 transitions. [2020-10-11 13:11:50,025 INFO L78 Accepts]: Start accepts. Automaton has 3841 states and 15250 transitions. Word has length 19 [2020-10-11 13:11:50,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 13:11:50,026 INFO L481 AbstractCegarLoop]: Abstraction has 3841 states and 15250 transitions. [2020-10-11 13:11:50,026 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-11 13:11:50,026 INFO L276 IsEmpty]: Start isEmpty. Operand 3841 states and 15250 transitions. [2020-10-11 13:11:50,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-10-11 13:11:50,028 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 13:11:50,028 INFO L421 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 13:11:50,028 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-10-11 13:11:50,028 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-11 13:11:50,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 13:11:50,029 INFO L82 PathProgramCache]: Analyzing trace with hash -1134272272, now seen corresponding path program 1 times [2020-10-11 13:11:50,029 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 13:11:50,029 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1782568444] [2020-10-11 13:11:50,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 13:11:50,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 13:11:50,124 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-11 13:11:50,125 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1782568444] [2020-10-11 13:11:50,125 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 13:11:50,125 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-10-11 13:11:50,125 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [792986382] [2020-10-11 13:11:50,126 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-11 13:11:50,126 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 13:11:50,126 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-11 13:11:50,126 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2020-10-11 13:11:50,126 INFO L87 Difference]: Start difference. First operand 3841 states and 15250 transitions. Second operand 9 states. [2020-10-11 13:11:50,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 13:11:50,466 INFO L93 Difference]: Finished difference Result 5256 states and 20905 transitions. [2020-10-11 13:11:50,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-11 13:11:50,466 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 20 [2020-10-11 13:11:50,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 13:11:50,478 INFO L225 Difference]: With dead ends: 5256 [2020-10-11 13:11:50,478 INFO L226 Difference]: Without dead ends: 5210 [2020-10-11 13:11:50,478 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=106, Unknown=0, NotChecked=0, Total=156 [2020-10-11 13:11:50,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5210 states. [2020-10-11 13:11:50,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5210 to 3994. [2020-10-11 13:11:50,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3994 states. [2020-10-11 13:11:50,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3994 states to 3994 states and 15976 transitions. [2020-10-11 13:11:50,593 INFO L78 Accepts]: Start accepts. Automaton has 3994 states and 15976 transitions. Word has length 20 [2020-10-11 13:11:50,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 13:11:50,594 INFO L481 AbstractCegarLoop]: Abstraction has 3994 states and 15976 transitions. [2020-10-11 13:11:50,594 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-11 13:11:50,594 INFO L276 IsEmpty]: Start isEmpty. Operand 3994 states and 15976 transitions. [2020-10-11 13:11:50,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-10-11 13:11:50,596 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 13:11:50,596 INFO L421 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 13:11:50,596 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-10-11 13:11:50,597 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-11 13:11:50,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 13:11:50,597 INFO L82 PathProgramCache]: Analyzing trace with hash 1058647793, now seen corresponding path program 1 times [2020-10-11 13:11:50,597 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 13:11:50,597 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [63943259] [2020-10-11 13:11:50,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 13:11:50,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 13:11:50,694 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-11 13:11:50,695 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [63943259] [2020-10-11 13:11:50,695 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 13:11:50,695 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-10-11 13:11:50,695 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2137982094] [2020-10-11 13:11:50,696 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-11 13:11:50,696 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 13:11:50,696 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-11 13:11:50,697 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2020-10-11 13:11:50,697 INFO L87 Difference]: Start difference. First operand 3994 states and 15976 transitions. Second operand 9 states. [2020-10-11 13:11:51,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 13:11:51,055 INFO L93 Difference]: Finished difference Result 5328 states and 21486 transitions. [2020-10-11 13:11:51,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-11 13:11:51,056 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 20 [2020-10-11 13:11:51,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 13:11:51,068 INFO L225 Difference]: With dead ends: 5328 [2020-10-11 13:11:51,068 INFO L226 Difference]: Without dead ends: 5282 [2020-10-11 13:11:51,069 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=127, Unknown=0, NotChecked=0, Total=182 [2020-10-11 13:11:51,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5282 states. [2020-10-11 13:11:51,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5282 to 3840. [2020-10-11 13:11:51,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3840 states. [2020-10-11 13:11:51,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3840 states to 3840 states and 15247 transitions. [2020-10-11 13:11:51,177 INFO L78 Accepts]: Start accepts. Automaton has 3840 states and 15247 transitions. Word has length 20 [2020-10-11 13:11:51,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 13:11:51,178 INFO L481 AbstractCegarLoop]: Abstraction has 3840 states and 15247 transitions. [2020-10-11 13:11:51,178 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-11 13:11:51,178 INFO L276 IsEmpty]: Start isEmpty. Operand 3840 states and 15247 transitions. [2020-10-11 13:11:51,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-10-11 13:11:51,181 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 13:11:51,181 INFO L421 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 13:11:51,181 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-10-11 13:11:51,181 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-11 13:11:51,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 13:11:51,181 INFO L82 PathProgramCache]: Analyzing trace with hash 2045819536, now seen corresponding path program 2 times [2020-10-11 13:11:51,182 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 13:11:51,182 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [348291623] [2020-10-11 13:11:51,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 13:11:51,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 13:11:51,320 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-11 13:11:51,321 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [348291623] [2020-10-11 13:11:51,321 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 13:11:51,321 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-10-11 13:11:51,321 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2030108780] [2020-10-11 13:11:51,322 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-10-11 13:11:51,322 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 13:11:51,322 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-10-11 13:11:51,322 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2020-10-11 13:11:51,323 INFO L87 Difference]: Start difference. First operand 3840 states and 15247 transitions. Second operand 10 states. [2020-10-11 13:11:51,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 13:11:51,730 INFO L93 Difference]: Finished difference Result 5284 states and 20663 transitions. [2020-10-11 13:11:51,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-10-11 13:11:51,731 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 20 [2020-10-11 13:11:51,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 13:11:51,742 INFO L225 Difference]: With dead ends: 5284 [2020-10-11 13:11:51,742 INFO L226 Difference]: Without dead ends: 5192 [2020-10-11 13:11:51,743 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=69, Invalid=171, Unknown=0, NotChecked=0, Total=240 [2020-10-11 13:11:51,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5192 states. [2020-10-11 13:11:51,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5192 to 3734. [2020-10-11 13:11:51,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3734 states. [2020-10-11 13:11:51,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3734 states to 3734 states and 14462 transitions. [2020-10-11 13:11:51,851 INFO L78 Accepts]: Start accepts. Automaton has 3734 states and 14462 transitions. Word has length 20 [2020-10-11 13:11:51,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 13:11:51,851 INFO L481 AbstractCegarLoop]: Abstraction has 3734 states and 14462 transitions. [2020-10-11 13:11:51,851 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-10-11 13:11:51,852 INFO L276 IsEmpty]: Start isEmpty. Operand 3734 states and 14462 transitions. [2020-10-11 13:11:51,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-10-11 13:11:51,854 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 13:11:51,854 INFO L421 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 13:11:51,854 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-10-11 13:11:51,854 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-11 13:11:51,854 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 13:11:51,854 INFO L82 PathProgramCache]: Analyzing trace with hash 258643217, now seen corresponding path program 2 times [2020-10-11 13:11:51,855 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 13:11:51,855 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1976157753] [2020-10-11 13:11:51,855 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 13:11:51,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 13:11:52,009 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-11 13:11:52,010 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1976157753] [2020-10-11 13:11:52,010 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 13:11:52,010 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-10-11 13:11:52,010 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1136425556] [2020-10-11 13:11:52,011 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-10-11 13:11:52,011 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 13:11:52,011 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-10-11 13:11:52,012 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2020-10-11 13:11:52,012 INFO L87 Difference]: Start difference. First operand 3734 states and 14462 transitions. Second operand 10 states. [2020-10-11 13:11:52,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 13:11:52,466 INFO L93 Difference]: Finished difference Result 6322 states and 24832 transitions. [2020-10-11 13:11:52,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-10-11 13:11:52,466 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 20 [2020-10-11 13:11:52,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 13:11:52,543 INFO L225 Difference]: With dead ends: 6322 [2020-10-11 13:11:52,543 INFO L226 Difference]: Without dead ends: 6276 [2020-10-11 13:11:52,544 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=88, Invalid=184, Unknown=0, NotChecked=0, Total=272 [2020-10-11 13:11:52,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6276 states. [2020-10-11 13:11:52,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6276 to 3733. [2020-10-11 13:11:52,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3733 states. [2020-10-11 13:11:52,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3733 states to 3733 states and 14461 transitions. [2020-10-11 13:11:52,654 INFO L78 Accepts]: Start accepts. Automaton has 3733 states and 14461 transitions. Word has length 20 [2020-10-11 13:11:52,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 13:11:52,655 INFO L481 AbstractCegarLoop]: Abstraction has 3733 states and 14461 transitions. [2020-10-11 13:11:52,655 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-10-11 13:11:52,655 INFO L276 IsEmpty]: Start isEmpty. Operand 3733 states and 14461 transitions. [2020-10-11 13:11:52,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-10-11 13:11:52,658 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 13:11:52,658 INFO L421 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 13:11:52,658 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-10-11 13:11:52,658 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-11 13:11:52,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 13:11:52,659 INFO L82 PathProgramCache]: Analyzing trace with hash 1348955075, now seen corresponding path program 3 times [2020-10-11 13:11:52,659 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 13:11:52,659 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [350472146] [2020-10-11 13:11:52,659 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 13:11:52,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 13:11:52,875 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-11 13:11:52,875 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [350472146] [2020-10-11 13:11:52,876 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 13:11:52,876 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-10-11 13:11:52,876 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1393434530] [2020-10-11 13:11:52,877 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-10-11 13:11:52,878 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 13:11:52,878 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-10-11 13:11:52,878 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2020-10-11 13:11:52,878 INFO L87 Difference]: Start difference. First operand 3733 states and 14461 transitions. Second operand 11 states. [2020-10-11 13:11:53,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 13:11:53,614 INFO L93 Difference]: Finished difference Result 4743 states and 18376 transitions. [2020-10-11 13:11:53,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-10-11 13:11:53,614 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 20 [2020-10-11 13:11:53,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 13:11:53,626 INFO L225 Difference]: With dead ends: 4743 [2020-10-11 13:11:53,627 INFO L226 Difference]: Without dead ends: 4709 [2020-10-11 13:11:53,628 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=100, Invalid=242, Unknown=0, NotChecked=0, Total=342 [2020-10-11 13:11:53,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4709 states. [2020-10-11 13:11:53,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4709 to 3733. [2020-10-11 13:11:53,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3733 states. [2020-10-11 13:11:53,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3733 states to 3733 states and 14461 transitions. [2020-10-11 13:11:53,718 INFO L78 Accepts]: Start accepts. Automaton has 3733 states and 14461 transitions. Word has length 20 [2020-10-11 13:11:53,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 13:11:53,718 INFO L481 AbstractCegarLoop]: Abstraction has 3733 states and 14461 transitions. [2020-10-11 13:11:53,718 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-10-11 13:11:53,718 INFO L276 IsEmpty]: Start isEmpty. Operand 3733 states and 14461 transitions. [2020-10-11 13:11:53,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-10-11 13:11:53,720 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 13:11:53,721 INFO L421 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 13:11:53,721 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-10-11 13:11:53,721 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-11 13:11:53,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 13:11:53,721 INFO L82 PathProgramCache]: Analyzing trace with hash 1331080475, now seen corresponding path program 4 times [2020-10-11 13:11:53,721 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 13:11:53,722 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [713000564] [2020-10-11 13:11:53,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 13:11:53,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 13:11:53,839 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-11 13:11:53,839 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [713000564] [2020-10-11 13:11:53,839 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 13:11:53,840 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-10-11 13:11:53,840 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [279760987] [2020-10-11 13:11:53,840 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-10-11 13:11:53,840 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 13:11:53,841 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-10-11 13:11:53,841 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2020-10-11 13:11:53,841 INFO L87 Difference]: Start difference. First operand 3733 states and 14461 transitions. Second operand 10 states. [2020-10-11 13:11:54,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 13:11:54,193 INFO L93 Difference]: Finished difference Result 4987 states and 19433 transitions. [2020-10-11 13:11:54,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-11 13:11:54,194 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 20 [2020-10-11 13:11:54,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 13:11:54,207 INFO L225 Difference]: With dead ends: 4987 [2020-10-11 13:11:54,207 INFO L226 Difference]: Without dead ends: 4941 [2020-10-11 13:11:54,208 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=117, Unknown=0, NotChecked=0, Total=182 [2020-10-11 13:11:54,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4941 states. [2020-10-11 13:11:54,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4941 to 3727. [2020-10-11 13:11:54,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3727 states. [2020-10-11 13:11:54,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3727 states to 3727 states and 14449 transitions. [2020-10-11 13:11:54,305 INFO L78 Accepts]: Start accepts. Automaton has 3727 states and 14449 transitions. Word has length 20 [2020-10-11 13:11:54,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 13:11:54,306 INFO L481 AbstractCegarLoop]: Abstraction has 3727 states and 14449 transitions. [2020-10-11 13:11:54,306 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-10-11 13:11:54,306 INFO L276 IsEmpty]: Start isEmpty. Operand 3727 states and 14449 transitions. [2020-10-11 13:11:54,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-10-11 13:11:54,309 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 13:11:54,309 INFO L421 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 13:11:54,309 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-10-11 13:11:54,309 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-11 13:11:54,310 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 13:11:54,310 INFO L82 PathProgramCache]: Analyzing trace with hash 657525156, now seen corresponding path program 3 times [2020-10-11 13:11:54,310 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 13:11:54,310 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1989136237] [2020-10-11 13:11:54,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 13:11:54,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 13:11:54,369 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-11 13:11:54,369 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1989136237] [2020-10-11 13:11:54,369 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 13:11:54,370 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-11 13:11:54,370 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1379262533] [2020-10-11 13:11:54,370 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-11 13:11:54,370 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 13:11:54,371 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-11 13:11:54,371 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2020-10-11 13:11:54,372 INFO L87 Difference]: Start difference. First operand 3727 states and 14449 transitions. Second operand 7 states. [2020-10-11 13:11:54,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 13:11:54,580 INFO L93 Difference]: Finished difference Result 5325 states and 20419 transitions. [2020-10-11 13:11:54,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-11 13:11:54,581 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 20 [2020-10-11 13:11:54,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 13:11:54,656 INFO L225 Difference]: With dead ends: 5325 [2020-10-11 13:11:54,656 INFO L226 Difference]: Without dead ends: 5279 [2020-10-11 13:11:54,656 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2020-10-11 13:11:54,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5279 states. [2020-10-11 13:11:54,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5279 to 2948. [2020-10-11 13:11:54,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2948 states. [2020-10-11 13:11:54,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2948 states to 2948 states and 10967 transitions. [2020-10-11 13:11:54,735 INFO L78 Accepts]: Start accepts. Automaton has 2948 states and 10967 transitions. Word has length 20 [2020-10-11 13:11:54,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 13:11:54,735 INFO L481 AbstractCegarLoop]: Abstraction has 2948 states and 10967 transitions. [2020-10-11 13:11:54,735 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-11 13:11:54,735 INFO L276 IsEmpty]: Start isEmpty. Operand 2948 states and 10967 transitions. [2020-10-11 13:11:54,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-10-11 13:11:54,737 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 13:11:54,737 INFO L421 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 13:11:54,738 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-10-11 13:11:54,738 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-11 13:11:54,738 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 13:11:54,738 INFO L82 PathProgramCache]: Analyzing trace with hash -1935934284, now seen corresponding path program 1 times [2020-10-11 13:11:54,738 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 13:11:54,739 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [174674771] [2020-10-11 13:11:54,739 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 13:11:54,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 13:11:54,780 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-11 13:11:54,780 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [174674771] [2020-10-11 13:11:54,780 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 13:11:54,781 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-11 13:11:54,781 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [290919185] [2020-10-11 13:11:54,781 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-11 13:11:54,781 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 13:11:54,781 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-11 13:11:54,782 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-10-11 13:11:54,782 INFO L87 Difference]: Start difference. First operand 2948 states and 10967 transitions. Second operand 6 states. [2020-10-11 13:11:54,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 13:11:54,906 INFO L93 Difference]: Finished difference Result 3727 states and 13634 transitions. [2020-10-11 13:11:54,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-11 13:11:54,906 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 21 [2020-10-11 13:11:54,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 13:11:54,914 INFO L225 Difference]: With dead ends: 3727 [2020-10-11 13:11:54,914 INFO L226 Difference]: Without dead ends: 3652 [2020-10-11 13:11:54,915 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2020-10-11 13:11:54,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3652 states. [2020-10-11 13:11:54,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3652 to 3270. [2020-10-11 13:11:54,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3270 states. [2020-10-11 13:11:54,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3270 states to 3270 states and 12154 transitions. [2020-10-11 13:11:54,983 INFO L78 Accepts]: Start accepts. Automaton has 3270 states and 12154 transitions. Word has length 21 [2020-10-11 13:11:54,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 13:11:54,984 INFO L481 AbstractCegarLoop]: Abstraction has 3270 states and 12154 transitions. [2020-10-11 13:11:54,984 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-11 13:11:54,984 INFO L276 IsEmpty]: Start isEmpty. Operand 3270 states and 12154 transitions. [2020-10-11 13:11:54,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-10-11 13:11:54,986 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 13:11:54,987 INFO L421 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 13:11:54,987 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2020-10-11 13:11:54,987 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-11 13:11:54,987 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 13:11:54,987 INFO L82 PathProgramCache]: Analyzing trace with hash 558788524, now seen corresponding path program 1 times [2020-10-11 13:11:54,987 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 13:11:54,988 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [903041336] [2020-10-11 13:11:54,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 13:11:55,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 13:11:55,220 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-11 13:11:55,221 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [903041336] [2020-10-11 13:11:55,221 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 13:11:55,221 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-10-11 13:11:55,221 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [234611165] [2020-10-11 13:11:55,222 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-10-11 13:11:55,222 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 13:11:55,222 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-10-11 13:11:55,222 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2020-10-11 13:11:55,222 INFO L87 Difference]: Start difference. First operand 3270 states and 12154 transitions. Second operand 12 states. [2020-10-11 13:11:55,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 13:11:55,935 INFO L93 Difference]: Finished difference Result 4405 states and 16600 transitions. [2020-10-11 13:11:55,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-10-11 13:11:55,935 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 21 [2020-10-11 13:11:55,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 13:11:55,945 INFO L225 Difference]: With dead ends: 4405 [2020-10-11 13:11:55,945 INFO L226 Difference]: Without dead ends: 4371 [2020-10-11 13:11:55,946 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=98, Invalid=244, Unknown=0, NotChecked=0, Total=342 [2020-10-11 13:11:55,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4371 states. [2020-10-11 13:11:55,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4371 to 3270. [2020-10-11 13:11:55,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3270 states. [2020-10-11 13:11:55,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3270 states to 3270 states and 12154 transitions. [2020-10-11 13:11:55,997 INFO L78 Accepts]: Start accepts. Automaton has 3270 states and 12154 transitions. Word has length 21 [2020-10-11 13:11:55,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 13:11:55,997 INFO L481 AbstractCegarLoop]: Abstraction has 3270 states and 12154 transitions. [2020-10-11 13:11:55,997 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-10-11 13:11:55,997 INFO L276 IsEmpty]: Start isEmpty. Operand 3270 states and 12154 transitions. [2020-10-11 13:11:55,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-10-11 13:11:55,999 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 13:11:55,999 INFO L421 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 13:11:55,999 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2020-10-11 13:11:55,999 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-11 13:11:55,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 13:11:56,000 INFO L82 PathProgramCache]: Analyzing trace with hash 540913924, now seen corresponding path program 2 times [2020-10-11 13:11:56,000 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 13:11:56,000 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [612538555] [2020-10-11 13:11:56,000 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 13:11:56,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 13:11:56,157 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-11 13:11:56,157 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [612538555] [2020-10-11 13:11:56,158 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 13:11:56,158 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-10-11 13:11:56,158 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [974751835] [2020-10-11 13:11:56,158 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-10-11 13:11:56,159 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 13:11:56,159 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-10-11 13:11:56,159 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2020-10-11 13:11:56,159 INFO L87 Difference]: Start difference. First operand 3270 states and 12154 transitions. Second operand 11 states. [2020-10-11 13:11:56,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 13:11:56,579 INFO L93 Difference]: Finished difference Result 4064 states and 15268 transitions. [2020-10-11 13:11:56,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-10-11 13:11:56,581 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 21 [2020-10-11 13:11:56,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 13:11:56,589 INFO L225 Difference]: With dead ends: 4064 [2020-10-11 13:11:56,589 INFO L226 Difference]: Without dead ends: 3972 [2020-10-11 13:11:56,590 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=81, Invalid=191, Unknown=0, NotChecked=0, Total=272 [2020-10-11 13:11:56,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3972 states. [2020-10-11 13:11:56,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3972 to 2499. [2020-10-11 13:11:56,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2499 states. [2020-10-11 13:11:56,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2499 states to 2499 states and 9076 transitions. [2020-10-11 13:11:56,697 INFO L78 Accepts]: Start accepts. Automaton has 2499 states and 9076 transitions. Word has length 21 [2020-10-11 13:11:56,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 13:11:56,697 INFO L481 AbstractCegarLoop]: Abstraction has 2499 states and 9076 transitions. [2020-10-11 13:11:56,697 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-10-11 13:11:56,697 INFO L276 IsEmpty]: Start isEmpty. Operand 2499 states and 9076 transitions. [2020-10-11 13:11:56,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-10-11 13:11:56,699 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 13:11:56,699 INFO L421 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 13:11:56,700 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2020-10-11 13:11:56,700 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-11 13:11:56,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 13:11:56,700 INFO L82 PathProgramCache]: Analyzing trace with hash 1608946948, now seen corresponding path program 2 times [2020-10-11 13:11:56,700 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 13:11:56,701 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1001723250] [2020-10-11 13:11:56,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 13:11:56,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 13:11:56,755 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-11 13:11:56,755 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1001723250] [2020-10-11 13:11:56,755 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 13:11:56,756 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-11 13:11:56,756 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1754652759] [2020-10-11 13:11:56,756 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-11 13:11:56,756 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 13:11:56,756 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-11 13:11:56,757 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-10-11 13:11:56,757 INFO L87 Difference]: Start difference. First operand 2499 states and 9076 transitions. Second operand 6 states. [2020-10-11 13:11:56,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 13:11:56,852 INFO L93 Difference]: Finished difference Result 2874 states and 10132 transitions. [2020-10-11 13:11:56,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-11 13:11:56,853 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 21 [2020-10-11 13:11:56,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 13:11:56,859 INFO L225 Difference]: With dead ends: 2874 [2020-10-11 13:11:56,859 INFO L226 Difference]: Without dead ends: 2650 [2020-10-11 13:11:56,859 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2020-10-11 13:11:56,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2650 states. [2020-10-11 13:11:56,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2650 to 2211. [2020-10-11 13:11:56,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2211 states. [2020-10-11 13:11:56,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2211 states to 2211 states and 7918 transitions. [2020-10-11 13:11:56,893 INFO L78 Accepts]: Start accepts. Automaton has 2211 states and 7918 transitions. Word has length 21 [2020-10-11 13:11:56,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 13:11:56,893 INFO L481 AbstractCegarLoop]: Abstraction has 2211 states and 7918 transitions. [2020-10-11 13:11:56,893 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-11 13:11:56,894 INFO L276 IsEmpty]: Start isEmpty. Operand 2211 states and 7918 transitions. [2020-10-11 13:11:56,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-10-11 13:11:56,896 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 13:11:56,896 INFO L421 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 13:11:56,896 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2020-10-11 13:11:56,896 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-11 13:11:56,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 13:11:56,896 INFO L82 PathProgramCache]: Analyzing trace with hash 1396456954, now seen corresponding path program 1 times [2020-10-11 13:11:56,896 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 13:11:56,897 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [66126348] [2020-10-11 13:11:56,897 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 13:11:56,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 13:11:56,979 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-11 13:11:56,979 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [66126348] [2020-10-11 13:11:56,980 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 13:11:56,980 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-11 13:11:56,980 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1641348020] [2020-10-11 13:11:56,980 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-11 13:11:56,980 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 13:11:56,981 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-11 13:11:56,981 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2020-10-11 13:11:56,981 INFO L87 Difference]: Start difference. First operand 2211 states and 7918 transitions. Second operand 7 states. [2020-10-11 13:11:57,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 13:11:57,197 INFO L93 Difference]: Finished difference Result 2930 states and 10378 transitions. [2020-10-11 13:11:57,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-10-11 13:11:57,198 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 22 [2020-10-11 13:11:57,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 13:11:57,205 INFO L225 Difference]: With dead ends: 2930 [2020-10-11 13:11:57,205 INFO L226 Difference]: Without dead ends: 2870 [2020-10-11 13:11:57,205 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2020-10-11 13:11:57,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2870 states. [2020-10-11 13:11:57,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2870 to 2208. [2020-10-11 13:11:57,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2208 states. [2020-10-11 13:11:57,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2208 states to 2208 states and 7913 transitions. [2020-10-11 13:11:57,239 INFO L78 Accepts]: Start accepts. Automaton has 2208 states and 7913 transitions. Word has length 22 [2020-10-11 13:11:57,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 13:11:57,239 INFO L481 AbstractCegarLoop]: Abstraction has 2208 states and 7913 transitions. [2020-10-11 13:11:57,239 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-11 13:11:57,239 INFO L276 IsEmpty]: Start isEmpty. Operand 2208 states and 7913 transitions. [2020-10-11 13:11:57,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-10-11 13:11:57,241 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 13:11:57,241 INFO L421 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 13:11:57,241 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2020-10-11 13:11:57,241 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-11 13:11:57,241 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 13:11:57,242 INFO L82 PathProgramCache]: Analyzing trace with hash 644682778, now seen corresponding path program 2 times [2020-10-11 13:11:57,242 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 13:11:57,242 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1265610863] [2020-10-11 13:11:57,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 13:11:57,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 13:11:57,339 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-11 13:11:57,340 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1265610863] [2020-10-11 13:11:57,340 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 13:11:57,340 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-11 13:11:57,341 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [90871376] [2020-10-11 13:11:57,341 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-11 13:11:57,341 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 13:11:57,341 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-11 13:11:57,341 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2020-10-11 13:11:57,341 INFO L87 Difference]: Start difference. First operand 2208 states and 7913 transitions. Second operand 8 states. [2020-10-11 13:11:57,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 13:11:57,577 INFO L93 Difference]: Finished difference Result 2920 states and 10358 transitions. [2020-10-11 13:11:57,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-10-11 13:11:57,578 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 22 [2020-10-11 13:11:57,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 13:11:57,583 INFO L225 Difference]: With dead ends: 2920 [2020-10-11 13:11:57,583 INFO L226 Difference]: Without dead ends: 2860 [2020-10-11 13:11:57,584 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=109, Unknown=0, NotChecked=0, Total=156 [2020-10-11 13:11:57,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2860 states. [2020-10-11 13:11:57,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2860 to 2202. [2020-10-11 13:11:57,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2202 states. [2020-10-11 13:11:57,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2202 states to 2202 states and 7899 transitions. [2020-10-11 13:11:57,614 INFO L78 Accepts]: Start accepts. Automaton has 2202 states and 7899 transitions. Word has length 22 [2020-10-11 13:11:57,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 13:11:57,614 INFO L481 AbstractCegarLoop]: Abstraction has 2202 states and 7899 transitions. [2020-10-11 13:11:57,615 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-11 13:11:57,615 INFO L276 IsEmpty]: Start isEmpty. Operand 2202 states and 7899 transitions. [2020-10-11 13:11:57,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-10-11 13:11:57,617 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 13:11:57,617 INFO L421 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 13:11:57,617 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2020-10-11 13:11:57,617 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-11 13:11:57,617 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 13:11:57,617 INFO L82 PathProgramCache]: Analyzing trace with hash -787433364, now seen corresponding path program 3 times [2020-10-11 13:11:57,617 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 13:11:57,618 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [933165836] [2020-10-11 13:11:57,618 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 13:11:57,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 13:11:57,718 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-11 13:11:57,718 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [933165836] [2020-10-11 13:11:57,718 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 13:11:57,718 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-10-11 13:11:57,719 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1829130216] [2020-10-11 13:11:57,719 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-11 13:11:57,719 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 13:11:57,719 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-11 13:11:57,720 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2020-10-11 13:11:57,720 INFO L87 Difference]: Start difference. First operand 2202 states and 7899 transitions. Second operand 9 states. [2020-10-11 13:11:57,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 13:11:57,879 INFO L93 Difference]: Finished difference Result 2905 states and 10327 transitions. [2020-10-11 13:11:57,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-11 13:11:57,880 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-10-11 13:11:57,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 13:11:57,886 INFO L225 Difference]: With dead ends: 2905 [2020-10-11 13:11:57,887 INFO L226 Difference]: Without dead ends: 2845 [2020-10-11 13:11:57,887 INFO L673 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-11 13:11:57,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2845 states. [2020-10-11 13:11:57,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2845 to 2202. [2020-10-11 13:11:57,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2202 states. [2020-10-11 13:11:57,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2202 states to 2202 states and 7899 transitions. [2020-10-11 13:11:57,918 INFO L78 Accepts]: Start accepts. Automaton has 2202 states and 7899 transitions. Word has length 22 [2020-10-11 13:11:57,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 13:11:57,919 INFO L481 AbstractCegarLoop]: Abstraction has 2202 states and 7899 transitions. [2020-10-11 13:11:57,919 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-11 13:11:57,919 INFO L276 IsEmpty]: Start isEmpty. Operand 2202 states and 7899 transitions. [2020-10-11 13:11:57,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-10-11 13:11:57,921 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 13:11:57,921 INFO L421 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 13:11:57,921 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2020-10-11 13:11:57,922 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-11 13:11:57,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 13:11:57,922 INFO L82 PathProgramCache]: Analyzing trace with hash -270857424, now seen corresponding path program 4 times [2020-10-11 13:11:57,922 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 13:11:57,922 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1150656352] [2020-10-11 13:11:57,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 13:11:57,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 13:11:58,109 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-11 13:11:58,109 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1150656352] [2020-10-11 13:11:58,109 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 13:11:58,109 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-10-11 13:11:58,109 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [446805683] [2020-10-11 13:11:58,110 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-10-11 13:11:58,110 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 13:11:58,110 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-10-11 13:11:58,110 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2020-10-11 13:11:58,110 INFO L87 Difference]: Start difference. First operand 2202 states and 7899 transitions. Second operand 11 states. [2020-10-11 13:11:58,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 13:11:58,459 INFO L93 Difference]: Finished difference Result 3120 states and 11113 transitions. [2020-10-11 13:11:58,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-11 13:11:58,459 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 22 [2020-10-11 13:11:58,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 13:11:58,466 INFO L225 Difference]: With dead ends: 3120 [2020-10-11 13:11:58,466 INFO L226 Difference]: Without dead ends: 3060 [2020-10-11 13:11:58,467 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=65, Invalid=145, Unknown=0, NotChecked=0, Total=210 [2020-10-11 13:11:58,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3060 states. [2020-10-11 13:11:58,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3060 to 2202. [2020-10-11 13:11:58,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2202 states. [2020-10-11 13:11:58,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2202 states to 2202 states and 7896 transitions. [2020-10-11 13:11:58,503 INFO L78 Accepts]: Start accepts. Automaton has 2202 states and 7896 transitions. Word has length 22 [2020-10-11 13:11:58,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 13:11:58,504 INFO L481 AbstractCegarLoop]: Abstraction has 2202 states and 7896 transitions. [2020-10-11 13:11:58,504 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-10-11 13:11:58,504 INFO L276 IsEmpty]: Start isEmpty. Operand 2202 states and 7896 transitions. [2020-10-11 13:11:58,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-10-11 13:11:58,505 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 13:11:58,505 INFO L421 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 13:11:58,505 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2020-10-11 13:11:58,505 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-11 13:11:58,506 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 13:11:58,506 INFO L82 PathProgramCache]: Analyzing trace with hash -503603988, now seen corresponding path program 5 times [2020-10-11 13:11:58,506 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 13:11:58,506 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1770257987] [2020-10-11 13:11:58,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 13:11:58,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 13:11:58,607 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-11 13:11:58,607 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1770257987] [2020-10-11 13:11:58,607 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 13:11:58,608 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-10-11 13:11:58,608 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [365844935] [2020-10-11 13:11:58,608 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-11 13:11:58,608 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 13:11:58,608 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-11 13:11:58,609 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2020-10-11 13:11:58,609 INFO L87 Difference]: Start difference. First operand 2202 states and 7896 transitions. Second operand 9 states. [2020-10-11 13:11:58,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 13:11:58,914 INFO L93 Difference]: Finished difference Result 3737 states and 13299 transitions. [2020-10-11 13:11:58,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-11 13:11:58,915 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-10-11 13:11:58,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 13:11:58,923 INFO L225 Difference]: With dead ends: 3737 [2020-10-11 13:11:58,923 INFO L226 Difference]: Without dead ends: 3677 [2020-10-11 13:11:58,923 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2020-10-11 13:11:58,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3677 states. [2020-10-11 13:11:58,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3677 to 2170. [2020-10-11 13:11:58,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2170 states. [2020-10-11 13:11:58,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2170 states to 2170 states and 7789 transitions. [2020-10-11 13:11:58,966 INFO L78 Accepts]: Start accepts. Automaton has 2170 states and 7789 transitions. Word has length 22 [2020-10-11 13:11:58,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 13:11:58,966 INFO L481 AbstractCegarLoop]: Abstraction has 2170 states and 7789 transitions. [2020-10-11 13:11:58,966 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-11 13:11:58,966 INFO L276 IsEmpty]: Start isEmpty. Operand 2170 states and 7789 transitions. [2020-10-11 13:11:58,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-10-11 13:11:58,968 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 13:11:58,968 INFO L421 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 13:11:58,969 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2020-10-11 13:11:58,969 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-11 13:11:58,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 13:11:58,969 INFO L82 PathProgramCache]: Analyzing trace with hash -1357008819, now seen corresponding path program 1 times [2020-10-11 13:11:58,969 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 13:11:58,969 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1043347400] [2020-10-11 13:11:58,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 13:11:58,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 13:11:59,151 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-11 13:11:59,152 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1043347400] [2020-10-11 13:11:59,152 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 13:11:59,154 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-10-11 13:11:59,154 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [650387246] [2020-10-11 13:11:59,154 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-10-11 13:11:59,155 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 13:11:59,155 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-10-11 13:11:59,155 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2020-10-11 13:11:59,155 INFO L87 Difference]: Start difference. First operand 2170 states and 7789 transitions. Second operand 10 states. [2020-10-11 13:11:59,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 13:11:59,598 INFO L93 Difference]: Finished difference Result 3595 states and 12502 transitions. [2020-10-11 13:11:59,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-10-11 13:11:59,598 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 23 [2020-10-11 13:11:59,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 13:11:59,605 INFO L225 Difference]: With dead ends: 3595 [2020-10-11 13:11:59,605 INFO L226 Difference]: Without dead ends: 3478 [2020-10-11 13:11:59,606 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=65, Invalid=145, Unknown=0, NotChecked=0, Total=210 [2020-10-11 13:11:59,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3478 states. [2020-10-11 13:11:59,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3478 to 1979. [2020-10-11 13:11:59,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1979 states. [2020-10-11 13:11:59,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1979 states to 1979 states and 7017 transitions. [2020-10-11 13:11:59,637 INFO L78 Accepts]: Start accepts. Automaton has 1979 states and 7017 transitions. Word has length 23 [2020-10-11 13:11:59,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 13:11:59,637 INFO L481 AbstractCegarLoop]: Abstraction has 1979 states and 7017 transitions. [2020-10-11 13:11:59,637 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-10-11 13:11:59,638 INFO L276 IsEmpty]: Start isEmpty. Operand 1979 states and 7017 transitions. [2020-10-11 13:11:59,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-10-11 13:11:59,639 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 13:11:59,639 INFO L421 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 13:11:59,639 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2020-10-11 13:11:59,639 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-11 13:11:59,639 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 13:11:59,640 INFO L82 PathProgramCache]: Analyzing trace with hash -1309010247, now seen corresponding path program 1 times [2020-10-11 13:11:59,640 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 13:11:59,640 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1484539960] [2020-10-11 13:11:59,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 13:11:59,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 13:11:59,687 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-11 13:11:59,687 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1484539960] [2020-10-11 13:11:59,688 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 13:11:59,688 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-11 13:11:59,688 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [341758049] [2020-10-11 13:11:59,688 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-11 13:11:59,688 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 13:11:59,688 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-11 13:11:59,689 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-10-11 13:11:59,689 INFO L87 Difference]: Start difference. First operand 1979 states and 7017 transitions. Second operand 6 states. [2020-10-11 13:11:59,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 13:11:59,825 INFO L93 Difference]: Finished difference Result 2476 states and 8453 transitions. [2020-10-11 13:11:59,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-11 13:11:59,826 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 24 [2020-10-11 13:11:59,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 13:11:59,831 INFO L225 Difference]: With dead ends: 2476 [2020-10-11 13:11:59,831 INFO L226 Difference]: Without dead ends: 2412 [2020-10-11 13:11:59,831 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2020-10-11 13:11:59,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2412 states. [2020-10-11 13:11:59,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2412 to 2291. [2020-10-11 13:11:59,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2291 states. [2020-10-11 13:11:59,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2291 states to 2291 states and 8009 transitions. [2020-10-11 13:11:59,860 INFO L78 Accepts]: Start accepts. Automaton has 2291 states and 8009 transitions. Word has length 24 [2020-10-11 13:11:59,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 13:11:59,860 INFO L481 AbstractCegarLoop]: Abstraction has 2291 states and 8009 transitions. [2020-10-11 13:11:59,860 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-11 13:11:59,860 INFO L276 IsEmpty]: Start isEmpty. Operand 2291 states and 8009 transitions. [2020-10-11 13:11:59,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-10-11 13:11:59,862 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 13:11:59,862 INFO L421 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 13:11:59,862 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2020-10-11 13:11:59,862 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-11 13:11:59,862 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 13:11:59,862 INFO L82 PathProgramCache]: Analyzing trace with hash 1793125216, now seen corresponding path program 1 times [2020-10-11 13:11:59,863 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 13:11:59,863 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [764564256] [2020-10-11 13:11:59,863 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 13:11:59,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 13:11:59,960 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-11 13:11:59,960 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [764564256] [2020-10-11 13:11:59,960 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 13:11:59,960 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-10-11 13:11:59,961 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [717140968] [2020-10-11 13:11:59,961 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-11 13:11:59,961 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 13:11:59,961 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-11 13:11:59,961 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2020-10-11 13:11:59,962 INFO L87 Difference]: Start difference. First operand 2291 states and 8009 transitions. Second operand 9 states. [2020-10-11 13:12:00,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 13:12:00,154 INFO L93 Difference]: Finished difference Result 3139 states and 10958 transitions. [2020-10-11 13:12:00,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-11 13:12:00,154 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 24 [2020-10-11 13:12:00,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 13:12:00,161 INFO L225 Difference]: With dead ends: 3139 [2020-10-11 13:12:00,161 INFO L226 Difference]: Without dead ends: 3115 [2020-10-11 13:12:00,162 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=127, Unknown=0, NotChecked=0, Total=182 [2020-10-11 13:12:00,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3115 states. [2020-10-11 13:12:00,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3115 to 2290. [2020-10-11 13:12:00,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2290 states. [2020-10-11 13:12:00,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2290 states to 2290 states and 8008 transitions. [2020-10-11 13:12:00,195 INFO L78 Accepts]: Start accepts. Automaton has 2290 states and 8008 transitions. Word has length 24 [2020-10-11 13:12:00,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 13:12:00,195 INFO L481 AbstractCegarLoop]: Abstraction has 2290 states and 8008 transitions. [2020-10-11 13:12:00,195 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-11 13:12:00,195 INFO L276 IsEmpty]: Start isEmpty. Operand 2290 states and 8008 transitions. [2020-10-11 13:12:00,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-10-11 13:12:00,197 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 13:12:00,197 INFO L421 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 13:12:00,198 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2020-10-11 13:12:00,198 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-11 13:12:00,198 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 13:12:00,198 INFO L82 PathProgramCache]: Analyzing trace with hash 1041351040, now seen corresponding path program 2 times [2020-10-11 13:12:00,198 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 13:12:00,198 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [307241836] [2020-10-11 13:12:00,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 13:12:00,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 13:12:00,326 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-11 13:12:00,326 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [307241836] [2020-10-11 13:12:00,327 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 13:12:00,327 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-10-11 13:12:00,327 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [299328371] [2020-10-11 13:12:00,327 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-10-11 13:12:00,327 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 13:12:00,328 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-10-11 13:12:00,328 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2020-10-11 13:12:00,328 INFO L87 Difference]: Start difference. First operand 2290 states and 8008 transitions. Second operand 10 states. [2020-10-11 13:12:00,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 13:12:00,690 INFO L93 Difference]: Finished difference Result 3138 states and 10954 transitions. [2020-10-11 13:12:00,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-10-11 13:12:00,690 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 24 [2020-10-11 13:12:00,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 13:12:00,696 INFO L225 Difference]: With dead ends: 3138 [2020-10-11 13:12:00,696 INFO L226 Difference]: Without dead ends: 3114 [2020-10-11 13:12:00,697 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=79, Invalid=193, Unknown=0, NotChecked=0, Total=272 [2020-10-11 13:12:00,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3114 states. [2020-10-11 13:12:00,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3114 to 2293. [2020-10-11 13:12:00,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2293 states. [2020-10-11 13:12:00,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2293 states to 2293 states and 8015 transitions. [2020-10-11 13:12:00,728 INFO L78 Accepts]: Start accepts. Automaton has 2293 states and 8015 transitions. Word has length 24 [2020-10-11 13:12:00,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 13:12:00,728 INFO L481 AbstractCegarLoop]: Abstraction has 2293 states and 8015 transitions. [2020-10-11 13:12:00,729 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-10-11 13:12:00,729 INFO L276 IsEmpty]: Start isEmpty. Operand 2293 states and 8015 transitions. [2020-10-11 13:12:00,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-10-11 13:12:00,731 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 13:12:00,731 INFO L421 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 13:12:00,731 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2020-10-11 13:12:00,731 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-11 13:12:00,731 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 13:12:00,731 INFO L82 PathProgramCache]: Analyzing trace with hash -106935726, now seen corresponding path program 3 times [2020-10-11 13:12:00,732 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 13:12:00,732 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [303109369] [2020-10-11 13:12:00,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 13:12:00,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 13:12:00,877 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-11 13:12:00,877 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [303109369] [2020-10-11 13:12:00,878 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 13:12:00,878 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-10-11 13:12:00,878 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [643609829] [2020-10-11 13:12:00,878 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-10-11 13:12:00,878 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 13:12:00,879 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-10-11 13:12:00,879 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2020-10-11 13:12:00,880 INFO L87 Difference]: Start difference. First operand 2293 states and 8015 transitions. Second operand 11 states. [2020-10-11 13:12:01,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 13:12:01,200 INFO L93 Difference]: Finished difference Result 3732 states and 13122 transitions. [2020-10-11 13:12:01,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-10-11 13:12:01,201 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 24 [2020-10-11 13:12:01,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 13:12:01,208 INFO L225 Difference]: With dead ends: 3732 [2020-10-11 13:12:01,208 INFO L226 Difference]: Without dead ends: 3708 [2020-10-11 13:12:01,209 INFO L673 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-11 13:12:01,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3708 states. [2020-10-11 13:12:01,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3708 to 2271. [2020-10-11 13:12:01,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2271 states. [2020-10-11 13:12:01,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2271 states to 2271 states and 7965 transitions. [2020-10-11 13:12:01,244 INFO L78 Accepts]: Start accepts. Automaton has 2271 states and 7965 transitions. Word has length 24 [2020-10-11 13:12:01,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 13:12:01,244 INFO L481 AbstractCegarLoop]: Abstraction has 2271 states and 7965 transitions. [2020-10-11 13:12:01,244 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-10-11 13:12:01,244 INFO L276 IsEmpty]: Start isEmpty. Operand 2271 states and 7965 transitions. [2020-10-11 13:12:01,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-10-11 13:12:01,247 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 13:12:01,248 INFO L421 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 13:12:01,248 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2020-10-11 13:12:01,248 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-11 13:12:01,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 13:12:01,248 INFO L82 PathProgramCache]: Analyzing trace with hash -408101783, now seen corresponding path program 2 times [2020-10-11 13:12:01,248 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 13:12:01,249 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [142879254] [2020-10-11 13:12:01,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 13:12:01,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 13:12:01,314 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-11 13:12:01,314 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [142879254] [2020-10-11 13:12:01,314 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 13:12:01,315 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-11 13:12:01,315 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [14213027] [2020-10-11 13:12:01,315 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-11 13:12:01,315 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 13:12:01,315 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-11 13:12:01,316 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2020-10-11 13:12:01,316 INFO L87 Difference]: Start difference. First operand 2271 states and 7965 transitions. Second operand 7 states. [2020-10-11 13:12:01,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 13:12:01,563 INFO L93 Difference]: Finished difference Result 2765 states and 9396 transitions. [2020-10-11 13:12:01,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-10-11 13:12:01,563 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 24 [2020-10-11 13:12:01,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 13:12:01,569 INFO L225 Difference]: With dead ends: 2765 [2020-10-11 13:12:01,570 INFO L226 Difference]: Without dead ends: 2701 [2020-10-11 13:12:01,570 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2020-10-11 13:12:01,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2701 states. [2020-10-11 13:12:01,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2701 to 2268. [2020-10-11 13:12:01,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2268 states. [2020-10-11 13:12:01,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2268 states to 2268 states and 7960 transitions. [2020-10-11 13:12:01,727 INFO L78 Accepts]: Start accepts. Automaton has 2268 states and 7960 transitions. Word has length 24 [2020-10-11 13:12:01,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 13:12:01,728 INFO L481 AbstractCegarLoop]: Abstraction has 2268 states and 7960 transitions. [2020-10-11 13:12:01,728 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-11 13:12:01,728 INFO L276 IsEmpty]: Start isEmpty. Operand 2268 states and 7960 transitions. [2020-10-11 13:12:01,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-10-11 13:12:01,731 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 13:12:01,731 INFO L421 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 13:12:01,731 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2020-10-11 13:12:01,732 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-11 13:12:01,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 13:12:01,733 INFO L82 PathProgramCache]: Analyzing trace with hash -1308579191, now seen corresponding path program 3 times [2020-10-11 13:12:01,733 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 13:12:01,733 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [108159606] [2020-10-11 13:12:01,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 13:12:01,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 13:12:01,833 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-11 13:12:01,834 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [108159606] [2020-10-11 13:12:01,834 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 13:12:01,834 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-11 13:12:01,834 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1629285531] [2020-10-11 13:12:01,835 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-11 13:12:01,835 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 13:12:01,835 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-11 13:12:01,835 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2020-10-11 13:12:01,835 INFO L87 Difference]: Start difference. First operand 2268 states and 7960 transitions. Second operand 8 states. [2020-10-11 13:12:02,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 13:12:02,071 INFO L93 Difference]: Finished difference Result 2755 states and 9376 transitions. [2020-10-11 13:12:02,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-10-11 13:12:02,071 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 24 [2020-10-11 13:12:02,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 13:12:02,077 INFO L225 Difference]: With dead ends: 2755 [2020-10-11 13:12:02,078 INFO L226 Difference]: Without dead ends: 2691 [2020-10-11 13:12:02,078 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=109, Unknown=0, NotChecked=0, Total=156 [2020-10-11 13:12:02,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2691 states. [2020-10-11 13:12:02,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2691 to 2262. [2020-10-11 13:12:02,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2262 states. [2020-10-11 13:12:02,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2262 states to 2262 states and 7946 transitions. [2020-10-11 13:12:02,109 INFO L78 Accepts]: Start accepts. Automaton has 2262 states and 7946 transitions. Word has length 24 [2020-10-11 13:12:02,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 13:12:02,110 INFO L481 AbstractCegarLoop]: Abstraction has 2262 states and 7946 transitions. [2020-10-11 13:12:02,110 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-11 13:12:02,110 INFO L276 IsEmpty]: Start isEmpty. Operand 2262 states and 7946 transitions. [2020-10-11 13:12:02,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-10-11 13:12:02,112 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 13:12:02,112 INFO L421 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 13:12:02,112 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2020-10-11 13:12:02,112 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-11 13:12:02,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 13:12:02,113 INFO L82 PathProgramCache]: Analyzing trace with hash -1370549309, now seen corresponding path program 4 times [2020-10-11 13:12:02,113 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 13:12:02,113 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [61949558] [2020-10-11 13:12:02,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 13:12:02,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 13:12:02,225 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-11 13:12:02,226 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [61949558] [2020-10-11 13:12:02,226 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 13:12:02,226 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-10-11 13:12:02,226 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2029003822] [2020-10-11 13:12:02,227 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-10-11 13:12:02,227 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 13:12:02,227 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-10-11 13:12:02,227 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2020-10-11 13:12:02,227 INFO L87 Difference]: Start difference. First operand 2262 states and 7946 transitions. Second operand 10 states. [2020-10-11 13:12:02,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 13:12:02,434 INFO L93 Difference]: Finished difference Result 2704 states and 9243 transitions. [2020-10-11 13:12:02,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-11 13:12:02,434 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 24 [2020-10-11 13:12:02,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 13:12:02,440 INFO L225 Difference]: With dead ends: 2704 [2020-10-11 13:12:02,440 INFO L226 Difference]: Without dead ends: 2640 [2020-10-11 13:12:02,441 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=98, Unknown=0, NotChecked=0, Total=156 [2020-10-11 13:12:02,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2640 states. [2020-10-11 13:12:02,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2640 to 2262. [2020-10-11 13:12:02,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2262 states. [2020-10-11 13:12:02,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2262 states to 2262 states and 7946 transitions. [2020-10-11 13:12:02,478 INFO L78 Accepts]: Start accepts. Automaton has 2262 states and 7946 transitions. Word has length 24 [2020-10-11 13:12:02,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 13:12:02,478 INFO L481 AbstractCegarLoop]: Abstraction has 2262 states and 7946 transitions. [2020-10-11 13:12:02,478 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-10-11 13:12:02,478 INFO L276 IsEmpty]: Start isEmpty. Operand 2262 states and 7946 transitions. [2020-10-11 13:12:02,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-10-11 13:12:02,481 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 13:12:02,481 INFO L421 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 13:12:02,482 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2020-10-11 13:12:02,482 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-11 13:12:02,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 13:12:02,482 INFO L82 PathProgramCache]: Analyzing trace with hash -1607134461, now seen corresponding path program 5 times [2020-10-11 13:12:02,482 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 13:12:02,482 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [19367909] [2020-10-11 13:12:02,482 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 13:12:02,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 13:12:02,709 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-11 13:12:02,710 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [19367909] [2020-10-11 13:12:02,710 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 13:12:02,710 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-10-11 13:12:02,711 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [709416366] [2020-10-11 13:12:02,712 INFO L461 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-10-11 13:12:02,712 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 13:12:02,712 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-10-11 13:12:02,712 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2020-10-11 13:12:02,713 INFO L87 Difference]: Start difference. First operand 2262 states and 7946 transitions. Second operand 13 states. [2020-10-11 13:12:03,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 13:12:03,281 INFO L93 Difference]: Finished difference Result 4164 states and 14122 transitions. [2020-10-11 13:12:03,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-11 13:12:03,282 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 24 [2020-10-11 13:12:03,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 13:12:03,292 INFO L225 Difference]: With dead ends: 4164 [2020-10-11 13:12:03,292 INFO L226 Difference]: Without dead ends: 4036 [2020-10-11 13:12:03,292 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=86, Invalid=220, Unknown=0, NotChecked=0, Total=306 [2020-10-11 13:12:03,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4036 states. [2020-10-11 13:12:03,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4036 to 2451. [2020-10-11 13:12:03,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2451 states. [2020-10-11 13:12:03,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2451 states to 2451 states and 8748 transitions. [2020-10-11 13:12:03,349 INFO L78 Accepts]: Start accepts. Automaton has 2451 states and 8748 transitions. Word has length 24 [2020-10-11 13:12:03,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 13:12:03,349 INFO L481 AbstractCegarLoop]: Abstraction has 2451 states and 8748 transitions. [2020-10-11 13:12:03,349 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-10-11 13:12:03,349 INFO L276 IsEmpty]: Start isEmpty. Operand 2451 states and 8748 transitions. [2020-10-11 13:12:03,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-10-11 13:12:03,353 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 13:12:03,353 INFO L421 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 13:12:03,353 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2020-10-11 13:12:03,353 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-11 13:12:03,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 13:12:03,353 INFO L82 PathProgramCache]: Analyzing trace with hash 1497656527, now seen corresponding path program 6 times [2020-10-11 13:12:03,354 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 13:12:03,354 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1003413735] [2020-10-11 13:12:03,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 13:12:03,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 13:12:03,498 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-11 13:12:03,499 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1003413735] [2020-10-11 13:12:03,499 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 13:12:03,499 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-10-11 13:12:03,499 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [603712451] [2020-10-11 13:12:03,500 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-10-11 13:12:03,500 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 13:12:03,500 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-10-11 13:12:03,500 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2020-10-11 13:12:03,500 INFO L87 Difference]: Start difference. First operand 2451 states and 8748 transitions. Second operand 10 states. [2020-10-11 13:12:03,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 13:12:03,761 INFO L93 Difference]: Finished difference Result 3358 states and 11346 transitions. [2020-10-11 13:12:03,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-11 13:12:03,762 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 24 [2020-10-11 13:12:03,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 13:12:03,769 INFO L225 Difference]: With dead ends: 3358 [2020-10-11 13:12:03,769 INFO L226 Difference]: Without dead ends: 3294 [2020-10-11 13:12:03,769 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=140, Unknown=0, NotChecked=0, Total=210 [2020-10-11 13:12:03,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3294 states. [2020-10-11 13:12:03,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3294 to 2271. [2020-10-11 13:12:03,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2271 states. [2020-10-11 13:12:03,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2271 states to 2271 states and 8062 transitions. [2020-10-11 13:12:03,803 INFO L78 Accepts]: Start accepts. Automaton has 2271 states and 8062 transitions. Word has length 24 [2020-10-11 13:12:03,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 13:12:03,804 INFO L481 AbstractCegarLoop]: Abstraction has 2271 states and 8062 transitions. [2020-10-11 13:12:03,804 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-10-11 13:12:03,804 INFO L276 IsEmpty]: Start isEmpty. Operand 2271 states and 8062 transitions. [2020-10-11 13:12:03,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-10-11 13:12:03,807 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 13:12:03,807 INFO L421 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 13:12:03,807 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2020-10-11 13:12:03,807 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-11 13:12:03,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 13:12:03,808 INFO L82 PathProgramCache]: Analyzing trace with hash -1945194585, now seen corresponding path program 1 times [2020-10-11 13:12:03,808 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 13:12:03,808 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [53093258] [2020-10-11 13:12:03,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 13:12:03,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 13:12:03,957 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-11 13:12:03,957 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [53093258] [2020-10-11 13:12:03,958 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 13:12:03,958 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-10-11 13:12:03,958 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [9268567] [2020-10-11 13:12:03,959 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-10-11 13:12:03,959 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 13:12:03,959 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-10-11 13:12:03,959 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2020-10-11 13:12:03,959 INFO L87 Difference]: Start difference. First operand 2271 states and 8062 transitions. Second operand 12 states. [2020-10-11 13:12:04,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 13:12:04,379 INFO L93 Difference]: Finished difference Result 2789 states and 9626 transitions. [2020-10-11 13:12:04,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-10-11 13:12:04,379 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 25 [2020-10-11 13:12:04,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 13:12:04,385 INFO L225 Difference]: With dead ends: 2789 [2020-10-11 13:12:04,385 INFO L226 Difference]: Without dead ends: 2742 [2020-10-11 13:12:04,386 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=92, Invalid=214, Unknown=0, NotChecked=0, Total=306 [2020-10-11 13:12:04,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2742 states. [2020-10-11 13:12:04,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2742 to 1742. [2020-10-11 13:12:04,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1742 states. [2020-10-11 13:12:04,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1742 states to 1742 states and 6049 transitions. [2020-10-11 13:12:04,413 INFO L78 Accepts]: Start accepts. Automaton has 1742 states and 6049 transitions. Word has length 25 [2020-10-11 13:12:04,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 13:12:04,413 INFO L481 AbstractCegarLoop]: Abstraction has 1742 states and 6049 transitions. [2020-10-11 13:12:04,413 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-10-11 13:12:04,413 INFO L276 IsEmpty]: Start isEmpty. Operand 1742 states and 6049 transitions. [2020-10-11 13:12:04,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-10-11 13:12:04,415 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 13:12:04,415 INFO L421 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 13:12:04,415 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2020-10-11 13:12:04,415 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-11 13:12:04,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 13:12:04,416 INFO L82 PathProgramCache]: Analyzing trace with hash -1461991345, now seen corresponding path program 1 times [2020-10-11 13:12:04,416 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 13:12:04,416 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [309647046] [2020-10-11 13:12:04,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 13:12:04,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 13:12:04,517 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-11 13:12:04,517 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [309647046] [2020-10-11 13:12:04,517 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 13:12:04,517 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-10-11 13:12:04,518 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1700527014] [2020-10-11 13:12:04,518 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-11 13:12:04,518 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 13:12:04,518 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-11 13:12:04,519 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2020-10-11 13:12:04,519 INFO L87 Difference]: Start difference. First operand 1742 states and 6049 transitions. Second operand 9 states. [2020-10-11 13:12:04,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 13:12:04,795 INFO L93 Difference]: Finished difference Result 2359 states and 7868 transitions. [2020-10-11 13:12:04,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-11 13:12:04,795 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 26 [2020-10-11 13:12:04,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 13:12:04,801 INFO L225 Difference]: With dead ends: 2359 [2020-10-11 13:12:04,801 INFO L226 Difference]: Without dead ends: 2337 [2020-10-11 13:12:04,801 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=127, Unknown=0, NotChecked=0, Total=182 [2020-10-11 13:12:04,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2337 states. [2020-10-11 13:12:04,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2337 to 1741. [2020-10-11 13:12:04,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1741 states. [2020-10-11 13:12:04,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1741 states to 1741 states and 6048 transitions. [2020-10-11 13:12:04,832 INFO L78 Accepts]: Start accepts. Automaton has 1741 states and 6048 transitions. Word has length 26 [2020-10-11 13:12:04,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 13:12:04,833 INFO L481 AbstractCegarLoop]: Abstraction has 1741 states and 6048 transitions. [2020-10-11 13:12:04,833 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-11 13:12:04,833 INFO L276 IsEmpty]: Start isEmpty. Operand 1741 states and 6048 transitions. [2020-10-11 13:12:04,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-10-11 13:12:04,836 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 13:12:04,836 INFO L421 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 13:12:04,836 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2020-10-11 13:12:04,836 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-11 13:12:04,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 13:12:04,836 INFO L82 PathProgramCache]: Analyzing trace with hash 1932498543, now seen corresponding path program 2 times [2020-10-11 13:12:04,836 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 13:12:04,837 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1236671134] [2020-10-11 13:12:04,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 13:12:04,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 13:12:04,958 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-11 13:12:04,959 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1236671134] [2020-10-11 13:12:04,959 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 13:12:04,959 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-10-11 13:12:04,959 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2743812] [2020-10-11 13:12:04,959 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-10-11 13:12:04,960 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 13:12:04,960 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-10-11 13:12:04,960 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2020-10-11 13:12:04,960 INFO L87 Difference]: Start difference. First operand 1741 states and 6048 transitions. Second operand 10 states. [2020-10-11 13:12:05,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 13:12:05,455 INFO L93 Difference]: Finished difference Result 2355 states and 7860 transitions. [2020-10-11 13:12:05,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-10-11 13:12:05,456 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 26 [2020-10-11 13:12:05,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 13:12:05,463 INFO L225 Difference]: With dead ends: 2355 [2020-10-11 13:12:05,463 INFO L226 Difference]: Without dead ends: 2333 [2020-10-11 13:12:05,464 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=79, Invalid=193, Unknown=0, NotChecked=0, Total=272 [2020-10-11 13:12:05,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2333 states. [2020-10-11 13:12:05,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2333 to 1744. [2020-10-11 13:12:05,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1744 states. [2020-10-11 13:12:05,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1744 states to 1744 states and 6055 transitions. [2020-10-11 13:12:05,519 INFO L78 Accepts]: Start accepts. Automaton has 1744 states and 6055 transitions. Word has length 26 [2020-10-11 13:12:05,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 13:12:05,519 INFO L481 AbstractCegarLoop]: Abstraction has 1744 states and 6055 transitions. [2020-10-11 13:12:05,519 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-10-11 13:12:05,519 INFO L276 IsEmpty]: Start isEmpty. Operand 1744 states and 6055 transitions. [2020-10-11 13:12:05,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-10-11 13:12:05,523 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 13:12:05,523 INFO L421 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 13:12:05,524 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2020-10-11 13:12:05,524 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-11 13:12:05,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 13:12:05,524 INFO L82 PathProgramCache]: Analyzing trace with hash 1870528425, now seen corresponding path program 3 times [2020-10-11 13:12:05,525 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 13:12:05,525 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [989912488] [2020-10-11 13:12:05,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 13:12:05,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 13:12:05,733 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-11 13:12:05,734 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [989912488] [2020-10-11 13:12:05,734 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 13:12:05,734 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-10-11 13:12:05,734 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1407178742] [2020-10-11 13:12:05,735 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-10-11 13:12:05,735 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 13:12:05,735 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-10-11 13:12:05,735 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2020-10-11 13:12:05,735 INFO L87 Difference]: Start difference. First operand 1744 states and 6055 transitions. Second operand 12 states. [2020-10-11 13:12:06,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 13:12:06,157 INFO L93 Difference]: Finished difference Result 2375 states and 7965 transitions. [2020-10-11 13:12:06,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-11 13:12:06,158 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 26 [2020-10-11 13:12:06,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 13:12:06,165 INFO L225 Difference]: With dead ends: 2375 [2020-10-11 13:12:06,166 INFO L226 Difference]: Without dead ends: 2287 [2020-10-11 13:12:06,166 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=101, Invalid=205, Unknown=0, NotChecked=0, Total=306 [2020-10-11 13:12:06,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2287 states. [2020-10-11 13:12:06,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2287 to 1491. [2020-10-11 13:12:06,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1491 states. [2020-10-11 13:12:06,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1491 states to 1491 states and 5039 transitions. [2020-10-11 13:12:06,215 INFO L78 Accepts]: Start accepts. Automaton has 1491 states and 5039 transitions. Word has length 26 [2020-10-11 13:12:06,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 13:12:06,216 INFO L481 AbstractCegarLoop]: Abstraction has 1491 states and 5039 transitions. [2020-10-11 13:12:06,216 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-10-11 13:12:06,216 INFO L276 IsEmpty]: Start isEmpty. Operand 1491 states and 5039 transitions. [2020-10-11 13:12:06,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-10-11 13:12:06,220 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 13:12:06,220 INFO L421 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 13:12:06,220 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2020-10-11 13:12:06,220 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-11 13:12:06,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 13:12:06,220 INFO L82 PathProgramCache]: Analyzing trace with hash 443766965, now seen corresponding path program 4 times [2020-10-11 13:12:06,221 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 13:12:06,221 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [985339429] [2020-10-11 13:12:06,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 13:12:06,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 13:12:06,416 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-11 13:12:06,417 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [985339429] [2020-10-11 13:12:06,417 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 13:12:06,417 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-10-11 13:12:06,417 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2035848099] [2020-10-11 13:12:06,418 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-10-11 13:12:06,418 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 13:12:06,418 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-10-11 13:12:06,418 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2020-10-11 13:12:06,418 INFO L87 Difference]: Start difference. First operand 1491 states and 5039 transitions. Second operand 12 states. [2020-10-11 13:12:06,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 13:12:06,778 INFO L93 Difference]: Finished difference Result 1544 states and 5003 transitions. [2020-10-11 13:12:06,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-10-11 13:12:06,778 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 26 [2020-10-11 13:12:06,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 13:12:06,781 INFO L225 Difference]: With dead ends: 1544 [2020-10-11 13:12:06,782 INFO L226 Difference]: Without dead ends: 1500 [2020-10-11 13:12:06,782 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=123, Invalid=257, Unknown=0, NotChecked=0, Total=380 [2020-10-11 13:12:06,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1500 states. [2020-10-11 13:12:06,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1500 to 885. [2020-10-11 13:12:06,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 885 states. [2020-10-11 13:12:06,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 885 states to 885 states and 3033 transitions. [2020-10-11 13:12:06,796 INFO L78 Accepts]: Start accepts. Automaton has 885 states and 3033 transitions. Word has length 26 [2020-10-11 13:12:06,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 13:12:06,796 INFO L481 AbstractCegarLoop]: Abstraction has 885 states and 3033 transitions. [2020-10-11 13:12:06,796 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-10-11 13:12:06,796 INFO L276 IsEmpty]: Start isEmpty. Operand 885 states and 3033 transitions. [2020-10-11 13:12:06,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2020-10-11 13:12:06,798 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 13:12:06,798 INFO L421 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 13:12:06,798 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2020-10-11 13:12:06,798 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-11 13:12:06,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 13:12:06,798 INFO L82 PathProgramCache]: Analyzing trace with hash -416507732, now seen corresponding path program 1 times [2020-10-11 13:12:06,799 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 13:12:06,799 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [820297610] [2020-10-11 13:12:06,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 13:12:06,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 13:12:06,868 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-11 13:12:06,868 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [820297610] [2020-10-11 13:12:06,868 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 13:12:06,868 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-10-11 13:12:06,869 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [163297345] [2020-10-11 13:12:06,869 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-11 13:12:06,869 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 13:12:06,869 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-11 13:12:06,869 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2020-10-11 13:12:06,870 INFO L87 Difference]: Start difference. First operand 885 states and 3033 transitions. Second operand 8 states. [2020-10-11 13:12:07,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 13:12:07,012 INFO L93 Difference]: Finished difference Result 885 states and 3029 transitions. [2020-10-11 13:12:07,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-11 13:12:07,013 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 41 [2020-10-11 13:12:07,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 13:12:07,015 INFO L225 Difference]: With dead ends: 885 [2020-10-11 13:12:07,015 INFO L226 Difference]: Without dead ends: 879 [2020-10-11 13:12:07,015 INFO L673 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-11 13:12:07,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 879 states. [2020-10-11 13:12:07,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 879 to 879. [2020-10-11 13:12:07,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 879 states. [2020-10-11 13:12:07,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 879 states to 879 states and 3010 transitions. [2020-10-11 13:12:07,038 INFO L78 Accepts]: Start accepts. Automaton has 879 states and 3010 transitions. Word has length 41 [2020-10-11 13:12:07,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 13:12:07,039 INFO L481 AbstractCegarLoop]: Abstraction has 879 states and 3010 transitions. [2020-10-11 13:12:07,039 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-11 13:12:07,039 INFO L276 IsEmpty]: Start isEmpty. Operand 879 states and 3010 transitions. [2020-10-11 13:12:07,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2020-10-11 13:12:07,042 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 13:12:07,042 INFO L421 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 13:12:07,043 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2020-10-11 13:12:07,043 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-11 13:12:07,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 13:12:07,043 INFO L82 PathProgramCache]: Analyzing trace with hash 829092404, now seen corresponding path program 1 times [2020-10-11 13:12:07,044 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 13:12:07,044 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1925524012] [2020-10-11 13:12:07,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 13:12:07,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 13:12:07,144 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-11 13:12:07,144 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1925524012] [2020-10-11 13:12:07,146 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 13:12:07,146 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-10-11 13:12:07,147 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [884941745] [2020-10-11 13:12:07,147 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-11 13:12:07,147 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 13:12:07,148 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-11 13:12:07,148 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2020-10-11 13:12:07,149 INFO L87 Difference]: Start difference. First operand 879 states and 3010 transitions. Second operand 8 states. [2020-10-11 13:12:07,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 13:12:07,318 INFO L93 Difference]: Finished difference Result 879 states and 3006 transitions. [2020-10-11 13:12:07,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-11 13:12:07,318 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 41 [2020-10-11 13:12:07,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 13:12:07,321 INFO L225 Difference]: With dead ends: 879 [2020-10-11 13:12:07,321 INFO L226 Difference]: Without dead ends: 819 [2020-10-11 13:12:07,321 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2020-10-11 13:12:07,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 819 states. [2020-10-11 13:12:07,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 819 to 819. [2020-10-11 13:12:07,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 819 states. [2020-10-11 13:12:07,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 819 states to 819 states and 2784 transitions. [2020-10-11 13:12:07,337 INFO L78 Accepts]: Start accepts. Automaton has 819 states and 2784 transitions. Word has length 41 [2020-10-11 13:12:07,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 13:12:07,339 INFO L481 AbstractCegarLoop]: Abstraction has 819 states and 2784 transitions. [2020-10-11 13:12:07,339 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-11 13:12:07,339 INFO L276 IsEmpty]: Start isEmpty. Operand 819 states and 2784 transitions. [2020-10-11 13:12:07,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2020-10-11 13:12:07,341 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 13:12:07,342 INFO L421 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 13:12:07,342 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2020-10-11 13:12:07,342 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-11 13:12:07,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 13:12:07,342 INFO L82 PathProgramCache]: Analyzing trace with hash 1378914744, now seen corresponding path program 1 times [2020-10-11 13:12:07,342 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 13:12:07,342 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2124335387] [2020-10-11 13:12:07,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 13:12:07,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-11 13:12:07,363 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-11 13:12:07,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-11 13:12:07,390 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-11 13:12:07,441 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-11 13:12:07,441 INFO L519 BasicCegarLoop]: Counterexample might be feasible [2020-10-11 13:12:07,441 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2020-10-11 13:12:07,565 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 01:12:07 BasicIcfg [2020-10-11 13:12:07,565 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-11 13:12:07,566 INFO L168 Benchmark]: Toolchain (without parser) took 28004.05 ms. Allocated memory was 251.7 MB in the beginning and 967.8 MB in the end (delta: 716.2 MB). Free memory was 207.0 MB in the beginning and 503.9 MB in the end (delta: -296.9 MB). Peak memory consumption was 419.3 MB. Max. memory is 14.2 GB. [2020-10-11 13:12:07,567 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 251.7 MB. Free memory is still 228.0 MB. There was no memory consumed. Max. memory is 14.2 GB. [2020-10-11 13:12:07,567 INFO L168 Benchmark]: CACSL2BoogieTranslator took 954.68 ms. Allocated memory was 251.7 MB in the beginning and 315.6 MB in the end (delta: 64.0 MB). Free memory was 207.0 MB in the beginning and 232.7 MB in the end (delta: -25.6 MB). Peak memory consumption was 48.8 MB. Max. memory is 14.2 GB. [2020-10-11 13:12:07,567 INFO L168 Benchmark]: Boogie Procedure Inliner took 61.47 ms. Allocated memory is still 315.6 MB. Free memory was 232.7 MB in the beginning and 230.1 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB. [2020-10-11 13:12:07,568 INFO L168 Benchmark]: Boogie Preprocessor took 27.85 ms. Allocated memory is still 315.6 MB. Free memory was 230.1 MB in the beginning and 227.6 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB. [2020-10-11 13:12:07,568 INFO L168 Benchmark]: RCFGBuilder took 505.82 ms. Allocated memory is still 315.6 MB. Free memory was 227.6 MB in the beginning and 200.7 MB in the end (delta: 26.9 MB). Peak memory consumption was 26.9 MB. Max. memory is 14.2 GB. [2020-10-11 13:12:07,568 INFO L168 Benchmark]: TraceAbstraction took 26448.02 ms. Allocated memory was 315.6 MB in the beginning and 967.8 MB in the end (delta: 652.2 MB). Free memory was 200.7 MB in the beginning and 503.9 MB in the end (delta: -303.2 MB). Peak memory consumption was 349.0 MB. Max. memory is 14.2 GB. [2020-10-11 13:12:07,570 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.24 ms. Allocated memory is still 251.7 MB. Free memory is still 228.0 MB. There was no memory consumed. Max. memory is 14.2 GB. * CACSL2BoogieTranslator took 954.68 ms. Allocated memory was 251.7 MB in the beginning and 315.6 MB in the end (delta: 64.0 MB). Free memory was 207.0 MB in the beginning and 232.7 MB in the end (delta: -25.6 MB). Peak memory consumption was 48.8 MB. Max. memory is 14.2 GB. * Boogie Procedure Inliner took 61.47 ms. Allocated memory is still 315.6 MB. Free memory was 232.7 MB in the beginning and 230.1 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB. * Boogie Preprocessor took 27.85 ms. Allocated memory is still 315.6 MB. Free memory was 230.1 MB in the beginning and 227.6 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB. * RCFGBuilder took 505.82 ms. Allocated memory is still 315.6 MB. Free memory was 227.6 MB in the beginning and 200.7 MB in the end (delta: 26.9 MB). Peak memory consumption was 26.9 MB. Max. memory is 14.2 GB. * TraceAbstraction took 26448.02 ms. Allocated memory was 315.6 MB in the beginning and 967.8 MB in the end (delta: 652.2 MB). Free memory was 200.7 MB in the beginning and 503.9 MB in the end (delta: -303.2 MB). Peak memory consumption was 349.0 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: 14.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 2.7s, 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.9s 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.3s 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...