/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-SemanticLbe.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix052_power.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 02:52:35,157 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 02:52:35,159 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 02:52:35,177 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 02:52:35,178 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 02:52:35,180 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 02:52:35,182 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 02:52:35,191 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 02:52:35,195 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 02:52:35,198 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 02:52:35,200 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 02:52:35,202 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 02:52:35,202 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 02:52:35,204 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 02:52:35,206 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 02:52:35,207 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 02:52:35,209 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 02:52:35,210 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 02:52:35,211 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 02:52:35,216 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 02:52:35,220 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 02:52:35,224 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 02:52:35,225 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 02:52:35,226 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 02:52:35,228 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 02:52:35,228 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 02:52:35,228 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 02:52:35,230 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 02:52:35,231 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 02:52:35,232 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 02:52:35,232 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 02:52:35,234 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 02:52:35,235 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 02:52:35,236 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 02:52:35,237 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 02:52:35,237 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 02:52:35,238 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 02:52:35,238 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 02:52:35,238 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 02:52:35,239 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 02:52:35,240 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 02:52:35,241 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-SemanticLbe.epf [2019-12-27 02:52:35,257 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 02:52:35,258 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 02:52:35,259 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 02:52:35,259 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 02:52:35,259 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 02:52:35,260 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 02:52:35,260 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 02:52:35,260 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 02:52:35,260 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 02:52:35,260 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 02:52:35,260 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 02:52:35,261 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 02:52:35,261 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 02:52:35,261 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 02:52:35,261 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 02:52:35,261 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 02:52:35,262 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 02:52:35,262 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 02:52:35,262 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 02:52:35,262 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 02:52:35,262 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 02:52:35,263 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 02:52:35,263 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 02:52:35,263 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 02:52:35,263 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 02:52:35,263 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 02:52:35,264 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 02:52:35,264 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 02:52:35,264 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 02:52:35,517 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 02:52:35,532 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 02:52:35,536 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 02:52:35,537 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 02:52:35,537 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 02:52:35,537 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix052_power.oepc.i [2019-12-27 02:52:35,604 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d699cb362/3d816137bcb7488a8a424413d4d4cffb/FLAG449cd4669 [2019-12-27 02:52:36,188 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 02:52:36,188 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix052_power.oepc.i [2019-12-27 02:52:36,203 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d699cb362/3d816137bcb7488a8a424413d4d4cffb/FLAG449cd4669 [2019-12-27 02:52:36,428 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d699cb362/3d816137bcb7488a8a424413d4d4cffb [2019-12-27 02:52:36,438 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 02:52:36,440 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 02:52:36,441 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 02:52:36,441 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 02:52:36,445 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 02:52:36,446 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 02:52:36" (1/1) ... [2019-12-27 02:52:36,449 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3a3a9b46 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:52:36, skipping insertion in model container [2019-12-27 02:52:36,449 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 02:52:36" (1/1) ... [2019-12-27 02:52:36,457 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 02:52:36,509 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 02:52:37,013 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 02:52:37,025 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 02:52:37,138 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 02:52:37,210 INFO L208 MainTranslator]: Completed translation [2019-12-27 02:52:37,211 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:52:37 WrapperNode [2019-12-27 02:52:37,211 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 02:52:37,212 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 02:52:37,212 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 02:52:37,212 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 02:52:37,221 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:52:37" (1/1) ... [2019-12-27 02:52:37,242 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:52:37" (1/1) ... [2019-12-27 02:52:37,276 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 02:52:37,276 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 02:52:37,276 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 02:52:37,277 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 02:52:37,285 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:52:37" (1/1) ... [2019-12-27 02:52:37,285 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:52:37" (1/1) ... [2019-12-27 02:52:37,290 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:52:37" (1/1) ... [2019-12-27 02:52:37,291 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:52:37" (1/1) ... [2019-12-27 02:52:37,305 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:52:37" (1/1) ... [2019-12-27 02:52:37,310 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:52:37" (1/1) ... [2019-12-27 02:52:37,315 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:52:37" (1/1) ... [2019-12-27 02:52:37,321 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 02:52:37,327 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 02:52:37,328 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 02:52:37,328 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 02:52:37,329 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:52: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 02:52:37,400 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 02:52:37,400 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 02:52:37,401 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 02:52:37,401 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 02:52:37,401 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 02:52:37,402 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 02:52:37,403 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 02:52:37,404 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 02:52:37,405 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-27 02:52:37,405 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-27 02:52:37,407 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 02:52:37,407 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 02:52:37,407 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 02:52:37,410 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 02:52:38,190 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 02:52:38,191 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 02:52:38,192 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 02:52:38 BoogieIcfgContainer [2019-12-27 02:52:38,193 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 02:52:38,194 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 02:52:38,194 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 02:52:38,198 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 02:52:38,199 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 02:52:36" (1/3) ... [2019-12-27 02:52:38,200 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@72184c2f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 02:52:38, skipping insertion in model container [2019-12-27 02:52:38,200 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:52:37" (2/3) ... [2019-12-27 02:52:38,201 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@72184c2f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 02:52:38, skipping insertion in model container [2019-12-27 02:52:38,201 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 02:52:38" (3/3) ... [2019-12-27 02:52:38,204 INFO L109 eAbstractionObserver]: Analyzing ICFG mix052_power.oepc.i [2019-12-27 02:52:38,216 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 02:52:38,217 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 02:52:38,228 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 02:52:38,229 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 02:52:38,284 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:38,284 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:38,285 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:38,285 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:38,285 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:38,286 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:38,286 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:38,286 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:38,287 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:38,287 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:38,287 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:38,288 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:38,288 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:38,288 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:38,288 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:38,289 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:38,289 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:38,289 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:38,289 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:38,290 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:38,290 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:38,290 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:38,291 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:38,291 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:38,291 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:38,291 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:38,292 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:38,292 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:38,292 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:38,292 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:38,293 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:38,293 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:38,293 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:38,293 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:38,294 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:38,294 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:38,294 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:38,295 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:38,295 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:38,295 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:38,295 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:38,296 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:38,296 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:38,296 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:38,296 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:38,315 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:38,317 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:38,317 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:38,317 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:38,318 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:38,318 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:38,318 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:38,318 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:38,318 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:38,319 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:38,319 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:38,319 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:38,319 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:38,320 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:38,320 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:38,320 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:38,320 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:38,320 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:38,321 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:38,322 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:38,322 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:38,322 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:38,322 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:38,322 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:38,323 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:38,323 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:38,323 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:38,323 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:38,323 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:38,324 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:38,324 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:38,324 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:38,324 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:38,324 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:38,325 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:38,325 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:38,325 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:38,325 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:38,325 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:38,326 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:38,326 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:38,326 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:38,326 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:38,327 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:38,327 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:38,327 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:38,327 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:38,327 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:38,327 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:38,328 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:38,328 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:38,328 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:38,328 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:38,328 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:38,329 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:38,329 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:38,329 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:38,329 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:38,330 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:38,330 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:38,330 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:38,330 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:38,330 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:38,331 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:38,331 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:38,331 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:38,331 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:38,331 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:38,332 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:38,332 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:38,332 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:38,332 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:38,332 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:38,333 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:38,333 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:38,333 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:38,333 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:38,333 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:38,334 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:38,334 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:38,334 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:38,334 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:38,334 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:38,335 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:38,335 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:38,335 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:38,335 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:38,335 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:38,335 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:38,336 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:38,336 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:38,336 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:38,336 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:38,336 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:38,337 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:38,337 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:38,337 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:38,337 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:38,337 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:38,337 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:38,338 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:38,338 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:38,338 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:38,338 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:38,338 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:38,339 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:38,339 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:38,339 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:38,339 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:38,339 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:38,340 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:38,340 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:38,340 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:38,340 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:38,340 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:38,341 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:38,341 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:38,341 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:38,341 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:38,341 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:38,341 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:38,342 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:38,342 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:38,342 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:38,342 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:38,343 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:38,343 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:38,343 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:38,343 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:38,343 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:38,343 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:38,344 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:38,344 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:38,344 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:38,344 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:38,344 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:38,345 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:38,348 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:38,348 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:38,349 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:38,349 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:38,349 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:38,349 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:38,349 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:38,350 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:38,350 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:38,350 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:38,350 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:38,350 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:38,353 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:38,353 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:38,353 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:38,353 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:38,354 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:38,354 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:38,354 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:38,354 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:38,354 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:38,355 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:38,357 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:38,357 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:38,357 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:38,357 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:38,358 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:38,358 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:38,358 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:38,358 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:38,358 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:38,358 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:38,359 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:38,359 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:38,359 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:38,359 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:38,359 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:38,360 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:38,360 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:38,360 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:38,360 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:38,360 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:38,360 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:38,361 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:38,361 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:38,361 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:38,361 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:38,362 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:38,362 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:38,362 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:38,362 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:38,362 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:38,363 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:38,363 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:38,363 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:52:38,379 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-27 02:52:38,400 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 02:52:38,400 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 02:52:38,400 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 02:52:38,401 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-27 02:52:38,401 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 02:52:38,401 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 02:52:38,401 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 02:52:38,401 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 02:52:38,419 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 175 places, 212 transitions [2019-12-27 02:52:38,421 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 175 places, 212 transitions [2019-12-27 02:52:38,526 INFO L132 PetriNetUnfolder]: 47/209 cut-off events. [2019-12-27 02:52:38,526 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 02:52:38,543 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 02:52:38,566 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 175 places, 212 transitions [2019-12-27 02:52:38,621 INFO L132 PetriNetUnfolder]: 47/209 cut-off events. [2019-12-27 02:52:38,621 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 02:52:38,630 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 02:52:38,653 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 19004 [2019-12-27 02:52:38,654 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-27 02:52:44,321 WARN L192 SmtUtils]: Spent 242.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 87 [2019-12-27 02:52:44,454 WARN L192 SmtUtils]: Spent 130.00 ms on a formula simplification that was a NOOP. DAG size: 85 [2019-12-27 02:52:44,844 INFO L206 etLargeBlockEncoding]: Checked pairs total: 125946 [2019-12-27 02:52:44,844 INFO L214 etLargeBlockEncoding]: Total number of compositions: 121 [2019-12-27 02:52:44,848 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 92 places, 102 transitions [2019-12-27 02:53:02,987 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 111572 states. [2019-12-27 02:53:02,988 INFO L276 IsEmpty]: Start isEmpty. Operand 111572 states. [2019-12-27 02:53:02,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-27 02:53:02,993 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:53:02,994 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-27 02:53:02,994 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 02:53:02,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:53:02,999 INFO L82 PathProgramCache]: Analyzing trace with hash 912834, now seen corresponding path program 1 times [2019-12-27 02:53:03,007 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:53:03,007 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [169552707] [2019-12-27 02:53:03,007 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:53:03,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:53:03,215 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 02:53:03,216 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [169552707] [2019-12-27 02:53:03,217 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:53:03,217 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 02:53:03,218 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1144959174] [2019-12-27 02:53:03,222 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 02:53:03,222 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:53:03,233 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 02:53:03,233 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 02:53:03,236 INFO L87 Difference]: Start difference. First operand 111572 states. Second operand 3 states. [2019-12-27 02:53:04,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:53:04,259 INFO L93 Difference]: Finished difference Result 110910 states and 474711 transitions. [2019-12-27 02:53:04,260 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 02:53:04,261 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-27 02:53:04,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:53:07,946 INFO L225 Difference]: With dead ends: 110910 [2019-12-27 02:53:07,946 INFO L226 Difference]: Without dead ends: 98066 [2019-12-27 02:53:07,948 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 02:53:11,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98066 states. [2019-12-27 02:53:14,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98066 to 98066. [2019-12-27 02:53:14,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98066 states. [2019-12-27 02:53:14,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98066 states to 98066 states and 418629 transitions. [2019-12-27 02:53:14,527 INFO L78 Accepts]: Start accepts. Automaton has 98066 states and 418629 transitions. Word has length 3 [2019-12-27 02:53:14,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:53:14,527 INFO L462 AbstractCegarLoop]: Abstraction has 98066 states and 418629 transitions. [2019-12-27 02:53:14,527 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 02:53:14,528 INFO L276 IsEmpty]: Start isEmpty. Operand 98066 states and 418629 transitions. [2019-12-27 02:53:14,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-27 02:53:14,532 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:53:14,532 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:53:14,532 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 02:53:14,533 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:53:14,533 INFO L82 PathProgramCache]: Analyzing trace with hash 1027484309, now seen corresponding path program 1 times [2019-12-27 02:53:14,533 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:53:14,534 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2145309164] [2019-12-27 02:53:14,534 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:53:14,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:53:14,632 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 02:53:14,632 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2145309164] [2019-12-27 02:53:14,632 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:53:14,633 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 02:53:14,633 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1028361133] [2019-12-27 02:53:14,635 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 02:53:14,635 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:53:14,635 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 02:53:14,636 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 02:53:14,636 INFO L87 Difference]: Start difference. First operand 98066 states and 418629 transitions. Second operand 4 states. [2019-12-27 02:53:19,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:53:19,549 INFO L93 Difference]: Finished difference Result 156656 states and 639635 transitions. [2019-12-27 02:53:19,550 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 02:53:19,550 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-27 02:53:19,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:53:20,181 INFO L225 Difference]: With dead ends: 156656 [2019-12-27 02:53:20,181 INFO L226 Difference]: Without dead ends: 156558 [2019-12-27 02:53:20,182 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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 02:53:24,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156558 states. [2019-12-27 02:53:28,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156558 to 142946. [2019-12-27 02:53:28,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142946 states. [2019-12-27 02:53:35,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142946 states to 142946 states and 591329 transitions. [2019-12-27 02:53:35,415 INFO L78 Accepts]: Start accepts. Automaton has 142946 states and 591329 transitions. Word has length 11 [2019-12-27 02:53:35,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:53:35,416 INFO L462 AbstractCegarLoop]: Abstraction has 142946 states and 591329 transitions. [2019-12-27 02:53:35,416 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 02:53:35,416 INFO L276 IsEmpty]: Start isEmpty. Operand 142946 states and 591329 transitions. [2019-12-27 02:53:35,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 02:53:35,425 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:53:35,425 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:53:35,426 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 02:53:35,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:53:35,426 INFO L82 PathProgramCache]: Analyzing trace with hash 1461043352, now seen corresponding path program 1 times [2019-12-27 02:53:35,426 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:53:35,427 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1358693979] [2019-12-27 02:53:35,427 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:53:35,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:53:35,500 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 02:53:35,500 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1358693979] [2019-12-27 02:53:35,501 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:53:35,501 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 02:53:35,501 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1230998132] [2019-12-27 02:53:35,501 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 02:53:35,502 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:53:35,502 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 02:53:35,502 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 02:53:35,502 INFO L87 Difference]: Start difference. First operand 142946 states and 591329 transitions. Second operand 3 states. [2019-12-27 02:53:35,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:53:35,640 INFO L93 Difference]: Finished difference Result 31386 states and 102018 transitions. [2019-12-27 02:53:35,640 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 02:53:35,640 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-27 02:53:35,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:53:35,719 INFO L225 Difference]: With dead ends: 31386 [2019-12-27 02:53:35,720 INFO L226 Difference]: Without dead ends: 31386 [2019-12-27 02:53:35,721 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 02:53:35,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31386 states. [2019-12-27 02:53:36,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31386 to 31386. [2019-12-27 02:53:36,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31386 states. [2019-12-27 02:53:36,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31386 states to 31386 states and 102018 transitions. [2019-12-27 02:53:36,317 INFO L78 Accepts]: Start accepts. Automaton has 31386 states and 102018 transitions. Word has length 13 [2019-12-27 02:53:36,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:53:36,317 INFO L462 AbstractCegarLoop]: Abstraction has 31386 states and 102018 transitions. [2019-12-27 02:53:36,317 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 02:53:36,317 INFO L276 IsEmpty]: Start isEmpty. Operand 31386 states and 102018 transitions. [2019-12-27 02:53:36,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-27 02:53:36,320 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:53:36,320 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:53:36,320 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 02:53:36,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:53:36,320 INFO L82 PathProgramCache]: Analyzing trace with hash -876468662, now seen corresponding path program 1 times [2019-12-27 02:53:36,320 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:53:36,321 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2025025784] [2019-12-27 02:53:36,321 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:53:36,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:53:36,424 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 02:53:36,425 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2025025784] [2019-12-27 02:53:36,425 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:53:36,426 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 02:53:36,426 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1292498233] [2019-12-27 02:53:36,426 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 02:53:36,427 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:53:36,427 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 02:53:36,427 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 02:53:36,427 INFO L87 Difference]: Start difference. First operand 31386 states and 102018 transitions. Second operand 5 states. [2019-12-27 02:53:36,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:53:36,918 INFO L93 Difference]: Finished difference Result 43205 states and 138515 transitions. [2019-12-27 02:53:36,919 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 02:53:36,919 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2019-12-27 02:53:36,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:53:37,003 INFO L225 Difference]: With dead ends: 43205 [2019-12-27 02:53:37,003 INFO L226 Difference]: Without dead ends: 43205 [2019-12-27 02:53:37,004 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 02:53:37,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43205 states. [2019-12-27 02:53:39,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43205 to 36470. [2019-12-27 02:53:39,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36470 states. [2019-12-27 02:53:39,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36470 states to 36470 states and 117941 transitions. [2019-12-27 02:53:39,943 INFO L78 Accepts]: Start accepts. Automaton has 36470 states and 117941 transitions. Word has length 16 [2019-12-27 02:53:39,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:53:39,944 INFO L462 AbstractCegarLoop]: Abstraction has 36470 states and 117941 transitions. [2019-12-27 02:53:39,944 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 02:53:39,944 INFO L276 IsEmpty]: Start isEmpty. Operand 36470 states and 117941 transitions. [2019-12-27 02:53:39,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-27 02:53:39,954 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:53:39,954 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 02:53:39,954 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 02:53:39,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:53:39,955 INFO L82 PathProgramCache]: Analyzing trace with hash -1783143627, now seen corresponding path program 1 times [2019-12-27 02:53:39,955 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:53:39,955 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1741068185] [2019-12-27 02:53:39,955 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:53:39,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:53:40,111 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 02:53:40,112 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1741068185] [2019-12-27 02:53:40,112 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:53:40,112 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 02:53:40,113 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1362997183] [2019-12-27 02:53:40,113 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 02:53:40,113 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:53:40,114 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 02:53:40,114 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 02:53:40,115 INFO L87 Difference]: Start difference. First operand 36470 states and 117941 transitions. Second operand 6 states. [2019-12-27 02:53:41,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:53:41,021 INFO L93 Difference]: Finished difference Result 56051 states and 176371 transitions. [2019-12-27 02:53:41,023 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 02:53:41,023 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2019-12-27 02:53:41,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:53:41,114 INFO L225 Difference]: With dead ends: 56051 [2019-12-27 02:53:41,114 INFO L226 Difference]: Without dead ends: 56037 [2019-12-27 02:53:41,115 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2019-12-27 02:53:41,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56037 states. [2019-12-27 02:53:42,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56037 to 37420. [2019-12-27 02:53:42,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37420 states. [2019-12-27 02:53:42,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37420 states to 37420 states and 120221 transitions. [2019-12-27 02:53:42,267 INFO L78 Accepts]: Start accepts. Automaton has 37420 states and 120221 transitions. Word has length 22 [2019-12-27 02:53:42,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:53:42,268 INFO L462 AbstractCegarLoop]: Abstraction has 37420 states and 120221 transitions. [2019-12-27 02:53:42,268 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 02:53:42,268 INFO L276 IsEmpty]: Start isEmpty. Operand 37420 states and 120221 transitions. [2019-12-27 02:53:42,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 02:53:42,282 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:53:42,282 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 02:53:42,282 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 02:53:42,282 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:53:42,282 INFO L82 PathProgramCache]: Analyzing trace with hash 1148876988, now seen corresponding path program 1 times [2019-12-27 02:53:42,283 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:53:42,283 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [275489871] [2019-12-27 02:53:42,283 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:53:42,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:53:42,352 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 02:53:42,353 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [275489871] [2019-12-27 02:53:42,353 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:53:42,353 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 02:53:42,353 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1988971529] [2019-12-27 02:53:42,354 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 02:53:42,354 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:53:42,354 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 02:53:42,354 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 02:53:42,355 INFO L87 Difference]: Start difference. First operand 37420 states and 120221 transitions. Second operand 4 states. [2019-12-27 02:53:42,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:53:42,418 INFO L93 Difference]: Finished difference Result 15281 states and 46378 transitions. [2019-12-27 02:53:42,419 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 02:53:42,419 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2019-12-27 02:53:42,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:53:42,445 INFO L225 Difference]: With dead ends: 15281 [2019-12-27 02:53:42,445 INFO L226 Difference]: Without dead ends: 15281 [2019-12-27 02:53:42,445 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 02:53:42,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15281 states. [2019-12-27 02:53:42,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15281 to 15023. [2019-12-27 02:53:42,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15023 states. [2019-12-27 02:53:42,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15023 states to 15023 states and 45642 transitions. [2019-12-27 02:53:42,671 INFO L78 Accepts]: Start accepts. Automaton has 15023 states and 45642 transitions. Word has length 25 [2019-12-27 02:53:42,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:53:42,671 INFO L462 AbstractCegarLoop]: Abstraction has 15023 states and 45642 transitions. [2019-12-27 02:53:42,671 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 02:53:42,671 INFO L276 IsEmpty]: Start isEmpty. Operand 15023 states and 45642 transitions. [2019-12-27 02:53:42,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-27 02:53:42,682 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:53:42,682 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 02:53:42,682 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 02:53:42,683 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:53:42,683 INFO L82 PathProgramCache]: Analyzing trace with hash -1026533913, now seen corresponding path program 1 times [2019-12-27 02:53:42,683 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:53:42,683 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [479591311] [2019-12-27 02:53:42,684 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:53:42,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:53:42,788 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 02:53:42,788 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [479591311] [2019-12-27 02:53:42,788 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:53:42,788 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 02:53:42,789 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1207383780] [2019-12-27 02:53:42,789 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 02:53:42,789 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:53:42,789 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 02:53:42,790 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 02:53:42,790 INFO L87 Difference]: Start difference. First operand 15023 states and 45642 transitions. Second operand 6 states. [2019-12-27 02:53:43,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:53:43,327 INFO L93 Difference]: Finished difference Result 21679 states and 63968 transitions. [2019-12-27 02:53:43,327 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-27 02:53:43,328 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2019-12-27 02:53:43,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:53:43,358 INFO L225 Difference]: With dead ends: 21679 [2019-12-27 02:53:43,358 INFO L226 Difference]: Without dead ends: 21679 [2019-12-27 02:53:43,358 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 02:53:43,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21679 states. [2019-12-27 02:53:43,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21679 to 17339. [2019-12-27 02:53:43,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17339 states. [2019-12-27 02:53:43,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17339 states to 17339 states and 52223 transitions. [2019-12-27 02:53:43,651 INFO L78 Accepts]: Start accepts. Automaton has 17339 states and 52223 transitions. Word has length 27 [2019-12-27 02:53:43,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:53:43,651 INFO L462 AbstractCegarLoop]: Abstraction has 17339 states and 52223 transitions. [2019-12-27 02:53:43,651 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 02:53:43,651 INFO L276 IsEmpty]: Start isEmpty. Operand 17339 states and 52223 transitions. [2019-12-27 02:53:43,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-27 02:53:43,668 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:53:43,668 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 02:53:43,669 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 02:53:43,669 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:53:43,669 INFO L82 PathProgramCache]: Analyzing trace with hash 1079552274, now seen corresponding path program 1 times [2019-12-27 02:53:43,669 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:53:43,669 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1691046075] [2019-12-27 02:53:43,669 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:53:43,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:53:43,783 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 02:53:43,783 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1691046075] [2019-12-27 02:53:43,784 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:53:43,784 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 02:53:43,784 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1340891003] [2019-12-27 02:53:43,784 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 02:53:43,785 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:53:43,785 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 02:53:43,785 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-27 02:53:43,785 INFO L87 Difference]: Start difference. First operand 17339 states and 52223 transitions. Second operand 7 states. [2019-12-27 02:53:45,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:53:45,062 INFO L93 Difference]: Finished difference Result 24589 states and 72044 transitions. [2019-12-27 02:53:45,062 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-27 02:53:45,063 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 33 [2019-12-27 02:53:45,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:53:45,094 INFO L225 Difference]: With dead ends: 24589 [2019-12-27 02:53:45,094 INFO L226 Difference]: Without dead ends: 24589 [2019-12-27 02:53:45,095 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 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 02:53:45,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24589 states. [2019-12-27 02:53:45,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24589 to 16666. [2019-12-27 02:53:45,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16666 states. [2019-12-27 02:53:45,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16666 states to 16666 states and 50150 transitions. [2019-12-27 02:53:45,628 INFO L78 Accepts]: Start accepts. Automaton has 16666 states and 50150 transitions. Word has length 33 [2019-12-27 02:53:45,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:53:45,628 INFO L462 AbstractCegarLoop]: Abstraction has 16666 states and 50150 transitions. [2019-12-27 02:53:45,629 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 02:53:45,629 INFO L276 IsEmpty]: Start isEmpty. Operand 16666 states and 50150 transitions. [2019-12-27 02:53:45,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-27 02:53:45,650 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:53:45,651 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 02:53:45,651 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 02:53:45,651 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:53:45,651 INFO L82 PathProgramCache]: Analyzing trace with hash 1641373212, now seen corresponding path program 1 times [2019-12-27 02:53:45,652 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:53:45,652 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [443388100] [2019-12-27 02:53:45,652 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:53:45,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:53:45,725 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 02:53:45,725 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [443388100] [2019-12-27 02:53:45,725 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:53:45,726 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 02:53:45,726 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1395459022] [2019-12-27 02:53:45,726 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 02:53:45,726 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:53:45,727 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 02:53:45,727 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 02:53:45,727 INFO L87 Difference]: Start difference. First operand 16666 states and 50150 transitions. Second operand 5 states. [2019-12-27 02:53:45,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:53:45,810 INFO L93 Difference]: Finished difference Result 15541 states and 47563 transitions. [2019-12-27 02:53:45,810 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 02:53:45,810 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 39 [2019-12-27 02:53:45,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:53:45,833 INFO L225 Difference]: With dead ends: 15541 [2019-12-27 02:53:45,833 INFO L226 Difference]: Without dead ends: 15541 [2019-12-27 02:53:45,834 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 02:53:45,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15541 states. [2019-12-27 02:53:46,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15541 to 15044. [2019-12-27 02:53:46,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15044 states. [2019-12-27 02:53:46,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15044 states to 15044 states and 46220 transitions. [2019-12-27 02:53:46,066 INFO L78 Accepts]: Start accepts. Automaton has 15044 states and 46220 transitions. Word has length 39 [2019-12-27 02:53:46,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:53:46,066 INFO L462 AbstractCegarLoop]: Abstraction has 15044 states and 46220 transitions. [2019-12-27 02:53:46,066 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 02:53:46,066 INFO L276 IsEmpty]: Start isEmpty. Operand 15044 states and 46220 transitions. [2019-12-27 02:53:46,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 02:53:46,086 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:53:46,087 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 02:53:46,087 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 02:53:46,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:53:46,087 INFO L82 PathProgramCache]: Analyzing trace with hash -411911737, now seen corresponding path program 1 times [2019-12-27 02:53:46,087 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:53:46,087 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2040455399] [2019-12-27 02:53:46,088 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:53:46,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:53:46,137 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 02:53:46,138 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2040455399] [2019-12-27 02:53:46,138 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:53:46,138 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 02:53:46,138 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1055003388] [2019-12-27 02:53:46,139 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 02:53:46,139 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:53:46,139 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 02:53:46,139 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 02:53:46,140 INFO L87 Difference]: Start difference. First operand 15044 states and 46220 transitions. Second operand 3 states. [2019-12-27 02:53:46,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:53:46,269 INFO L93 Difference]: Finished difference Result 22609 states and 69550 transitions. [2019-12-27 02:53:46,269 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 02:53:46,270 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 64 [2019-12-27 02:53:46,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:53:46,317 INFO L225 Difference]: With dead ends: 22609 [2019-12-27 02:53:46,317 INFO L226 Difference]: Without dead ends: 22609 [2019-12-27 02:53:46,318 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 02:53:46,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22609 states. [2019-12-27 02:53:46,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22609 to 16710. [2019-12-27 02:53:46,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16710 states. [2019-12-27 02:53:46,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16710 states to 16710 states and 52163 transitions. [2019-12-27 02:53:46,791 INFO L78 Accepts]: Start accepts. Automaton has 16710 states and 52163 transitions. Word has length 64 [2019-12-27 02:53:46,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:53:46,792 INFO L462 AbstractCegarLoop]: Abstraction has 16710 states and 52163 transitions. [2019-12-27 02:53:46,792 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 02:53:46,792 INFO L276 IsEmpty]: Start isEmpty. Operand 16710 states and 52163 transitions. [2019-12-27 02:53:46,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 02:53:46,819 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:53:46,819 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 02:53:46,820 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 02:53:46,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:53:46,820 INFO L82 PathProgramCache]: Analyzing trace with hash 190415677, now seen corresponding path program 1 times [2019-12-27 02:53:46,820 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:53:46,820 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [12421484] [2019-12-27 02:53:46,821 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:53:46,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:53:46,900 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 02:53:46,900 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [12421484] [2019-12-27 02:53:46,901 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:53:46,901 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 02:53:46,901 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1969596544] [2019-12-27 02:53:46,903 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 02:53:46,903 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:53:46,903 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 02:53:46,904 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 02:53:46,904 INFO L87 Difference]: Start difference. First operand 16710 states and 52163 transitions. Second operand 4 states. [2019-12-27 02:53:47,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:53:47,044 INFO L93 Difference]: Finished difference Result 31544 states and 98598 transitions. [2019-12-27 02:53:47,045 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 02:53:47,045 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 64 [2019-12-27 02:53:47,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:53:47,075 INFO L225 Difference]: With dead ends: 31544 [2019-12-27 02:53:47,075 INFO L226 Difference]: Without dead ends: 15723 [2019-12-27 02:53:47,075 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 02:53:47,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15723 states. [2019-12-27 02:53:47,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15723 to 15723. [2019-12-27 02:53:47,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15723 states. [2019-12-27 02:53:47,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15723 states to 15723 states and 48991 transitions. [2019-12-27 02:53:47,328 INFO L78 Accepts]: Start accepts. Automaton has 15723 states and 48991 transitions. Word has length 64 [2019-12-27 02:53:47,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:53:47,328 INFO L462 AbstractCegarLoop]: Abstraction has 15723 states and 48991 transitions. [2019-12-27 02:53:47,328 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 02:53:47,328 INFO L276 IsEmpty]: Start isEmpty. Operand 15723 states and 48991 transitions. [2019-12-27 02:53:47,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 02:53:47,345 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:53:47,345 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 02:53:47,345 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 02:53:47,345 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:53:47,345 INFO L82 PathProgramCache]: Analyzing trace with hash -1559426519, now seen corresponding path program 2 times [2019-12-27 02:53:47,345 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:53:47,346 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1618430828] [2019-12-27 02:53:47,346 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:53:47,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:53:47,449 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 02:53:47,450 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1618430828] [2019-12-27 02:53:47,450 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:53:47,450 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 02:53:47,451 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1908236449] [2019-12-27 02:53:47,451 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 02:53:47,451 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:53:47,451 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 02:53:47,452 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-27 02:53:47,452 INFO L87 Difference]: Start difference. First operand 15723 states and 48991 transitions. Second operand 7 states. [2019-12-27 02:53:48,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:53:48,154 INFO L93 Difference]: Finished difference Result 46938 states and 144585 transitions. [2019-12-27 02:53:48,155 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 02:53:48,155 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 64 [2019-12-27 02:53:48,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:53:48,209 INFO L225 Difference]: With dead ends: 46938 [2019-12-27 02:53:48,209 INFO L226 Difference]: Without dead ends: 33282 [2019-12-27 02:53:48,209 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 02:53:48,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33282 states. [2019-12-27 02:53:48,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33282 to 18382. [2019-12-27 02:53:48,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18382 states. [2019-12-27 02:53:48,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18382 states to 18382 states and 57406 transitions. [2019-12-27 02:53:48,600 INFO L78 Accepts]: Start accepts. Automaton has 18382 states and 57406 transitions. Word has length 64 [2019-12-27 02:53:48,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:53:48,600 INFO L462 AbstractCegarLoop]: Abstraction has 18382 states and 57406 transitions. [2019-12-27 02:53:48,600 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 02:53:48,600 INFO L276 IsEmpty]: Start isEmpty. Operand 18382 states and 57406 transitions. [2019-12-27 02:53:48,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 02:53:48,621 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:53:48,622 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 02:53:48,622 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 02:53:48,622 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:53:48,622 INFO L82 PathProgramCache]: Analyzing trace with hash 1388462743, now seen corresponding path program 3 times [2019-12-27 02:53:48,622 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:53:48,623 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2043861287] [2019-12-27 02:53:48,623 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:53:48,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:53:48,719 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 02:53:48,720 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2043861287] [2019-12-27 02:53:48,720 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:53:48,720 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 02:53:48,720 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [871559] [2019-12-27 02:53:48,721 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 02:53:48,721 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:53:48,721 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 02:53:48,721 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-27 02:53:48,721 INFO L87 Difference]: Start difference. First operand 18382 states and 57406 transitions. Second operand 7 states. [2019-12-27 02:53:49,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:53:49,226 INFO L93 Difference]: Finished difference Result 51331 states and 159915 transitions. [2019-12-27 02:53:49,227 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-27 02:53:49,227 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 64 [2019-12-27 02:53:49,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:53:49,286 INFO L225 Difference]: With dead ends: 51331 [2019-12-27 02:53:49,287 INFO L226 Difference]: Without dead ends: 39815 [2019-12-27 02:53:49,287 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=53, Invalid=157, Unknown=0, NotChecked=0, Total=210 [2019-12-27 02:53:49,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39815 states. [2019-12-27 02:53:49,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39815 to 21811. [2019-12-27 02:53:49,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21811 states. [2019-12-27 02:53:49,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21811 states to 21811 states and 68616 transitions. [2019-12-27 02:53:49,767 INFO L78 Accepts]: Start accepts. Automaton has 21811 states and 68616 transitions. Word has length 64 [2019-12-27 02:53:49,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:53:49,768 INFO L462 AbstractCegarLoop]: Abstraction has 21811 states and 68616 transitions. [2019-12-27 02:53:49,768 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 02:53:49,768 INFO L276 IsEmpty]: Start isEmpty. Operand 21811 states and 68616 transitions. [2019-12-27 02:53:49,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 02:53:49,804 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:53:49,805 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 02:53:49,805 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 02:53:49,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:53:49,805 INFO L82 PathProgramCache]: Analyzing trace with hash -1026171661, now seen corresponding path program 4 times [2019-12-27 02:53:49,806 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:53:49,806 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [124936340] [2019-12-27 02:53:49,806 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:53:49,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:53:49,897 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 02:53:49,898 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [124936340] [2019-12-27 02:53:49,898 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:53:49,898 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 02:53:49,898 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1710844598] [2019-12-27 02:53:49,899 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 02:53:49,899 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:53:49,899 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 02:53:49,899 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-27 02:53:49,899 INFO L87 Difference]: Start difference. First operand 21811 states and 68616 transitions. Second operand 7 states. [2019-12-27 02:53:50,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:53:50,340 INFO L93 Difference]: Finished difference Result 45057 states and 140142 transitions. [2019-12-27 02:53:50,340 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-27 02:53:50,340 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 64 [2019-12-27 02:53:50,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:53:50,400 INFO L225 Difference]: With dead ends: 45057 [2019-12-27 02:53:50,400 INFO L226 Difference]: Without dead ends: 40843 [2019-12-27 02:53:50,400 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 02:53:50,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40843 states. [2019-12-27 02:53:51,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40843 to 22027. [2019-12-27 02:53:51,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22027 states. [2019-12-27 02:53:51,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22027 states to 22027 states and 69303 transitions. [2019-12-27 02:53:51,186 INFO L78 Accepts]: Start accepts. Automaton has 22027 states and 69303 transitions. Word has length 64 [2019-12-27 02:53:51,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:53:51,186 INFO L462 AbstractCegarLoop]: Abstraction has 22027 states and 69303 transitions. [2019-12-27 02:53:51,186 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 02:53:51,186 INFO L276 IsEmpty]: Start isEmpty. Operand 22027 states and 69303 transitions. [2019-12-27 02:53:51,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 02:53:51,210 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:53:51,210 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 02:53:51,210 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 02:53:51,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:53:51,211 INFO L82 PathProgramCache]: Analyzing trace with hash -1087297877, now seen corresponding path program 5 times [2019-12-27 02:53:51,211 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:53:51,211 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1004051319] [2019-12-27 02:53:51,211 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:53:51,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:53:51,311 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 02:53:51,311 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1004051319] [2019-12-27 02:53:51,312 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:53:51,312 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 02:53:51,312 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1123805764] [2019-12-27 02:53:51,312 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 02:53:51,313 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:53:51,313 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 02:53:51,313 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 02:53:51,313 INFO L87 Difference]: Start difference. First operand 22027 states and 69303 transitions. Second operand 5 states. [2019-12-27 02:53:51,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:53:51,895 INFO L93 Difference]: Finished difference Result 34201 states and 104680 transitions. [2019-12-27 02:53:51,895 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 02:53:51,895 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 64 [2019-12-27 02:53:51,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:53:51,957 INFO L225 Difference]: With dead ends: 34201 [2019-12-27 02:53:51,957 INFO L226 Difference]: Without dead ends: 34033 [2019-12-27 02:53:51,958 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 02:53:52,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34033 states. [2019-12-27 02:53:52,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34033 to 28062. [2019-12-27 02:53:52,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28062 states. [2019-12-27 02:53:52,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28062 states to 28062 states and 87165 transitions. [2019-12-27 02:53:52,423 INFO L78 Accepts]: Start accepts. Automaton has 28062 states and 87165 transitions. Word has length 64 [2019-12-27 02:53:52,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:53:52,424 INFO L462 AbstractCegarLoop]: Abstraction has 28062 states and 87165 transitions. [2019-12-27 02:53:52,424 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 02:53:52,424 INFO L276 IsEmpty]: Start isEmpty. Operand 28062 states and 87165 transitions. [2019-12-27 02:53:52,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 02:53:52,453 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:53:52,453 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 02:53:52,453 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 02:53:52,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:53:52,454 INFO L82 PathProgramCache]: Analyzing trace with hash -738203667, now seen corresponding path program 6 times [2019-12-27 02:53:52,454 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:53:52,454 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [253144778] [2019-12-27 02:53:52,454 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:53:52,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:53:52,539 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 02:53:52,539 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [253144778] [2019-12-27 02:53:52,539 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:53:52,540 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 02:53:52,540 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [914795123] [2019-12-27 02:53:52,540 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 02:53:52,540 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:53:52,541 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 02:53:52,541 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 02:53:52,541 INFO L87 Difference]: Start difference. First operand 28062 states and 87165 transitions. Second operand 5 states. [2019-12-27 02:53:52,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:53:52,929 INFO L93 Difference]: Finished difference Result 30014 states and 92644 transitions. [2019-12-27 02:53:52,930 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 02:53:52,930 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 64 [2019-12-27 02:53:52,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:53:52,973 INFO L225 Difference]: With dead ends: 30014 [2019-12-27 02:53:52,974 INFO L226 Difference]: Without dead ends: 30014 [2019-12-27 02:53:52,974 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 1 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 02:53:53,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30014 states. [2019-12-27 02:53:53,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30014 to 28475. [2019-12-27 02:53:53,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28475 states. [2019-12-27 02:53:53,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28475 states to 28475 states and 88433 transitions. [2019-12-27 02:53:53,729 INFO L78 Accepts]: Start accepts. Automaton has 28475 states and 88433 transitions. Word has length 64 [2019-12-27 02:53:53,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:53:53,729 INFO L462 AbstractCegarLoop]: Abstraction has 28475 states and 88433 transitions. [2019-12-27 02:53:53,729 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 02:53:53,729 INFO L276 IsEmpty]: Start isEmpty. Operand 28475 states and 88433 transitions. [2019-12-27 02:53:53,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 02:53:53,761 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:53:53,762 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 02:53:53,762 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 02:53:53,762 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:53:53,762 INFO L82 PathProgramCache]: Analyzing trace with hash 2028716035, now seen corresponding path program 7 times [2019-12-27 02:53:53,762 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:53:53,762 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [321061710] [2019-12-27 02:53:53,762 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:53:53,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:53:53,854 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 02:53:53,854 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [321061710] [2019-12-27 02:53:53,854 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:53:53,854 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 02:53:53,855 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [64982618] [2019-12-27 02:53:53,855 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 02:53:53,855 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:53:53,855 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 02:53:53,856 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 02:53:53,856 INFO L87 Difference]: Start difference. First operand 28475 states and 88433 transitions. Second operand 6 states. [2019-12-27 02:53:54,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:53:54,634 INFO L93 Difference]: Finished difference Result 48040 states and 146628 transitions. [2019-12-27 02:53:54,634 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-27 02:53:54,634 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 64 [2019-12-27 02:53:54,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:53:54,705 INFO L225 Difference]: With dead ends: 48040 [2019-12-27 02:53:54,705 INFO L226 Difference]: Without dead ends: 47747 [2019-12-27 02:53:54,705 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-12-27 02:53:54,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47747 states. [2019-12-27 02:53:55,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47747 to 36218. [2019-12-27 02:53:55,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36218 states. [2019-12-27 02:53:55,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36218 states to 36218 states and 112422 transitions. [2019-12-27 02:53:55,386 INFO L78 Accepts]: Start accepts. Automaton has 36218 states and 112422 transitions. Word has length 64 [2019-12-27 02:53:55,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:53:55,387 INFO L462 AbstractCegarLoop]: Abstraction has 36218 states and 112422 transitions. [2019-12-27 02:53:55,387 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 02:53:55,387 INFO L276 IsEmpty]: Start isEmpty. Operand 36218 states and 112422 transitions. [2019-12-27 02:53:55,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 02:53:55,428 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:53:55,428 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 02:53:55,429 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 02:53:55,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:53:55,429 INFO L82 PathProgramCache]: Analyzing trace with hash -2089785517, now seen corresponding path program 8 times [2019-12-27 02:53:55,429 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:53:55,429 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [808381132] [2019-12-27 02:53:55,429 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:53:55,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:53:55,541 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 02:53:55,542 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [808381132] [2019-12-27 02:53:55,544 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:53:55,544 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 02:53:55,547 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1268950727] [2019-12-27 02:53:55,548 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 02:53:55,548 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:53:55,548 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 02:53:55,548 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 02:53:55,548 INFO L87 Difference]: Start difference. First operand 36218 states and 112422 transitions. Second operand 3 states. [2019-12-27 02:53:55,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:53:55,706 INFO L93 Difference]: Finished difference Result 36218 states and 112421 transitions. [2019-12-27 02:53:55,706 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 02:53:55,706 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 64 [2019-12-27 02:53:55,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:53:55,765 INFO L225 Difference]: With dead ends: 36218 [2019-12-27 02:53:55,766 INFO L226 Difference]: Without dead ends: 36218 [2019-12-27 02:53:55,766 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 02:53:55,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36218 states. [2019-12-27 02:53:56,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36218 to 31693. [2019-12-27 02:53:56,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31693 states. [2019-12-27 02:53:56,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31693 states to 31693 states and 99497 transitions. [2019-12-27 02:53:56,680 INFO L78 Accepts]: Start accepts. Automaton has 31693 states and 99497 transitions. Word has length 64 [2019-12-27 02:53:56,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:53:56,681 INFO L462 AbstractCegarLoop]: Abstraction has 31693 states and 99497 transitions. [2019-12-27 02:53:56,681 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 02:53:56,681 INFO L276 IsEmpty]: Start isEmpty. Operand 31693 states and 99497 transitions. [2019-12-27 02:53:56,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 02:53:56,718 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:53:56,718 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 02:53:56,718 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 02:53:56,718 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:53:56,718 INFO L82 PathProgramCache]: Analyzing trace with hash 1914914851, now seen corresponding path program 1 times [2019-12-27 02:53:56,718 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:53:56,718 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [205900576] [2019-12-27 02:53:56,719 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:53:56,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:53:56,809 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 02:53:56,809 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [205900576] [2019-12-27 02:53:56,809 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:53:56,809 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 02:53:56,809 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [617180553] [2019-12-27 02:53:56,810 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 02:53:56,810 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:53:56,810 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 02:53:56,810 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-27 02:53:56,811 INFO L87 Difference]: Start difference. First operand 31693 states and 99497 transitions. Second operand 6 states. [2019-12-27 02:53:57,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:53:57,262 INFO L93 Difference]: Finished difference Result 33466 states and 104373 transitions. [2019-12-27 02:53:57,265 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-27 02:53:57,265 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 65 [2019-12-27 02:53:57,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:53:57,332 INFO L225 Difference]: With dead ends: 33466 [2019-12-27 02:53:57,332 INFO L226 Difference]: Without dead ends: 33466 [2019-12-27 02:53:57,333 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 3 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-12-27 02:53:57,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33466 states. [2019-12-27 02:53:57,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33466 to 31726. [2019-12-27 02:53:57,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31726 states. [2019-12-27 02:53:57,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31726 states to 31726 states and 99597 transitions. [2019-12-27 02:53:57,857 INFO L78 Accepts]: Start accepts. Automaton has 31726 states and 99597 transitions. Word has length 65 [2019-12-27 02:53:57,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:53:57,858 INFO L462 AbstractCegarLoop]: Abstraction has 31726 states and 99597 transitions. [2019-12-27 02:53:57,858 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 02:53:57,858 INFO L276 IsEmpty]: Start isEmpty. Operand 31726 states and 99597 transitions. [2019-12-27 02:53:57,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 02:53:57,894 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:53:57,894 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 02:53:57,894 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 02:53:57,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:53:57,895 INFO L82 PathProgramCache]: Analyzing trace with hash -1796094165, now seen corresponding path program 2 times [2019-12-27 02:53:57,895 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:53:57,895 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1703981361] [2019-12-27 02:53:57,895 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:53:57,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:53:57,957 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 02:53:57,957 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1703981361] [2019-12-27 02:53:57,957 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:53:57,958 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 02:53:57,958 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1393618313] [2019-12-27 02:53:57,958 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 02:53:57,959 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:53:57,959 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 02:53:57,959 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 02:53:57,959 INFO L87 Difference]: Start difference. First operand 31726 states and 99597 transitions. Second operand 3 states. [2019-12-27 02:53:58,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:53:58,048 INFO L93 Difference]: Finished difference Result 23388 states and 72333 transitions. [2019-12-27 02:53:58,049 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 02:53:58,049 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-27 02:53:58,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:53:58,080 INFO L225 Difference]: With dead ends: 23388 [2019-12-27 02:53:58,080 INFO L226 Difference]: Without dead ends: 23388 [2019-12-27 02:53:58,081 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 02:53:58,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23388 states. [2019-12-27 02:53:58,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23388 to 22384. [2019-12-27 02:53:58,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22384 states. [2019-12-27 02:53:58,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22384 states to 22384 states and 69136 transitions. [2019-12-27 02:53:58,417 INFO L78 Accepts]: Start accepts. Automaton has 22384 states and 69136 transitions. Word has length 65 [2019-12-27 02:53:58,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:53:58,417 INFO L462 AbstractCegarLoop]: Abstraction has 22384 states and 69136 transitions. [2019-12-27 02:53:58,417 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 02:53:58,418 INFO L276 IsEmpty]: Start isEmpty. Operand 22384 states and 69136 transitions. [2019-12-27 02:53:58,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 02:53:58,445 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:53:58,445 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 02:53:58,445 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 02:53:58,446 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:53:58,446 INFO L82 PathProgramCache]: Analyzing trace with hash -1860630415, now seen corresponding path program 1 times [2019-12-27 02:53:58,446 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:53:58,447 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1249826792] [2019-12-27 02:53:58,447 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:53:58,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:53:58,557 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 02:53:58,557 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1249826792] [2019-12-27 02:53:58,557 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:53:58,558 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 02:53:58,558 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2143680342] [2019-12-27 02:53:58,559 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 02:53:58,559 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:53:58,559 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 02:53:58,559 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-12-27 02:53:58,559 INFO L87 Difference]: Start difference. First operand 22384 states and 69136 transitions. Second operand 8 states. [2019-12-27 02:54:00,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:54:00,882 INFO L93 Difference]: Finished difference Result 36775 states and 110702 transitions. [2019-12-27 02:54:00,882 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-27 02:54:00,882 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 66 [2019-12-27 02:54:00,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:54:00,929 INFO L225 Difference]: With dead ends: 36775 [2019-12-27 02:54:00,929 INFO L226 Difference]: Without dead ends: 36503 [2019-12-27 02:54:00,930 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 10 SyntacticMatches, 2 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 190 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=152, Invalid=660, Unknown=0, NotChecked=0, Total=812 [2019-12-27 02:54:01,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36503 states. [2019-12-27 02:54:01,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36503 to 24201. [2019-12-27 02:54:01,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24201 states. [2019-12-27 02:54:01,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24201 states to 24201 states and 74702 transitions. [2019-12-27 02:54:01,392 INFO L78 Accepts]: Start accepts. Automaton has 24201 states and 74702 transitions. Word has length 66 [2019-12-27 02:54:01,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:54:01,392 INFO L462 AbstractCegarLoop]: Abstraction has 24201 states and 74702 transitions. [2019-12-27 02:54:01,392 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 02:54:01,392 INFO L276 IsEmpty]: Start isEmpty. Operand 24201 states and 74702 transitions. [2019-12-27 02:54:01,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 02:54:01,421 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:54:01,421 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 02:54:01,421 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 02:54:01,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:54:01,422 INFO L82 PathProgramCache]: Analyzing trace with hash 1036503919, now seen corresponding path program 2 times [2019-12-27 02:54:01,422 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:54:01,422 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [665908486] [2019-12-27 02:54:01,422 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:54:01,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:54:01,520 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 02:54:01,520 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [665908486] [2019-12-27 02:54:01,520 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:54:01,520 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 02:54:01,521 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1763826554] [2019-12-27 02:54:01,521 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 02:54:01,521 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:54:01,521 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 02:54:01,522 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-12-27 02:54:01,523 INFO L87 Difference]: Start difference. First operand 24201 states and 74702 transitions. Second operand 9 states. [2019-12-27 02:54:03,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:54:03,148 INFO L93 Difference]: Finished difference Result 45743 states and 140753 transitions. [2019-12-27 02:54:03,148 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-27 02:54:03,148 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 66 [2019-12-27 02:54:03,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:54:03,204 INFO L225 Difference]: With dead ends: 45743 [2019-12-27 02:54:03,204 INFO L226 Difference]: Without dead ends: 36796 [2019-12-27 02:54:03,205 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=100, Invalid=362, Unknown=0, NotChecked=0, Total=462 [2019-12-27 02:54:03,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36796 states. [2019-12-27 02:54:03,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36796 to 24806. [2019-12-27 02:54:03,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24806 states. [2019-12-27 02:54:03,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24806 states to 24806 states and 76001 transitions. [2019-12-27 02:54:03,666 INFO L78 Accepts]: Start accepts. Automaton has 24806 states and 76001 transitions. Word has length 66 [2019-12-27 02:54:03,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:54:03,666 INFO L462 AbstractCegarLoop]: Abstraction has 24806 states and 76001 transitions. [2019-12-27 02:54:03,666 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 02:54:03,666 INFO L276 IsEmpty]: Start isEmpty. Operand 24806 states and 76001 transitions. [2019-12-27 02:54:03,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 02:54:03,691 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:54:03,691 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 02:54:03,692 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 02:54:03,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:54:03,692 INFO L82 PathProgramCache]: Analyzing trace with hash 216698061, now seen corresponding path program 3 times [2019-12-27 02:54:03,692 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:54:03,693 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1126455207] [2019-12-27 02:54:03,693 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:54:03,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:54:03,851 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 02:54:03,853 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1126455207] [2019-12-27 02:54:03,853 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:54:03,854 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 02:54:03,854 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1830470222] [2019-12-27 02:54:03,854 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 02:54:03,854 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:54:03,855 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 02:54:03,855 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-27 02:54:03,855 INFO L87 Difference]: Start difference. First operand 24806 states and 76001 transitions. Second operand 11 states. [2019-12-27 02:54:05,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:54:05,441 INFO L93 Difference]: Finished difference Result 49982 states and 152918 transitions. [2019-12-27 02:54:05,441 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-12-27 02:54:05,441 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 66 [2019-12-27 02:54:05,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:54:05,501 INFO L225 Difference]: With dead ends: 49982 [2019-12-27 02:54:05,501 INFO L226 Difference]: Without dead ends: 40195 [2019-12-27 02:54:05,502 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 235 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=203, Invalid=853, Unknown=0, NotChecked=0, Total=1056 [2019-12-27 02:54:05,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40195 states. [2019-12-27 02:54:05,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40195 to 23864. [2019-12-27 02:54:05,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23864 states. [2019-12-27 02:54:05,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23864 states to 23864 states and 73092 transitions. [2019-12-27 02:54:05,992 INFO L78 Accepts]: Start accepts. Automaton has 23864 states and 73092 transitions. Word has length 66 [2019-12-27 02:54:05,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:54:05,992 INFO L462 AbstractCegarLoop]: Abstraction has 23864 states and 73092 transitions. [2019-12-27 02:54:05,992 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 02:54:05,993 INFO L276 IsEmpty]: Start isEmpty. Operand 23864 states and 73092 transitions. [2019-12-27 02:54:06,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 02:54:06,021 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:54:06,021 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 02:54:06,021 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 02:54:06,021 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:54:06,021 INFO L82 PathProgramCache]: Analyzing trace with hash -821584657, now seen corresponding path program 4 times [2019-12-27 02:54:06,021 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:54:06,021 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [173027391] [2019-12-27 02:54:06,021 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:54:06,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:54:06,114 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 02:54:06,114 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [173027391] [2019-12-27 02:54:06,115 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:54:06,115 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 02:54:06,115 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1955437610] [2019-12-27 02:54:06,116 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 02:54:06,117 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:54:06,117 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 02:54:06,117 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 02:54:06,117 INFO L87 Difference]: Start difference. First operand 23864 states and 73092 transitions. Second operand 4 states. [2019-12-27 02:54:06,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:54:06,293 INFO L93 Difference]: Finished difference Result 27941 states and 85304 transitions. [2019-12-27 02:54:06,294 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 02:54:06,294 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 66 [2019-12-27 02:54:06,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:54:06,349 INFO L225 Difference]: With dead ends: 27941 [2019-12-27 02:54:06,349 INFO L226 Difference]: Without dead ends: 27941 [2019-12-27 02:54:06,349 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 1 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 02:54:06,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27941 states. [2019-12-27 02:54:06,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27941 to 23912. [2019-12-27 02:54:06,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23912 states. [2019-12-27 02:54:06,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23912 states to 23912 states and 73418 transitions. [2019-12-27 02:54:06,792 INFO L78 Accepts]: Start accepts. Automaton has 23912 states and 73418 transitions. Word has length 66 [2019-12-27 02:54:06,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:54:06,792 INFO L462 AbstractCegarLoop]: Abstraction has 23912 states and 73418 transitions. [2019-12-27 02:54:06,792 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 02:54:06,792 INFO L276 IsEmpty]: Start isEmpty. Operand 23912 states and 73418 transitions. [2019-12-27 02:54:06,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 02:54:06,821 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:54:06,821 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 02:54:06,821 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 02:54:06,821 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:54:06,821 INFO L82 PathProgramCache]: Analyzing trace with hash -1156108883, now seen corresponding path program 1 times [2019-12-27 02:54:06,821 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:54:06,821 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2008339042] [2019-12-27 02:54:06,821 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:54:06,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:54:07,035 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 02:54:07,036 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2008339042] [2019-12-27 02:54:07,036 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:54:07,036 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-27 02:54:07,037 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [893373217] [2019-12-27 02:54:07,037 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-27 02:54:07,037 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:54:07,038 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-27 02:54:07,038 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2019-12-27 02:54:07,038 INFO L87 Difference]: Start difference. First operand 23912 states and 73418 transitions. Second operand 12 states. [2019-12-27 02:54:08,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:54:08,010 INFO L93 Difference]: Finished difference Result 40486 states and 124488 transitions. [2019-12-27 02:54:08,010 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-27 02:54:08,011 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 67 [2019-12-27 02:54:08,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:54:08,066 INFO L225 Difference]: With dead ends: 40486 [2019-12-27 02:54:08,066 INFO L226 Difference]: Without dead ends: 40057 [2019-12-27 02:54:08,067 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=133, Invalid=569, Unknown=0, NotChecked=0, Total=702 [2019-12-27 02:54:08,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40057 states. [2019-12-27 02:54:08,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40057 to 23658. [2019-12-27 02:54:08,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23658 states. [2019-12-27 02:54:08,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23658 states to 23658 states and 72774 transitions. [2019-12-27 02:54:08,839 INFO L78 Accepts]: Start accepts. Automaton has 23658 states and 72774 transitions. Word has length 67 [2019-12-27 02:54:08,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:54:08,839 INFO L462 AbstractCegarLoop]: Abstraction has 23658 states and 72774 transitions. [2019-12-27 02:54:08,839 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-27 02:54:08,839 INFO L276 IsEmpty]: Start isEmpty. Operand 23658 states and 72774 transitions. [2019-12-27 02:54:08,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 02:54:08,862 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:54:08,863 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 02:54:08,863 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 02:54:08,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:54:08,863 INFO L82 PathProgramCache]: Analyzing trace with hash 750664618, now seen corresponding path program 1 times [2019-12-27 02:54:08,863 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:54:08,863 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1634828682] [2019-12-27 02:54:08,863 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:54:08,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:54:08,911 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 02:54:08,911 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1634828682] [2019-12-27 02:54:08,911 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:54:08,912 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 02:54:08,912 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [852736532] [2019-12-27 02:54:08,912 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 02:54:08,912 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:54:08,913 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 02:54:08,913 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 02:54:08,913 INFO L87 Difference]: Start difference. First operand 23658 states and 72774 transitions. Second operand 4 states. [2019-12-27 02:54:09,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:54:09,354 INFO L93 Difference]: Finished difference Result 35745 states and 110826 transitions. [2019-12-27 02:54:09,355 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 02:54:09,355 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 67 [2019-12-27 02:54:09,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:54:09,439 INFO L225 Difference]: With dead ends: 35745 [2019-12-27 02:54:09,439 INFO L226 Difference]: Without dead ends: 35745 [2019-12-27 02:54:09,439 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 02:54:09,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35745 states. [2019-12-27 02:54:09,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35745 to 25027. [2019-12-27 02:54:09,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25027 states. [2019-12-27 02:54:10,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25027 states to 25027 states and 77638 transitions. [2019-12-27 02:54:10,015 INFO L78 Accepts]: Start accepts. Automaton has 25027 states and 77638 transitions. Word has length 67 [2019-12-27 02:54:10,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:54:10,015 INFO L462 AbstractCegarLoop]: Abstraction has 25027 states and 77638 transitions. [2019-12-27 02:54:10,015 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 02:54:10,015 INFO L276 IsEmpty]: Start isEmpty. Operand 25027 states and 77638 transitions. [2019-12-27 02:54:10,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 02:54:10,043 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:54:10,043 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 02:54:10,043 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 02:54:10,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:54:10,043 INFO L82 PathProgramCache]: Analyzing trace with hash 1791716501, now seen corresponding path program 1 times [2019-12-27 02:54:10,043 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:54:10,043 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1323842207] [2019-12-27 02:54:10,043 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:54:10,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:54:10,268 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 02:54:10,269 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1323842207] [2019-12-27 02:54:10,269 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:54:10,269 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 02:54:10,269 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1725967756] [2019-12-27 02:54:10,270 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-27 02:54:10,270 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:54:10,271 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-27 02:54:10,272 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2019-12-27 02:54:10,272 INFO L87 Difference]: Start difference. First operand 25027 states and 77638 transitions. Second operand 10 states. [2019-12-27 02:54:11,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:54:11,564 INFO L93 Difference]: Finished difference Result 36112 states and 108864 transitions. [2019-12-27 02:54:11,565 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-27 02:54:11,565 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 67 [2019-12-27 02:54:11,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:54:11,615 INFO L225 Difference]: With dead ends: 36112 [2019-12-27 02:54:11,615 INFO L226 Difference]: Without dead ends: 35896 [2019-12-27 02:54:11,615 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=57, Invalid=125, Unknown=0, NotChecked=0, Total=182 [2019-12-27 02:54:11,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35896 states. [2019-12-27 02:54:12,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35896 to 26937. [2019-12-27 02:54:12,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26937 states. [2019-12-27 02:54:12,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26937 states to 26937 states and 82549 transitions. [2019-12-27 02:54:12,089 INFO L78 Accepts]: Start accepts. Automaton has 26937 states and 82549 transitions. Word has length 67 [2019-12-27 02:54:12,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:54:12,089 INFO L462 AbstractCegarLoop]: Abstraction has 26937 states and 82549 transitions. [2019-12-27 02:54:12,089 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-27 02:54:12,090 INFO L276 IsEmpty]: Start isEmpty. Operand 26937 states and 82549 transitions. [2019-12-27 02:54:12,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 02:54:12,119 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:54:12,120 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 02:54:12,120 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 02:54:12,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:54:12,120 INFO L82 PathProgramCache]: Analyzing trace with hash -3014007, now seen corresponding path program 1 times [2019-12-27 02:54:12,120 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:54:12,120 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1784126896] [2019-12-27 02:54:12,120 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:54:12,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:54:12,165 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 02:54:12,166 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1784126896] [2019-12-27 02:54:12,166 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:54:12,166 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 02:54:12,166 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2138007719] [2019-12-27 02:54:12,167 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 02:54:12,167 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:54:12,167 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 02:54:12,167 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 02:54:12,167 INFO L87 Difference]: Start difference. First operand 26937 states and 82549 transitions. Second operand 3 states. [2019-12-27 02:54:12,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:54:12,789 INFO L93 Difference]: Finished difference Result 36999 states and 112747 transitions. [2019-12-27 02:54:12,789 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 02:54:12,790 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 67 [2019-12-27 02:54:12,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:54:12,863 INFO L225 Difference]: With dead ends: 36999 [2019-12-27 02:54:12,863 INFO L226 Difference]: Without dead ends: 36999 [2019-12-27 02:54:12,864 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 02:54:13,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36999 states. [2019-12-27 02:54:13,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36999 to 26911. [2019-12-27 02:54:13,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26911 states. [2019-12-27 02:54:13,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26911 states to 26911 states and 82512 transitions. [2019-12-27 02:54:13,397 INFO L78 Accepts]: Start accepts. Automaton has 26911 states and 82512 transitions. Word has length 67 [2019-12-27 02:54:13,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:54:13,397 INFO L462 AbstractCegarLoop]: Abstraction has 26911 states and 82512 transitions. [2019-12-27 02:54:13,397 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 02:54:13,397 INFO L276 IsEmpty]: Start isEmpty. Operand 26911 states and 82512 transitions. [2019-12-27 02:54:13,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 02:54:13,424 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:54:13,424 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 02:54:13,424 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 02:54:13,425 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:54:13,425 INFO L82 PathProgramCache]: Analyzing trace with hash 1799686927, now seen corresponding path program 2 times [2019-12-27 02:54:13,425 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:54:13,425 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1607195385] [2019-12-27 02:54:13,425 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:54:13,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:54:13,550 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 02:54:13,551 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1607195385] [2019-12-27 02:54:13,551 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:54:13,551 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-27 02:54:13,551 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [611764381] [2019-12-27 02:54:13,552 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-27 02:54:13,552 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:54:13,552 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-27 02:54:13,552 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2019-12-27 02:54:13,552 INFO L87 Difference]: Start difference. First operand 26911 states and 82512 transitions. Second operand 10 states. [2019-12-27 02:54:15,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:54:15,335 INFO L93 Difference]: Finished difference Result 59396 states and 184037 transitions. [2019-12-27 02:54:15,336 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-12-27 02:54:15,336 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 67 [2019-12-27 02:54:15,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:54:15,428 INFO L225 Difference]: With dead ends: 59396 [2019-12-27 02:54:15,428 INFO L226 Difference]: Without dead ends: 59396 [2019-12-27 02:54:15,429 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 251 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=244, Invalid=748, Unknown=0, NotChecked=0, Total=992 [2019-12-27 02:54:15,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59396 states. [2019-12-27 02:54:16,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59396 to 29440. [2019-12-27 02:54:16,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29440 states. [2019-12-27 02:54:16,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29440 states to 29440 states and 90395 transitions. [2019-12-27 02:54:16,109 INFO L78 Accepts]: Start accepts. Automaton has 29440 states and 90395 transitions. Word has length 67 [2019-12-27 02:54:16,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:54:16,109 INFO L462 AbstractCegarLoop]: Abstraction has 29440 states and 90395 transitions. [2019-12-27 02:54:16,109 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-27 02:54:16,109 INFO L276 IsEmpty]: Start isEmpty. Operand 29440 states and 90395 transitions. [2019-12-27 02:54:16,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 02:54:16,140 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:54:16,140 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 02:54:16,140 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 02:54:16,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:54:16,140 INFO L82 PathProgramCache]: Analyzing trace with hash 1038037876, now seen corresponding path program 1 times [2019-12-27 02:54:16,140 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:54:16,141 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [197425899] [2019-12-27 02:54:16,141 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:54:16,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:54:16,232 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 02:54:16,232 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [197425899] [2019-12-27 02:54:16,233 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:54:16,233 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 02:54:16,233 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [934965290] [2019-12-27 02:54:16,233 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 02:54:16,233 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:54:16,234 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 02:54:16,234 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 02:54:16,234 INFO L87 Difference]: Start difference. First operand 29440 states and 90395 transitions. Second operand 4 states. [2019-12-27 02:54:16,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:54:16,435 INFO L93 Difference]: Finished difference Result 29285 states and 89662 transitions. [2019-12-27 02:54:16,435 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 02:54:16,435 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 67 [2019-12-27 02:54:16,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:54:16,496 INFO L225 Difference]: With dead ends: 29285 [2019-12-27 02:54:16,496 INFO L226 Difference]: Without dead ends: 29285 [2019-12-27 02:54:16,496 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 3 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 02:54:16,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29285 states. [2019-12-27 02:54:17,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29285 to 23492. [2019-12-27 02:54:17,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23492 states. [2019-12-27 02:54:17,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23492 states to 23492 states and 71268 transitions. [2019-12-27 02:54:17,286 INFO L78 Accepts]: Start accepts. Automaton has 23492 states and 71268 transitions. Word has length 67 [2019-12-27 02:54:17,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:54:17,286 INFO L462 AbstractCegarLoop]: Abstraction has 23492 states and 71268 transitions. [2019-12-27 02:54:17,286 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 02:54:17,286 INFO L276 IsEmpty]: Start isEmpty. Operand 23492 states and 71268 transitions. [2019-12-27 02:54:17,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 02:54:17,308 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:54:17,308 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 02:54:17,308 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 02:54:17,309 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:54:17,309 INFO L82 PathProgramCache]: Analyzing trace with hash -2101838907, now seen corresponding path program 2 times [2019-12-27 02:54:17,309 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:54:17,309 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [238901576] [2019-12-27 02:54:17,309 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:54:17,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 02:54:17,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 02:54:17,417 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 02:54:17,418 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 02:54:17,422 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [894] [894] ULTIMATE.startENTRY-->L820: Formula: (let ((.cse0 (store |v_#valid_71| 0 0))) (and (= |v_#valid_69| (store .cse0 |v_ULTIMATE.start_main_~#t1385~0.base_26| 1)) (= v_~z$w_buff0_used~0_958 0) (= v_~x~0_72 0) (= v_~z$r_buff0_thd2~0_111 0) (= |v_#NULL.offset_6| 0) (= 0 v_~__unbuffered_p1_EAX~0_40) (= v_~z$r_buff1_thd0~0_129 0) (= |v_#length_23| (store |v_#length_24| |v_ULTIMATE.start_main_~#t1385~0.base_26| 4)) (= v_~z$w_buff1_used~0_531 0) (= v_~y~0_19 0) (= |v_ULTIMATE.start_main_~#t1385~0.offset_19| 0) (= v_~z$r_buff0_thd1~0_132 0) (= v_~z$r_buff1_thd1~0_108 0) (= v_~z$read_delayed_var~0.offset_7 0) (= v_~main$tmp_guard1~0_39 0) (= v_~z$w_buff0~0_487 0) (< 0 |v_#StackHeapBarrier_18|) (= v_~z$r_buff1_thd2~0_104 0) (= (store |v_#memory_int_22| |v_ULTIMATE.start_main_~#t1385~0.base_26| (store (select |v_#memory_int_22| |v_ULTIMATE.start_main_~#t1385~0.base_26|) |v_ULTIMATE.start_main_~#t1385~0.offset_19| 0)) |v_#memory_int_21|) (= 0 v_~__unbuffered_p2_EAX~0_53) (= (select .cse0 |v_ULTIMATE.start_main_~#t1385~0.base_26|) 0) (< |v_#StackHeapBarrier_18| |v_ULTIMATE.start_main_~#t1385~0.base_26|) (= v_~z$w_buff1~0_307 0) (= 0 v_~z$r_buff1_thd3~0_237) (= 0 |v_#NULL.base_6|) (= 0 v_~z$flush_delayed~0_24) (= v_~z$r_buff0_thd0~0_141 0) (= v_~z$read_delayed_var~0.base_7 0) (= v_~z$read_delayed~0_7 0) (= v_~z$mem_tmp~0_13 0) (= v_~z~0_174 0) (= 0 v_~__unbuffered_cnt~0_91) (= 0 v_~z$r_buff0_thd3~0_332) (= v_~main$tmp_guard0~0_26 0) (= v_~weak$$choice2~0_107 0) (= 0 v_~weak$$choice0~0_12))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_18|, #valid=|v_#valid_71|, #memory_int=|v_#memory_int_22|, #length=|v_#length_24|} OutVars{~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_104, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_31|, ULTIMATE.start_main_~#t1387~0.offset=|v_ULTIMATE.start_main_~#t1387~0.offset_12|, #NULL.offset=|v_#NULL.offset_6|, ULTIMATE.start_main_#t~ite49=|v_ULTIMATE.start_main_#t~ite49_287|, ULTIMATE.start_main_#t~ite50=|v_ULTIMATE.start_main_#t~ite50_41|, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_85|, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_141, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_40, #length=|v_#length_23|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_53, ULTIMATE.start_main_~#t1387~0.base=|v_ULTIMATE.start_main_~#t1387~0.base_16|, ~z$mem_tmp~0=v_~z$mem_tmp~0_13, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_8|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_531, ~z$flush_delayed~0=v_~z$flush_delayed~0_24, ULTIMATE.start_main_~#t1385~0.offset=|v_ULTIMATE.start_main_~#t1385~0.offset_19|, ~weak$$choice0~0=v_~weak$$choice0~0_12, #StackHeapBarrier=|v_#StackHeapBarrier_18|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_108, ~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_332, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_91, ~x~0=v_~x~0_72, ~z$read_delayed~0=v_~z$read_delayed~0_7, ~z$w_buff1~0=v_~z$w_buff1~0_307, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_39, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_35|, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_7, ULTIMATE.start_main_~#t1386~0.base=|v_ULTIMATE.start_main_~#t1386~0.base_23|, ULTIMATE.start_main_#t~ite51=|v_ULTIMATE.start_main_#t~ite51_35|, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_129, ~y~0=v_~y~0_19, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_111, ULTIMATE.start_main_~#t1386~0.offset=|v_ULTIMATE.start_main_~#t1386~0.offset_19|, ULTIMATE.start_main_~#t1385~0.base=|v_ULTIMATE.start_main_~#t1385~0.base_26|, ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_23|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_958, ~z$w_buff0~0=v_~z$w_buff0~0_487, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_7|, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_237, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_26, #NULL.base=|v_#NULL.base_6|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_24|, #valid=|v_#valid_69|, #memory_int=|v_#memory_int_21|, ~z~0=v_~z~0_174, ~weak$$choice2~0=v_~weak$$choice2~0_107, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_132} AuxVars[] AssignedVars[~z$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite47, ULTIMATE.start_main_~#t1387~0.offset, ~z$read_delayed~0, #NULL.offset, ~z$w_buff1~0, ULTIMATE.start_main_#t~ite49, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite48, ~z$read_delayed_var~0.offset, ULTIMATE.start_main_~#t1386~0.base, ULTIMATE.start_main_#t~ite50, 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, ULTIMATE.start_main_~#t1387~0.base, ~y~0, ~z$r_buff0_thd2~0, ULTIMATE.start_main_~#t1386~0.offset, ~z$mem_tmp~0, ULTIMATE.start_main_~#t1385~0.base, ULTIMATE.start_main_#t~nondet46, ~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, ULTIMATE.start_main_~#t1385~0.offset, #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] because there is no mapped edge [2019-12-27 02:54:17,423 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [850] [850] L820-1-->L822: Formula: (and (= |v_#memory_int_11| (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1386~0.base_9| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1386~0.base_9|) |v_ULTIMATE.start_main_~#t1386~0.offset_8| 1))) (= |v_#valid_33| (store |v_#valid_34| |v_ULTIMATE.start_main_~#t1386~0.base_9| 1)) (= (select |v_#valid_34| |v_ULTIMATE.start_main_~#t1386~0.base_9|) 0) (not (= 0 |v_ULTIMATE.start_main_~#t1386~0.base_9|)) (= |v_ULTIMATE.start_main_~#t1386~0.offset_8| 0) (= |v_#length_13| (store |v_#length_14| |v_ULTIMATE.start_main_~#t1386~0.base_9| 4)) (< |v_#StackHeapBarrier_10| |v_ULTIMATE.start_main_~#t1386~0.base_9|)) 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_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_3|, #valid=|v_#valid_33|, #memory_int=|v_#memory_int_11|, #length=|v_#length_13|, ULTIMATE.start_main_~#t1386~0.base=|v_ULTIMATE.start_main_~#t1386~0.base_9|, ULTIMATE.start_main_~#t1386~0.offset=|v_ULTIMATE.start_main_~#t1386~0.offset_8|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet44, #valid, #memory_int, #length, ULTIMATE.start_main_~#t1386~0.base, ULTIMATE.start_main_~#t1386~0.offset] because there is no mapped edge [2019-12-27 02:54:17,423 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [874] [874] P0ENTRY-->L4-3: Formula: (and (= P0Thread1of1ForFork0_~arg.base_Out-1698835617 |P0Thread1of1ForFork0_#in~arg.base_In-1698835617|) (= |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_Out-1698835617| P0Thread1of1ForFork0___VERIFIER_assert_~expression_Out-1698835617) (= ~z$w_buff1_used~0_Out-1698835617 ~z$w_buff0_used~0_In-1698835617) (= P0Thread1of1ForFork0_~arg.offset_Out-1698835617 |P0Thread1of1ForFork0_#in~arg.offset_In-1698835617|) (= ~z$w_buff0_used~0_Out-1698835617 1) (= |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_Out-1698835617| 1) (= 0 (mod ~z$w_buff1_used~0_Out-1698835617 256)) (= ~z$w_buff0~0_Out-1698835617 1) (= ~z$w_buff0~0_In-1698835617 ~z$w_buff1~0_Out-1698835617)) InVars {P0Thread1of1ForFork0_#in~arg.offset=|P0Thread1of1ForFork0_#in~arg.offset_In-1698835617|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1698835617, ~z$w_buff0~0=~z$w_buff0~0_In-1698835617, P0Thread1of1ForFork0_#in~arg.base=|P0Thread1of1ForFork0_#in~arg.base_In-1698835617|} OutVars{P0Thread1of1ForFork0_#in~arg.offset=|P0Thread1of1ForFork0_#in~arg.offset_In-1698835617|, ~z$w_buff0_used~0=~z$w_buff0_used~0_Out-1698835617, ~z$w_buff0~0=~z$w_buff0~0_Out-1698835617, ~z$w_buff1_used~0=~z$w_buff1_used~0_Out-1698835617, P0Thread1of1ForFork0___VERIFIER_assert_~expression=P0Thread1of1ForFork0___VERIFIER_assert_~expression_Out-1698835617, P0Thread1of1ForFork0_#in~arg.base=|P0Thread1of1ForFork0_#in~arg.base_In-1698835617|, ~z$w_buff1~0=~z$w_buff1~0_Out-1698835617, P0Thread1of1ForFork0_~arg.base=P0Thread1of1ForFork0_~arg.base_Out-1698835617, P0Thread1of1ForFork0___VERIFIER_assert_#in~expression=|P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_Out-1698835617|, P0Thread1of1ForFork0_~arg.offset=P0Thread1of1ForFork0_~arg.offset_Out-1698835617} 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 02:54:17,424 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [872] [872] L822-1-->L824: Formula: (and (= 0 (select |v_#valid_41| |v_ULTIMATE.start_main_~#t1387~0.base_11|)) (= (store |v_#valid_41| |v_ULTIMATE.start_main_~#t1387~0.base_11| 1) |v_#valid_40|) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t1387~0.base_11|) (= |v_ULTIMATE.start_main_~#t1387~0.offset_9| 0) (not (= |v_ULTIMATE.start_main_~#t1387~0.base_11| 0)) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1387~0.base_11| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1387~0.base_11|) |v_ULTIMATE.start_main_~#t1387~0.offset_9| 2)) |v_#memory_int_15|) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t1387~0.base_11| 4))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_41|, #memory_int=|v_#memory_int_16|, #length=|v_#length_18|} OutVars{#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|, ULTIMATE.start_main_~#t1387~0.offset=|v_ULTIMATE.start_main_~#t1387~0.offset_9|, #length=|v_#length_17|, ULTIMATE.start_main_~#t1387~0.base=|v_ULTIMATE.start_main_~#t1387~0.base_11|} AuxVars[] AssignedVars[#valid, ULTIMATE.start_main_#t~nondet45, #memory_int, ULTIMATE.start_main_~#t1387~0.offset, #length, ULTIMATE.start_main_~#t1387~0.base] because there is no mapped edge [2019-12-27 02:54:17,426 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [817] [817] L764-2-->L764-5: Formula: (let ((.cse0 (= |P1Thread1of1ForFork1_#t~ite10_Out-2068831924| |P1Thread1of1ForFork1_#t~ite9_Out-2068831924|)) (.cse2 (= 0 (mod ~z$w_buff1_used~0_In-2068831924 256))) (.cse1 (= (mod ~z$r_buff1_thd2~0_In-2068831924 256) 0))) (or (and .cse0 (or .cse1 .cse2) (= ~z~0_In-2068831924 |P1Thread1of1ForFork1_#t~ite9_Out-2068831924|)) (and .cse0 (= ~z$w_buff1~0_In-2068831924 |P1Thread1of1ForFork1_#t~ite9_Out-2068831924|) (not .cse2) (not .cse1)))) InVars {~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-2068831924, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-2068831924, ~z$w_buff1~0=~z$w_buff1~0_In-2068831924, ~z~0=~z~0_In-2068831924} OutVars{P1Thread1of1ForFork1_#t~ite9=|P1Thread1of1ForFork1_#t~ite9_Out-2068831924|, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-2068831924, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-2068831924, P1Thread1of1ForFork1_#t~ite10=|P1Thread1of1ForFork1_#t~ite10_Out-2068831924|, ~z$w_buff1~0=~z$w_buff1~0_In-2068831924, ~z~0=~z~0_In-2068831924} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite9, P1Thread1of1ForFork1_#t~ite10] because there is no mapped edge [2019-12-27 02:54:17,427 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [836] [836] L765-->L765-2: Formula: (let ((.cse0 (= (mod ~z$r_buff0_thd2~0_In87584844 256) 0)) (.cse1 (= (mod ~z$w_buff0_used~0_In87584844 256) 0))) (or (and (or .cse0 .cse1) (= ~z$w_buff0_used~0_In87584844 |P1Thread1of1ForFork1_#t~ite11_Out87584844|)) (and (not .cse0) (= 0 |P1Thread1of1ForFork1_#t~ite11_Out87584844|) (not .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In87584844, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In87584844} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In87584844, P1Thread1of1ForFork1_#t~ite11=|P1Thread1of1ForFork1_#t~ite11_Out87584844|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In87584844} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite11] because there is no mapped edge [2019-12-27 02:54:17,430 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [828] [828] L766-->L766-2: Formula: (let ((.cse2 (= 0 (mod ~z$w_buff1_used~0_In1687231959 256))) (.cse3 (= 0 (mod ~z$r_buff1_thd2~0_In1687231959 256))) (.cse0 (= (mod ~z$r_buff0_thd2~0_In1687231959 256) 0)) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In1687231959 256)))) (or (and (or .cse0 .cse1) (= |P1Thread1of1ForFork1_#t~ite12_Out1687231959| ~z$w_buff1_used~0_In1687231959) (or .cse2 .cse3)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1))) (= |P1Thread1of1ForFork1_#t~ite12_Out1687231959| 0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1687231959, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In1687231959, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1687231959, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1687231959} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1687231959, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In1687231959, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1687231959, P1Thread1of1ForFork1_#t~ite12=|P1Thread1of1ForFork1_#t~ite12_Out1687231959|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1687231959} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite12] because there is no mapped edge [2019-12-27 02:54:17,430 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [841] [841] L767-->L767-2: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In424686139 256) 0)) (.cse0 (= 0 (mod ~z$r_buff0_thd2~0_In424686139 256)))) (or (and (= |P1Thread1of1ForFork1_#t~ite13_Out424686139| ~z$r_buff0_thd2~0_In424686139) (or .cse0 .cse1)) (and (= |P1Thread1of1ForFork1_#t~ite13_Out424686139| 0) (not .cse1) (not .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In424686139, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In424686139} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In424686139, P1Thread1of1ForFork1_#t~ite13=|P1Thread1of1ForFork1_#t~ite13_Out424686139|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In424686139} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite13] because there is no mapped edge [2019-12-27 02:54:17,431 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [873] [873] L787-->L787-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In-318671800 256) 0))) (or (and .cse0 (= |P2Thread1of1ForFork2_#t~ite23_Out-318671800| |P2Thread1of1ForFork2_#t~ite24_Out-318671800|) (let ((.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In-318671800 256)))) (or (and .cse1 (= 0 (mod ~z$r_buff1_thd3~0_In-318671800 256))) (= (mod ~z$w_buff0_used~0_In-318671800 256) 0) (and (= 0 (mod ~z$w_buff1_used~0_In-318671800 256)) .cse1))) (= ~z$w_buff1~0_In-318671800 |P2Thread1of1ForFork2_#t~ite23_Out-318671800|)) (and (= |P2Thread1of1ForFork2_#t~ite23_In-318671800| |P2Thread1of1ForFork2_#t~ite23_Out-318671800|) (not .cse0) (= ~z$w_buff1~0_In-318671800 |P2Thread1of1ForFork2_#t~ite24_Out-318671800|)))) InVars {P2Thread1of1ForFork2_#t~ite23=|P2Thread1of1ForFork2_#t~ite23_In-318671800|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-318671800, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-318671800, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-318671800, ~z$w_buff1~0=~z$w_buff1~0_In-318671800, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-318671800, ~weak$$choice2~0=~weak$$choice2~0_In-318671800} OutVars{P2Thread1of1ForFork2_#t~ite23=|P2Thread1of1ForFork2_#t~ite23_Out-318671800|, P2Thread1of1ForFork2_#t~ite24=|P2Thread1of1ForFork2_#t~ite24_Out-318671800|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-318671800, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-318671800, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-318671800, ~z$w_buff1~0=~z$w_buff1~0_In-318671800, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-318671800, ~weak$$choice2~0=~weak$$choice2~0_In-318671800} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite23, P2Thread1of1ForFork2_#t~ite24] because there is no mapped edge [2019-12-27 02:54:17,432 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [875] [875] L788-->L788-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In-982880399 256) 0))) (or (and (not .cse0) (= |P2Thread1of1ForFork2_#t~ite26_In-982880399| |P2Thread1of1ForFork2_#t~ite26_Out-982880399|) (= |P2Thread1of1ForFork2_#t~ite27_Out-982880399| ~z$w_buff0_used~0_In-982880399)) (and (let ((.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In-982880399 256)))) (or (and .cse1 (= 0 (mod ~z$r_buff1_thd3~0_In-982880399 256))) (and (= (mod ~z$w_buff1_used~0_In-982880399 256) 0) .cse1) (= (mod ~z$w_buff0_used~0_In-982880399 256) 0))) .cse0 (= |P2Thread1of1ForFork2_#t~ite26_Out-982880399| |P2Thread1of1ForFork2_#t~ite27_Out-982880399|) (= |P2Thread1of1ForFork2_#t~ite26_Out-982880399| ~z$w_buff0_used~0_In-982880399)))) InVars {P2Thread1of1ForFork2_#t~ite26=|P2Thread1of1ForFork2_#t~ite26_In-982880399|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-982880399, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-982880399, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-982880399, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-982880399, ~weak$$choice2~0=~weak$$choice2~0_In-982880399} OutVars{P2Thread1of1ForFork2_#t~ite26=|P2Thread1of1ForFork2_#t~ite26_Out-982880399|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-982880399, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-982880399, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-982880399, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-982880399, ~weak$$choice2~0=~weak$$choice2~0_In-982880399, P2Thread1of1ForFork2_#t~ite27=|P2Thread1of1ForFork2_#t~ite27_Out-982880399|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite26, P2Thread1of1ForFork2_#t~ite27] because there is no mapped edge [2019-12-27 02:54:17,432 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [827] [827] L768-->L768-2: Formula: (let ((.cse1 (= (mod ~z$w_buff1_used~0_In1663860176 256) 0)) (.cse0 (= 0 (mod ~z$r_buff1_thd2~0_In1663860176 256))) (.cse3 (= 0 (mod ~z$w_buff0_used~0_In1663860176 256))) (.cse2 (= 0 (mod ~z$r_buff0_thd2~0_In1663860176 256)))) (or (and (= |P1Thread1of1ForFork1_#t~ite14_Out1663860176| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse1 .cse0) (or .cse3 .cse2) (= |P1Thread1of1ForFork1_#t~ite14_Out1663860176| ~z$r_buff1_thd2~0_In1663860176)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1663860176, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In1663860176, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1663860176, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1663860176} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1663860176, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In1663860176, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1663860176, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_Out1663860176|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1663860176} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite14] because there is no mapped edge [2019-12-27 02:54:17,433 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [848] [848] L768-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork1_#res.base_5|) (= |v_P1Thread1of1ForFork1_#t~ite14_28| v_~z$r_buff1_thd2~0_55) (= |v_P1Thread1of1ForFork1_#res.offset_5| 0) (= (+ v_~__unbuffered_cnt~0_40 1) v_~__unbuffered_cnt~0_39)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_40, P1Thread1of1ForFork1_#t~ite14=|v_P1Thread1of1ForFork1_#t~ite14_28|} OutVars{P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_5|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_55, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_39, P1Thread1of1ForFork1_#t~ite14=|v_P1Thread1of1ForFork1_#t~ite14_27|, 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 02:54:17,433 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [876] [876] L789-->L789-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-163165011 256)))) (or (and (= |P2Thread1of1ForFork2_#t~ite29_In-163165011| |P2Thread1of1ForFork2_#t~ite29_Out-163165011|) (= ~z$w_buff1_used~0_In-163165011 |P2Thread1of1ForFork2_#t~ite30_Out-163165011|) (not .cse0)) (and .cse0 (let ((.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In-163165011 256)))) (or (and .cse1 (= (mod ~z$r_buff1_thd3~0_In-163165011 256) 0)) (and (= (mod ~z$w_buff1_used~0_In-163165011 256) 0) .cse1) (= (mod ~z$w_buff0_used~0_In-163165011 256) 0))) (= |P2Thread1of1ForFork2_#t~ite29_Out-163165011| ~z$w_buff1_used~0_In-163165011) (= |P2Thread1of1ForFork2_#t~ite29_Out-163165011| |P2Thread1of1ForFork2_#t~ite30_Out-163165011|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-163165011, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-163165011, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-163165011, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-163165011, ~weak$$choice2~0=~weak$$choice2~0_In-163165011, P2Thread1of1ForFork2_#t~ite29=|P2Thread1of1ForFork2_#t~ite29_In-163165011|} OutVars{P2Thread1of1ForFork2_#t~ite30=|P2Thread1of1ForFork2_#t~ite30_Out-163165011|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-163165011, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-163165011, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-163165011, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-163165011, ~weak$$choice2~0=~weak$$choice2~0_In-163165011, P2Thread1of1ForFork2_#t~ite29=|P2Thread1of1ForFork2_#t~ite29_Out-163165011|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite30, P2Thread1of1ForFork2_#t~ite29] because there is no mapped edge [2019-12-27 02:54:17,434 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [779] [779] L790-->L791: Formula: (and (= v_~z$r_buff0_thd3~0_68 v_~z$r_buff0_thd3~0_67) (not (= 0 (mod v_~weak$$choice2~0_15 256)))) InVars {~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_68, ~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_67, ~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 02:54:17,435 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [761] [761] L793-->L797: Formula: (and (= 0 v_~z$flush_delayed~0_6) (= v_~z~0_25 v_~z$mem_tmp~0_5) (not (= 0 (mod v_~z$flush_delayed~0_7 256)))) 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_25} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite37, ~z$flush_delayed~0, ~z~0] because there is no mapped edge [2019-12-27 02:54:17,436 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [839] [839] L745-->L745-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In-1510490370 256))) (.cse1 (= 0 (mod ~z$r_buff0_thd1~0_In-1510490370 256)))) (or (and (not .cse0) (not .cse1) (= 0 |P0Thread1of1ForFork0_#t~ite5_Out-1510490370|)) (and (= ~z$w_buff0_used~0_In-1510490370 |P0Thread1of1ForFork0_#t~ite5_Out-1510490370|) (or .cse0 .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1510490370, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-1510490370} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out-1510490370|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1510490370, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-1510490370} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-27 02:54:17,437 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [818] [818] L746-->L746-2: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In1602454818 256) 0)) (.cse0 (= 0 (mod ~z$r_buff0_thd1~0_In1602454818 256))) (.cse3 (= 0 (mod ~z$w_buff1_used~0_In1602454818 256))) (.cse2 (= 0 (mod ~z$r_buff1_thd1~0_In1602454818 256)))) (or (and (= 0 |P0Thread1of1ForFork0_#t~ite6_Out1602454818|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse1 .cse0) (or .cse3 .cse2) (= ~z$w_buff1_used~0_In1602454818 |P0Thread1of1ForFork0_#t~ite6_Out1602454818|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1602454818, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In1602454818, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1602454818, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In1602454818} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out1602454818|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1602454818, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In1602454818, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1602454818, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In1602454818} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-27 02:54:17,438 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [837] [837] L747-->L748: Formula: (let ((.cse0 (= (mod ~z$r_buff0_thd1~0_In-2115090384 256) 0)) (.cse1 (= (mod ~z$w_buff0_used~0_In-2115090384 256) 0))) (or (and (not .cse0) (= 0 ~z$r_buff0_thd1~0_Out-2115090384) (not .cse1)) (and (= ~z$r_buff0_thd1~0_In-2115090384 ~z$r_buff0_thd1~0_Out-2115090384) (or .cse0 .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-2115090384, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-2115090384} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-2115090384, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out-2115090384|, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_Out-2115090384} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-27 02:54:17,438 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [838] [838] L748-->L748-2: Formula: (let ((.cse3 (= 0 (mod ~z$w_buff1_used~0_In-369265340 256))) (.cse2 (= (mod ~z$r_buff1_thd1~0_In-369265340 256) 0)) (.cse1 (= (mod ~z$w_buff0_used~0_In-369265340 256) 0)) (.cse0 (= 0 (mod ~z$r_buff0_thd1~0_In-369265340 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P0Thread1of1ForFork0_#t~ite8_Out-369265340|)) (and (or .cse3 .cse2) (= ~z$r_buff1_thd1~0_In-369265340 |P0Thread1of1ForFork0_#t~ite8_Out-369265340|) (or .cse1 .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-369265340, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In-369265340, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-369265340, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-369265340} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-369265340, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out-369265340|, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In-369265340, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-369265340, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-369265340} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-27 02:54:17,438 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [861] [861] L748-2-->P0EXIT: Formula: (and (= v_~__unbuffered_cnt~0_73 (+ v_~__unbuffered_cnt~0_74 1)) (= 0 |v_P0Thread1of1ForFork0_#res.base_5|) (= v_~z$r_buff1_thd1~0_68 |v_P0Thread1of1ForFork0_#t~ite8_44|) (= |v_P0Thread1of1ForFork0_#res.offset_5| 0)) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_44|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_74} OutVars{P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_5|, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_43|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_68, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_73} 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 02:54:17,438 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [829] [829] L797-2-->L797-5: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff1_thd3~0_In473817066 256))) (.cse2 (= |P2Thread1of1ForFork2_#t~ite39_Out473817066| |P2Thread1of1ForFork2_#t~ite38_Out473817066|)) (.cse1 (= 0 (mod ~z$w_buff1_used~0_In473817066 256)))) (or (and (or .cse0 .cse1) (= |P2Thread1of1ForFork2_#t~ite38_Out473817066| ~z~0_In473817066) .cse2) (and (= |P2Thread1of1ForFork2_#t~ite38_Out473817066| ~z$w_buff1~0_In473817066) (not .cse0) .cse2 (not .cse1)))) InVars {~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In473817066, ~z$w_buff1_used~0=~z$w_buff1_used~0_In473817066, ~z$w_buff1~0=~z$w_buff1~0_In473817066, ~z~0=~z~0_In473817066} OutVars{~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In473817066, ~z$w_buff1_used~0=~z$w_buff1_used~0_In473817066, ~z$w_buff1~0=~z$w_buff1~0_In473817066, ~z~0=~z~0_In473817066, P2Thread1of1ForFork2_#t~ite39=|P2Thread1of1ForFork2_#t~ite39_Out473817066|, P2Thread1of1ForFork2_#t~ite38=|P2Thread1of1ForFork2_#t~ite38_Out473817066|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite39, P2Thread1of1ForFork2_#t~ite38] because there is no mapped edge [2019-12-27 02:54:17,439 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [832] [832] L798-->L798-2: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In-1160347643 256) 0)) (.cse0 (= 0 (mod ~z$r_buff0_thd3~0_In-1160347643 256)))) (or (and (or .cse0 .cse1) (= |P2Thread1of1ForFork2_#t~ite40_Out-1160347643| ~z$w_buff0_used~0_In-1160347643)) (and (not .cse1) (not .cse0) (= |P2Thread1of1ForFork2_#t~ite40_Out-1160347643| 0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1160347643, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1160347643} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1160347643, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1160347643, P2Thread1of1ForFork2_#t~ite40=|P2Thread1of1ForFork2_#t~ite40_Out-1160347643|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite40] because there is no mapped edge [2019-12-27 02:54:17,440 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [819] [819] L799-->L799-2: Formula: (let ((.cse2 (= 0 (mod ~z$w_buff0_used~0_In1606246009 256))) (.cse3 (= 0 (mod ~z$r_buff0_thd3~0_In1606246009 256))) (.cse1 (= 0 (mod ~z$w_buff1_used~0_In1606246009 256))) (.cse0 (= (mod ~z$r_buff1_thd3~0_In1606246009 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P2Thread1of1ForFork2_#t~ite41_Out1606246009| 0)) (and (or .cse2 .cse3) (or .cse1 .cse0) (= |P2Thread1of1ForFork2_#t~ite41_Out1606246009| ~z$w_buff1_used~0_In1606246009)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1606246009, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1606246009, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1606246009, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1606246009} OutVars{P2Thread1of1ForFork2_#t~ite41=|P2Thread1of1ForFork2_#t~ite41_Out1606246009|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1606246009, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1606246009, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1606246009, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1606246009} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite41] because there is no mapped edge [2019-12-27 02:54:17,441 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [815] [815] L800-->L800-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In1365800527 256))) (.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In1365800527 256)))) (or (and (= 0 |P2Thread1of1ForFork2_#t~ite42_Out1365800527|) (not .cse0) (not .cse1)) (and (= ~z$r_buff0_thd3~0_In1365800527 |P2Thread1of1ForFork2_#t~ite42_Out1365800527|) (or .cse0 .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1365800527, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1365800527} OutVars{P2Thread1of1ForFork2_#t~ite42=|P2Thread1of1ForFork2_#t~ite42_Out1365800527|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1365800527, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1365800527} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite42] because there is no mapped edge [2019-12-27 02:54:17,441 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [834] [834] L801-->L801-2: Formula: (let ((.cse0 (= (mod ~z$w_buff1_used~0_In-151376607 256) 0)) (.cse1 (= 0 (mod ~z$r_buff1_thd3~0_In-151376607 256))) (.cse3 (= (mod ~z$r_buff0_thd3~0_In-151376607 256) 0)) (.cse2 (= (mod ~z$w_buff0_used~0_In-151376607 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P2Thread1of1ForFork2_#t~ite43_Out-151376607|)) (and (= ~z$r_buff1_thd3~0_In-151376607 |P2Thread1of1ForFork2_#t~ite43_Out-151376607|) (or .cse0 .cse1) (or .cse3 .cse2)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-151376607, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-151376607, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-151376607, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-151376607} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-151376607, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-151376607, P2Thread1of1ForFork2_#t~ite43=|P2Thread1of1ForFork2_#t~ite43_Out-151376607|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-151376607, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-151376607} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite43] because there is no mapped edge [2019-12-27 02:54:17,441 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [859] [859] L801-2-->P2EXIT: Formula: (and (= 0 |v_P2Thread1of1ForFork2_#res.base_5|) (= v_~z$r_buff1_thd3~0_136 |v_P2Thread1of1ForFork2_#t~ite43_30|) (= |v_P2Thread1of1ForFork2_#res.offset_5| 0) (= (+ v_~__unbuffered_cnt~0_56 1) v_~__unbuffered_cnt~0_55)) InVars {P2Thread1of1ForFork2_#t~ite43=|v_P2Thread1of1ForFork2_#t~ite43_30|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_56} OutVars{~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_136, P2Thread1of1ForFork2_#t~ite43=|v_P2Thread1of1ForFork2_#t~ite43_29|, P2Thread1of1ForFork2_#res.base=|v_P2Thread1of1ForFork2_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_55, 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 02:54:17,442 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [781] [781] L824-1-->L830: Formula: (and (= v_~main$tmp_guard0~0_7 1) (= 3 v_~__unbuffered_cnt~0_13)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_13} OutVars{ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_13, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet46, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-27 02:54:17,442 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [825] [825] L830-2-->L830-5: Formula: (let ((.cse2 (= |ULTIMATE.start_main_#t~ite48_Out157370137| |ULTIMATE.start_main_#t~ite47_Out157370137|)) (.cse1 (= (mod ~z$r_buff1_thd0~0_In157370137 256) 0)) (.cse0 (= 0 (mod ~z$w_buff1_used~0_In157370137 256)))) (or (and (not .cse0) (not .cse1) .cse2 (= ~z$w_buff1~0_In157370137 |ULTIMATE.start_main_#t~ite47_Out157370137|)) (and .cse2 (= ~z~0_In157370137 |ULTIMATE.start_main_#t~ite47_Out157370137|) (or .cse1 .cse0)))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In157370137, ~z$w_buff1_used~0=~z$w_buff1_used~0_In157370137, ~z$w_buff1~0=~z$w_buff1~0_In157370137, ~z~0=~z~0_In157370137} OutVars{~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In157370137, ULTIMATE.start_main_#t~ite47=|ULTIMATE.start_main_#t~ite47_Out157370137|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In157370137, ~z$w_buff1~0=~z$w_buff1~0_In157370137, ULTIMATE.start_main_#t~ite48=|ULTIMATE.start_main_#t~ite48_Out157370137|, ~z~0=~z~0_In157370137} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite47, ULTIMATE.start_main_#t~ite48] because there is no mapped edge [2019-12-27 02:54:17,443 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [821] [821] L831-->L831-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff0_thd0~0_In861574684 256))) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In861574684 256)))) (or (and (= 0 |ULTIMATE.start_main_#t~ite49_Out861574684|) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= ~z$w_buff0_used~0_In861574684 |ULTIMATE.start_main_#t~ite49_Out861574684|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In861574684, ~z$w_buff0_used~0=~z$w_buff0_used~0_In861574684} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In861574684, ~z$w_buff0_used~0=~z$w_buff0_used~0_In861574684, ULTIMATE.start_main_#t~ite49=|ULTIMATE.start_main_#t~ite49_Out861574684|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite49] because there is no mapped edge [2019-12-27 02:54:17,444 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [840] [840] L832-->L832-2: Formula: (let ((.cse2 (= (mod ~z$r_buff0_thd0~0_In-1626744042 256) 0)) (.cse3 (= 0 (mod ~z$w_buff0_used~0_In-1626744042 256))) (.cse0 (= 0 (mod ~z$w_buff1_used~0_In-1626744042 256))) (.cse1 (= 0 (mod ~z$r_buff1_thd0~0_In-1626744042 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~z$w_buff1_used~0_In-1626744042 |ULTIMATE.start_main_#t~ite50_Out-1626744042|)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1))) (= |ULTIMATE.start_main_#t~ite50_Out-1626744042| 0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1626744042, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1626744042, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1626744042, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1626744042} OutVars{ULTIMATE.start_main_#t~ite50=|ULTIMATE.start_main_#t~ite50_Out-1626744042|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1626744042, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1626744042, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1626744042, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1626744042} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite50] because there is no mapped edge [2019-12-27 02:54:17,444 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [831] [831] L833-->L833-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff0_thd0~0_In-1989106534 256))) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In-1989106534 256)))) (or (and (= 0 |ULTIMATE.start_main_#t~ite51_Out-1989106534|) (not .cse0) (not .cse1)) (and (= ~z$r_buff0_thd0~0_In-1989106534 |ULTIMATE.start_main_#t~ite51_Out-1989106534|) (or .cse0 .cse1)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1989106534, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1989106534} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1989106534, ULTIMATE.start_main_#t~ite51=|ULTIMATE.start_main_#t~ite51_Out-1989106534|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1989106534} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite51] because there is no mapped edge [2019-12-27 02:54:17,445 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [820] [820] L834-->L834-2: Formula: (let ((.cse2 (= 0 (mod ~z$w_buff1_used~0_In1642434580 256))) (.cse3 (= 0 (mod ~z$r_buff1_thd0~0_In1642434580 256))) (.cse0 (= 0 (mod ~z$r_buff0_thd0~0_In1642434580 256))) (.cse1 (= (mod ~z$w_buff0_used~0_In1642434580 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite52_Out1642434580| 0)) (and (or .cse2 .cse3) (= |ULTIMATE.start_main_#t~ite52_Out1642434580| ~z$r_buff1_thd0~0_In1642434580) (or .cse0 .cse1)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1642434580, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1642434580, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1642434580, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1642434580} OutVars{ULTIMATE.start_main_#t~ite52=|ULTIMATE.start_main_#t~ite52_Out1642434580|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1642434580, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1642434580, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1642434580, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1642434580} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52] because there is no mapped edge [2019-12-27 02:54:17,445 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [883] [883] L834-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_~main$tmp_guard1~0_21 0) (= 0 v_~__unbuffered_p2_EAX~0_28) (= 0 v_~__unbuffered_p1_EAX~0_23) (= |v_ULTIMATE.start_main_#t~ite52_50| v_~z$r_buff1_thd0~0_94) (= v_ULTIMATE.start___VERIFIER_assert_~expression_15 0) (= v_~x~0_47 2) (= v_ULTIMATE.start___VERIFIER_assert_~expression_15 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_10|)) InVars {ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_50|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_23, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_28, ~x~0=v_~x~0_47} OutVars{ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_49|, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_15, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_23, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_94, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_21, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_28, ~x~0=v_~x~0_47, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_10|} 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 02:54:17,559 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 02:54:17 BasicIcfg [2019-12-27 02:54:17,559 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 02:54:17,561 INFO L168 Benchmark]: Toolchain (without parser) took 101121.71 ms. Allocated memory was 138.9 MB in the beginning and 2.9 GB in the end (delta: 2.7 GB). Free memory was 102.5 MB in the beginning and 1.9 GB in the end (delta: -1.8 GB). Peak memory consumption was 919.7 MB. Max. memory is 7.1 GB. [2019-12-27 02:54:17,562 INFO L168 Benchmark]: CDTParser took 0.37 ms. Allocated memory is still 138.9 MB. Free memory was 122.1 MB in the beginning and 121.9 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-12-27 02:54:17,562 INFO L168 Benchmark]: CACSL2BoogieTranslator took 770.40 ms. Allocated memory was 138.9 MB in the beginning and 203.4 MB in the end (delta: 64.5 MB). Free memory was 102.3 MB in the beginning and 156.8 MB in the end (delta: -54.5 MB). Peak memory consumption was 25.8 MB. Max. memory is 7.1 GB. [2019-12-27 02:54:17,563 INFO L168 Benchmark]: Boogie Procedure Inliner took 64.17 ms. Allocated memory is still 203.4 MB. Free memory was 156.8 MB in the beginning and 154.2 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-12-27 02:54:17,563 INFO L168 Benchmark]: Boogie Preprocessor took 44.43 ms. Allocated memory is still 203.4 MB. Free memory was 154.2 MB in the beginning and 152.2 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2019-12-27 02:54:17,563 INFO L168 Benchmark]: RCFGBuilder took 865.74 ms. Allocated memory is still 203.4 MB. Free memory was 151.5 MB in the beginning and 102.1 MB in the end (delta: 49.4 MB). Peak memory consumption was 49.4 MB. Max. memory is 7.1 GB. [2019-12-27 02:54:17,566 INFO L168 Benchmark]: TraceAbstraction took 99365.37 ms. Allocated memory was 203.4 MB in the beginning and 2.9 GB in the end (delta: 2.7 GB). Free memory was 101.5 MB in the beginning and 1.9 GB in the end (delta: -1.8 GB). Peak memory consumption was 854.2 MB. Max. memory is 7.1 GB. [2019-12-27 02:54:17,568 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.37 ms. Allocated memory is still 138.9 MB. Free memory was 122.1 MB in the beginning and 121.9 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 770.40 ms. Allocated memory was 138.9 MB in the beginning and 203.4 MB in the end (delta: 64.5 MB). Free memory was 102.3 MB in the beginning and 156.8 MB in the end (delta: -54.5 MB). Peak memory consumption was 25.8 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 64.17 ms. Allocated memory is still 203.4 MB. Free memory was 156.8 MB in the beginning and 154.2 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 44.43 ms. Allocated memory is still 203.4 MB. Free memory was 154.2 MB in the beginning and 152.2 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 865.74 ms. Allocated memory is still 203.4 MB. Free memory was 151.5 MB in the beginning and 102.1 MB in the end (delta: 49.4 MB). Peak memory consumption was 49.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 99365.37 ms. Allocated memory was 203.4 MB in the beginning and 2.9 GB in the end (delta: 2.7 GB). Free memory was 101.5 MB in the beginning and 1.9 GB in the end (delta: -1.8 GB). Peak memory consumption was 854.2 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 6.4s, 175 ProgramPointsBefore, 92 ProgramPointsAfterwards, 212 TransitionsBefore, 102 TransitionsAfterwards, 19004 CoEnabledTransitionPairs, 12 FixpointIterations, 32 TrivialSequentialCompositions, 54 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 35 ConcurrentYvCompositions, 31 ChoiceCompositions, 7186 VarBasedMoverChecksPositive, 380 VarBasedMoverChecksNegative, 188 SemBasedMoverChecksPositive, 286 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 2.1s, 0 MoverChecksTotal, 125946 CheckedPairsTotal, 121 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(&t1385, ((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(&t1386, ((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(&t1387, ((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=7, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=1, 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=7, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=1, 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=7, weak$$choice2=1, 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=1, 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=7, weak$$choice2=1, 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=1, 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=7, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=1, 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=7, weak$$choice2=1, 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=7, weak$$choice2=1, 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: 99.0s, OverallIterations: 31, TraceHistogramMax: 1, AutomataDifference: 30.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 6601 SDtfs, 8019 SDslu, 20361 SDs, 0 SdLazy, 11509 SolverSat, 365 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 10.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 357 GetRequests, 65 SyntacticMatches, 24 SemanticMatches, 268 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1036 ImplicationChecksByTransitivity, 3.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=142946occurred 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: 39.4s AutomataMinimizationTime, 30 MinimizatonAttempts, 262474 StatesRemovedByMinimization, 27 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.3s InterpolantComputationTime, 1628 NumberOfCodeBlocks, 1628 NumberOfCodeBlocksAsserted, 31 NumberOfCheckSat, 1531 ConstructedInterpolants, 0 QuantifiedInterpolants, 342776 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 30 InterpolantComputations, 30 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...