/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix052_rmo.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 06:51:35,071 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 06:51:35,074 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 06:51:35,092 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 06:51:35,093 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 06:51:35,095 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 06:51:35,097 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 06:51:35,106 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 06:51:35,110 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 06:51:35,113 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 06:51:35,116 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 06:51:35,118 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 06:51:35,118 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 06:51:35,120 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 06:51:35,123 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 06:51:35,124 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 06:51:35,125 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 06:51:35,126 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 06:51:35,128 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 06:51:35,133 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 06:51:35,138 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 06:51:35,143 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 06:51:35,144 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 06:51:35,145 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 06:51:35,148 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 06:51:35,148 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 06:51:35,148 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 06:51:35,150 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 06:51:35,151 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 06:51:35,152 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 06:51:35,153 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 06:51:35,154 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 06:51:35,155 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 06:51:35,156 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 06:51:35,157 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 06:51:35,158 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 06:51:35,158 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 06:51:35,158 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 06:51:35,159 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 06:51:35,159 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 06:51:35,161 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 06:51:35,162 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe.epf [2019-12-27 06:51:35,180 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 06:51:35,180 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 06:51:35,182 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 06:51:35,182 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 06:51:35,182 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 06:51:35,182 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 06:51:35,182 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 06:51:35,183 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 06:51:35,183 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 06:51:35,183 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 06:51:35,183 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 06:51:35,183 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 06:51:35,184 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 06:51:35,184 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 06:51:35,184 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 06:51:35,184 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 06:51:35,184 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 06:51:35,185 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 06:51:35,185 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 06:51:35,185 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 06:51:35,185 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 06:51:35,186 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 06:51:35,186 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 06:51:35,186 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 06:51:35,186 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 06:51:35,186 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 06:51:35,187 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 06:51:35,187 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2019-12-27 06:51:35,187 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 06:51:35,187 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 06:51:35,448 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 06:51:35,460 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 06:51:35,463 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 06:51:35,467 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 06:51:35,467 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 06:51:35,468 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix052_rmo.oepc.i [2019-12-27 06:51:35,543 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b6aae2163/c03d6a6bfbb347a2a187d589bbe58e0b/FLAG177c271af [2019-12-27 06:51:36,128 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 06:51:36,129 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix052_rmo.oepc.i [2019-12-27 06:51:36,143 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b6aae2163/c03d6a6bfbb347a2a187d589bbe58e0b/FLAG177c271af [2019-12-27 06:51:36,376 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b6aae2163/c03d6a6bfbb347a2a187d589bbe58e0b [2019-12-27 06:51:36,387 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 06:51:36,389 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 06:51:36,390 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 06:51:36,390 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 06:51:36,395 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 06:51:36,396 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 06:51:36" (1/1) ... [2019-12-27 06:51:36,400 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3cad934d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:51:36, skipping insertion in model container [2019-12-27 06:51:36,400 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 06:51:36" (1/1) ... [2019-12-27 06:51:36,408 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 06:51:36,453 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 06:51:36,980 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 06:51:36,994 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 06:51:37,091 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 06:51:37,161 INFO L208 MainTranslator]: Completed translation [2019-12-27 06:51:37,162 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:51:37 WrapperNode [2019-12-27 06:51:37,162 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 06:51:37,163 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 06:51:37,163 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 06:51:37,163 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 06:51:37,172 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:51:37" (1/1) ... [2019-12-27 06:51:37,193 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:51:37" (1/1) ... [2019-12-27 06:51:37,223 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 06:51:37,223 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 06:51:37,224 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 06:51:37,224 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 06:51:37,233 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:51:37" (1/1) ... [2019-12-27 06:51:37,234 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:51:37" (1/1) ... [2019-12-27 06:51:37,239 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:51:37" (1/1) ... [2019-12-27 06:51:37,239 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:51:37" (1/1) ... [2019-12-27 06:51:37,250 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:51:37" (1/1) ... [2019-12-27 06:51:37,255 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:51:37" (1/1) ... [2019-12-27 06:51:37,259 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:51:37" (1/1) ... [2019-12-27 06:51:37,264 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 06:51:37,265 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 06:51:37,265 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 06:51:37,265 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 06:51:37,266 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:51:37" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 06:51:37,335 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 06:51:37,336 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 06:51:37,336 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 06:51:37,336 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 06:51:37,336 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 06:51:37,337 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 06:51:37,337 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 06:51:37,338 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 06:51:37,338 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-27 06:51:37,339 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-27 06:51:37,339 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 06:51:37,339 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 06:51:37,339 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 06:51:37,341 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-27 06:51:38,098 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 06:51:38,099 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 06:51:38,100 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 06:51:38 BoogieIcfgContainer [2019-12-27 06:51:38,100 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 06:51:38,102 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 06:51:38,102 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 06:51:38,105 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 06:51:38,105 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 06:51:36" (1/3) ... [2019-12-27 06:51:38,106 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@47fd5d85 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 06:51:38, skipping insertion in model container [2019-12-27 06:51:38,107 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:51:37" (2/3) ... [2019-12-27 06:51:38,107 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@47fd5d85 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 06:51:38, skipping insertion in model container [2019-12-27 06:51:38,107 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 06:51:38" (3/3) ... [2019-12-27 06:51:38,109 INFO L109 eAbstractionObserver]: Analyzing ICFG mix052_rmo.oepc.i [2019-12-27 06:51:38,120 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 06:51:38,120 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 06:51:38,130 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 06:51:38,131 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 06:51:38,175 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:51:38,175 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:51:38,176 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:51:38,176 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:51:38,176 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:51:38,177 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:51:38,177 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:51:38,177 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:51:38,178 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:51:38,178 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:51:38,178 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:51:38,179 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:51:38,179 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:51:38,179 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:51:38,180 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:51:38,180 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:51:38,180 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:51:38,180 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:51:38,181 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:51:38,181 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:51:38,181 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:51:38,182 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:51:38,182 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:51:38,183 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:51:38,183 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:51:38,183 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:51:38,183 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:51:38,184 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:51:38,184 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:51:38,184 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:51:38,201 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:51:38,201 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:51:38,202 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:51:38,202 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:51:38,202 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:51:38,203 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:51:38,203 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:51:38,203 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:51:38,203 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:51:38,204 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:51:38,204 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:51:38,204 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:51:38,204 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:51:38,204 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:51:38,205 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:51:38,205 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:51:38,205 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:51:38,205 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:51:38,205 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:51:38,206 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:51:38,206 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:51:38,206 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:51:38,206 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:51:38,207 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:51:38,207 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:51:38,207 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:51:38,207 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:51:38,207 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:51:38,208 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:51:38,208 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:51:38,208 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:51:38,208 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:51:38,208 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:51:38,209 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:51:38,210 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:51:38,210 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:51:38,210 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:51:38,210 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:51:38,210 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:51:38,211 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:51:38,211 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:51:38,211 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:51:38,211 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:51:38,212 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:51:38,212 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:51:38,212 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:51:38,212 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:51:38,212 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:51:38,213 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:51:38,213 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:51:38,213 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:51:38,213 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:51:38,214 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:51:38,214 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:51:38,214 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:51:38,214 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:51:38,214 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:51:38,215 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:51:38,215 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:51:38,215 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:51:38,215 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:51:38,216 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:51:38,216 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:51:38,216 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:51:38,216 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:51:38,216 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:51:38,217 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:51:38,217 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:51:38,217 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:51:38,217 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:51:38,217 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:51:38,218 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:51:38,218 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:51:38,218 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:51:38,218 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:51:38,218 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:51:38,219 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:51:38,219 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:51:38,219 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:51:38,219 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:51:38,220 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:51:38,220 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:51:38,220 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:51:38,220 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:51:38,220 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:51:38,221 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:51:38,221 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:51:38,221 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:51:38,221 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:51:38,221 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:51:38,222 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:51:38,222 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:51:38,222 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:51:38,222 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:51:38,222 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:51:38,223 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:51:38,223 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:51:38,223 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:51:38,223 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:51:38,223 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:51:38,223 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:51:38,224 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:51:38,224 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:51:38,224 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:51:38,224 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:51:38,225 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:51:38,225 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:51:38,225 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:51:38,225 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:51:38,225 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:51:38,226 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:51:38,226 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:51:38,226 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:51:38,226 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:51:38,227 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:51:38,227 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:51:38,227 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:51:38,227 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:51:38,227 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:51:38,228 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:51:38,228 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:51:38,228 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:51:38,228 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:51:38,228 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:51:38,229 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:51:38,229 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:51:38,229 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:51:38,229 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:51:38,229 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:51:38,230 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:51:38,230 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:51:38,230 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:51:38,230 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:51:38,230 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:51:38,231 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:51:38,231 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:51:38,231 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:51:38,231 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:51:38,231 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:51:38,232 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:51:38,232 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:51:38,232 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:51:38,232 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:51:38,232 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:51:38,233 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:51:38,233 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:51:38,233 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:51:38,233 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:51:38,233 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:51:38,234 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:51:38,234 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:51:38,234 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:51:38,237 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:51:38,238 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:51:38,238 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:51:38,238 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:51:38,238 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:51:38,238 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:51:38,239 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:51:38,239 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:51:38,239 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:51:38,239 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:51:38,239 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:51:38,239 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:51:38,242 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:51:38,243 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:51:38,243 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:51:38,243 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:51:38,243 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:51:38,243 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:51:38,244 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:51:38,244 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:51:38,244 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:51:38,244 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:51:38,246 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:51:38,246 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:51:38,247 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:51:38,247 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:51:38,247 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:51:38,247 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:51:38,247 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:51:38,248 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:51:38,248 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:51:38,248 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:51:38,248 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:51:38,249 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:51:38,249 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:51:38,249 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:51:38,249 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:51:38,249 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:51:38,249 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:51:38,250 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:51:38,250 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:51:38,250 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:51:38,250 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:51:38,250 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:51:38,251 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:51:38,251 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:51:38,251 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:51:38,252 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:51:38,252 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:51:38,252 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:51:38,252 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:51:38,252 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:51:38,252 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:51:38,253 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:51:38,253 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:51:38,273 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-27 06:51:38,293 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 06:51:38,294 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 06:51:38,294 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 06:51:38,294 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-27 06:51:38,294 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 06:51:38,294 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 06:51:38,295 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 06:51:38,295 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 06:51:38,312 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 175 places, 212 transitions [2019-12-27 06:51:38,313 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 175 places, 212 transitions [2019-12-27 06:51:38,419 INFO L132 PetriNetUnfolder]: 47/209 cut-off events. [2019-12-27 06:51:38,419 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 06:51:38,438 INFO L76 FinitePrefix]: Finished finitePrefix Result has 219 conditions, 209 events. 47/209 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 437 event pairs. 0/160 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-27 06:51:38,463 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 175 places, 212 transitions [2019-12-27 06:51:38,520 INFO L132 PetriNetUnfolder]: 47/209 cut-off events. [2019-12-27 06:51:38,520 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 06:51:38,529 INFO L76 FinitePrefix]: Finished finitePrefix Result has 219 conditions, 209 events. 47/209 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 437 event pairs. 0/160 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-27 06:51:38,551 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 19004 [2019-12-27 06:51:38,552 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-27 06:51:42,309 WARN L192 SmtUtils]: Spent 276.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 87 [2019-12-27 06:51:42,426 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 85 [2019-12-27 06:51:42,449 INFO L206 etLargeBlockEncoding]: Checked pairs total: 80960 [2019-12-27 06:51:42,450 INFO L214 etLargeBlockEncoding]: Total number of compositions: 113 [2019-12-27 06:51:42,453 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 92 places, 101 transitions [2019-12-27 06:51:58,746 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 106892 states. [2019-12-27 06:51:58,748 INFO L276 IsEmpty]: Start isEmpty. Operand 106892 states. [2019-12-27 06:51:58,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-27 06:51:58,754 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:51:58,755 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-27 06:51:58,755 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:51:58,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:51:58,761 INFO L82 PathProgramCache]: Analyzing trace with hash 911873, now seen corresponding path program 1 times [2019-12-27 06:51:58,768 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:51:58,769 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [699490409] [2019-12-27 06:51:58,769 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:51:58,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:51:59,018 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:51:59,019 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [699490409] [2019-12-27 06:51:59,020 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:51:59,022 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 06:51:59,023 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [370539504] [2019-12-27 06:51:59,029 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 06:51:59,030 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:51:59,045 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 06:51:59,046 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 06:51:59,048 INFO L87 Difference]: Start difference. First operand 106892 states. Second operand 3 states. [2019-12-27 06:52:00,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:52:00,538 INFO L93 Difference]: Finished difference Result 106230 states and 453846 transitions. [2019-12-27 06:52:00,538 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 06:52:00,539 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-27 06:52:00,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:52:03,783 INFO L225 Difference]: With dead ends: 106230 [2019-12-27 06:52:03,783 INFO L226 Difference]: Without dead ends: 99639 [2019-12-27 06:52:03,784 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 06:52:07,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99639 states. [2019-12-27 06:52:10,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99639 to 99639. [2019-12-27 06:52:10,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99639 states. [2019-12-27 06:52:13,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99639 states to 99639 states and 425116 transitions. [2019-12-27 06:52:13,832 INFO L78 Accepts]: Start accepts. Automaton has 99639 states and 425116 transitions. Word has length 3 [2019-12-27 06:52:13,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:52:13,832 INFO L462 AbstractCegarLoop]: Abstraction has 99639 states and 425116 transitions. [2019-12-27 06:52:13,832 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 06:52:13,832 INFO L276 IsEmpty]: Start isEmpty. Operand 99639 states and 425116 transitions. [2019-12-27 06:52:13,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-27 06:52:13,838 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:52:13,838 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:52:13,838 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:52:13,839 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:52:13,839 INFO L82 PathProgramCache]: Analyzing trace with hash -1470531628, now seen corresponding path program 1 times [2019-12-27 06:52:13,839 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:52:13,839 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1546031686] [2019-12-27 06:52:13,839 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:52:13,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:52:13,992 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:52:13,993 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1546031686] [2019-12-27 06:52:13,993 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:52:13,994 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 06:52:13,995 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [120106395] [2019-12-27 06:52:13,996 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 06:52:13,996 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:52:13,997 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 06:52:13,997 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 06:52:13,997 INFO L87 Difference]: Start difference. First operand 99639 states and 425116 transitions. Second operand 4 states. [2019-12-27 06:52:18,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:52:18,935 INFO L93 Difference]: Finished difference Result 159197 states and 650077 transitions. [2019-12-27 06:52:18,935 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 06:52:18,935 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-27 06:52:18,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:52:19,652 INFO L225 Difference]: With dead ends: 159197 [2019-12-27 06:52:19,652 INFO L226 Difference]: Without dead ends: 159148 [2019-12-27 06:52:19,653 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 06:52:24,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159148 states. [2019-12-27 06:52:28,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159148 to 145638. [2019-12-27 06:52:28,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145638 states. [2019-12-27 06:52:28,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145638 states to 145638 states and 602196 transitions. [2019-12-27 06:52:28,719 INFO L78 Accepts]: Start accepts. Automaton has 145638 states and 602196 transitions. Word has length 11 [2019-12-27 06:52:28,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:52:28,720 INFO L462 AbstractCegarLoop]: Abstraction has 145638 states and 602196 transitions. [2019-12-27 06:52:28,720 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 06:52:28,720 INFO L276 IsEmpty]: Start isEmpty. Operand 145638 states and 602196 transitions. [2019-12-27 06:52:28,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 06:52:28,725 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:52:28,725 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:52:28,725 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:52:28,726 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:52:28,726 INFO L82 PathProgramCache]: Analyzing trace with hash 1074387989, now seen corresponding path program 1 times [2019-12-27 06:52:28,726 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:52:28,726 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [339271975] [2019-12-27 06:52:28,727 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:52:28,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:52:28,777 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:52:28,777 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [339271975] [2019-12-27 06:52:28,778 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:52:28,778 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 06:52:28,778 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [123398536] [2019-12-27 06:52:28,778 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 06:52:28,779 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:52:28,779 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 06:52:28,779 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 06:52:28,779 INFO L87 Difference]: Start difference. First operand 145638 states and 602196 transitions. Second operand 3 states. [2019-12-27 06:52:28,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:52:28,947 INFO L93 Difference]: Finished difference Result 32092 states and 104170 transitions. [2019-12-27 06:52:28,948 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 06:52:28,948 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-27 06:52:28,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:52:29,025 INFO L225 Difference]: With dead ends: 32092 [2019-12-27 06:52:29,026 INFO L226 Difference]: Without dead ends: 32092 [2019-12-27 06:52:29,026 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 06:52:29,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32092 states. [2019-12-27 06:52:33,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32092 to 32092. [2019-12-27 06:52:33,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32092 states. [2019-12-27 06:52:34,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32092 states to 32092 states and 104170 transitions. [2019-12-27 06:52:34,008 INFO L78 Accepts]: Start accepts. Automaton has 32092 states and 104170 transitions. Word has length 13 [2019-12-27 06:52:34,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:52:34,008 INFO L462 AbstractCegarLoop]: Abstraction has 32092 states and 104170 transitions. [2019-12-27 06:52:34,008 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 06:52:34,009 INFO L276 IsEmpty]: Start isEmpty. Operand 32092 states and 104170 transitions. [2019-12-27 06:52:34,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-27 06:52:34,012 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:52:34,012 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:52:34,012 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:52:34,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:52:34,013 INFO L82 PathProgramCache]: Analyzing trace with hash -625948887, now seen corresponding path program 1 times [2019-12-27 06:52:34,013 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:52:34,013 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [483433477] [2019-12-27 06:52:34,013 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:52:34,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:52:34,193 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:52:34,194 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [483433477] [2019-12-27 06:52:34,194 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:52:34,194 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 06:52:34,195 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1243465920] [2019-12-27 06:52:34,195 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 06:52:34,195 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:52:34,195 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 06:52:34,196 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 06:52:34,197 INFO L87 Difference]: Start difference. First operand 32092 states and 104170 transitions. Second operand 5 states. [2019-12-27 06:52:34,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:52:34,711 INFO L93 Difference]: Finished difference Result 43827 states and 140462 transitions. [2019-12-27 06:52:34,711 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 06:52:34,712 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2019-12-27 06:52:34,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:52:34,793 INFO L225 Difference]: With dead ends: 43827 [2019-12-27 06:52:34,793 INFO L226 Difference]: Without dead ends: 43827 [2019-12-27 06:52:34,794 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-27 06:52:35,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43827 states. [2019-12-27 06:52:35,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43827 to 37110. [2019-12-27 06:52:35,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37110 states. [2019-12-27 06:52:35,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37110 states to 37110 states and 119926 transitions. [2019-12-27 06:52:35,882 INFO L78 Accepts]: Start accepts. Automaton has 37110 states and 119926 transitions. Word has length 16 [2019-12-27 06:52:35,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:52:35,883 INFO L462 AbstractCegarLoop]: Abstraction has 37110 states and 119926 transitions. [2019-12-27 06:52:35,883 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 06:52:35,883 INFO L276 IsEmpty]: Start isEmpty. Operand 37110 states and 119926 transitions. [2019-12-27 06:52:35,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-27 06:52:35,892 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:52:35,892 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:52:35,893 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:52:35,893 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:52:35,893 INFO L82 PathProgramCache]: Analyzing trace with hash 867934420, now seen corresponding path program 1 times [2019-12-27 06:52:35,893 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:52:35,894 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1649138706] [2019-12-27 06:52:35,894 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:52:35,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:52:36,023 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:52:36,023 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1649138706] [2019-12-27 06:52:36,024 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:52:36,024 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 06:52:36,024 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1666135381] [2019-12-27 06:52:36,024 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 06:52:36,025 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:52:36,025 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 06:52:36,025 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 06:52:36,025 INFO L87 Difference]: Start difference. First operand 37110 states and 119926 transitions. Second operand 6 states. [2019-12-27 06:52:37,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:52:37,104 INFO L93 Difference]: Finished difference Result 56855 states and 178889 transitions. [2019-12-27 06:52:37,105 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 06:52:37,105 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2019-12-27 06:52:37,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:52:37,200 INFO L225 Difference]: With dead ends: 56855 [2019-12-27 06:52:37,200 INFO L226 Difference]: Without dead ends: 56848 [2019-12-27 06:52:37,200 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2019-12-27 06:52:37,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56848 states. [2019-12-27 06:52:38,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56848 to 38036. [2019-12-27 06:52:38,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38036 states. [2019-12-27 06:52:38,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38036 states to 38036 states and 122132 transitions. [2019-12-27 06:52:38,488 INFO L78 Accepts]: Start accepts. Automaton has 38036 states and 122132 transitions. Word has length 22 [2019-12-27 06:52:38,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:52:38,488 INFO L462 AbstractCegarLoop]: Abstraction has 38036 states and 122132 transitions. [2019-12-27 06:52:38,488 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 06:52:38,488 INFO L276 IsEmpty]: Start isEmpty. Operand 38036 states and 122132 transitions. [2019-12-27 06:52:38,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 06:52:38,503 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:52:38,503 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:52:38,503 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:52:38,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:52:38,503 INFO L82 PathProgramCache]: Analyzing trace with hash -1491582791, now seen corresponding path program 1 times [2019-12-27 06:52:38,504 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:52:38,504 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [258871206] [2019-12-27 06:52:38,504 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:52:38,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:52:38,561 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:52:38,562 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [258871206] [2019-12-27 06:52:38,562 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:52:38,562 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 06:52:38,562 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [658058321] [2019-12-27 06:52:38,563 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 06:52:38,563 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:52:38,563 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 06:52:38,563 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 06:52:38,563 INFO L87 Difference]: Start difference. First operand 38036 states and 122132 transitions. Second operand 4 states. [2019-12-27 06:52:38,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:52:38,633 INFO L93 Difference]: Finished difference Result 15569 states and 47210 transitions. [2019-12-27 06:52:38,633 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 06:52:38,634 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2019-12-27 06:52:38,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:52:38,655 INFO L225 Difference]: With dead ends: 15569 [2019-12-27 06:52:38,655 INFO L226 Difference]: Without dead ends: 15569 [2019-12-27 06:52:38,655 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 06:52:38,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15569 states. [2019-12-27 06:52:38,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15569 to 15311. [2019-12-27 06:52:38,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15311 states. [2019-12-27 06:52:38,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15311 states to 15311 states and 46474 transitions. [2019-12-27 06:52:38,894 INFO L78 Accepts]: Start accepts. Automaton has 15311 states and 46474 transitions. Word has length 25 [2019-12-27 06:52:38,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:52:38,895 INFO L462 AbstractCegarLoop]: Abstraction has 15311 states and 46474 transitions. [2019-12-27 06:52:38,895 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 06:52:38,895 INFO L276 IsEmpty]: Start isEmpty. Operand 15311 states and 46474 transitions. [2019-12-27 06:52:38,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-27 06:52:38,908 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:52:38,908 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:52:38,908 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:52:38,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:52:38,908 INFO L82 PathProgramCache]: Analyzing trace with hash 1591310570, now seen corresponding path program 1 times [2019-12-27 06:52:38,909 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:52:38,909 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [320090204] [2019-12-27 06:52:38,909 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:52:38,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:52:39,013 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:52:39,013 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [320090204] [2019-12-27 06:52:39,014 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:52:39,014 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 06:52:39,014 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1341710350] [2019-12-27 06:52:39,015 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 06:52:39,015 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:52:39,015 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 06:52:39,015 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 06:52:39,015 INFO L87 Difference]: Start difference. First operand 15311 states and 46474 transitions. Second operand 6 states. [2019-12-27 06:52:39,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:52:39,648 INFO L93 Difference]: Finished difference Result 21967 states and 64800 transitions. [2019-12-27 06:52:39,648 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-27 06:52:39,649 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2019-12-27 06:52:39,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:52:39,688 INFO L225 Difference]: With dead ends: 21967 [2019-12-27 06:52:39,688 INFO L226 Difference]: Without dead ends: 21967 [2019-12-27 06:52:39,689 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-12-27 06:52:39,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21967 states. [2019-12-27 06:52:40,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21967 to 17627. [2019-12-27 06:52:40,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17627 states. [2019-12-27 06:52:40,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17627 states to 17627 states and 53055 transitions. [2019-12-27 06:52:40,136 INFO L78 Accepts]: Start accepts. Automaton has 17627 states and 53055 transitions. Word has length 27 [2019-12-27 06:52:40,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:52:40,137 INFO L462 AbstractCegarLoop]: Abstraction has 17627 states and 53055 transitions. [2019-12-27 06:52:40,137 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 06:52:40,137 INFO L276 IsEmpty]: Start isEmpty. Operand 17627 states and 53055 transitions. [2019-12-27 06:52:40,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-27 06:52:40,166 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:52:40,166 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:52:40,166 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:52:40,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:52:40,167 INFO L82 PathProgramCache]: Analyzing trace with hash 174996949, now seen corresponding path program 1 times [2019-12-27 06:52:40,167 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:52:40,167 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1130675643] [2019-12-27 06:52:40,167 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:52:40,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:52:40,387 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:52:40,388 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1130675643] [2019-12-27 06:52:40,388 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:52:40,388 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 06:52:40,388 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1222360143] [2019-12-27 06:52:40,389 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 06:52:40,389 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:52:40,389 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 06:52:40,390 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-12-27 06:52:40,390 INFO L87 Difference]: Start difference. First operand 17627 states and 53055 transitions. Second operand 8 states. [2019-12-27 06:52:41,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:52:41,877 INFO L93 Difference]: Finished difference Result 24849 states and 72852 transitions. [2019-12-27 06:52:41,877 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-12-27 06:52:41,878 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 33 [2019-12-27 06:52:41,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:52:41,914 INFO L225 Difference]: With dead ends: 24849 [2019-12-27 06:52:41,915 INFO L226 Difference]: Without dead ends: 24849 [2019-12-27 06:52:41,915 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 0 SyntacticMatches, 3 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=120, Invalid=342, Unknown=0, NotChecked=0, Total=462 [2019-12-27 06:52:42,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24849 states. [2019-12-27 06:52:42,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24849 to 17725. [2019-12-27 06:52:42,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17725 states. [2019-12-27 06:52:42,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17725 states to 17725 states and 53335 transitions. [2019-12-27 06:52:42,247 INFO L78 Accepts]: Start accepts. Automaton has 17725 states and 53335 transitions. Word has length 33 [2019-12-27 06:52:42,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:52:42,248 INFO L462 AbstractCegarLoop]: Abstraction has 17725 states and 53335 transitions. [2019-12-27 06:52:42,248 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 06:52:42,248 INFO L276 IsEmpty]: Start isEmpty. Operand 17725 states and 53335 transitions. [2019-12-27 06:52:42,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-27 06:52:42,268 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:52:42,269 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:52:42,269 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:52:42,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:52:42,269 INFO L82 PathProgramCache]: Analyzing trace with hash -1052383531, now seen corresponding path program 2 times [2019-12-27 06:52:42,269 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:52:42,270 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [993853076] [2019-12-27 06:52:42,270 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:52:42,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:52:42,387 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:52:42,388 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [993853076] [2019-12-27 06:52:42,388 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:52:42,388 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 06:52:42,388 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1477902197] [2019-12-27 06:52:42,389 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 06:52:42,389 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:52:42,389 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 06:52:42,389 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-27 06:52:42,389 INFO L87 Difference]: Start difference. First operand 17725 states and 53335 transitions. Second operand 7 states. [2019-12-27 06:52:43,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:52:43,586 INFO L93 Difference]: Finished difference Result 24587 states and 72060 transitions. [2019-12-27 06:52:43,587 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-27 06:52:43,587 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 33 [2019-12-27 06:52:43,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:52:43,620 INFO L225 Difference]: With dead ends: 24587 [2019-12-27 06:52:43,620 INFO L226 Difference]: Without dead ends: 24587 [2019-12-27 06:52:43,620 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=90, Invalid=252, Unknown=0, NotChecked=0, Total=342 [2019-12-27 06:52:43,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24587 states. [2019-12-27 06:52:43,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24587 to 16954. [2019-12-27 06:52:43,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16954 states. [2019-12-27 06:52:43,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16954 states to 16954 states and 50982 transitions. [2019-12-27 06:52:43,928 INFO L78 Accepts]: Start accepts. Automaton has 16954 states and 50982 transitions. Word has length 33 [2019-12-27 06:52:43,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:52:43,928 INFO L462 AbstractCegarLoop]: Abstraction has 16954 states and 50982 transitions. [2019-12-27 06:52:43,928 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 06:52:43,928 INFO L276 IsEmpty]: Start isEmpty. Operand 16954 states and 50982 transitions. [2019-12-27 06:52:43,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-27 06:52:43,950 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:52:43,950 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:52:43,950 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:52:43,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:52:43,951 INFO L82 PathProgramCache]: Analyzing trace with hash 1438899484, now seen corresponding path program 1 times [2019-12-27 06:52:43,951 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:52:43,951 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [848644654] [2019-12-27 06:52:43,951 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:52:43,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:52:44,038 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:52:44,038 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [848644654] [2019-12-27 06:52:44,038 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:52:44,039 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 06:52:44,039 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1839637516] [2019-12-27 06:52:44,039 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 06:52:44,039 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:52:44,040 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 06:52:44,040 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 06:52:44,040 INFO L87 Difference]: Start difference. First operand 16954 states and 50982 transitions. Second operand 5 states. [2019-12-27 06:52:44,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:52:44,663 INFO L93 Difference]: Finished difference Result 23664 states and 70656 transitions. [2019-12-27 06:52:44,663 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 06:52:44,663 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 39 [2019-12-27 06:52:44,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:52:44,696 INFO L225 Difference]: With dead ends: 23664 [2019-12-27 06:52:44,697 INFO L226 Difference]: Without dead ends: 23664 [2019-12-27 06:52:44,697 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-27 06:52:44,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23664 states. [2019-12-27 06:52:45,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23664 to 22129. [2019-12-27 06:52:45,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22129 states. [2019-12-27 06:52:45,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22129 states to 22129 states and 66460 transitions. [2019-12-27 06:52:45,249 INFO L78 Accepts]: Start accepts. Automaton has 22129 states and 66460 transitions. Word has length 39 [2019-12-27 06:52:45,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:52:45,249 INFO L462 AbstractCegarLoop]: Abstraction has 22129 states and 66460 transitions. [2019-12-27 06:52:45,249 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 06:52:45,249 INFO L276 IsEmpty]: Start isEmpty. Operand 22129 states and 66460 transitions. [2019-12-27 06:52:45,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-27 06:52:45,273 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:52:45,273 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:52:45,274 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:52:45,274 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:52:45,274 INFO L82 PathProgramCache]: Analyzing trace with hash 1240175328, now seen corresponding path program 2 times [2019-12-27 06:52:45,274 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:52:45,274 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [557618741] [2019-12-27 06:52:45,274 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:52:45,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:52:45,333 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:52:45,333 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [557618741] [2019-12-27 06:52:45,333 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:52:45,334 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 06:52:45,334 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1843419363] [2019-12-27 06:52:45,334 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 06:52:45,334 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:52:45,335 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 06:52:45,335 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 06:52:45,335 INFO L87 Difference]: Start difference. First operand 22129 states and 66460 transitions. Second operand 5 states. [2019-12-27 06:52:45,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:52:45,410 INFO L93 Difference]: Finished difference Result 20882 states and 63572 transitions. [2019-12-27 06:52:45,410 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 06:52:45,411 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 39 [2019-12-27 06:52:45,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:52:45,439 INFO L225 Difference]: With dead ends: 20882 [2019-12-27 06:52:45,439 INFO L226 Difference]: Without dead ends: 20882 [2019-12-27 06:52:45,442 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 06:52:45,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20882 states. [2019-12-27 06:52:45,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20882 to 20042. [2019-12-27 06:52:45,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20042 states. [2019-12-27 06:52:45,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20042 states to 20042 states and 61305 transitions. [2019-12-27 06:52:45,751 INFO L78 Accepts]: Start accepts. Automaton has 20042 states and 61305 transitions. Word has length 39 [2019-12-27 06:52:45,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:52:45,751 INFO L462 AbstractCegarLoop]: Abstraction has 20042 states and 61305 transitions. [2019-12-27 06:52:45,751 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 06:52:45,751 INFO L276 IsEmpty]: Start isEmpty. Operand 20042 states and 61305 transitions. [2019-12-27 06:52:45,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 06:52:45,772 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:52:45,772 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:52:45,772 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:52:45,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:52:45,772 INFO L82 PathProgramCache]: Analyzing trace with hash 480370435, now seen corresponding path program 1 times [2019-12-27 06:52:45,773 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:52:45,773 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1274121527] [2019-12-27 06:52:45,773 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:52:45,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:52:45,818 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:52:45,818 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1274121527] [2019-12-27 06:52:45,818 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:52:45,818 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 06:52:45,819 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [336586502] [2019-12-27 06:52:45,819 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 06:52:45,819 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:52:45,820 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 06:52:45,820 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 06:52:45,820 INFO L87 Difference]: Start difference. First operand 20042 states and 61305 transitions. Second operand 3 states. [2019-12-27 06:52:45,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:52:45,982 INFO L93 Difference]: Finished difference Result 29777 states and 91217 transitions. [2019-12-27 06:52:45,983 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 06:52:45,983 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 64 [2019-12-27 06:52:45,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:52:46,062 INFO L225 Difference]: With dead ends: 29777 [2019-12-27 06:52:46,063 INFO L226 Difference]: Without dead ends: 29777 [2019-12-27 06:52:46,063 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 06:52:46,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29777 states. [2019-12-27 06:52:46,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29777 to 22663. [2019-12-27 06:52:46,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22663 states. [2019-12-27 06:52:46,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22663 states to 22663 states and 70163 transitions. [2019-12-27 06:52:46,718 INFO L78 Accepts]: Start accepts. Automaton has 22663 states and 70163 transitions. Word has length 64 [2019-12-27 06:52:46,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:52:46,718 INFO L462 AbstractCegarLoop]: Abstraction has 22663 states and 70163 transitions. [2019-12-27 06:52:46,718 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 06:52:46,718 INFO L276 IsEmpty]: Start isEmpty. Operand 22663 states and 70163 transitions. [2019-12-27 06:52:46,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 06:52:46,750 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:52:46,750 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:52:46,750 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:52:46,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:52:46,751 INFO L82 PathProgramCache]: Analyzing trace with hash -2036276616, now seen corresponding path program 1 times [2019-12-27 06:52:46,751 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:52:46,751 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1545447415] [2019-12-27 06:52:46,751 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:52:46,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:52:46,868 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:52:46,868 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1545447415] [2019-12-27 06:52:46,869 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:52:46,869 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 06:52:46,869 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [298399411] [2019-12-27 06:52:46,870 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 06:52:46,870 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:52:46,871 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 06:52:46,871 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 06:52:46,871 INFO L87 Difference]: Start difference. First operand 22663 states and 70163 transitions. Second operand 4 states. [2019-12-27 06:52:47,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:52:47,269 INFO L93 Difference]: Finished difference Result 42597 states and 132112 transitions. [2019-12-27 06:52:47,269 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 06:52:47,269 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 64 [2019-12-27 06:52:47,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:52:47,299 INFO L225 Difference]: With dead ends: 42597 [2019-12-27 06:52:47,299 INFO L226 Difference]: Without dead ends: 21217 [2019-12-27 06:52:47,300 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 06:52:47,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21217 states. [2019-12-27 06:52:47,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21217 to 21217. [2019-12-27 06:52:47,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21217 states. [2019-12-27 06:52:47,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21217 states to 21217 states and 65595 transitions. [2019-12-27 06:52:47,642 INFO L78 Accepts]: Start accepts. Automaton has 21217 states and 65595 transitions. Word has length 64 [2019-12-27 06:52:47,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:52:47,643 INFO L462 AbstractCegarLoop]: Abstraction has 21217 states and 65595 transitions. [2019-12-27 06:52:47,643 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 06:52:47,643 INFO L276 IsEmpty]: Start isEmpty. Operand 21217 states and 65595 transitions. [2019-12-27 06:52:47,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 06:52:47,677 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:52:47,678 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:52:47,678 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:52:47,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:52:47,678 INFO L82 PathProgramCache]: Analyzing trace with hash -776574144, now seen corresponding path program 2 times [2019-12-27 06:52:47,678 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:52:47,679 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2116742502] [2019-12-27 06:52:47,679 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:52:47,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:52:47,769 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:52:47,769 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2116742502] [2019-12-27 06:52:47,769 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:52:47,769 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 06:52:47,770 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1041627182] [2019-12-27 06:52:47,770 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 06:52:47,770 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:52:47,770 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 06:52:47,771 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-27 06:52:47,771 INFO L87 Difference]: Start difference. First operand 21217 states and 65595 transitions. Second operand 7 states. [2019-12-27 06:52:48,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:52:48,299 INFO L93 Difference]: Finished difference Result 62594 states and 191097 transitions. [2019-12-27 06:52:48,299 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 06:52:48,299 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 64 [2019-12-27 06:52:48,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:52:48,364 INFO L225 Difference]: With dead ends: 62594 [2019-12-27 06:52:48,365 INFO L226 Difference]: Without dead ends: 42982 [2019-12-27 06:52:48,365 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2019-12-27 06:52:48,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42982 states. [2019-12-27 06:52:48,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42982 to 24204. [2019-12-27 06:52:48,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24204 states. [2019-12-27 06:52:48,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24204 states to 24204 states and 74744 transitions. [2019-12-27 06:52:48,886 INFO L78 Accepts]: Start accepts. Automaton has 24204 states and 74744 transitions. Word has length 64 [2019-12-27 06:52:48,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:52:48,886 INFO L462 AbstractCegarLoop]: Abstraction has 24204 states and 74744 transitions. [2019-12-27 06:52:48,886 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 06:52:48,886 INFO L276 IsEmpty]: Start isEmpty. Operand 24204 states and 74744 transitions. [2019-12-27 06:52:48,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 06:52:48,911 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:52:48,911 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:52:48,911 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:52:48,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:52:48,912 INFO L82 PathProgramCache]: Analyzing trace with hash 4176110, now seen corresponding path program 3 times [2019-12-27 06:52:48,912 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:52:48,912 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1094609850] [2019-12-27 06:52:48,912 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:52:48,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:52:49,006 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:52:49,007 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1094609850] [2019-12-27 06:52:49,007 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:52:49,007 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 06:52:49,007 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1132171686] [2019-12-27 06:52:49,008 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 06:52:49,008 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:52:49,008 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 06:52:49,008 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-27 06:52:49,008 INFO L87 Difference]: Start difference. First operand 24204 states and 74744 transitions. Second operand 7 states. [2019-12-27 06:52:49,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:52:49,979 INFO L93 Difference]: Finished difference Result 70069 states and 215496 transitions. [2019-12-27 06:52:49,979 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-27 06:52:49,979 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 64 [2019-12-27 06:52:49,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:52:50,066 INFO L225 Difference]: With dead ends: 70069 [2019-12-27 06:52:50,066 INFO L226 Difference]: Without dead ends: 52756 [2019-12-27 06:52:50,067 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=157, Unknown=0, NotChecked=0, Total=210 [2019-12-27 06:52:50,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52756 states. [2019-12-27 06:52:50,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52756 to 28331. [2019-12-27 06:52:50,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28331 states. [2019-12-27 06:52:50,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28331 states to 28331 states and 88059 transitions. [2019-12-27 06:52:50,688 INFO L78 Accepts]: Start accepts. Automaton has 28331 states and 88059 transitions. Word has length 64 [2019-12-27 06:52:50,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:52:50,688 INFO L462 AbstractCegarLoop]: Abstraction has 28331 states and 88059 transitions. [2019-12-27 06:52:50,688 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 06:52:50,688 INFO L276 IsEmpty]: Start isEmpty. Operand 28331 states and 88059 transitions. [2019-12-27 06:52:50,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 06:52:50,717 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:52:50,717 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:52:50,717 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:52:50,717 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:52:50,717 INFO L82 PathProgramCache]: Analyzing trace with hash 1890015084, now seen corresponding path program 4 times [2019-12-27 06:52:50,718 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:52:50,718 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1587751777] [2019-12-27 06:52:50,718 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:52:50,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:52:50,798 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:52:50,799 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1587751777] [2019-12-27 06:52:50,801 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:52:50,801 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 06:52:50,801 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1667094362] [2019-12-27 06:52:50,802 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 06:52:50,802 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:52:50,802 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 06:52:50,802 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-27 06:52:50,802 INFO L87 Difference]: Start difference. First operand 28331 states and 88059 transitions. Second operand 7 states. [2019-12-27 06:52:51,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:52:51,290 INFO L93 Difference]: Finished difference Result 60139 states and 184623 transitions. [2019-12-27 06:52:51,290 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-27 06:52:51,290 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 64 [2019-12-27 06:52:51,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:52:51,391 INFO L225 Difference]: With dead ends: 60139 [2019-12-27 06:52:51,391 INFO L226 Difference]: Without dead ends: 52780 [2019-12-27 06:52:51,391 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2019-12-27 06:52:51,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52780 states. [2019-12-27 06:52:52,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52780 to 28639. [2019-12-27 06:52:52,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28639 states. [2019-12-27 06:52:52,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28639 states to 28639 states and 89010 transitions. [2019-12-27 06:52:52,350 INFO L78 Accepts]: Start accepts. Automaton has 28639 states and 89010 transitions. Word has length 64 [2019-12-27 06:52:52,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:52:52,350 INFO L462 AbstractCegarLoop]: Abstraction has 28639 states and 89010 transitions. [2019-12-27 06:52:52,350 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 06:52:52,350 INFO L276 IsEmpty]: Start isEmpty. Operand 28639 states and 89010 transitions. [2019-12-27 06:52:52,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 06:52:52,381 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:52:52,381 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:52:52,381 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:52:52,381 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:52:52,381 INFO L82 PathProgramCache]: Analyzing trace with hash -1583546656, now seen corresponding path program 5 times [2019-12-27 06:52:52,382 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:52:52,382 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [165638099] [2019-12-27 06:52:52,382 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:52:52,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:52:52,438 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:52:52,438 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [165638099] [2019-12-27 06:52:52,438 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:52:52,438 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 06:52:52,439 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [198190427] [2019-12-27 06:52:52,439 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 06:52:52,439 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:52:52,439 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 06:52:52,440 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 06:52:52,440 INFO L87 Difference]: Start difference. First operand 28639 states and 89010 transitions. Second operand 3 states. [2019-12-27 06:52:52,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:52:52,655 INFO L93 Difference]: Finished difference Result 34404 states and 106219 transitions. [2019-12-27 06:52:52,655 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 06:52:52,656 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 64 [2019-12-27 06:52:52,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:52:52,726 INFO L225 Difference]: With dead ends: 34404 [2019-12-27 06:52:52,726 INFO L226 Difference]: Without dead ends: 34404 [2019-12-27 06:52:52,727 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 06:52:52,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34404 states. [2019-12-27 06:52:53,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34404 to 30218. [2019-12-27 06:52:53,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30218 states. [2019-12-27 06:52:53,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30218 states to 30218 states and 93973 transitions. [2019-12-27 06:52:53,265 INFO L78 Accepts]: Start accepts. Automaton has 30218 states and 93973 transitions. Word has length 64 [2019-12-27 06:52:53,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:52:53,265 INFO L462 AbstractCegarLoop]: Abstraction has 30218 states and 93973 transitions. [2019-12-27 06:52:53,265 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 06:52:53,265 INFO L276 IsEmpty]: Start isEmpty. Operand 30218 states and 93973 transitions. [2019-12-27 06:52:53,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 06:52:53,298 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:52:53,298 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:52:53,298 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:52:53,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:52:53,299 INFO L82 PathProgramCache]: Analyzing trace with hash 1838532524, now seen corresponding path program 1 times [2019-12-27 06:52:53,299 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:52:53,299 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1917338224] [2019-12-27 06:52:53,299 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:52:53,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:52:53,351 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:52:53,352 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1917338224] [2019-12-27 06:52:53,352 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:52:53,352 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 06:52:53,352 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1277447853] [2019-12-27 06:52:53,353 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 06:52:53,353 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:52:53,353 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 06:52:53,353 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 06:52:53,354 INFO L87 Difference]: Start difference. First operand 30218 states and 93973 transitions. Second operand 4 states. [2019-12-27 06:52:53,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:52:53,589 INFO L93 Difference]: Finished difference Result 38058 states and 117223 transitions. [2019-12-27 06:52:53,589 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 06:52:53,589 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 65 [2019-12-27 06:52:53,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:52:53,645 INFO L225 Difference]: With dead ends: 38058 [2019-12-27 06:52:53,645 INFO L226 Difference]: Without dead ends: 38058 [2019-12-27 06:52:53,645 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 06:52:53,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38058 states. [2019-12-27 06:52:54,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38058 to 30836. [2019-12-27 06:52:54,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30836 states. [2019-12-27 06:52:54,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30836 states to 30836 states and 95961 transitions. [2019-12-27 06:52:54,565 INFO L78 Accepts]: Start accepts. Automaton has 30836 states and 95961 transitions. Word has length 65 [2019-12-27 06:52:54,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:52:54,566 INFO L462 AbstractCegarLoop]: Abstraction has 30836 states and 95961 transitions. [2019-12-27 06:52:54,566 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 06:52:54,566 INFO L276 IsEmpty]: Start isEmpty. Operand 30836 states and 95961 transitions. [2019-12-27 06:52:54,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 06:52:54,600 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:52:54,600 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:52:54,600 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:52:54,601 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:52:54,601 INFO L82 PathProgramCache]: Analyzing trace with hash 1450523796, now seen corresponding path program 2 times [2019-12-27 06:52:54,601 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:52:54,601 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [774803631] [2019-12-27 06:52:54,601 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:52:54,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:52:54,652 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:52:54,653 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [774803631] [2019-12-27 06:52:54,653 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:52:54,653 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 06:52:54,653 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [680652563] [2019-12-27 06:52:54,654 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 06:52:54,654 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:52:54,654 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 06:52:54,654 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 06:52:54,655 INFO L87 Difference]: Start difference. First operand 30836 states and 95961 transitions. Second operand 4 states. [2019-12-27 06:52:55,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:52:55,032 INFO L93 Difference]: Finished difference Result 48141 states and 150231 transitions. [2019-12-27 06:52:55,035 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 06:52:55,035 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 65 [2019-12-27 06:52:55,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:52:55,131 INFO L225 Difference]: With dead ends: 48141 [2019-12-27 06:52:55,131 INFO L226 Difference]: Without dead ends: 48141 [2019-12-27 06:52:55,132 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 06:52:55,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48141 states. [2019-12-27 06:52:55,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48141 to 32995. [2019-12-27 06:52:55,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32995 states. [2019-12-27 06:52:55,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32995 states to 32995 states and 103746 transitions. [2019-12-27 06:52:55,807 INFO L78 Accepts]: Start accepts. Automaton has 32995 states and 103746 transitions. Word has length 65 [2019-12-27 06:52:55,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:52:55,808 INFO L462 AbstractCegarLoop]: Abstraction has 32995 states and 103746 transitions. [2019-12-27 06:52:55,808 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 06:52:55,808 INFO L276 IsEmpty]: Start isEmpty. Operand 32995 states and 103746 transitions. [2019-12-27 06:52:55,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 06:52:55,847 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:52:55,847 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:52:55,847 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:52:55,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:52:55,848 INFO L82 PathProgramCache]: Analyzing trace with hash 1631986328, now seen corresponding path program 3 times [2019-12-27 06:52:55,848 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:52:55,848 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [289742137] [2019-12-27 06:52:55,848 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:52:55,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:52:55,920 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:52:55,921 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [289742137] [2019-12-27 06:52:55,921 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:52:55,921 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 06:52:55,921 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [951462238] [2019-12-27 06:52:55,922 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 06:52:55,922 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:52:55,922 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 06:52:55,922 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-27 06:52:55,922 INFO L87 Difference]: Start difference. First operand 32995 states and 103746 transitions. Second operand 7 states. [2019-12-27 06:52:56,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:52:56,496 INFO L93 Difference]: Finished difference Result 72421 states and 224911 transitions. [2019-12-27 06:52:56,497 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-27 06:52:56,497 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 65 [2019-12-27 06:52:56,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:52:56,603 INFO L225 Difference]: With dead ends: 72421 [2019-12-27 06:52:56,604 INFO L226 Difference]: Without dead ends: 66202 [2019-12-27 06:52:56,604 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2019-12-27 06:52:56,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66202 states. [2019-12-27 06:52:57,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66202 to 33027. [2019-12-27 06:52:57,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33027 states. [2019-12-27 06:52:57,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33027 states to 33027 states and 103864 transitions. [2019-12-27 06:52:57,757 INFO L78 Accepts]: Start accepts. Automaton has 33027 states and 103864 transitions. Word has length 65 [2019-12-27 06:52:57,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:52:57,757 INFO L462 AbstractCegarLoop]: Abstraction has 33027 states and 103864 transitions. [2019-12-27 06:52:57,757 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 06:52:57,757 INFO L276 IsEmpty]: Start isEmpty. Operand 33027 states and 103864 transitions. [2019-12-27 06:52:57,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 06:52:57,796 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:52:57,796 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:52:57,796 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:52:57,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:52:57,796 INFO L82 PathProgramCache]: Analyzing trace with hash -855143256, now seen corresponding path program 4 times [2019-12-27 06:52:57,796 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:52:57,796 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1508331996] [2019-12-27 06:52:57,797 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:52:57,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:52:57,893 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:52:57,893 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1508331996] [2019-12-27 06:52:57,893 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:52:57,893 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 06:52:57,893 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [298137575] [2019-12-27 06:52:57,894 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 06:52:57,894 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:52:57,894 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 06:52:57,894 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-27 06:52:57,895 INFO L87 Difference]: Start difference. First operand 33027 states and 103864 transitions. Second operand 7 states. [2019-12-27 06:52:58,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:52:58,773 INFO L93 Difference]: Finished difference Result 53845 states and 170272 transitions. [2019-12-27 06:52:58,774 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-27 06:52:58,774 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 65 [2019-12-27 06:52:58,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:52:58,923 INFO L225 Difference]: With dead ends: 53845 [2019-12-27 06:52:58,923 INFO L226 Difference]: Without dead ends: 53845 [2019-12-27 06:52:58,925 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2019-12-27 06:52:59,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53845 states. [2019-12-27 06:52:59,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53845 to 34199. [2019-12-27 06:52:59,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34199 states. [2019-12-27 06:52:59,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34199 states to 34199 states and 107426 transitions. [2019-12-27 06:52:59,770 INFO L78 Accepts]: Start accepts. Automaton has 34199 states and 107426 transitions. Word has length 65 [2019-12-27 06:52:59,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:52:59,772 INFO L462 AbstractCegarLoop]: Abstraction has 34199 states and 107426 transitions. [2019-12-27 06:52:59,772 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 06:52:59,772 INFO L276 IsEmpty]: Start isEmpty. Operand 34199 states and 107426 transitions. [2019-12-27 06:53:00,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 06:53:00,268 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:53:00,268 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:53:00,268 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:53:00,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:53:00,269 INFO L82 PathProgramCache]: Analyzing trace with hash -1607407314, now seen corresponding path program 1 times [2019-12-27 06:53:00,269 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:53:00,270 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1092480060] [2019-12-27 06:53:00,270 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:53:00,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:53:00,361 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:53:00,361 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1092480060] [2019-12-27 06:53:00,362 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:53:00,362 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 06:53:00,362 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1663234023] [2019-12-27 06:53:00,362 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 06:53:00,362 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:53:00,363 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 06:53:00,363 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 06:53:00,365 INFO L87 Difference]: Start difference. First operand 34199 states and 107426 transitions. Second operand 5 states. [2019-12-27 06:53:01,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:53:01,047 INFO L93 Difference]: Finished difference Result 49777 states and 152916 transitions. [2019-12-27 06:53:01,047 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 06:53:01,047 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 65 [2019-12-27 06:53:01,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:53:01,125 INFO L225 Difference]: With dead ends: 49777 [2019-12-27 06:53:01,125 INFO L226 Difference]: Without dead ends: 49557 [2019-12-27 06:53:01,126 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-27 06:53:01,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49557 states. [2019-12-27 06:53:01,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49557 to 39728. [2019-12-27 06:53:01,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39728 states. [2019-12-27 06:53:01,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39728 states to 39728 states and 124203 transitions. [2019-12-27 06:53:01,845 INFO L78 Accepts]: Start accepts. Automaton has 39728 states and 124203 transitions. Word has length 65 [2019-12-27 06:53:01,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:53:01,846 INFO L462 AbstractCegarLoop]: Abstraction has 39728 states and 124203 transitions. [2019-12-27 06:53:01,846 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 06:53:01,846 INFO L276 IsEmpty]: Start isEmpty. Operand 39728 states and 124203 transitions. [2019-12-27 06:53:01,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 06:53:01,895 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:53:01,895 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:53:01,896 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:53:01,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:53:01,896 INFO L82 PathProgramCache]: Analyzing trace with hash 99240326, now seen corresponding path program 2 times [2019-12-27 06:53:01,896 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:53:01,896 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2146916225] [2019-12-27 06:53:01,896 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:53:01,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:53:02,010 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:53:02,012 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2146916225] [2019-12-27 06:53:02,013 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:53:02,013 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 06:53:02,014 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1236301220] [2019-12-27 06:53:02,014 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 06:53:02,014 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:53:02,015 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 06:53:02,015 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-12-27 06:53:02,015 INFO L87 Difference]: Start difference. First operand 39728 states and 124203 transitions. Second operand 8 states. [2019-12-27 06:53:03,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:53:03,422 INFO L93 Difference]: Finished difference Result 59625 states and 183241 transitions. [2019-12-27 06:53:03,422 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-12-27 06:53:03,422 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 65 [2019-12-27 06:53:03,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:53:03,517 INFO L225 Difference]: With dead ends: 59625 [2019-12-27 06:53:03,517 INFO L226 Difference]: Without dead ends: 59513 [2019-12-27 06:53:03,518 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 4 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=170, Unknown=0, NotChecked=0, Total=240 [2019-12-27 06:53:03,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59513 states. [2019-12-27 06:53:04,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59513 to 40852. [2019-12-27 06:53:04,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40852 states. [2019-12-27 06:53:04,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40852 states to 40852 states and 127127 transitions. [2019-12-27 06:53:04,685 INFO L78 Accepts]: Start accepts. Automaton has 40852 states and 127127 transitions. Word has length 65 [2019-12-27 06:53:04,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:53:04,686 INFO L462 AbstractCegarLoop]: Abstraction has 40852 states and 127127 transitions. [2019-12-27 06:53:04,686 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 06:53:04,686 INFO L276 IsEmpty]: Start isEmpty. Operand 40852 states and 127127 transitions. [2019-12-27 06:53:04,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 06:53:04,732 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:53:04,732 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:53:04,732 INFO L410 AbstractCegarLoop]: === Iteration 24 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:53:04,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:53:04,733 INFO L82 PathProgramCache]: Analyzing trace with hash -154311598, now seen corresponding path program 3 times [2019-12-27 06:53:04,733 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:53:04,733 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [42774756] [2019-12-27 06:53:04,733 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:53:04,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:53:04,884 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:53:04,884 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [42774756] [2019-12-27 06:53:04,884 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:53:04,885 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-27 06:53:04,885 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2146061941] [2019-12-27 06:53:04,887 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-27 06:53:04,887 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:53:04,887 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-27 06:53:04,887 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2019-12-27 06:53:04,888 INFO L87 Difference]: Start difference. First operand 40852 states and 127127 transitions. Second operand 10 states. [2019-12-27 06:53:08,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:53:08,021 INFO L93 Difference]: Finished difference Result 62437 states and 190755 transitions. [2019-12-27 06:53:08,021 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-12-27 06:53:08,021 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 65 [2019-12-27 06:53:08,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:53:08,119 INFO L225 Difference]: With dead ends: 62437 [2019-12-27 06:53:08,119 INFO L226 Difference]: Without dead ends: 62141 [2019-12-27 06:53:08,120 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 4 SyntacticMatches, 4 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 221 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=215, Invalid=777, Unknown=0, NotChecked=0, Total=992 [2019-12-27 06:53:08,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62141 states. [2019-12-27 06:53:09,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62141 to 44129. [2019-12-27 06:53:09,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44129 states. [2019-12-27 06:53:09,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44129 states to 44129 states and 136879 transitions. [2019-12-27 06:53:09,393 INFO L78 Accepts]: Start accepts. Automaton has 44129 states and 136879 transitions. Word has length 65 [2019-12-27 06:53:09,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:53:09,394 INFO L462 AbstractCegarLoop]: Abstraction has 44129 states and 136879 transitions. [2019-12-27 06:53:09,394 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-27 06:53:09,394 INFO L276 IsEmpty]: Start isEmpty. Operand 44129 states and 136879 transitions. [2019-12-27 06:53:09,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 06:53:09,444 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:53:09,444 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:53:09,444 INFO L410 AbstractCegarLoop]: === Iteration 25 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:53:09,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:53:09,445 INFO L82 PathProgramCache]: Analyzing trace with hash -1583496514, now seen corresponding path program 4 times [2019-12-27 06:53:09,445 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:53:09,445 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [983071516] [2019-12-27 06:53:09,445 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:53:09,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:53:09,506 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:53:09,506 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [983071516] [2019-12-27 06:53:09,507 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:53:09,507 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 06:53:09,507 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [901223920] [2019-12-27 06:53:09,508 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 06:53:09,508 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:53:09,508 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 06:53:09,508 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 06:53:09,509 INFO L87 Difference]: Start difference. First operand 44129 states and 136879 transitions. Second operand 3 states. [2019-12-27 06:53:09,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:53:09,698 INFO L93 Difference]: Finished difference Result 44129 states and 136878 transitions. [2019-12-27 06:53:09,698 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 06:53:09,699 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-27 06:53:09,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:53:09,773 INFO L225 Difference]: With dead ends: 44129 [2019-12-27 06:53:09,774 INFO L226 Difference]: Without dead ends: 44129 [2019-12-27 06:53:09,774 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 06:53:09,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44129 states. [2019-12-27 06:53:10,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44129 to 37314. [2019-12-27 06:53:10,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37314 states. [2019-12-27 06:53:10,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37314 states to 37314 states and 117566 transitions. [2019-12-27 06:53:10,487 INFO L78 Accepts]: Start accepts. Automaton has 37314 states and 117566 transitions. Word has length 65 [2019-12-27 06:53:10,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:53:10,487 INFO L462 AbstractCegarLoop]: Abstraction has 37314 states and 117566 transitions. [2019-12-27 06:53:10,487 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 06:53:10,487 INFO L276 IsEmpty]: Start isEmpty. Operand 37314 states and 117566 transitions. [2019-12-27 06:53:10,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 06:53:10,530 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:53:10,531 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:53:10,531 INFO L410 AbstractCegarLoop]: === Iteration 26 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:53:10,531 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:53:10,531 INFO L82 PathProgramCache]: Analyzing trace with hash -1323575748, now seen corresponding path program 1 times [2019-12-27 06:53:10,531 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:53:10,531 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [726453817] [2019-12-27 06:53:10,531 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:53:10,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:53:10,724 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:53:10,725 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [726453817] [2019-12-27 06:53:10,725 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:53:10,726 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-27 06:53:10,726 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1615912290] [2019-12-27 06:53:10,726 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-27 06:53:10,726 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:53:10,727 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-27 06:53:10,727 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-12-27 06:53:10,727 INFO L87 Difference]: Start difference. First operand 37314 states and 117566 transitions. Second operand 10 states. [2019-12-27 06:53:12,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:53:12,519 INFO L93 Difference]: Finished difference Result 49030 states and 152122 transitions. [2019-12-27 06:53:12,520 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-27 06:53:12,520 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 66 [2019-12-27 06:53:12,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:53:12,597 INFO L225 Difference]: With dead ends: 49030 [2019-12-27 06:53:12,597 INFO L226 Difference]: Without dead ends: 49030 [2019-12-27 06:53:12,598 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 4 SyntacticMatches, 4 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=81, Invalid=261, Unknown=0, NotChecked=0, Total=342 [2019-12-27 06:53:12,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49030 states. [2019-12-27 06:53:13,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49030 to 37403. [2019-12-27 06:53:13,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37403 states. [2019-12-27 06:53:13,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37403 states to 37403 states and 117868 transitions. [2019-12-27 06:53:13,689 INFO L78 Accepts]: Start accepts. Automaton has 37403 states and 117868 transitions. Word has length 66 [2019-12-27 06:53:13,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:53:13,689 INFO L462 AbstractCegarLoop]: Abstraction has 37403 states and 117868 transitions. [2019-12-27 06:53:13,689 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-27 06:53:13,689 INFO L276 IsEmpty]: Start isEmpty. Operand 37403 states and 117868 transitions. [2019-12-27 06:53:13,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 06:53:13,734 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:53:13,735 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:53:13,735 INFO L410 AbstractCegarLoop]: === Iteration 27 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:53:13,735 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:53:13,735 INFO L82 PathProgramCache]: Analyzing trace with hash -871413024, now seen corresponding path program 2 times [2019-12-27 06:53:13,735 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:53:13,735 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1572325967] [2019-12-27 06:53:13,735 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:53:13,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:53:13,793 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:53:13,793 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1572325967] [2019-12-27 06:53:13,794 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:53:13,794 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 06:53:13,794 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [374094745] [2019-12-27 06:53:13,794 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 06:53:13,794 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:53:13,795 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 06:53:13,795 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 06:53:13,795 INFO L87 Difference]: Start difference. First operand 37403 states and 117868 transitions. Second operand 3 states. [2019-12-27 06:53:13,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:53:13,946 INFO L93 Difference]: Finished difference Result 28362 states and 88102 transitions. [2019-12-27 06:53:13,947 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 06:53:13,947 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-12-27 06:53:13,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:53:14,018 INFO L225 Difference]: With dead ends: 28362 [2019-12-27 06:53:14,019 INFO L226 Difference]: Without dead ends: 28362 [2019-12-27 06:53:14,019 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 06:53:14,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28362 states. [2019-12-27 06:53:14,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28362 to 27035. [2019-12-27 06:53:14,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27035 states. [2019-12-27 06:53:14,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27035 states to 27035 states and 83886 transitions. [2019-12-27 06:53:14,727 INFO L78 Accepts]: Start accepts. Automaton has 27035 states and 83886 transitions. Word has length 66 [2019-12-27 06:53:14,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:53:14,728 INFO L462 AbstractCegarLoop]: Abstraction has 27035 states and 83886 transitions. [2019-12-27 06:53:14,728 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 06:53:14,728 INFO L276 IsEmpty]: Start isEmpty. Operand 27035 states and 83886 transitions. [2019-12-27 06:53:14,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 06:53:14,779 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:53:14,779 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:53:14,779 INFO L410 AbstractCegarLoop]: === Iteration 28 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:53:14,779 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:53:14,780 INFO L82 PathProgramCache]: Analyzing trace with hash -1134321916, now seen corresponding path program 1 times [2019-12-27 06:53:14,780 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:53:14,780 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1898021919] [2019-12-27 06:53:14,780 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:53:14,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:53:15,301 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:53:15,302 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1898021919] [2019-12-27 06:53:15,302 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:53:15,302 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-27 06:53:15,302 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [8216247] [2019-12-27 06:53:15,303 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-27 06:53:15,303 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:53:15,304 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-27 06:53:15,304 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2019-12-27 06:53:15,305 INFO L87 Difference]: Start difference. First operand 27035 states and 83886 transitions. Second operand 15 states. [2019-12-27 06:53:20,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:53:20,749 INFO L93 Difference]: Finished difference Result 59894 states and 183484 transitions. [2019-12-27 06:53:20,749 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2019-12-27 06:53:20,749 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 67 [2019-12-27 06:53:20,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:53:20,819 INFO L225 Difference]: With dead ends: 59894 [2019-12-27 06:53:20,819 INFO L226 Difference]: Without dead ends: 50130 [2019-12-27 06:53:20,821 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 0 SyntacticMatches, 3 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1216 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=620, Invalid=3412, Unknown=0, NotChecked=0, Total=4032 [2019-12-27 06:53:20,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50130 states. [2019-12-27 06:53:21,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50130 to 27699. [2019-12-27 06:53:21,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27699 states. [2019-12-27 06:53:21,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27699 states to 27699 states and 85507 transitions. [2019-12-27 06:53:21,408 INFO L78 Accepts]: Start accepts. Automaton has 27699 states and 85507 transitions. Word has length 67 [2019-12-27 06:53:21,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:53:21,408 INFO L462 AbstractCegarLoop]: Abstraction has 27699 states and 85507 transitions. [2019-12-27 06:53:21,408 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-27 06:53:21,408 INFO L276 IsEmpty]: Start isEmpty. Operand 27699 states and 85507 transitions. [2019-12-27 06:53:21,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 06:53:21,439 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:53:21,439 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:53:21,440 INFO L410 AbstractCegarLoop]: === Iteration 29 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:53:21,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:53:21,440 INFO L82 PathProgramCache]: Analyzing trace with hash 744299942, now seen corresponding path program 2 times [2019-12-27 06:53:21,440 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:53:21,440 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [378537810] [2019-12-27 06:53:21,440 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:53:21,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:53:21,800 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:53:21,800 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [378537810] [2019-12-27 06:53:21,801 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:53:21,801 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-27 06:53:21,801 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [819231246] [2019-12-27 06:53:21,801 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-27 06:53:21,801 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:53:21,802 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-27 06:53:21,802 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=176, Unknown=0, NotChecked=0, Total=210 [2019-12-27 06:53:21,802 INFO L87 Difference]: Start difference. First operand 27699 states and 85507 transitions. Second operand 15 states. [2019-12-27 06:53:26,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:53:26,267 INFO L93 Difference]: Finished difference Result 50435 states and 154162 transitions. [2019-12-27 06:53:26,268 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2019-12-27 06:53:26,268 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 67 [2019-12-27 06:53:26,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:53:26,331 INFO L225 Difference]: With dead ends: 50435 [2019-12-27 06:53:26,331 INFO L226 Difference]: Without dead ends: 49776 [2019-12-27 06:53:26,332 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 0 SyntacticMatches, 3 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 825 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=497, Invalid=2473, Unknown=0, NotChecked=0, Total=2970 [2019-12-27 06:53:26,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49776 states. [2019-12-27 06:53:26,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49776 to 27459. [2019-12-27 06:53:26,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27459 states. [2019-12-27 06:53:26,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27459 states to 27459 states and 84851 transitions. [2019-12-27 06:53:26,868 INFO L78 Accepts]: Start accepts. Automaton has 27459 states and 84851 transitions. Word has length 67 [2019-12-27 06:53:26,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:53:26,868 INFO L462 AbstractCegarLoop]: Abstraction has 27459 states and 84851 transitions. [2019-12-27 06:53:26,868 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-27 06:53:26,868 INFO L276 IsEmpty]: Start isEmpty. Operand 27459 states and 84851 transitions. [2019-12-27 06:53:26,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 06:53:26,899 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:53:26,899 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:53:26,899 INFO L410 AbstractCegarLoop]: === Iteration 30 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:53:26,899 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:53:26,900 INFO L82 PathProgramCache]: Analyzing trace with hash 1184662856, now seen corresponding path program 1 times [2019-12-27 06:53:26,900 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:53:26,900 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2085904073] [2019-12-27 06:53:26,900 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:53:26,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:53:26,962 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:53:26,963 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2085904073] [2019-12-27 06:53:26,963 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:53:26,963 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 06:53:26,964 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1959770749] [2019-12-27 06:53:26,964 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 06:53:26,964 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:53:26,964 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 06:53:26,964 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 06:53:26,965 INFO L87 Difference]: Start difference. First operand 27459 states and 84851 transitions. Second operand 4 states. [2019-12-27 06:53:27,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:53:27,227 INFO L93 Difference]: Finished difference Result 27459 states and 84587 transitions. [2019-12-27 06:53:27,227 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 06:53:27,228 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 67 [2019-12-27 06:53:27,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:53:27,298 INFO L225 Difference]: With dead ends: 27459 [2019-12-27 06:53:27,298 INFO L226 Difference]: Without dead ends: 27459 [2019-12-27 06:53:27,301 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 06:53:27,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27459 states. [2019-12-27 06:53:27,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27459 to 23333. [2019-12-27 06:53:27,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23333 states. [2019-12-27 06:53:27,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23333 states to 23333 states and 71725 transitions. [2019-12-27 06:53:27,821 INFO L78 Accepts]: Start accepts. Automaton has 23333 states and 71725 transitions. Word has length 67 [2019-12-27 06:53:27,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:53:27,821 INFO L462 AbstractCegarLoop]: Abstraction has 23333 states and 71725 transitions. [2019-12-27 06:53:27,821 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 06:53:27,821 INFO L276 IsEmpty]: Start isEmpty. Operand 23333 states and 71725 transitions. [2019-12-27 06:53:27,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 06:53:27,847 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:53:27,847 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:53:27,847 INFO L410 AbstractCegarLoop]: === Iteration 31 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:53:27,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:53:27,847 INFO L82 PathProgramCache]: Analyzing trace with hash -1579837296, now seen corresponding path program 3 times [2019-12-27 06:53:27,848 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:53:27,848 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [957084378] [2019-12-27 06:53:27,848 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:53:27,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:53:28,223 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:53:28,223 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [957084378] [2019-12-27 06:53:28,223 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:53:28,224 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-27 06:53:28,224 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [333425165] [2019-12-27 06:53:28,224 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-27 06:53:28,224 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:53:28,224 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-27 06:53:28,225 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2019-12-27 06:53:28,225 INFO L87 Difference]: Start difference. First operand 23333 states and 71725 transitions. Second operand 15 states. [2019-12-27 06:53:34,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:53:34,071 INFO L93 Difference]: Finished difference Result 57446 states and 175809 transitions. [2019-12-27 06:53:34,072 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2019-12-27 06:53:34,072 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 67 [2019-12-27 06:53:34,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:53:34,149 INFO L225 Difference]: With dead ends: 57446 [2019-12-27 06:53:34,149 INFO L226 Difference]: Without dead ends: 55231 [2019-12-27 06:53:34,151 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1185 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=576, Invalid=3456, Unknown=0, NotChecked=0, Total=4032 [2019-12-27 06:53:34,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55231 states. [2019-12-27 06:53:34,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55231 to 29484. [2019-12-27 06:53:34,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29484 states. [2019-12-27 06:53:34,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29484 states to 29484 states and 91211 transitions. [2019-12-27 06:53:34,817 INFO L78 Accepts]: Start accepts. Automaton has 29484 states and 91211 transitions. Word has length 67 [2019-12-27 06:53:34,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:53:34,817 INFO L462 AbstractCegarLoop]: Abstraction has 29484 states and 91211 transitions. [2019-12-27 06:53:34,817 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-27 06:53:34,818 INFO L276 IsEmpty]: Start isEmpty. Operand 29484 states and 91211 transitions. [2019-12-27 06:53:34,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 06:53:34,849 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:53:34,849 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:53:34,850 INFO L410 AbstractCegarLoop]: === Iteration 32 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:53:34,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:53:34,850 INFO L82 PathProgramCache]: Analyzing trace with hash 1338235554, now seen corresponding path program 4 times [2019-12-27 06:53:34,850 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:53:34,850 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1617705629] [2019-12-27 06:53:34,850 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:53:34,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:53:35,391 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:53:35,391 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1617705629] [2019-12-27 06:53:35,392 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:53:35,392 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-27 06:53:35,392 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1617430287] [2019-12-27 06:53:35,393 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-27 06:53:35,393 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:53:35,395 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-27 06:53:35,395 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2019-12-27 06:53:35,395 INFO L87 Difference]: Start difference. First operand 29484 states and 91211 transitions. Second operand 15 states. [2019-12-27 06:53:39,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:53:39,817 INFO L93 Difference]: Finished difference Result 56134 states and 171135 transitions. [2019-12-27 06:53:39,818 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2019-12-27 06:53:39,818 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 67 [2019-12-27 06:53:39,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:53:39,880 INFO L225 Difference]: With dead ends: 56134 [2019-12-27 06:53:39,880 INFO L226 Difference]: Without dead ends: 42377 [2019-12-27 06:53:39,882 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 758 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=490, Invalid=2372, Unknown=0, NotChecked=0, Total=2862 [2019-12-27 06:53:40,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42377 states. [2019-12-27 06:53:40,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42377 to 23236. [2019-12-27 06:53:40,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23236 states. [2019-12-27 06:53:40,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23236 states to 23236 states and 71151 transitions. [2019-12-27 06:53:40,559 INFO L78 Accepts]: Start accepts. Automaton has 23236 states and 71151 transitions. Word has length 67 [2019-12-27 06:53:40,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:53:40,559 INFO L462 AbstractCegarLoop]: Abstraction has 23236 states and 71151 transitions. [2019-12-27 06:53:40,559 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-27 06:53:40,559 INFO L276 IsEmpty]: Start isEmpty. Operand 23236 states and 71151 transitions. [2019-12-27 06:53:40,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 06:53:40,581 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:53:40,581 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:53:40,582 INFO L410 AbstractCegarLoop]: === Iteration 33 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:53:40,582 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:53:40,582 INFO L82 PathProgramCache]: Analyzing trace with hash 2122626696, now seen corresponding path program 5 times [2019-12-27 06:53:40,582 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:53:40,582 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1250427016] [2019-12-27 06:53:40,582 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:53:40,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:53:41,030 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:53:41,030 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1250427016] [2019-12-27 06:53:41,031 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:53:41,031 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-27 06:53:41,031 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1372083633] [2019-12-27 06:53:41,031 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-27 06:53:41,031 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:53:41,032 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-27 06:53:41,032 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=203, Unknown=0, NotChecked=0, Total=240 [2019-12-27 06:53:41,032 INFO L87 Difference]: Start difference. First operand 23236 states and 71151 transitions. Second operand 16 states. [2019-12-27 06:53:45,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:53:45,605 INFO L93 Difference]: Finished difference Result 45173 states and 137213 transitions. [2019-12-27 06:53:45,605 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2019-12-27 06:53:45,605 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 67 [2019-12-27 06:53:45,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:53:45,672 INFO L225 Difference]: With dead ends: 45173 [2019-12-27 06:53:45,672 INFO L226 Difference]: Without dead ends: 44406 [2019-12-27 06:53:45,673 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 0 SyntacticMatches, 3 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 852 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=493, Invalid=2699, Unknown=0, NotChecked=0, Total=3192 [2019-12-27 06:53:45,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44406 states. [2019-12-27 06:53:46,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44406 to 25528. [2019-12-27 06:53:46,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25528 states. [2019-12-27 06:53:46,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25528 states to 25528 states and 78155 transitions. [2019-12-27 06:53:46,223 INFO L78 Accepts]: Start accepts. Automaton has 25528 states and 78155 transitions. Word has length 67 [2019-12-27 06:53:46,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:53:46,224 INFO L462 AbstractCegarLoop]: Abstraction has 25528 states and 78155 transitions. [2019-12-27 06:53:46,224 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-27 06:53:46,224 INFO L276 IsEmpty]: Start isEmpty. Operand 25528 states and 78155 transitions. [2019-12-27 06:53:46,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 06:53:46,253 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:53:46,253 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:53:46,253 INFO L410 AbstractCegarLoop]: === Iteration 34 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:53:46,254 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:53:46,254 INFO L82 PathProgramCache]: Analyzing trace with hash 745732250, now seen corresponding path program 6 times [2019-12-27 06:53:46,254 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:53:46,254 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1958623802] [2019-12-27 06:53:46,254 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:53:46,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:53:46,640 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:53:46,641 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1958623802] [2019-12-27 06:53:46,641 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:53:46,641 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-27 06:53:46,641 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1711755864] [2019-12-27 06:53:46,641 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-27 06:53:46,642 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:53:46,642 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-27 06:53:46,642 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=199, Unknown=0, NotChecked=0, Total=240 [2019-12-27 06:53:46,642 INFO L87 Difference]: Start difference. First operand 25528 states and 78155 transitions. Second operand 16 states. [2019-12-27 06:53:51,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:53:51,999 INFO L93 Difference]: Finished difference Result 44992 states and 136192 transitions. [2019-12-27 06:53:51,999 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2019-12-27 06:53:52,000 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 67 [2019-12-27 06:53:52,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:53:52,063 INFO L225 Difference]: With dead ends: 44992 [2019-12-27 06:53:52,063 INFO L226 Difference]: Without dead ends: 42305 [2019-12-27 06:53:52,064 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 0 SyntacticMatches, 3 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 773 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=511, Invalid=2459, Unknown=0, NotChecked=0, Total=2970 [2019-12-27 06:53:52,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42305 states. [2019-12-27 06:53:52,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42305 to 23218. [2019-12-27 06:53:52,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23218 states. [2019-12-27 06:53:52,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23218 states to 23218 states and 71117 transitions. [2019-12-27 06:53:52,556 INFO L78 Accepts]: Start accepts. Automaton has 23218 states and 71117 transitions. Word has length 67 [2019-12-27 06:53:52,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:53:52,556 INFO L462 AbstractCegarLoop]: Abstraction has 23218 states and 71117 transitions. [2019-12-27 06:53:52,556 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-27 06:53:52,556 INFO L276 IsEmpty]: Start isEmpty. Operand 23218 states and 71117 transitions. [2019-12-27 06:53:52,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 06:53:52,582 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:53:52,582 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:53:52,583 INFO L410 AbstractCegarLoop]: === Iteration 35 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:53:52,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:53:52,583 INFO L82 PathProgramCache]: Analyzing trace with hash 1590486634, now seen corresponding path program 7 times [2019-12-27 06:53:52,583 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:53:52,583 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [941344568] [2019-12-27 06:53:52,583 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:53:52,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:53:52,691 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:53:52,691 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [941344568] [2019-12-27 06:53:52,692 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:53:52,692 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 06:53:52,692 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [488529036] [2019-12-27 06:53:52,692 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 06:53:52,692 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:53:52,693 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 06:53:52,693 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-12-27 06:53:52,693 INFO L87 Difference]: Start difference. First operand 23218 states and 71117 transitions. Second operand 9 states. [2019-12-27 06:53:54,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:53:54,014 INFO L93 Difference]: Finished difference Result 38000 states and 115479 transitions. [2019-12-27 06:53:54,014 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-27 06:53:54,015 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 67 [2019-12-27 06:53:54,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:53:54,059 INFO L225 Difference]: With dead ends: 38000 [2019-12-27 06:53:54,060 INFO L226 Difference]: Without dead ends: 31390 [2019-12-27 06:53:54,060 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=241, Unknown=0, NotChecked=0, Total=306 [2019-12-27 06:53:54,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31390 states. [2019-12-27 06:53:54,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31390 to 23112. [2019-12-27 06:53:54,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23112 states. [2019-12-27 06:53:54,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23112 states to 23112 states and 70702 transitions. [2019-12-27 06:53:54,471 INFO L78 Accepts]: Start accepts. Automaton has 23112 states and 70702 transitions. Word has length 67 [2019-12-27 06:53:54,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:53:54,471 INFO L462 AbstractCegarLoop]: Abstraction has 23112 states and 70702 transitions. [2019-12-27 06:53:54,471 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 06:53:54,471 INFO L276 IsEmpty]: Start isEmpty. Operand 23112 states and 70702 transitions. [2019-12-27 06:53:54,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 06:53:54,496 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:53:54,496 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:53:54,496 INFO L410 AbstractCegarLoop]: === Iteration 36 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:53:54,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:53:54,496 INFO L82 PathProgramCache]: Analyzing trace with hash 2065181176, now seen corresponding path program 8 times [2019-12-27 06:53:54,497 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:53:54,497 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [450404983] [2019-12-27 06:53:54,497 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:53:54,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:53:54,903 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:53:54,904 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [450404983] [2019-12-27 06:53:54,904 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:53:54,904 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 06:53:54,904 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [334097139] [2019-12-27 06:53:54,905 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 06:53:54,905 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:53:54,905 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 06:53:54,905 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-27 06:53:54,905 INFO L87 Difference]: Start difference. First operand 23112 states and 70702 transitions. Second operand 11 states. [2019-12-27 06:53:56,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:53:56,095 INFO L93 Difference]: Finished difference Result 42448 states and 130239 transitions. [2019-12-27 06:53:56,095 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-12-27 06:53:56,095 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 67 [2019-12-27 06:53:56,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:53:56,152 INFO L225 Difference]: With dead ends: 42448 [2019-12-27 06:53:56,152 INFO L226 Difference]: Without dead ends: 40533 [2019-12-27 06:53:56,153 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 173 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=165, Invalid=705, Unknown=0, NotChecked=0, Total=870 [2019-12-27 06:53:56,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40533 states. [2019-12-27 06:53:56,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40533 to 25550. [2019-12-27 06:53:56,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25550 states. [2019-12-27 06:53:56,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25550 states to 25550 states and 78387 transitions. [2019-12-27 06:53:56,679 INFO L78 Accepts]: Start accepts. Automaton has 25550 states and 78387 transitions. Word has length 67 [2019-12-27 06:53:56,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:53:56,679 INFO L462 AbstractCegarLoop]: Abstraction has 25550 states and 78387 transitions. [2019-12-27 06:53:56,679 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 06:53:56,679 INFO L276 IsEmpty]: Start isEmpty. Operand 25550 states and 78387 transitions. [2019-12-27 06:53:56,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 06:53:56,709 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:53:56,709 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:53:56,710 INFO L410 AbstractCegarLoop]: === Iteration 37 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:53:56,710 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:53:56,710 INFO L82 PathProgramCache]: Analyzing trace with hash 688286730, now seen corresponding path program 9 times [2019-12-27 06:53:56,710 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:53:56,710 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1049440496] [2019-12-27 06:53:56,710 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:53:56,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:53:56,873 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:53:56,874 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1049440496] [2019-12-27 06:53:56,874 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:53:56,874 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 06:53:56,874 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [680468653] [2019-12-27 06:53:56,874 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 06:53:56,875 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:53:56,875 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 06:53:56,875 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-27 06:53:56,875 INFO L87 Difference]: Start difference. First operand 25550 states and 78387 transitions. Second operand 11 states. [2019-12-27 06:53:57,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:53:57,856 INFO L93 Difference]: Finished difference Result 41116 states and 125770 transitions. [2019-12-27 06:53:57,857 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-12-27 06:53:57,857 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 67 [2019-12-27 06:53:57,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:53:57,907 INFO L225 Difference]: With dead ends: 41116 [2019-12-27 06:53:57,907 INFO L226 Difference]: Without dead ends: 35386 [2019-12-27 06:53:57,907 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=438, Unknown=0, NotChecked=0, Total=552 [2019-12-27 06:53:58,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35386 states. [2019-12-27 06:53:58,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35386 to 22124. [2019-12-27 06:53:58,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22124 states. [2019-12-27 06:53:58,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22124 states to 22124 states and 67770 transitions. [2019-12-27 06:53:58,339 INFO L78 Accepts]: Start accepts. Automaton has 22124 states and 67770 transitions. Word has length 67 [2019-12-27 06:53:58,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:53:58,340 INFO L462 AbstractCegarLoop]: Abstraction has 22124 states and 67770 transitions. [2019-12-27 06:53:58,340 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 06:53:58,340 INFO L276 IsEmpty]: Start isEmpty. Operand 22124 states and 67770 transitions. [2019-12-27 06:53:58,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 06:53:58,362 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:53:58,362 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:53:58,363 INFO L410 AbstractCegarLoop]: === Iteration 38 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:53:58,363 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:53:58,363 INFO L82 PathProgramCache]: Analyzing trace with hash -1450844730, now seen corresponding path program 10 times [2019-12-27 06:53:58,363 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:53:58,363 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1899399179] [2019-12-27 06:53:58,363 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:53:58,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 06:53:58,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 06:53:58,501 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 06:53:58,501 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 06:53:58,505 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [893] [893] ULTIMATE.startENTRY-->L820: Formula: (let ((.cse0 (store |v_#valid_66| 0 0))) (and (= v_~main$tmp_guard1~0_17 0) (= v_~main$tmp_guard0~0_10 0) (= 0 v_~weak$$choice0~0_8) (= 0 v_~z$r_buff1_thd0~0_24) (= (select .cse0 |v_ULTIMATE.start_main_~#t1397~0.base_23|) 0) (= v_~z$r_buff0_thd3~0_77 0) (= |v_#NULL.offset_6| 0) (= 0 v_~z$w_buff1_used~0_77) (= 0 v_~z$w_buff1~0_28) (= 0 v_~__unbuffered_cnt~0_21) (= v_~z$r_buff0_thd2~0_19 0) (= 0 v_~weak$$choice2~0_32) (= v_~z$read_delayed_var~0.offset_7 0) (= |v_ULTIMATE.start_main_~#t1397~0.offset_17| 0) (= (store |v_#memory_int_22| |v_ULTIMATE.start_main_~#t1397~0.base_23| (store (select |v_#memory_int_22| |v_ULTIMATE.start_main_~#t1397~0.base_23|) |v_ULTIMATE.start_main_~#t1397~0.offset_17| 0)) |v_#memory_int_21|) (= 0 v_~z$r_buff1_thd2~0_18) (= 0 v_~z$mem_tmp~0_9) (< 0 |v_#StackHeapBarrier_18|) (= 0 v_~__unbuffered_p2_EAX~0_16) (= 0 |v_#NULL.base_6|) (= v_~z$read_delayed_var~0.base_7 0) (= v_~z$read_delayed~0_7 0) (= v_~z$r_buff0_thd0~0_18 0) (= |v_#valid_64| (store .cse0 |v_ULTIMATE.start_main_~#t1397~0.base_23| 1)) (= v_~z~0_27 0) (= v_~z$r_buff0_thd1~0_22 0) (= 0 v_~z$flush_delayed~0_12) (= 0 v_~z$w_buff0~0_26) (= 0 v_~z$r_buff1_thd3~0_50) (< |v_#StackHeapBarrier_18| |v_ULTIMATE.start_main_~#t1397~0.base_23|) (= 0 v_~__unbuffered_p1_EAX~0_16) (= 0 v_~z$r_buff1_thd1~0_16) (= (store |v_#length_24| |v_ULTIMATE.start_main_~#t1397~0.base_23| 4) |v_#length_23|) (= v_~z$w_buff0_used~0_116 0) (= v_~x~0_16 0) (= 0 v_~y~0_9))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_18|, #valid=|v_#valid_66|, #memory_int=|v_#memory_int_22|, #length=|v_#length_24|} OutVars{~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_18, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_11|, #NULL.offset=|v_#NULL.offset_6|, ULTIMATE.start_main_~#t1397~0.offset=|v_ULTIMATE.start_main_~#t1397~0.offset_17|, ULTIMATE.start_main_#t~ite49=|v_ULTIMATE.start_main_#t~ite49_9|, ULTIMATE.start_main_#t~ite50=|v_ULTIMATE.start_main_#t~ite50_9|, ULTIMATE.start_main_~#t1399~0.base=|v_ULTIMATE.start_main_~#t1399~0.base_18|, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_23|, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_18, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_16, #length=|v_#length_23|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_16, ~z$mem_tmp~0=v_~z$mem_tmp~0_9, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_8|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_77, ~z$flush_delayed~0=v_~z$flush_delayed~0_12, ~weak$$choice0~0=v_~weak$$choice0~0_8, #StackHeapBarrier=|v_#StackHeapBarrier_18|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_16, ~z$read_delayed_var~0.base=v_~z$read_delayed_var~0.base_7, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_77, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_21, ~x~0=v_~x~0_16, ULTIMATE.start_main_~#t1398~0.base=|v_ULTIMATE.start_main_~#t1398~0.base_22|, ~z$read_delayed~0=v_~z$read_delayed~0_7, ~z$w_buff1~0=v_~z$w_buff1~0_28, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_17, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_11|, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_7, ULTIMATE.start_main_~#t1399~0.offset=|v_ULTIMATE.start_main_~#t1399~0.offset_13|, ULTIMATE.start_main_#t~ite51=|v_ULTIMATE.start_main_#t~ite51_9|, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_24, ~y~0=v_~y~0_9, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_19, ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_7|, ULTIMATE.start_main_~#t1398~0.offset=|v_ULTIMATE.start_main_~#t1398~0.offset_17|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_116, ~z$w_buff0~0=v_~z$w_buff0~0_26, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_7|, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_50, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_10, #NULL.base=|v_#NULL.base_6|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_20|, #valid=|v_#valid_64|, #memory_int=|v_#memory_int_21|, ~z~0=v_~z~0_27, ~weak$$choice2~0=v_~weak$$choice2~0_32, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_22, ULTIMATE.start_main_~#t1397~0.base=|v_ULTIMATE.start_main_~#t1397~0.base_23|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1398~0.base, ~z$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite47, ~z$read_delayed~0, #NULL.offset, ~z$w_buff1~0, ULTIMATE.start_main_~#t1397~0.offset, ULTIMATE.start_main_#t~ite49, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite48, ~z$read_delayed_var~0.offset, ULTIMATE.start_main_#t~ite50, ULTIMATE.start_main_~#t1399~0.base, ULTIMATE.start_main_~#t1399~0.offset, ULTIMATE.start_main_#t~ite52, ~z$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite51, ~__unbuffered_p1_EAX~0, ~z$r_buff1_thd0~0, #length, ~__unbuffered_p2_EAX~0, ~y~0, ~z$r_buff0_thd2~0, ~z$mem_tmp~0, ULTIMATE.start_main_#t~nondet46, ULTIMATE.start_main_~#t1398~0.offset, ~z$w_buff0_used~0, ~z$w_buff0~0, ULTIMATE.start_main_#t~nondet44, ~z$r_buff1_thd3~0, ULTIMATE.start_main_#t~nondet45, ~z$w_buff1_used~0, ~z$flush_delayed~0, ~main$tmp_guard0~0, #NULL.base, ~weak$$choice0~0, ULTIMATE.start_main_#res, ~z$r_buff1_thd1~0, #valid, #memory_int, ~z$read_delayed_var~0.base, ~z$r_buff0_thd3~0, ~__unbuffered_cnt~0, ~z~0, ~weak$$choice2~0, ~z$r_buff0_thd1~0, ~x~0, ULTIMATE.start_main_~#t1397~0.base] because there is no mapped edge [2019-12-27 06:53:58,506 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [850] [850] L820-1-->L822: Formula: (and (= |v_#length_13| (store |v_#length_14| |v_ULTIMATE.start_main_~#t1398~0.base_9| 4)) (< |v_#StackHeapBarrier_10| |v_ULTIMATE.start_main_~#t1398~0.base_9|) (= |v_ULTIMATE.start_main_~#t1398~0.offset_8| 0) (= |v_#valid_33| (store |v_#valid_34| |v_ULTIMATE.start_main_~#t1398~0.base_9| 1)) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1398~0.base_9| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1398~0.base_9|) |v_ULTIMATE.start_main_~#t1398~0.offset_8| 1)) |v_#memory_int_11|) (= (select |v_#valid_34| |v_ULTIMATE.start_main_~#t1398~0.base_9|) 0) (not (= |v_ULTIMATE.start_main_~#t1398~0.base_9| 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_34|, #memory_int=|v_#memory_int_12|, #length=|v_#length_14|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_10|, ULTIMATE.start_main_~#t1398~0.offset=|v_ULTIMATE.start_main_~#t1398~0.offset_8|, ULTIMATE.start_main_~#t1398~0.base=|v_ULTIMATE.start_main_~#t1398~0.base_9|, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_3|, #valid=|v_#valid_33|, #memory_int=|v_#memory_int_11|, #length=|v_#length_13|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1398~0.offset, ULTIMATE.start_main_~#t1398~0.base, ULTIMATE.start_main_#t~nondet44, #valid, #memory_int, #length] because there is no mapped edge [2019-12-27 06:53:58,507 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [872] [872] P0ENTRY-->L4-3: Formula: (and (= (mod ~z$w_buff1_used~0_Out1008420178 256) 0) (= P0Thread1of1ForFork0_~arg.offset_Out1008420178 |P0Thread1of1ForFork0_#in~arg.offset_In1008420178|) (= 1 ~z$w_buff0_used~0_Out1008420178) (= 1 ~z$w_buff0~0_Out1008420178) (= |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_Out1008420178| P0Thread1of1ForFork0___VERIFIER_assert_~expression_Out1008420178) (= P0Thread1of1ForFork0_~arg.base_Out1008420178 |P0Thread1of1ForFork0_#in~arg.base_In1008420178|) (= 1 |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_Out1008420178|) (= ~z$w_buff1_used~0_Out1008420178 ~z$w_buff0_used~0_In1008420178) (= ~z$w_buff1~0_Out1008420178 ~z$w_buff0~0_In1008420178)) InVars {P0Thread1of1ForFork0_#in~arg.offset=|P0Thread1of1ForFork0_#in~arg.offset_In1008420178|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1008420178, ~z$w_buff0~0=~z$w_buff0~0_In1008420178, P0Thread1of1ForFork0_#in~arg.base=|P0Thread1of1ForFork0_#in~arg.base_In1008420178|} OutVars{P0Thread1of1ForFork0_#in~arg.offset=|P0Thread1of1ForFork0_#in~arg.offset_In1008420178|, ~z$w_buff0_used~0=~z$w_buff0_used~0_Out1008420178, ~z$w_buff0~0=~z$w_buff0~0_Out1008420178, ~z$w_buff1_used~0=~z$w_buff1_used~0_Out1008420178, P0Thread1of1ForFork0___VERIFIER_assert_~expression=P0Thread1of1ForFork0___VERIFIER_assert_~expression_Out1008420178, P0Thread1of1ForFork0_#in~arg.base=|P0Thread1of1ForFork0_#in~arg.base_In1008420178|, ~z$w_buff1~0=~z$w_buff1~0_Out1008420178, P0Thread1of1ForFork0_~arg.base=P0Thread1of1ForFork0_~arg.base_Out1008420178, P0Thread1of1ForFork0___VERIFIER_assert_#in~expression=|P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_Out1008420178|, P0Thread1of1ForFork0_~arg.offset=P0Thread1of1ForFork0_~arg.offset_Out1008420178} AuxVars[] AssignedVars[~z$w_buff0_used~0, ~z$w_buff0~0, ~z$w_buff1_used~0, P0Thread1of1ForFork0___VERIFIER_assert_~expression, ~z$w_buff1~0, P0Thread1of1ForFork0_~arg.base, P0Thread1of1ForFork0___VERIFIER_assert_#in~expression, P0Thread1of1ForFork0_~arg.offset] because there is no mapped edge [2019-12-27 06:53:58,510 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [870] [870] L822-1-->L824: Formula: (and (= 0 (select |v_#valid_41| |v_ULTIMATE.start_main_~#t1399~0.base_11|)) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t1399~0.base_11|) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t1399~0.base_11| 4)) (= |v_#valid_40| (store |v_#valid_41| |v_ULTIMATE.start_main_~#t1399~0.base_11| 1)) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1399~0.base_11| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1399~0.base_11|) |v_ULTIMATE.start_main_~#t1399~0.offset_9| 2)) |v_#memory_int_15|) (not (= 0 |v_ULTIMATE.start_main_~#t1399~0.base_11|)) (= |v_ULTIMATE.start_main_~#t1399~0.offset_9| 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_41|, #memory_int=|v_#memory_int_16|, #length=|v_#length_18|} OutVars{ULTIMATE.start_main_~#t1399~0.base=|v_ULTIMATE.start_main_~#t1399~0.base_11|, ULTIMATE.start_main_~#t1399~0.offset=|v_ULTIMATE.start_main_~#t1399~0.offset_9|, #StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_40|, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_5|, #memory_int=|v_#memory_int_15|, #length=|v_#length_17|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1399~0.base, ULTIMATE.start_main_~#t1399~0.offset, #valid, ULTIMATE.start_main_#t~nondet45, #memory_int, #length] because there is no mapped edge [2019-12-27 06:53:58,512 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [817] [817] L764-2-->L764-5: Formula: (let ((.cse1 (= |P1Thread1of1ForFork1_#t~ite10_Out1460333907| |P1Thread1of1ForFork1_#t~ite9_Out1460333907|)) (.cse0 (= (mod ~z$r_buff1_thd2~0_In1460333907 256) 0)) (.cse2 (= 0 (mod ~z$w_buff1_used~0_In1460333907 256)))) (or (and (not .cse0) (= |P1Thread1of1ForFork1_#t~ite9_Out1460333907| ~z$w_buff1~0_In1460333907) .cse1 (not .cse2)) (and .cse1 (= ~z~0_In1460333907 |P1Thread1of1ForFork1_#t~ite9_Out1460333907|) (or .cse0 .cse2)))) InVars {~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In1460333907, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1460333907, ~z$w_buff1~0=~z$w_buff1~0_In1460333907, ~z~0=~z~0_In1460333907} OutVars{P1Thread1of1ForFork1_#t~ite9=|P1Thread1of1ForFork1_#t~ite9_Out1460333907|, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In1460333907, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1460333907, P1Thread1of1ForFork1_#t~ite10=|P1Thread1of1ForFork1_#t~ite10_Out1460333907|, ~z$w_buff1~0=~z$w_buff1~0_In1460333907, ~z~0=~z~0_In1460333907} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite9, P1Thread1of1ForFork1_#t~ite10] because there is no mapped edge [2019-12-27 06:53:58,513 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [836] [836] L765-->L765-2: Formula: (let ((.cse1 (= (mod ~z$r_buff0_thd2~0_In365533621 256) 0)) (.cse0 (= (mod ~z$w_buff0_used~0_In365533621 256) 0))) (or (and (not .cse0) (not .cse1) (= 0 |P1Thread1of1ForFork1_#t~ite11_Out365533621|)) (and (or .cse1 .cse0) (= ~z$w_buff0_used~0_In365533621 |P1Thread1of1ForFork1_#t~ite11_Out365533621|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In365533621, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In365533621} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In365533621, P1Thread1of1ForFork1_#t~ite11=|P1Thread1of1ForFork1_#t~ite11_Out365533621|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In365533621} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite11] because there is no mapped edge [2019-12-27 06:53:58,515 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [828] [828] L766-->L766-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd2~0_In-897173590 256))) (.cse0 (= (mod ~z$w_buff0_used~0_In-897173590 256) 0)) (.cse2 (= 0 (mod ~z$r_buff1_thd2~0_In-897173590 256))) (.cse3 (= 0 (mod ~z$w_buff1_used~0_In-897173590 256)))) (or (and (= 0 |P1Thread1of1ForFork1_#t~ite12_Out-897173590|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse1 .cse0) (or .cse2 .cse3) (= ~z$w_buff1_used~0_In-897173590 |P1Thread1of1ForFork1_#t~ite12_Out-897173590|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-897173590, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-897173590, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-897173590, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-897173590} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-897173590, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-897173590, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-897173590, P1Thread1of1ForFork1_#t~ite12=|P1Thread1of1ForFork1_#t~ite12_Out-897173590|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-897173590} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite12] because there is no mapped edge [2019-12-27 06:53:58,516 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [841] [841] L767-->L767-2: Formula: (let ((.cse1 (= (mod ~z$r_buff0_thd2~0_In-1846103698 256) 0)) (.cse0 (= (mod ~z$w_buff0_used~0_In-1846103698 256) 0))) (or (and (= |P1Thread1of1ForFork1_#t~ite13_Out-1846103698| ~z$r_buff0_thd2~0_In-1846103698) (or .cse0 .cse1)) (and (not .cse1) (= |P1Thread1of1ForFork1_#t~ite13_Out-1846103698| 0) (not .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1846103698, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1846103698} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1846103698, P1Thread1of1ForFork1_#t~ite13=|P1Thread1of1ForFork1_#t~ite13_Out-1846103698|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1846103698} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite13] because there is no mapped edge [2019-12-27 06:53:58,517 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [871] [871] L787-->L787-8: Formula: (let ((.cse1 (= 0 (mod ~weak$$choice2~0_In-1998376846 256)))) (or (and (= |P2Thread1of1ForFork2_#t~ite24_Out-1998376846| |P2Thread1of1ForFork2_#t~ite23_Out-1998376846|) (= ~z$w_buff1~0_In-1998376846 |P2Thread1of1ForFork2_#t~ite23_Out-1998376846|) (let ((.cse0 (= 0 (mod ~z$r_buff0_thd3~0_In-1998376846 256)))) (or (and (= (mod ~z$w_buff1_used~0_In-1998376846 256) 0) .cse0) (and (= 0 (mod ~z$r_buff1_thd3~0_In-1998376846 256)) .cse0) (= 0 (mod ~z$w_buff0_used~0_In-1998376846 256)))) .cse1) (and (not .cse1) (= ~z$w_buff1~0_In-1998376846 |P2Thread1of1ForFork2_#t~ite24_Out-1998376846|) (= |P2Thread1of1ForFork2_#t~ite23_In-1998376846| |P2Thread1of1ForFork2_#t~ite23_Out-1998376846|)))) InVars {P2Thread1of1ForFork2_#t~ite23=|P2Thread1of1ForFork2_#t~ite23_In-1998376846|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1998376846, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1998376846, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1998376846, ~z$w_buff1~0=~z$w_buff1~0_In-1998376846, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1998376846, ~weak$$choice2~0=~weak$$choice2~0_In-1998376846} OutVars{P2Thread1of1ForFork2_#t~ite23=|P2Thread1of1ForFork2_#t~ite23_Out-1998376846|, P2Thread1of1ForFork2_#t~ite24=|P2Thread1of1ForFork2_#t~ite24_Out-1998376846|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1998376846, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1998376846, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1998376846, ~z$w_buff1~0=~z$w_buff1~0_In-1998376846, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1998376846, ~weak$$choice2~0=~weak$$choice2~0_In-1998376846} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite23, P2Thread1of1ForFork2_#t~ite24] because there is no mapped edge [2019-12-27 06:53:58,518 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [873] [873] L788-->L788-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In-2005233971 256) 0))) (or (and (= |P2Thread1of1ForFork2_#t~ite27_Out-2005233971| ~z$w_buff0_used~0_In-2005233971) (= |P2Thread1of1ForFork2_#t~ite26_In-2005233971| |P2Thread1of1ForFork2_#t~ite26_Out-2005233971|) (not .cse0)) (and .cse0 (let ((.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In-2005233971 256)))) (or (= (mod ~z$w_buff0_used~0_In-2005233971 256) 0) (and (= 0 (mod ~z$w_buff1_used~0_In-2005233971 256)) .cse1) (and .cse1 (= (mod ~z$r_buff1_thd3~0_In-2005233971 256) 0)))) (= |P2Thread1of1ForFork2_#t~ite26_Out-2005233971| |P2Thread1of1ForFork2_#t~ite27_Out-2005233971|) (= |P2Thread1of1ForFork2_#t~ite26_Out-2005233971| ~z$w_buff0_used~0_In-2005233971)))) InVars {P2Thread1of1ForFork2_#t~ite26=|P2Thread1of1ForFork2_#t~ite26_In-2005233971|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-2005233971, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-2005233971, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-2005233971, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-2005233971, ~weak$$choice2~0=~weak$$choice2~0_In-2005233971} OutVars{P2Thread1of1ForFork2_#t~ite26=|P2Thread1of1ForFork2_#t~ite26_Out-2005233971|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-2005233971, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-2005233971, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-2005233971, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-2005233971, ~weak$$choice2~0=~weak$$choice2~0_In-2005233971, P2Thread1of1ForFork2_#t~ite27=|P2Thread1of1ForFork2_#t~ite27_Out-2005233971|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite26, P2Thread1of1ForFork2_#t~ite27] because there is no mapped edge [2019-12-27 06:53:58,518 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [827] [827] L768-->L768-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff0_thd2~0_In-1003939402 256))) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In-1003939402 256))) (.cse3 (= (mod ~z$r_buff1_thd2~0_In-1003939402 256) 0)) (.cse2 (= 0 (mod ~z$w_buff1_used~0_In-1003939402 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P1Thread1of1ForFork1_#t~ite14_Out-1003939402| 0)) (and (or .cse0 .cse1) (or .cse3 .cse2) (= ~z$r_buff1_thd2~0_In-1003939402 |P1Thread1of1ForFork1_#t~ite14_Out-1003939402|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1003939402, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-1003939402, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1003939402, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1003939402} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1003939402, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-1003939402, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1003939402, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_Out-1003939402|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1003939402} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite14] because there is no mapped edge [2019-12-27 06:53:58,518 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [848] [848] L768-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork1_#res.base_5|) (= (+ v_~__unbuffered_cnt~0_12 1) v_~__unbuffered_cnt~0_11) (= |v_P1Thread1of1ForFork1_#res.offset_5| 0) (= v_~z$r_buff1_thd2~0_13 |v_P1Thread1of1ForFork1_#t~ite14_8|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_12, P1Thread1of1ForFork1_#t~ite14=|v_P1Thread1of1ForFork1_#t~ite14_8|} OutVars{P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_5|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_13, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_11, P1Thread1of1ForFork1_#t~ite14=|v_P1Thread1of1ForFork1_#t~ite14_7|, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#res.offset, ~z$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#t~ite14, P1Thread1of1ForFork1_#res.base] because there is no mapped edge [2019-12-27 06:53:58,519 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [874] [874] L789-->L789-8: Formula: (let ((.cse1 (= 0 (mod ~weak$$choice2~0_In312225141 256)))) (or (and (= |P2Thread1of1ForFork2_#t~ite29_Out312225141| ~z$w_buff1_used~0_In312225141) (let ((.cse0 (= 0 (mod ~z$r_buff0_thd3~0_In312225141 256)))) (or (and (= (mod ~z$r_buff1_thd3~0_In312225141 256) 0) .cse0) (and .cse0 (= (mod ~z$w_buff1_used~0_In312225141 256) 0)) (= (mod ~z$w_buff0_used~0_In312225141 256) 0))) (= |P2Thread1of1ForFork2_#t~ite29_Out312225141| |P2Thread1of1ForFork2_#t~ite30_Out312225141|) .cse1) (and (= ~z$w_buff1_used~0_In312225141 |P2Thread1of1ForFork2_#t~ite30_Out312225141|) (not .cse1) (= |P2Thread1of1ForFork2_#t~ite29_In312225141| |P2Thread1of1ForFork2_#t~ite29_Out312225141|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In312225141, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In312225141, ~z$w_buff1_used~0=~z$w_buff1_used~0_In312225141, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In312225141, ~weak$$choice2~0=~weak$$choice2~0_In312225141, P2Thread1of1ForFork2_#t~ite29=|P2Thread1of1ForFork2_#t~ite29_In312225141|} OutVars{P2Thread1of1ForFork2_#t~ite30=|P2Thread1of1ForFork2_#t~ite30_Out312225141|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In312225141, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In312225141, ~z$w_buff1_used~0=~z$w_buff1_used~0_In312225141, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In312225141, ~weak$$choice2~0=~weak$$choice2~0_In312225141, P2Thread1of1ForFork2_#t~ite29=|P2Thread1of1ForFork2_#t~ite29_Out312225141|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite30, P2Thread1of1ForFork2_#t~ite29] because there is no mapped edge [2019-12-27 06:53:58,520 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [779] [779] L790-->L791: Formula: (and (not (= 0 (mod v_~weak$$choice2~0_15 256))) (= v_~z$r_buff0_thd3~0_52 v_~z$r_buff0_thd3~0_51)) InVars {~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_52, ~weak$$choice2~0=v_~weak$$choice2~0_15} OutVars{P2Thread1of1ForFork2_#t~ite31=|v_P2Thread1of1ForFork2_#t~ite31_8|, P2Thread1of1ForFork2_#t~ite33=|v_P2Thread1of1ForFork2_#t~ite33_9|, P2Thread1of1ForFork2_#t~ite32=|v_P2Thread1of1ForFork2_#t~ite32_9|, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_51, ~weak$$choice2~0=v_~weak$$choice2~0_15} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite31, P2Thread1of1ForFork2_#t~ite33, P2Thread1of1ForFork2_#t~ite32, ~z$r_buff0_thd3~0] because there is no mapped edge [2019-12-27 06:53:58,521 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [761] [761] L793-->L797: Formula: (and (= 0 v_~z$flush_delayed~0_6) (not (= 0 (mod v_~z$flush_delayed~0_7 256))) (= v_~z~0_18 v_~z$mem_tmp~0_5)) InVars {~z$mem_tmp~0=v_~z$mem_tmp~0_5, ~z$flush_delayed~0=v_~z$flush_delayed~0_7} OutVars{~z$mem_tmp~0=v_~z$mem_tmp~0_5, P2Thread1of1ForFork2_#t~ite37=|v_P2Thread1of1ForFork2_#t~ite37_7|, ~z$flush_delayed~0=v_~z$flush_delayed~0_6, ~z~0=v_~z~0_18} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite37, ~z$flush_delayed~0, ~z~0] because there is no mapped edge [2019-12-27 06:53:58,522 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [839] [839] L745-->L745-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff0_thd1~0_In1541582316 256))) (.cse1 (= (mod ~z$w_buff0_used~0_In1541582316 256) 0))) (or (and (or .cse0 .cse1) (= |P0Thread1of1ForFork0_#t~ite5_Out1541582316| ~z$w_buff0_used~0_In1541582316)) (and (= |P0Thread1of1ForFork0_#t~ite5_Out1541582316| 0) (not .cse0) (not .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1541582316, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In1541582316} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out1541582316|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1541582316, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In1541582316} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-27 06:53:58,523 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [818] [818] L746-->L746-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff1_used~0_In-2078452840 256))) (.cse1 (= (mod ~z$r_buff1_thd1~0_In-2078452840 256) 0)) (.cse2 (= 0 (mod ~z$w_buff0_used~0_In-2078452840 256))) (.cse3 (= (mod ~z$r_buff0_thd1~0_In-2078452840 256) 0))) (or (and (= 0 |P0Thread1of1ForFork0_#t~ite6_Out-2078452840|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= |P0Thread1of1ForFork0_#t~ite6_Out-2078452840| ~z$w_buff1_used~0_In-2078452840) (or .cse0 .cse1) (or .cse2 .cse3)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-2078452840, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In-2078452840, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-2078452840, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-2078452840} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out-2078452840|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-2078452840, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In-2078452840, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-2078452840, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-2078452840} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-27 06:53:58,524 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [837] [837] L747-->L748: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In1462840025 256) 0)) (.cse0 (= (mod ~z$r_buff0_thd1~0_In1462840025 256) 0))) (or (and (not .cse0) (not .cse1) (= 0 ~z$r_buff0_thd1~0_Out1462840025)) (and (or .cse1 .cse0) (= ~z$r_buff0_thd1~0_In1462840025 ~z$r_buff0_thd1~0_Out1462840025)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1462840025, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In1462840025} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1462840025, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out1462840025|, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_Out1462840025} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-27 06:53:58,524 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [838] [838] L748-->L748-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff1_thd1~0_In100549886 256))) (.cse1 (= (mod ~z$w_buff1_used~0_In100549886 256) 0)) (.cse2 (= 0 (mod ~z$w_buff0_used~0_In100549886 256))) (.cse3 (= 0 (mod ~z$r_buff0_thd1~0_In100549886 256)))) (or (and (or .cse0 .cse1) (= |P0Thread1of1ForFork0_#t~ite8_Out100549886| ~z$r_buff1_thd1~0_In100549886) (or .cse2 .cse3)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P0Thread1of1ForFork0_#t~ite8_Out100549886| 0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In100549886, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In100549886, ~z$w_buff1_used~0=~z$w_buff1_used~0_In100549886, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In100549886} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In100549886, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out100549886|, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In100549886, ~z$w_buff1_used~0=~z$w_buff1_used~0_In100549886, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In100549886} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-27 06:53:58,524 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [860] [860] L748-2-->P0EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_16 1) v_~__unbuffered_cnt~0_15) (= |v_P0Thread1of1ForFork0_#t~ite8_8| v_~z$r_buff1_thd1~0_12) (= 0 |v_P0Thread1of1ForFork0_#res.base_5|) (= |v_P0Thread1of1ForFork0_#res.offset_5| 0)) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_16} OutVars{P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_5|, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_7|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_12, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_15} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#t~ite8, ~z$r_buff1_thd1~0, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-27 06:53:58,525 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [829] [829] L797-2-->L797-5: Formula: (let ((.cse1 (= (mod ~z$w_buff1_used~0_In-686834723 256) 0)) (.cse2 (= 0 (mod ~z$r_buff1_thd3~0_In-686834723 256))) (.cse0 (= |P2Thread1of1ForFork2_#t~ite38_Out-686834723| |P2Thread1of1ForFork2_#t~ite39_Out-686834723|))) (or (and .cse0 (not .cse1) (= |P2Thread1of1ForFork2_#t~ite38_Out-686834723| ~z$w_buff1~0_In-686834723) (not .cse2)) (and (or .cse1 .cse2) .cse0 (= |P2Thread1of1ForFork2_#t~ite38_Out-686834723| ~z~0_In-686834723)))) InVars {~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-686834723, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-686834723, ~z$w_buff1~0=~z$w_buff1~0_In-686834723, ~z~0=~z~0_In-686834723} OutVars{~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-686834723, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-686834723, ~z$w_buff1~0=~z$w_buff1~0_In-686834723, ~z~0=~z~0_In-686834723, P2Thread1of1ForFork2_#t~ite39=|P2Thread1of1ForFork2_#t~ite39_Out-686834723|, P2Thread1of1ForFork2_#t~ite38=|P2Thread1of1ForFork2_#t~ite38_Out-686834723|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite39, P2Thread1of1ForFork2_#t~ite38] because there is no mapped edge [2019-12-27 06:53:58,525 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [832] [832] L798-->L798-2: Formula: (let ((.cse0 (= (mod ~z$w_buff0_used~0_In1113579076 256) 0)) (.cse1 (= (mod ~z$r_buff0_thd3~0_In1113579076 256) 0))) (or (and (or .cse0 .cse1) (= ~z$w_buff0_used~0_In1113579076 |P2Thread1of1ForFork2_#t~ite40_Out1113579076|)) (and (not .cse0) (not .cse1) (= 0 |P2Thread1of1ForFork2_#t~ite40_Out1113579076|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1113579076, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1113579076} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1113579076, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1113579076, P2Thread1of1ForFork2_#t~ite40=|P2Thread1of1ForFork2_#t~ite40_Out1113579076|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite40] because there is no mapped edge [2019-12-27 06:53:58,526 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [819] [819] L799-->L799-2: Formula: (let ((.cse2 (= (mod ~z$w_buff1_used~0_In-1959099054 256) 0)) (.cse3 (= 0 (mod ~z$r_buff1_thd3~0_In-1959099054 256))) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In-1959099054 256))) (.cse0 (= (mod ~z$r_buff0_thd3~0_In-1959099054 256) 0))) (or (and (= |P2Thread1of1ForFork2_#t~ite41_Out-1959099054| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse2 .cse3) (or .cse1 .cse0) (= |P2Thread1of1ForFork2_#t~ite41_Out-1959099054| ~z$w_buff1_used~0_In-1959099054)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1959099054, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1959099054, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1959099054, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1959099054} OutVars{P2Thread1of1ForFork2_#t~ite41=|P2Thread1of1ForFork2_#t~ite41_Out-1959099054|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1959099054, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1959099054, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1959099054, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1959099054} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite41] because there is no mapped edge [2019-12-27 06:53:58,527 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [815] [815] L800-->L800-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff0_thd3~0_In-388883221 256))) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In-388883221 256)))) (or (and (= 0 |P2Thread1of1ForFork2_#t~ite42_Out-388883221|) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= |P2Thread1of1ForFork2_#t~ite42_Out-388883221| ~z$r_buff0_thd3~0_In-388883221)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-388883221, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-388883221} OutVars{P2Thread1of1ForFork2_#t~ite42=|P2Thread1of1ForFork2_#t~ite42_Out-388883221|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-388883221, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-388883221} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite42] because there is no mapped edge [2019-12-27 06:53:58,528 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [834] [834] L801-->L801-2: Formula: (let ((.cse2 (= (mod ~z$w_buff1_used~0_In-863292924 256) 0)) (.cse3 (= 0 (mod ~z$r_buff1_thd3~0_In-863292924 256))) (.cse0 (= 0 (mod ~z$r_buff0_thd3~0_In-863292924 256))) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In-863292924 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~z$r_buff1_thd3~0_In-863292924 |P2Thread1of1ForFork2_#t~ite43_Out-863292924|)) (and (= 0 |P2Thread1of1ForFork2_#t~ite43_Out-863292924|) (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1)))))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-863292924, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-863292924, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-863292924, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-863292924} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-863292924, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-863292924, P2Thread1of1ForFork2_#t~ite43=|P2Thread1of1ForFork2_#t~ite43_Out-863292924|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-863292924, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-863292924} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite43] because there is no mapped edge [2019-12-27 06:53:58,528 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [858] [858] L801-2-->P2EXIT: Formula: (and (= 0 |v_P2Thread1of1ForFork2_#res.base_5|) (= |v_P2Thread1of1ForFork2_#t~ite43_8| v_~z$r_buff1_thd3~0_42) (= v_~__unbuffered_cnt~0_13 (+ v_~__unbuffered_cnt~0_14 1)) (= |v_P2Thread1of1ForFork2_#res.offset_5| 0)) InVars {P2Thread1of1ForFork2_#t~ite43=|v_P2Thread1of1ForFork2_#t~ite43_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_14} OutVars{~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_42, P2Thread1of1ForFork2_#t~ite43=|v_P2Thread1of1ForFork2_#t~ite43_7|, P2Thread1of1ForFork2_#res.base=|v_P2Thread1of1ForFork2_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_13, P2Thread1of1ForFork2_#res.offset=|v_P2Thread1of1ForFork2_#res.offset_5|} AuxVars[] AssignedVars[~z$r_buff1_thd3~0, P2Thread1of1ForFork2_#t~ite43, P2Thread1of1ForFork2_#res.base, ~__unbuffered_cnt~0, P2Thread1of1ForFork2_#res.offset] because there is no mapped edge [2019-12-27 06:53:58,528 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [781] [781] L824-1-->L830: Formula: (and (= v_~__unbuffered_cnt~0_9 3) (= v_~main$tmp_guard0~0_5 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_9} OutVars{ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_9, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_5} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet46, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-27 06:53:58,529 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [825] [825] L830-2-->L830-5: Formula: (let ((.cse1 (= (mod ~z$r_buff1_thd0~0_In1527721626 256) 0)) (.cse0 (= |ULTIMATE.start_main_#t~ite48_Out1527721626| |ULTIMATE.start_main_#t~ite47_Out1527721626|)) (.cse2 (= 0 (mod ~z$w_buff1_used~0_In1527721626 256)))) (or (and .cse0 (or .cse1 .cse2) (= ~z~0_In1527721626 |ULTIMATE.start_main_#t~ite47_Out1527721626|)) (and (not .cse1) .cse0 (= ~z$w_buff1~0_In1527721626 |ULTIMATE.start_main_#t~ite47_Out1527721626|) (not .cse2)))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1527721626, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1527721626, ~z$w_buff1~0=~z$w_buff1~0_In1527721626, ~z~0=~z~0_In1527721626} OutVars{~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1527721626, ULTIMATE.start_main_#t~ite47=|ULTIMATE.start_main_#t~ite47_Out1527721626|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1527721626, ~z$w_buff1~0=~z$w_buff1~0_In1527721626, ULTIMATE.start_main_#t~ite48=|ULTIMATE.start_main_#t~ite48_Out1527721626|, ~z~0=~z~0_In1527721626} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite47, ULTIMATE.start_main_#t~ite48] because there is no mapped edge [2019-12-27 06:53:58,529 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [821] [821] L831-->L831-2: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In1309439469 256) 0)) (.cse0 (= (mod ~z$r_buff0_thd0~0_In1309439469 256) 0))) (or (and (= 0 |ULTIMATE.start_main_#t~ite49_Out1309439469|) (not .cse0) (not .cse1)) (and (= ~z$w_buff0_used~0_In1309439469 |ULTIMATE.start_main_#t~ite49_Out1309439469|) (or .cse1 .cse0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1309439469, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1309439469} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1309439469, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1309439469, ULTIMATE.start_main_#t~ite49=|ULTIMATE.start_main_#t~ite49_Out1309439469|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite49] because there is no mapped edge [2019-12-27 06:53:58,530 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [840] [840] L832-->L832-2: Formula: (let ((.cse3 (= (mod ~z$w_buff1_used~0_In-2146994316 256) 0)) (.cse2 (= (mod ~z$r_buff1_thd0~0_In-2146994316 256) 0)) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In-2146994316 256))) (.cse1 (= (mod ~z$r_buff0_thd0~0_In-2146994316 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite50_Out-2146994316| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= |ULTIMATE.start_main_#t~ite50_Out-2146994316| ~z$w_buff1_used~0_In-2146994316) (or .cse3 .cse2) (or .cse0 .cse1)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-2146994316, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-2146994316, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-2146994316, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-2146994316} OutVars{ULTIMATE.start_main_#t~ite50=|ULTIMATE.start_main_#t~ite50_Out-2146994316|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-2146994316, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-2146994316, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-2146994316, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-2146994316} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite50] because there is no mapped edge [2019-12-27 06:53:58,531 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [831] [831] L833-->L833-2: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In1115114611 256) 0)) (.cse0 (= 0 (mod ~z$r_buff0_thd0~0_In1115114611 256)))) (or (and (= ~z$r_buff0_thd0~0_In1115114611 |ULTIMATE.start_main_#t~ite51_Out1115114611|) (or .cse0 .cse1)) (and (not .cse1) (not .cse0) (= |ULTIMATE.start_main_#t~ite51_Out1115114611| 0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1115114611, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1115114611} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1115114611, ULTIMATE.start_main_#t~ite51=|ULTIMATE.start_main_#t~ite51_Out1115114611|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1115114611} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite51] because there is no mapped edge [2019-12-27 06:53:58,532 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [820] [820] L834-->L834-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd0~0_In511184576 256))) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In511184576 256))) (.cse2 (= 0 (mod ~z$r_buff1_thd0~0_In511184576 256))) (.cse3 (= 0 (mod ~z$w_buff1_used~0_In511184576 256)))) (or (and (= |ULTIMATE.start_main_#t~ite52_Out511184576| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse1 .cse0) (= ~z$r_buff1_thd0~0_In511184576 |ULTIMATE.start_main_#t~ite52_Out511184576|) (or .cse2 .cse3)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In511184576, ~z$w_buff0_used~0=~z$w_buff0_used~0_In511184576, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In511184576, ~z$w_buff1_used~0=~z$w_buff1_used~0_In511184576} OutVars{ULTIMATE.start_main_#t~ite52=|ULTIMATE.start_main_#t~ite52_Out511184576|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In511184576, ~z$w_buff0_used~0=~z$w_buff0_used~0_In511184576, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In511184576, ~z$w_buff1_used~0=~z$w_buff1_used~0_In511184576} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52] because there is no mapped edge [2019-12-27 06:53:58,532 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [881] [881] L834-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_~main$tmp_guard1~0_9 0) (= 2 v_~x~0_8) (= |v_ULTIMATE.start_main_#t~ite52_10| v_~z$r_buff1_thd0~0_16) (= v_~__unbuffered_p2_EAX~0_8 0) (= 0 v_~__unbuffered_p1_EAX~0_8) (= v_ULTIMATE.start___VERIFIER_assert_~expression_13 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_13 0)) InVars {ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_10|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_8, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_8, ~x~0=v_~x~0_8} OutVars{ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_9|, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_13, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_8, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_16, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_9, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_8, ~x~0=v_~x~0_8, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52, ULTIMATE.start___VERIFIER_assert_~expression, ~z$r_buff1_thd0~0, ~main$tmp_guard1~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-27 06:53:58,644 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 06:53:58 BasicIcfg [2019-12-27 06:53:58,644 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 06:53:58,646 INFO L168 Benchmark]: Toolchain (without parser) took 142257.71 ms. Allocated memory was 139.5 MB in the beginning and 3.4 GB in the end (delta: 3.3 GB). Free memory was 101.1 MB in the beginning and 1.0 GB in the end (delta: -926.6 MB). Peak memory consumption was 2.4 GB. Max. memory is 7.1 GB. [2019-12-27 06:53:58,646 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 139.5 MB. Free memory was 121.4 MB in the beginning and 121.2 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. [2019-12-27 06:53:58,646 INFO L168 Benchmark]: CACSL2BoogieTranslator took 772.49 ms. Allocated memory was 139.5 MB in the beginning and 204.5 MB in the end (delta: 65.0 MB). Free memory was 100.7 MB in the beginning and 157.9 MB in the end (delta: -57.2 MB). Peak memory consumption was 24.4 MB. Max. memory is 7.1 GB. [2019-12-27 06:53:58,648 INFO L168 Benchmark]: Boogie Procedure Inliner took 60.54 ms. Allocated memory is still 204.5 MB. Free memory was 157.9 MB in the beginning and 155.3 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-12-27 06:53:58,648 INFO L168 Benchmark]: Boogie Preprocessor took 41.07 ms. Allocated memory is still 204.5 MB. Free memory was 155.3 MB in the beginning and 152.8 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-12-27 06:53:58,648 INFO L168 Benchmark]: RCFGBuilder took 835.77 ms. Allocated memory is still 204.5 MB. Free memory was 152.8 MB in the beginning and 103.1 MB in the end (delta: 49.7 MB). Peak memory consumption was 49.7 MB. Max. memory is 7.1 GB. [2019-12-27 06:53:58,649 INFO L168 Benchmark]: TraceAbstraction took 140542.37 ms. Allocated memory was 204.5 MB in the beginning and 3.4 GB in the end (delta: 3.2 GB). Free memory was 102.4 MB in the beginning and 1.0 GB in the end (delta: -925.3 MB). Peak memory consumption was 2.3 GB. Max. memory is 7.1 GB. [2019-12-27 06:53:58,652 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18 ms. Allocated memory is still 139.5 MB. Free memory was 121.4 MB in the beginning and 121.2 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 772.49 ms. Allocated memory was 139.5 MB in the beginning and 204.5 MB in the end (delta: 65.0 MB). Free memory was 100.7 MB in the beginning and 157.9 MB in the end (delta: -57.2 MB). Peak memory consumption was 24.4 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 60.54 ms. Allocated memory is still 204.5 MB. Free memory was 157.9 MB in the beginning and 155.3 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 41.07 ms. Allocated memory is still 204.5 MB. Free memory was 155.3 MB in the beginning and 152.8 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 835.77 ms. Allocated memory is still 204.5 MB. Free memory was 152.8 MB in the beginning and 103.1 MB in the end (delta: 49.7 MB). Peak memory consumption was 49.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 140542.37 ms. Allocated memory was 204.5 MB in the beginning and 3.4 GB in the end (delta: 3.2 GB). Free memory was 102.4 MB in the beginning and 1.0 GB in the end (delta: -925.3 MB). Peak memory consumption was 2.3 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 4.1s, 175 ProgramPointsBefore, 92 ProgramPointsAfterwards, 212 TransitionsBefore, 101 TransitionsAfterwards, 19004 CoEnabledTransitionPairs, 7 FixpointIterations, 32 TrivialSequentialCompositions, 47 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 34 ConcurrentYvCompositions, 32 ChoiceCompositions, 6848 VarBasedMoverChecksPositive, 229 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 80960 CheckedPairsTotal, 113 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L820] FCALL, FORK 0 pthread_create(&t1397, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L734] 1 z$r_buff1_thd0 = z$r_buff0_thd0 [L735] 1 z$r_buff1_thd1 = z$r_buff0_thd1 [L736] 1 z$r_buff1_thd2 = z$r_buff0_thd2 [L737] 1 z$r_buff1_thd3 = z$r_buff0_thd3 [L738] 1 z$r_buff0_thd1 = (_Bool)1 [L741] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L744] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L822] FCALL, FORK 0 pthread_create(&t1398, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L824] FCALL, FORK 0 pthread_create(&t1399, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L758] 2 x = 2 [L761] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L764] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L764] 2 z = z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L778] 3 y = 1 [L781] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L782] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L783] 3 z$flush_delayed = weak$$choice2 [L784] 3 z$mem_tmp = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=7, x=2, y=1, z=0, z$flush_delayed=7, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L785] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) VAL [!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=7, x=2, y=1, z=0, z$flush_delayed=7, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L785] 3 z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L765] 2 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L786] EXPR 3 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=7, weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0))=1, x=2, y=1, z=0, z$flush_delayed=7, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L766] 2 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L786] 3 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L787] 3 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L767] 2 z$r_buff0_thd2 = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L788] 3 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L789] 3 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L791] EXPR 3 weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=7, weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))=0, x=2, y=1, z=0, z$flush_delayed=7, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L791] 3 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L792] 3 __unbuffered_p2_EAX = z VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=7, x=2, y=1, z=0, z$flush_delayed=7, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L797] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=7, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L744] 1 z = z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L745] 1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L746] 1 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L797] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L798] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L799] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L800] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L830] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=7, x=2, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L830] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L831] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L832] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L833] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 166 locations, 2 error locations. Result: UNSAFE, OverallTime: 140.2s, OverallIterations: 38, TraceHistogramMax: 1, AutomataDifference: 64.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 10486 SDtfs, 15615 SDslu, 45348 SDs, 0 SdLazy, 35640 SolverSat, 694 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 30.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 725 GetRequests, 61 SyntacticMatches, 49 SemanticMatches, 615 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6471 ImplicationChecksByTransitivity, 11.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=145638occurred in iteration=2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 46.9s AutomataMinimizationTime, 37 MinimizatonAttempts, 449123 StatesRemovedByMinimization, 34 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 5.1s InterpolantComputationTime, 2034 NumberOfCodeBlocks, 2034 NumberOfCodeBlocksAsserted, 38 NumberOfCheckSat, 1930 ConstructedInterpolants, 0 QuantifiedInterpolants, 517860 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 37 InterpolantComputations, 37 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...