/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix042_power.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 06:29:18,141 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 06:29:18,143 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 06:29:18,162 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 06:29:18,163 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 06:29:18,165 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 06:29:18,167 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 06:29:18,170 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 06:29:18,174 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 06:29:18,175 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 06:29:18,175 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 06:29:18,177 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 06:29:18,177 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 06:29:18,178 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 06:29:18,179 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 06:29:18,181 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 06:29:18,182 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 06:29:18,187 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 06:29:18,189 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 06:29:18,192 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 06:29:18,195 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 06:29:18,197 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 06:29:18,201 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 06:29:18,202 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 06:29:18,205 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 06:29:18,206 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 06:29:18,206 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 06:29:18,208 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 06:29:18,209 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 06:29:18,211 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 06:29:18,211 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 06:29:18,212 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 06:29:18,213 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 06:29:18,215 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 06:29:18,219 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 06:29:18,219 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 06:29:18,220 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 06:29:18,221 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 06:29:18,221 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 06:29:18,222 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 06:29:18,224 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 06:29:18,225 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe.epf [2019-12-27 06:29:18,243 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 06:29:18,243 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 06:29:18,245 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 06:29:18,245 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 06:29:18,245 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 06:29:18,245 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 06:29:18,246 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 06:29:18,246 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 06:29:18,246 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 06:29:18,246 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 06:29:18,247 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 06:29:18,247 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 06:29:18,247 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 06:29:18,247 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 06:29:18,247 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 06:29:18,248 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 06:29:18,248 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 06:29:18,248 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 06:29:18,248 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 06:29:18,249 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 06:29:18,249 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 06:29:18,249 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 06:29:18,249 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 06:29:18,249 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 06:29:18,250 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 06:29:18,250 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 06:29:18,250 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 06:29:18,250 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2019-12-27 06:29:18,251 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 06:29:18,251 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 06:29:18,540 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 06:29:18,557 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 06:29:18,561 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 06:29:18,562 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 06:29:18,562 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 06:29:18,563 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix042_power.oepc.i [2019-12-27 06:29:18,624 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6358dda91/6d0631e2263a435bb1fa51ca2eb9be0a/FLAG9f54735f8 [2019-12-27 06:29:19,134 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 06:29:19,135 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix042_power.oepc.i [2019-12-27 06:29:19,156 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6358dda91/6d0631e2263a435bb1fa51ca2eb9be0a/FLAG9f54735f8 [2019-12-27 06:29:19,423 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6358dda91/6d0631e2263a435bb1fa51ca2eb9be0a [2019-12-27 06:29:19,431 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 06:29:19,433 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 06:29:19,434 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 06:29:19,434 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 06:29:19,438 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 06:29:19,439 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 06:29:19" (1/1) ... [2019-12-27 06:29:19,442 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4da409ab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:29:19, skipping insertion in model container [2019-12-27 06:29:19,442 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 06:29:19" (1/1) ... [2019-12-27 06:29:19,450 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 06:29:19,505 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 06:29:20,048 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 06:29:20,063 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 06:29:20,134 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 06:29:20,214 INFO L208 MainTranslator]: Completed translation [2019-12-27 06:29:20,215 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:29:20 WrapperNode [2019-12-27 06:29:20,215 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 06:29:20,216 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 06:29:20,216 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 06:29:20,216 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 06:29:20,225 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:29:20" (1/1) ... [2019-12-27 06:29:20,252 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:29:20" (1/1) ... [2019-12-27 06:29:20,286 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 06:29:20,286 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 06:29:20,286 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 06:29:20,287 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 06:29:20,295 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:29:20" (1/1) ... [2019-12-27 06:29:20,295 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:29:20" (1/1) ... [2019-12-27 06:29:20,300 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:29:20" (1/1) ... [2019-12-27 06:29:20,301 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:29:20" (1/1) ... [2019-12-27 06:29:20,312 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:29:20" (1/1) ... [2019-12-27 06:29:20,317 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:29:20" (1/1) ... [2019-12-27 06:29:20,321 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:29:20" (1/1) ... [2019-12-27 06:29:20,326 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 06:29:20,327 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 06:29:20,327 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 06:29:20,327 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 06:29:20,328 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:29:20" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 06:29:20,397 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 06:29:20,397 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 06:29:20,397 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 06:29:20,397 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 06:29:20,398 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 06:29:20,398 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 06:29:20,398 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 06:29:20,398 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 06:29:20,398 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-27 06:29:20,398 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-27 06:29:20,399 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 06:29:20,399 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 06:29:20,399 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 06:29:20,401 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-27 06:29:21,191 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 06:29:21,191 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 06:29:21,193 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 06:29:21 BoogieIcfgContainer [2019-12-27 06:29:21,193 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 06:29:21,194 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 06:29:21,194 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 06:29:21,197 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 06:29:21,197 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 06:29:19" (1/3) ... [2019-12-27 06:29:21,198 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d3167f0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 06:29:21, skipping insertion in model container [2019-12-27 06:29:21,198 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:29:20" (2/3) ... [2019-12-27 06:29:21,199 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d3167f0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 06:29:21, skipping insertion in model container [2019-12-27 06:29:21,199 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 06:29:21" (3/3) ... [2019-12-27 06:29:21,201 INFO L109 eAbstractionObserver]: Analyzing ICFG mix042_power.oepc.i [2019-12-27 06:29:21,211 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 06:29:21,212 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 06:29:21,220 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 06:29:21,221 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 06:29:21,267 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:21,267 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:21,267 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:21,268 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:21,268 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:21,268 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:21,269 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:21,269 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:21,270 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:21,270 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:21,271 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:21,271 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:21,271 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:21,271 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:21,272 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:21,272 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:21,272 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:21,273 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:21,273 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:21,273 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:21,273 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:21,274 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:21,274 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:21,274 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:21,275 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:21,275 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:21,275 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:21,275 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:21,276 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:21,276 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:21,277 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:21,277 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:21,278 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:21,278 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:21,299 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:21,299 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:21,299 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:21,300 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:21,300 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:21,300 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:21,300 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:21,301 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:21,301 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:21,301 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:21,301 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:21,302 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:21,302 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:21,302 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:21,302 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:21,302 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:21,303 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:21,303 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:21,303 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:21,303 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:21,304 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:21,304 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:21,304 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:21,304 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:21,305 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:21,305 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:21,305 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:21,305 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:21,306 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:21,306 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:21,307 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:21,307 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:21,307 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:21,308 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:21,308 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:21,308 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:21,308 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:21,308 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:21,309 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:21,309 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:21,309 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:21,309 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:21,310 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:21,310 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:21,310 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:21,310 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:21,311 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:21,311 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:21,311 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:21,311 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:21,311 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:21,311 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:21,312 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:21,312 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:21,312 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:21,312 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:21,313 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:21,313 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:21,313 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:21,313 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:21,313 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:21,314 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:21,314 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:21,314 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:21,314 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:21,315 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:21,315 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:21,315 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:21,315 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:21,316 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:21,316 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:21,316 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:21,316 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:21,316 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:21,317 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:21,317 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:21,317 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:21,317 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:21,318 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:21,318 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:21,318 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:21,318 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:21,318 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:21,319 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:21,319 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:21,319 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:21,319 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:21,319 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:21,320 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:21,320 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:21,320 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:21,320 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:21,320 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:21,321 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:21,321 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:21,321 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:21,321 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:21,321 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:21,322 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:21,322 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:21,322 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:21,322 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:21,323 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:21,323 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:21,323 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:21,323 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:21,324 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:21,324 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:21,324 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:21,324 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:21,324 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:21,325 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:21,325 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:21,325 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:21,325 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:21,325 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:21,326 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:21,326 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:21,326 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:21,326 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:21,326 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:21,326 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:21,327 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:21,327 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:21,327 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:21,327 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:21,327 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:21,328 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:21,328 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:21,328 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:21,328 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:21,328 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:21,329 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:21,329 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:21,329 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:21,329 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:21,330 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:21,330 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:21,330 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:21,330 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:21,330 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:21,330 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:21,331 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:21,331 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:21,331 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:21,331 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:21,332 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:21,332 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:21,337 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:21,338 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:21,338 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:21,338 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:21,338 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:21,338 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:21,339 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:21,339 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:21,339 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:21,339 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:21,339 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:21,339 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:21,340 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:21,340 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:21,340 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:21,340 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:21,340 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:21,341 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:21,341 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:21,341 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:21,341 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:21,341 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:21,341 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:21,342 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:21,342 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:21,342 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:21,343 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:21,343 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:21,343 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:21,344 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:21,344 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:21,344 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:21,344 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:21,347 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:21,348 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:21,348 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:21,348 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:21,348 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:21,348 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:21,349 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:21,349 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:21,349 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:21,349 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:21,349 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:21,349 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:21,351 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:21,352 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:21,352 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:21,352 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:21,352 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:21,357 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:21,357 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:21,358 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:21,361 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:21,361 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:21,382 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-27 06:29:21,404 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 06:29:21,404 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 06:29:21,404 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 06:29:21,404 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-27 06:29:21,405 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 06:29:21,405 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 06:29:21,405 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 06:29:21,405 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 06:29:21,423 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 177 places, 214 transitions [2019-12-27 06:29:21,425 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 177 places, 214 transitions [2019-12-27 06:29:21,530 INFO L132 PetriNetUnfolder]: 47/211 cut-off events. [2019-12-27 06:29:21,530 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 06:29:21,547 INFO L76 FinitePrefix]: Finished finitePrefix Result has 221 conditions, 211 events. 47/211 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 435 event pairs. 0/162 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-27 06:29:21,572 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 177 places, 214 transitions [2019-12-27 06:29:21,628 INFO L132 PetriNetUnfolder]: 47/211 cut-off events. [2019-12-27 06:29:21,628 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 06:29:21,638 INFO L76 FinitePrefix]: Finished finitePrefix Result has 221 conditions, 211 events. 47/211 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 435 event pairs. 0/162 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-27 06:29:21,662 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 19004 [2019-12-27 06:29:21,663 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-27 06:29:25,345 WARN L192 SmtUtils]: Spent 307.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 91 [2019-12-27 06:29:25,469 WARN L192 SmtUtils]: Spent 121.00 ms on a formula simplification that was a NOOP. DAG size: 89 [2019-12-27 06:29:25,494 INFO L206 etLargeBlockEncoding]: Checked pairs total: 80962 [2019-12-27 06:29:25,494 INFO L214 etLargeBlockEncoding]: Total number of compositions: 114 [2019-12-27 06:29:25,498 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 93 places, 102 transitions [2019-12-27 06:29:42,135 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 104862 states. [2019-12-27 06:29:42,137 INFO L276 IsEmpty]: Start isEmpty. Operand 104862 states. [2019-12-27 06:29:42,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-27 06:29:42,143 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:29:42,144 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-27 06:29:42,144 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:29:42,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:29:42,150 INFO L82 PathProgramCache]: Analyzing trace with hash 916881, now seen corresponding path program 1 times [2019-12-27 06:29:42,158 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:29:42,159 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1789295095] [2019-12-27 06:29:42,159 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:29:42,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:29:42,369 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:29:42,369 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1789295095] [2019-12-27 06:29:42,370 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:29:42,370 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 06:29:42,371 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1458037231] [2019-12-27 06:29:42,376 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 06:29:42,376 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:29:42,389 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 06:29:42,390 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 06:29:42,391 INFO L87 Difference]: Start difference. First operand 104862 states. Second operand 3 states. [2019-12-27 06:29:45,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:29:45,299 INFO L93 Difference]: Finished difference Result 104092 states and 443334 transitions. [2019-12-27 06:29:45,300 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 06:29:45,302 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-27 06:29:45,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:29:46,111 INFO L225 Difference]: With dead ends: 104092 [2019-12-27 06:29:46,111 INFO L226 Difference]: Without dead ends: 97696 [2019-12-27 06:29:46,116 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 06:29:50,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97696 states. [2019-12-27 06:29:52,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97696 to 97696. [2019-12-27 06:29:52,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97696 states. [2019-12-27 06:29:53,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97696 states to 97696 states and 415501 transitions. [2019-12-27 06:29:53,482 INFO L78 Accepts]: Start accepts. Automaton has 97696 states and 415501 transitions. Word has length 3 [2019-12-27 06:29:53,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:29:53,482 INFO L462 AbstractCegarLoop]: Abstraction has 97696 states and 415501 transitions. [2019-12-27 06:29:53,482 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 06:29:53,482 INFO L276 IsEmpty]: Start isEmpty. Operand 97696 states and 415501 transitions. [2019-12-27 06:29:53,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-27 06:29:53,486 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:29:53,486 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:29:53,487 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:29:53,487 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:29:53,487 INFO L82 PathProgramCache]: Analyzing trace with hash -1566799458, now seen corresponding path program 1 times [2019-12-27 06:29:53,487 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:29:53,488 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [984393297] [2019-12-27 06:29:53,488 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:29:53,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:29:53,599 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:29:53,600 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [984393297] [2019-12-27 06:29:53,600 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:29:53,600 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 06:29:53,600 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [310908128] [2019-12-27 06:29:53,602 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 06:29:53,602 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:29:53,602 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 06:29:53,603 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 06:29:53,603 INFO L87 Difference]: Start difference. First operand 97696 states and 415501 transitions. Second operand 4 states. [2019-12-27 06:29:58,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:29:58,574 INFO L93 Difference]: Finished difference Result 155904 states and 634680 transitions. [2019-12-27 06:29:58,575 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 06:29:58,575 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-27 06:29:58,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:29:59,091 INFO L225 Difference]: With dead ends: 155904 [2019-12-27 06:29:59,091 INFO L226 Difference]: Without dead ends: 155855 [2019-12-27 06:29:59,092 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 06:30:07,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155855 states. [2019-12-27 06:30:10,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155855 to 141665. [2019-12-27 06:30:10,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141665 states. [2019-12-27 06:30:10,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141665 states to 141665 states and 584468 transitions. [2019-12-27 06:30:10,645 INFO L78 Accepts]: Start accepts. Automaton has 141665 states and 584468 transitions. Word has length 11 [2019-12-27 06:30:10,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:30:10,646 INFO L462 AbstractCegarLoop]: Abstraction has 141665 states and 584468 transitions. [2019-12-27 06:30:10,646 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 06:30:10,646 INFO L276 IsEmpty]: Start isEmpty. Operand 141665 states and 584468 transitions. [2019-12-27 06:30:10,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 06:30:10,651 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:30:10,651 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:30:10,651 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:30:10,651 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:30:10,652 INFO L82 PathProgramCache]: Analyzing trace with hash 2120295885, now seen corresponding path program 1 times [2019-12-27 06:30:10,652 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:30:10,652 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [518000783] [2019-12-27 06:30:10,652 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:30:10,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:30:10,744 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:30:10,744 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [518000783] [2019-12-27 06:30:10,744 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:30:10,745 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 06:30:10,746 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1301076634] [2019-12-27 06:30:10,746 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 06:30:10,747 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:30:10,747 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 06:30:10,747 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 06:30:10,747 INFO L87 Difference]: Start difference. First operand 141665 states and 584468 transitions. Second operand 3 states. [2019-12-27 06:30:10,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:30:10,923 INFO L93 Difference]: Finished difference Result 31684 states and 102658 transitions. [2019-12-27 06:30:10,924 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 06:30:10,925 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-27 06:30:10,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:30:11,040 INFO L225 Difference]: With dead ends: 31684 [2019-12-27 06:30:11,040 INFO L226 Difference]: Without dead ends: 31684 [2019-12-27 06:30:11,041 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 06:30:11,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31684 states. [2019-12-27 06:30:16,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31684 to 31684. [2019-12-27 06:30:16,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31684 states. [2019-12-27 06:30:16,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31684 states to 31684 states and 102658 transitions. [2019-12-27 06:30:16,285 INFO L78 Accepts]: Start accepts. Automaton has 31684 states and 102658 transitions. Word has length 13 [2019-12-27 06:30:16,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:30:16,285 INFO L462 AbstractCegarLoop]: Abstraction has 31684 states and 102658 transitions. [2019-12-27 06:30:16,285 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 06:30:16,285 INFO L276 IsEmpty]: Start isEmpty. Operand 31684 states and 102658 transitions. [2019-12-27 06:30:16,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-27 06:30:16,287 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:30:16,288 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:30:16,288 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:30:16,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:30:16,288 INFO L82 PathProgramCache]: Analyzing trace with hash -2058055416, now seen corresponding path program 1 times [2019-12-27 06:30:16,288 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:30:16,289 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [263454871] [2019-12-27 06:30:16,289 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:30:16,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:30:16,406 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:30:16,406 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [263454871] [2019-12-27 06:30:16,407 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:30:16,407 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 06:30:16,407 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1158913988] [2019-12-27 06:30:16,407 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 06:30:16,408 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:30:16,408 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 06:30:16,408 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 06:30:16,408 INFO L87 Difference]: Start difference. First operand 31684 states and 102658 transitions. Second operand 4 states. [2019-12-27 06:30:16,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:30:16,786 INFO L93 Difference]: Finished difference Result 39269 states and 126736 transitions. [2019-12-27 06:30:16,786 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 06:30:16,786 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-12-27 06:30:16,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:30:16,861 INFO L225 Difference]: With dead ends: 39269 [2019-12-27 06:30:16,861 INFO L226 Difference]: Without dead ends: 39269 [2019-12-27 06:30:16,861 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 06:30:17,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39269 states. [2019-12-27 06:30:17,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39269 to 35204. [2019-12-27 06:30:17,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35204 states. [2019-12-27 06:30:17,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35204 states to 35204 states and 113989 transitions. [2019-12-27 06:30:17,553 INFO L78 Accepts]: Start accepts. Automaton has 35204 states and 113989 transitions. Word has length 16 [2019-12-27 06:30:17,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:30:17,554 INFO L462 AbstractCegarLoop]: Abstraction has 35204 states and 113989 transitions. [2019-12-27 06:30:17,554 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 06:30:17,554 INFO L276 IsEmpty]: Start isEmpty. Operand 35204 states and 113989 transitions. [2019-12-27 06:30:17,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-27 06:30:17,563 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:30:17,564 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:30:17,564 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:30:17,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:30:17,564 INFO L82 PathProgramCache]: Analyzing trace with hash -36065168, now seen corresponding path program 1 times [2019-12-27 06:30:17,564 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:30:17,565 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1370057294] [2019-12-27 06:30:17,565 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:30:17,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:30:17,671 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:30:17,671 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1370057294] [2019-12-27 06:30:17,671 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:30:17,672 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 06:30:17,673 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [481136928] [2019-12-27 06:30:17,673 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 06:30:17,673 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:30:17,673 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 06:30:17,674 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 06:30:17,674 INFO L87 Difference]: Start difference. First operand 35204 states and 113989 transitions. Second operand 5 states. [2019-12-27 06:30:18,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:30:18,601 INFO L93 Difference]: Finished difference Result 45733 states and 145470 transitions. [2019-12-27 06:30:18,601 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 06:30:18,601 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-12-27 06:30:18,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:30:18,675 INFO L225 Difference]: With dead ends: 45733 [2019-12-27 06:30:18,676 INFO L226 Difference]: Without dead ends: 45726 [2019-12-27 06:30:18,676 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-27 06:30:18,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45726 states. [2019-12-27 06:30:19,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45726 to 34769. [2019-12-27 06:30:19,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34769 states. [2019-12-27 06:30:19,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34769 states to 34769 states and 112450 transitions. [2019-12-27 06:30:19,370 INFO L78 Accepts]: Start accepts. Automaton has 34769 states and 112450 transitions. Word has length 22 [2019-12-27 06:30:19,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:30:19,370 INFO L462 AbstractCegarLoop]: Abstraction has 34769 states and 112450 transitions. [2019-12-27 06:30:19,370 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 06:30:19,371 INFO L276 IsEmpty]: Start isEmpty. Operand 34769 states and 112450 transitions. [2019-12-27 06:30:19,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 06:30:19,383 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:30:19,383 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:30:19,383 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:30:19,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:30:19,384 INFO L82 PathProgramCache]: Analyzing trace with hash -74237997, now seen corresponding path program 1 times [2019-12-27 06:30:19,384 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:30:19,384 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [509507524] [2019-12-27 06:30:19,384 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:30:19,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:30:19,476 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:30:19,477 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [509507524] [2019-12-27 06:30:19,477 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:30:19,477 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 06:30:19,477 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1544404334] [2019-12-27 06:30:19,478 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 06:30:19,478 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:30:19,478 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 06:30:19,478 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 06:30:19,479 INFO L87 Difference]: Start difference. First operand 34769 states and 112450 transitions. Second operand 4 states. [2019-12-27 06:30:19,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:30:19,540 INFO L93 Difference]: Finished difference Result 14037 states and 42756 transitions. [2019-12-27 06:30:19,541 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 06:30:19,541 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2019-12-27 06:30:19,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:30:19,563 INFO L225 Difference]: With dead ends: 14037 [2019-12-27 06:30:19,563 INFO L226 Difference]: Without dead ends: 14037 [2019-12-27 06:30:19,564 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 06:30:19,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14037 states. [2019-12-27 06:30:19,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14037 to 13737. [2019-12-27 06:30:19,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13737 states. [2019-12-27 06:30:19,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13737 states to 13737 states and 41900 transitions. [2019-12-27 06:30:19,778 INFO L78 Accepts]: Start accepts. Automaton has 13737 states and 41900 transitions. Word has length 25 [2019-12-27 06:30:19,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:30:19,779 INFO L462 AbstractCegarLoop]: Abstraction has 13737 states and 41900 transitions. [2019-12-27 06:30:19,779 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 06:30:19,779 INFO L276 IsEmpty]: Start isEmpty. Operand 13737 states and 41900 transitions. [2019-12-27 06:30:19,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-27 06:30:19,788 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:30:19,788 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:30:19,789 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:30:19,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:30:19,789 INFO L82 PathProgramCache]: Analyzing trace with hash -1416816819, now seen corresponding path program 1 times [2019-12-27 06:30:19,789 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:30:19,790 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1121468363] [2019-12-27 06:30:19,790 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:30:19,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:30:19,832 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:30:19,833 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1121468363] [2019-12-27 06:30:19,833 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:30:19,833 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 06:30:19,834 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1874754431] [2019-12-27 06:30:19,835 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 06:30:19,835 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:30:19,835 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 06:30:19,835 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 06:30:19,835 INFO L87 Difference]: Start difference. First operand 13737 states and 41900 transitions. Second operand 3 states. [2019-12-27 06:30:19,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:30:19,927 INFO L93 Difference]: Finished difference Result 19578 states and 58726 transitions. [2019-12-27 06:30:19,927 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 06:30:19,928 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-12-27 06:30:19,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:30:19,952 INFO L225 Difference]: With dead ends: 19578 [2019-12-27 06:30:19,953 INFO L226 Difference]: Without dead ends: 19578 [2019-12-27 06:30:19,953 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 06:30:20,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19578 states. [2019-12-27 06:30:20,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19578 to 14483. [2019-12-27 06:30:20,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14483 states. [2019-12-27 06:30:20,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14483 states to 14483 states and 44038 transitions. [2019-12-27 06:30:20,398 INFO L78 Accepts]: Start accepts. Automaton has 14483 states and 44038 transitions. Word has length 27 [2019-12-27 06:30:20,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:30:20,398 INFO L462 AbstractCegarLoop]: Abstraction has 14483 states and 44038 transitions. [2019-12-27 06:30:20,398 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 06:30:20,398 INFO L276 IsEmpty]: Start isEmpty. Operand 14483 states and 44038 transitions. [2019-12-27 06:30:20,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-27 06:30:20,409 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:30:20,409 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:30:20,409 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:30:20,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:30:20,410 INFO L82 PathProgramCache]: Analyzing trace with hash -522150304, now seen corresponding path program 1 times [2019-12-27 06:30:20,410 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:30:20,410 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1050849047] [2019-12-27 06:30:20,410 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:30:20,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:30:20,509 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:30:20,509 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1050849047] [2019-12-27 06:30:20,510 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:30:20,510 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 06:30:20,510 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [23028010] [2019-12-27 06:30:20,510 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 06:30:20,511 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:30:20,511 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 06:30:20,511 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 06:30:20,511 INFO L87 Difference]: Start difference. First operand 14483 states and 44038 transitions. Second operand 6 states. [2019-12-27 06:30:21,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:30:21,327 INFO L93 Difference]: Finished difference Result 37116 states and 111354 transitions. [2019-12-27 06:30:21,328 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-27 06:30:21,328 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2019-12-27 06:30:21,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:30:21,380 INFO L225 Difference]: With dead ends: 37116 [2019-12-27 06:30:21,381 INFO L226 Difference]: Without dead ends: 37116 [2019-12-27 06:30:21,381 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2019-12-27 06:30:21,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37116 states. [2019-12-27 06:30:21,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37116 to 20406. [2019-12-27 06:30:21,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20406 states. [2019-12-27 06:30:21,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20406 states to 20406 states and 62975 transitions. [2019-12-27 06:30:21,827 INFO L78 Accepts]: Start accepts. Automaton has 20406 states and 62975 transitions. Word has length 27 [2019-12-27 06:30:21,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:30:21,828 INFO L462 AbstractCegarLoop]: Abstraction has 20406 states and 62975 transitions. [2019-12-27 06:30:21,828 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 06:30:21,828 INFO L276 IsEmpty]: Start isEmpty. Operand 20406 states and 62975 transitions. [2019-12-27 06:30:21,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-27 06:30:21,843 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:30:21,844 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] [2019-12-27 06:30:21,844 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:30:21,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:30:21,844 INFO L82 PathProgramCache]: Analyzing trace with hash -624201971, now seen corresponding path program 1 times [2019-12-27 06:30:21,844 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:30:21,844 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1151059746] [2019-12-27 06:30:21,844 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:30:21,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:30:21,919 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:30:21,920 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1151059746] [2019-12-27 06:30:21,920 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:30:21,920 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 06:30:21,920 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [151253823] [2019-12-27 06:30:21,921 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 06:30:21,921 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:30:21,922 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 06:30:21,922 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 06:30:21,922 INFO L87 Difference]: Start difference. First operand 20406 states and 62975 transitions. Second operand 6 states. [2019-12-27 06:30:22,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:30:22,661 INFO L93 Difference]: Finished difference Result 34406 states and 103090 transitions. [2019-12-27 06:30:22,661 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-27 06:30:22,662 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 28 [2019-12-27 06:30:22,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:30:22,709 INFO L225 Difference]: With dead ends: 34406 [2019-12-27 06:30:22,709 INFO L226 Difference]: Without dead ends: 34406 [2019-12-27 06:30:22,710 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2019-12-27 06:30:22,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34406 states. [2019-12-27 06:30:23,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34406 to 20168. [2019-12-27 06:30:23,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20168 states. [2019-12-27 06:30:23,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20168 states to 20168 states and 62360 transitions. [2019-12-27 06:30:23,339 INFO L78 Accepts]: Start accepts. Automaton has 20168 states and 62360 transitions. Word has length 28 [2019-12-27 06:30:23,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:30:23,340 INFO L462 AbstractCegarLoop]: Abstraction has 20168 states and 62360 transitions. [2019-12-27 06:30:23,340 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 06:30:23,340 INFO L276 IsEmpty]: Start isEmpty. Operand 20168 states and 62360 transitions. [2019-12-27 06:30:23,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-27 06:30:23,362 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:30:23,362 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:30:23,362 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:30:23,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:30:23,363 INFO L82 PathProgramCache]: Analyzing trace with hash -160608776, now seen corresponding path program 1 times [2019-12-27 06:30:23,363 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:30:23,363 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1815423987] [2019-12-27 06:30:23,363 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:30:23,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:30:23,478 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:30:23,479 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1815423987] [2019-12-27 06:30:23,479 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:30:23,479 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 06:30:23,479 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1410463809] [2019-12-27 06:30:23,480 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 06:30:23,480 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:30:23,480 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 06:30:23,480 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-27 06:30:23,480 INFO L87 Difference]: Start difference. First operand 20168 states and 62360 transitions. Second operand 7 states. [2019-12-27 06:30:24,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:30:24,876 INFO L93 Difference]: Finished difference Result 46484 states and 138742 transitions. [2019-12-27 06:30:24,876 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-27 06:30:24,877 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 33 [2019-12-27 06:30:24,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:30:24,946 INFO L225 Difference]: With dead ends: 46484 [2019-12-27 06:30:24,947 INFO L226 Difference]: Without dead ends: 46484 [2019-12-27 06:30:24,947 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 3 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=117, Invalid=303, Unknown=0, NotChecked=0, Total=420 [2019-12-27 06:30:25,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46484 states. [2019-12-27 06:30:25,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46484 to 21453. [2019-12-27 06:30:25,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21453 states. [2019-12-27 06:30:25,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21453 states to 21453 states and 66323 transitions. [2019-12-27 06:30:25,434 INFO L78 Accepts]: Start accepts. Automaton has 21453 states and 66323 transitions. Word has length 33 [2019-12-27 06:30:25,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:30:25,435 INFO L462 AbstractCegarLoop]: Abstraction has 21453 states and 66323 transitions. [2019-12-27 06:30:25,435 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 06:30:25,435 INFO L276 IsEmpty]: Start isEmpty. Operand 21453 states and 66323 transitions. [2019-12-27 06:30:25,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-27 06:30:25,456 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:30:25,456 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:30:25,457 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:30:25,457 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:30:25,457 INFO L82 PathProgramCache]: Analyzing trace with hash 88321435, now seen corresponding path program 1 times [2019-12-27 06:30:25,457 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:30:25,457 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1726319484] [2019-12-27 06:30:25,457 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:30:25,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:30:25,501 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:30:25,502 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1726319484] [2019-12-27 06:30:25,502 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:30:25,502 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 06:30:25,503 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1396565910] [2019-12-27 06:30:25,503 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 06:30:25,503 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:30:25,503 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 06:30:25,504 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 06:30:25,504 INFO L87 Difference]: Start difference. First operand 21453 states and 66323 transitions. Second operand 3 states. [2019-12-27 06:30:25,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:30:25,611 INFO L93 Difference]: Finished difference Result 28695 states and 85797 transitions. [2019-12-27 06:30:25,612 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 06:30:25,612 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 33 [2019-12-27 06:30:25,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:30:25,651 INFO L225 Difference]: With dead ends: 28695 [2019-12-27 06:30:25,651 INFO L226 Difference]: Without dead ends: 28695 [2019-12-27 06:30:25,651 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 06:30:25,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28695 states. [2019-12-27 06:30:26,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28695 to 20429. [2019-12-27 06:30:26,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20429 states. [2019-12-27 06:30:26,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20429 states to 20429 states and 61176 transitions. [2019-12-27 06:30:26,190 INFO L78 Accepts]: Start accepts. Automaton has 20429 states and 61176 transitions. Word has length 33 [2019-12-27 06:30:26,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:30:26,190 INFO L462 AbstractCegarLoop]: Abstraction has 20429 states and 61176 transitions. [2019-12-27 06:30:26,190 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 06:30:26,190 INFO L276 IsEmpty]: Start isEmpty. Operand 20429 states and 61176 transitions. [2019-12-27 06:30:26,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-27 06:30:26,207 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:30:26,208 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:30:26,208 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:30:26,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:30:26,208 INFO L82 PathProgramCache]: Analyzing trace with hash 838482894, now seen corresponding path program 2 times [2019-12-27 06:30:26,209 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:30:26,209 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1420319264] [2019-12-27 06:30:26,209 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:30:26,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:30:26,309 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:30:26,309 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1420319264] [2019-12-27 06:30:26,310 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:30:26,310 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 06:30:26,310 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [56180781] [2019-12-27 06:30:26,310 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 06:30:26,311 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:30:26,311 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 06:30:26,311 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-12-27 06:30:26,311 INFO L87 Difference]: Start difference. First operand 20429 states and 61176 transitions. Second operand 8 states. [2019-12-27 06:30:28,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:30:28,108 INFO L93 Difference]: Finished difference Result 45938 states and 134554 transitions. [2019-12-27 06:30:28,108 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-12-27 06:30:28,108 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 33 [2019-12-27 06:30:28,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:30:28,172 INFO L225 Difference]: With dead ends: 45938 [2019-12-27 06:30:28,172 INFO L226 Difference]: Without dead ends: 45938 [2019-12-27 06:30:28,173 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 154 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=161, Invalid=489, Unknown=0, NotChecked=0, Total=650 [2019-12-27 06:30:28,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45938 states. [2019-12-27 06:30:28,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45938 to 19869. [2019-12-27 06:30:28,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19869 states. [2019-12-27 06:30:28,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19869 states to 19869 states and 59508 transitions. [2019-12-27 06:30:28,670 INFO L78 Accepts]: Start accepts. Automaton has 19869 states and 59508 transitions. Word has length 33 [2019-12-27 06:30:28,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:30:28,670 INFO L462 AbstractCegarLoop]: Abstraction has 19869 states and 59508 transitions. [2019-12-27 06:30:28,670 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 06:30:28,670 INFO L276 IsEmpty]: Start isEmpty. Operand 19869 states and 59508 transitions. [2019-12-27 06:30:28,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-12-27 06:30:28,688 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:30:28,688 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] [2019-12-27 06:30:28,688 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:30:28,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:30:28,689 INFO L82 PathProgramCache]: Analyzing trace with hash 1993650805, now seen corresponding path program 1 times [2019-12-27 06:30:28,689 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:30:28,689 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1963967217] [2019-12-27 06:30:28,689 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:30:28,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:30:28,778 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:30:28,778 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1963967217] [2019-12-27 06:30:28,778 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:30:28,779 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 06:30:28,779 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1820917676] [2019-12-27 06:30:28,779 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 06:30:28,779 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:30:28,780 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 06:30:28,780 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-27 06:30:28,780 INFO L87 Difference]: Start difference. First operand 19869 states and 59508 transitions. Second operand 7 states. [2019-12-27 06:30:30,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:30:30,037 INFO L93 Difference]: Finished difference Result 35347 states and 103679 transitions. [2019-12-27 06:30:30,038 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-27 06:30:30,038 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 34 [2019-12-27 06:30:30,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:30:30,085 INFO L225 Difference]: With dead ends: 35347 [2019-12-27 06:30:30,086 INFO L226 Difference]: Without dead ends: 35347 [2019-12-27 06:30:30,086 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=89, Invalid=253, Unknown=0, NotChecked=0, Total=342 [2019-12-27 06:30:30,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35347 states. [2019-12-27 06:30:30,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35347 to 18737. [2019-12-27 06:30:30,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18737 states. [2019-12-27 06:30:30,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18737 states to 18737 states and 56205 transitions. [2019-12-27 06:30:30,685 INFO L78 Accepts]: Start accepts. Automaton has 18737 states and 56205 transitions. Word has length 34 [2019-12-27 06:30:30,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:30:30,685 INFO L462 AbstractCegarLoop]: Abstraction has 18737 states and 56205 transitions. [2019-12-27 06:30:30,686 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 06:30:30,686 INFO L276 IsEmpty]: Start isEmpty. Operand 18737 states and 56205 transitions. [2019-12-27 06:30:30,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-12-27 06:30:30,703 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:30:30,703 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] [2019-12-27 06:30:30,704 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:30:30,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:30:30,704 INFO L82 PathProgramCache]: Analyzing trace with hash 1065822653, now seen corresponding path program 2 times [2019-12-27 06:30:30,704 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:30:30,705 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [263479293] [2019-12-27 06:30:30,705 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:30:30,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:30:30,801 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:30:30,801 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [263479293] [2019-12-27 06:30:30,802 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:30:30,802 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 06:30:30,802 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [298496932] [2019-12-27 06:30:30,802 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 06:30:30,803 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:30:30,803 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 06:30:30,803 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-12-27 06:30:30,803 INFO L87 Difference]: Start difference. First operand 18737 states and 56205 transitions. Second operand 8 states. [2019-12-27 06:30:32,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:30:32,440 INFO L93 Difference]: Finished difference Result 40218 states and 116663 transitions. [2019-12-27 06:30:32,440 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-12-27 06:30:32,441 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 34 [2019-12-27 06:30:32,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:30:32,533 INFO L225 Difference]: With dead ends: 40218 [2019-12-27 06:30:32,534 INFO L226 Difference]: Without dead ends: 40218 [2019-12-27 06:30:32,539 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 148 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=161, Invalid=489, Unknown=0, NotChecked=0, Total=650 [2019-12-27 06:30:32,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40218 states. [2019-12-27 06:30:33,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40218 to 16942. [2019-12-27 06:30:33,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16942 states. [2019-12-27 06:30:33,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16942 states to 16942 states and 50885 transitions. [2019-12-27 06:30:33,063 INFO L78 Accepts]: Start accepts. Automaton has 16942 states and 50885 transitions. Word has length 34 [2019-12-27 06:30:33,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:30:33,064 INFO L462 AbstractCegarLoop]: Abstraction has 16942 states and 50885 transitions. [2019-12-27 06:30:33,064 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 06:30:33,064 INFO L276 IsEmpty]: Start isEmpty. Operand 16942 states and 50885 transitions. [2019-12-27 06:30:33,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-27 06:30:33,084 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:30:33,084 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:30:33,084 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:30:33,085 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:30:33,085 INFO L82 PathProgramCache]: Analyzing trace with hash -903409010, now seen corresponding path program 1 times [2019-12-27 06:30:33,085 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:30:33,085 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1882156712] [2019-12-27 06:30:33,085 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:30:33,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:30:33,143 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:30:33,144 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1882156712] [2019-12-27 06:30:33,144 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:30:33,144 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 06:30:33,144 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2017274155] [2019-12-27 06:30:33,145 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 06:30:33,145 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:30:33,145 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 06:30:33,145 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 06:30:33,146 INFO L87 Difference]: Start difference. First operand 16942 states and 50885 transitions. Second operand 4 states. [2019-12-27 06:30:33,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:30:33,264 INFO L93 Difference]: Finished difference Result 28675 states and 86465 transitions. [2019-12-27 06:30:33,265 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 06:30:33,265 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 39 [2019-12-27 06:30:33,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:30:33,294 INFO L225 Difference]: With dead ends: 28675 [2019-12-27 06:30:33,295 INFO L226 Difference]: Without dead ends: 14492 [2019-12-27 06:30:33,295 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 06:30:33,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14492 states. [2019-12-27 06:30:33,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14492 to 14412. [2019-12-27 06:30:33,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14412 states. [2019-12-27 06:30:34,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14412 states to 14412 states and 42566 transitions. [2019-12-27 06:30:34,059 INFO L78 Accepts]: Start accepts. Automaton has 14412 states and 42566 transitions. Word has length 39 [2019-12-27 06:30:34,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:30:34,060 INFO L462 AbstractCegarLoop]: Abstraction has 14412 states and 42566 transitions. [2019-12-27 06:30:34,060 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 06:30:34,060 INFO L276 IsEmpty]: Start isEmpty. Operand 14412 states and 42566 transitions. [2019-12-27 06:30:34,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-27 06:30:34,078 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:30:34,078 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:30:34,078 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:30:34,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:30:34,079 INFO L82 PathProgramCache]: Analyzing trace with hash -2089566008, now seen corresponding path program 2 times [2019-12-27 06:30:34,079 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:30:34,079 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1057289789] [2019-12-27 06:30:34,079 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:30:34,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:30:34,130 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:30:34,130 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1057289789] [2019-12-27 06:30:34,130 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:30:34,131 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 06:30:34,131 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [829292233] [2019-12-27 06:30:34,131 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 06:30:34,131 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:30:34,131 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 06:30:34,132 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 06:30:34,132 INFO L87 Difference]: Start difference. First operand 14412 states and 42566 transitions. Second operand 3 states. [2019-12-27 06:30:34,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:30:34,227 INFO L93 Difference]: Finished difference Result 23005 states and 68360 transitions. [2019-12-27 06:30:34,228 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 06:30:34,228 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2019-12-27 06:30:34,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:30:34,246 INFO L225 Difference]: With dead ends: 23005 [2019-12-27 06:30:34,247 INFO L226 Difference]: Without dead ends: 10590 [2019-12-27 06:30:34,247 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 06:30:34,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10590 states. [2019-12-27 06:30:34,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10590 to 10534. [2019-12-27 06:30:34,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10534 states. [2019-12-27 06:30:34,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10534 states to 10534 states and 30298 transitions. [2019-12-27 06:30:34,418 INFO L78 Accepts]: Start accepts. Automaton has 10534 states and 30298 transitions. Word has length 39 [2019-12-27 06:30:34,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:30:34,419 INFO L462 AbstractCegarLoop]: Abstraction has 10534 states and 30298 transitions. [2019-12-27 06:30:34,419 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 06:30:34,419 INFO L276 IsEmpty]: Start isEmpty. Operand 10534 states and 30298 transitions. [2019-12-27 06:30:34,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-27 06:30:34,431 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:30:34,431 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] [2019-12-27 06:30:34,431 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:30:34,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:30:34,431 INFO L82 PathProgramCache]: Analyzing trace with hash 1423567527, now seen corresponding path program 1 times [2019-12-27 06:30:34,432 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:30:34,432 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [817573317] [2019-12-27 06:30:34,432 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:30:34,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:30:34,513 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:30:34,513 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [817573317] [2019-12-27 06:30:34,513 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:30:34,514 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 06:30:34,514 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [533457480] [2019-12-27 06:30:34,514 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 06:30:34,514 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:30:34,514 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 06:30:34,515 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 06:30:34,515 INFO L87 Difference]: Start difference. First operand 10534 states and 30298 transitions. Second operand 5 states. [2019-12-27 06:30:35,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:30:35,074 INFO L93 Difference]: Finished difference Result 17505 states and 50007 transitions. [2019-12-27 06:30:35,074 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 06:30:35,074 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 40 [2019-12-27 06:30:35,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:30:35,097 INFO L225 Difference]: With dead ends: 17505 [2019-12-27 06:30:35,097 INFO L226 Difference]: Without dead ends: 17505 [2019-12-27 06:30:35,097 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-27 06:30:35,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17505 states. [2019-12-27 06:30:35,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17505 to 16433. [2019-12-27 06:30:35,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16433 states. [2019-12-27 06:30:35,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16433 states to 16433 states and 47130 transitions. [2019-12-27 06:30:35,342 INFO L78 Accepts]: Start accepts. Automaton has 16433 states and 47130 transitions. Word has length 40 [2019-12-27 06:30:35,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:30:35,342 INFO L462 AbstractCegarLoop]: Abstraction has 16433 states and 47130 transitions. [2019-12-27 06:30:35,342 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 06:30:35,342 INFO L276 IsEmpty]: Start isEmpty. Operand 16433 states and 47130 transitions. [2019-12-27 06:30:35,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-27 06:30:35,357 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:30:35,357 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] [2019-12-27 06:30:35,357 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:30:35,357 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:30:35,357 INFO L82 PathProgramCache]: Analyzing trace with hash -1539619421, now seen corresponding path program 2 times [2019-12-27 06:30:35,357 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:30:35,357 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2042839355] [2019-12-27 06:30:35,358 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:30:35,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:30:35,406 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:30:35,406 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2042839355] [2019-12-27 06:30:35,406 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:30:35,407 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 06:30:35,407 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [368433037] [2019-12-27 06:30:35,407 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 06:30:35,407 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:30:35,408 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 06:30:35,408 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 06:30:35,408 INFO L87 Difference]: Start difference. First operand 16433 states and 47130 transitions. Second operand 5 states. [2019-12-27 06:30:35,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:30:35,492 INFO L93 Difference]: Finished difference Result 15339 states and 44645 transitions. [2019-12-27 06:30:35,492 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 06:30:35,492 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 40 [2019-12-27 06:30:35,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:30:35,514 INFO L225 Difference]: With dead ends: 15339 [2019-12-27 06:30:35,514 INFO L226 Difference]: Without dead ends: 12149 [2019-12-27 06:30:35,515 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 06:30:35,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12149 states. [2019-12-27 06:30:35,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12149 to 11603. [2019-12-27 06:30:35,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11603 states. [2019-12-27 06:30:35,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11603 states to 11603 states and 36079 transitions. [2019-12-27 06:30:35,731 INFO L78 Accepts]: Start accepts. Automaton has 11603 states and 36079 transitions. Word has length 40 [2019-12-27 06:30:35,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:30:35,732 INFO L462 AbstractCegarLoop]: Abstraction has 11603 states and 36079 transitions. [2019-12-27 06:30:35,732 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 06:30:35,732 INFO L276 IsEmpty]: Start isEmpty. Operand 11603 states and 36079 transitions. [2019-12-27 06:30:35,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 06:30:35,749 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:30:35,749 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:30:35,750 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:30:35,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:30:35,750 INFO L82 PathProgramCache]: Analyzing trace with hash 987827026, now seen corresponding path program 1 times [2019-12-27 06:30:35,750 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:30:35,750 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [499492049] [2019-12-27 06:30:35,751 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:30:35,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:30:35,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 06:30:35,852 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [499492049] [2019-12-27 06:30:35,852 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:30:35,852 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 06:30:35,852 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2098851400] [2019-12-27 06:30:35,853 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 06:30:35,853 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:30:35,853 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 06:30:35,853 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-12-27 06:30:35,853 INFO L87 Difference]: Start difference. First operand 11603 states and 36079 transitions. Second operand 8 states. [2019-12-27 06:30:36,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:30:36,689 INFO L93 Difference]: Finished difference Result 31587 states and 96032 transitions. [2019-12-27 06:30:36,689 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-27 06:30:36,689 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 64 [2019-12-27 06:30:36,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:30:36,720 INFO L225 Difference]: With dead ends: 31587 [2019-12-27 06:30:36,720 INFO L226 Difference]: Without dead ends: 22364 [2019-12-27 06:30:36,720 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=110, Invalid=352, Unknown=0, NotChecked=0, Total=462 [2019-12-27 06:30:36,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22364 states. [2019-12-27 06:30:36,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22364 to 13002. [2019-12-27 06:30:36,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13002 states. [2019-12-27 06:30:36,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13002 states to 13002 states and 40208 transitions. [2019-12-27 06:30:36,990 INFO L78 Accepts]: Start accepts. Automaton has 13002 states and 40208 transitions. Word has length 64 [2019-12-27 06:30:36,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:30:36,990 INFO L462 AbstractCegarLoop]: Abstraction has 13002 states and 40208 transitions. [2019-12-27 06:30:36,990 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 06:30:36,991 INFO L276 IsEmpty]: Start isEmpty. Operand 13002 states and 40208 transitions. [2019-12-27 06:30:37,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 06:30:37,006 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:30:37,007 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:30:37,007 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:30:37,007 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:30:37,007 INFO L82 PathProgramCache]: Analyzing trace with hash -2017353844, now seen corresponding path program 2 times [2019-12-27 06:30:37,007 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:30:37,007 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1951733763] [2019-12-27 06:30:37,007 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:30:37,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:30:37,294 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:30:37,294 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1951733763] [2019-12-27 06:30:37,295 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:30:37,295 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 06:30:37,295 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [30753802] [2019-12-27 06:30:37,296 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 06:30:37,296 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:30:37,296 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 06:30:37,296 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-27 06:30:37,296 INFO L87 Difference]: Start difference. First operand 13002 states and 40208 transitions. Second operand 7 states. [2019-12-27 06:30:37,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:30:37,572 INFO L93 Difference]: Finished difference Result 25917 states and 78857 transitions. [2019-12-27 06:30:37,573 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-27 06:30:37,573 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 64 [2019-12-27 06:30:37,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:30:37,597 INFO L225 Difference]: With dead ends: 25917 [2019-12-27 06:30:37,597 INFO L226 Difference]: Without dead ends: 18327 [2019-12-27 06:30:37,598 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2019-12-27 06:30:37,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18327 states. [2019-12-27 06:30:37,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18327 to 15314. [2019-12-27 06:30:37,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15314 states. [2019-12-27 06:30:37,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15314 states to 15314 states and 47034 transitions. [2019-12-27 06:30:37,847 INFO L78 Accepts]: Start accepts. Automaton has 15314 states and 47034 transitions. Word has length 64 [2019-12-27 06:30:37,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:30:37,847 INFO L462 AbstractCegarLoop]: Abstraction has 15314 states and 47034 transitions. [2019-12-27 06:30:37,847 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 06:30:37,847 INFO L276 IsEmpty]: Start isEmpty. Operand 15314 states and 47034 transitions. [2019-12-27 06:30:37,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 06:30:37,863 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:30:37,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] [2019-12-27 06:30:37,863 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:30:37,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:30:37,863 INFO L82 PathProgramCache]: Analyzing trace with hash -838064708, now seen corresponding path program 3 times [2019-12-27 06:30:37,863 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:30:37,864 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1470143300] [2019-12-27 06:30:37,864 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:30:37,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:30:37,976 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:30:37,976 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1470143300] [2019-12-27 06:30:37,976 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:30:37,976 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 06:30:37,976 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1178477083] [2019-12-27 06:30:37,977 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 06:30:37,977 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:30:37,977 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 06:30:37,977 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-27 06:30:37,977 INFO L87 Difference]: Start difference. First operand 15314 states and 47034 transitions. Second operand 9 states. [2019-12-27 06:30:38,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:30:38,961 INFO L93 Difference]: Finished difference Result 47803 states and 144821 transitions. [2019-12-27 06:30:38,961 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-27 06:30:38,962 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 64 [2019-12-27 06:30:38,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:30:39,025 INFO L225 Difference]: With dead ends: 47803 [2019-12-27 06:30:39,025 INFO L226 Difference]: Without dead ends: 44099 [2019-12-27 06:30:39,026 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 144 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=157, Invalid=493, Unknown=0, NotChecked=0, Total=650 [2019-12-27 06:30:39,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44099 states. [2019-12-27 06:30:39,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44099 to 15558. [2019-12-27 06:30:39,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15558 states. [2019-12-27 06:30:39,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15558 states to 15558 states and 47784 transitions. [2019-12-27 06:30:39,474 INFO L78 Accepts]: Start accepts. Automaton has 15558 states and 47784 transitions. Word has length 64 [2019-12-27 06:30:39,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:30:39,474 INFO L462 AbstractCegarLoop]: Abstraction has 15558 states and 47784 transitions. [2019-12-27 06:30:39,474 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 06:30:39,474 INFO L276 IsEmpty]: Start isEmpty. Operand 15558 states and 47784 transitions. [2019-12-27 06:30:39,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 06:30:39,497 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:30:39,497 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:30:39,497 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:30:39,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:30:39,498 INFO L82 PathProgramCache]: Analyzing trace with hash 1593875220, now seen corresponding path program 4 times [2019-12-27 06:30:39,498 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:30:39,498 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [716594675] [2019-12-27 06:30:39,498 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:30:39,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:30:39,619 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:30:39,620 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [716594675] [2019-12-27 06:30:39,620 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:30:39,620 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 06:30:39,620 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [222256389] [2019-12-27 06:30:39,621 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 06:30:39,621 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:30:39,621 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 06:30:39,622 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-27 06:30:39,623 INFO L87 Difference]: Start difference. First operand 15558 states and 47784 transitions. Second operand 9 states. [2019-12-27 06:30:40,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:30:40,693 INFO L93 Difference]: Finished difference Result 35624 states and 107719 transitions. [2019-12-27 06:30:40,693 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-12-27 06:30:40,693 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 64 [2019-12-27 06:30:40,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:30:40,738 INFO L225 Difference]: With dead ends: 35624 [2019-12-27 06:30:40,738 INFO L226 Difference]: Without dead ends: 32808 [2019-12-27 06:30:40,739 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 150 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=166, Invalid=536, Unknown=0, NotChecked=0, Total=702 [2019-12-27 06:30:41,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32808 states. [2019-12-27 06:30:41,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32808 to 15311. [2019-12-27 06:30:41,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15311 states. [2019-12-27 06:30:41,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15311 states to 15311 states and 47116 transitions. [2019-12-27 06:30:41,291 INFO L78 Accepts]: Start accepts. Automaton has 15311 states and 47116 transitions. Word has length 64 [2019-12-27 06:30:41,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:30:41,291 INFO L462 AbstractCegarLoop]: Abstraction has 15311 states and 47116 transitions. [2019-12-27 06:30:41,291 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 06:30:41,292 INFO L276 IsEmpty]: Start isEmpty. Operand 15311 states and 47116 transitions. [2019-12-27 06:30:41,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 06:30:41,308 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:30:41,309 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:30:41,309 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:30:41,309 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:30:41,309 INFO L82 PathProgramCache]: Analyzing trace with hash -406759870, now seen corresponding path program 5 times [2019-12-27 06:30:41,310 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:30:41,310 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1087006372] [2019-12-27 06:30:41,310 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:30:41,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:30:41,392 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:30:41,392 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1087006372] [2019-12-27 06:30:41,393 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:30:41,393 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 06:30:41,393 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2090476883] [2019-12-27 06:30:41,393 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 06:30:41,394 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:30:41,394 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 06:30:41,394 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-27 06:30:41,394 INFO L87 Difference]: Start difference. First operand 15311 states and 47116 transitions. Second operand 7 states. [2019-12-27 06:30:41,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:30:41,834 INFO L93 Difference]: Finished difference Result 25740 states and 77714 transitions. [2019-12-27 06:30:41,834 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-27 06:30:41,835 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 64 [2019-12-27 06:30:41,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:30:41,884 INFO L225 Difference]: With dead ends: 25740 [2019-12-27 06:30:41,884 INFO L226 Difference]: Without dead ends: 18859 [2019-12-27 06:30:41,885 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2019-12-27 06:30:42,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18859 states. [2019-12-27 06:30:42,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18859 to 15335. [2019-12-27 06:30:42,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15335 states. [2019-12-27 06:30:42,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15335 states to 15335 states and 47162 transitions. [2019-12-27 06:30:42,440 INFO L78 Accepts]: Start accepts. Automaton has 15335 states and 47162 transitions. Word has length 64 [2019-12-27 06:30:42,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:30:42,441 INFO L462 AbstractCegarLoop]: Abstraction has 15335 states and 47162 transitions. [2019-12-27 06:30:42,441 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 06:30:42,441 INFO L276 IsEmpty]: Start isEmpty. Operand 15335 states and 47162 transitions. [2019-12-27 06:30:42,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 06:30:42,470 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:30:42,471 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:30:42,471 INFO L410 AbstractCegarLoop]: === Iteration 24 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:30:42,471 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:30:42,472 INFO L82 PathProgramCache]: Analyzing trace with hash -2083011794, now seen corresponding path program 6 times [2019-12-27 06:30:42,472 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:30:42,472 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [145597356] [2019-12-27 06:30:42,472 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:30:42,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:30:42,565 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:30:42,566 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [145597356] [2019-12-27 06:30:42,566 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:30:42,566 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 06:30:42,567 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [132680302] [2019-12-27 06:30:42,569 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 06:30:42,569 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:30:42,570 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 06:30:42,570 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 06:30:42,570 INFO L87 Difference]: Start difference. First operand 15335 states and 47162 transitions. Second operand 3 states. [2019-12-27 06:30:42,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:30:42,736 INFO L93 Difference]: Finished difference Result 17615 states and 54128 transitions. [2019-12-27 06:30:42,737 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 06:30:42,737 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 64 [2019-12-27 06:30:42,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:30:42,772 INFO L225 Difference]: With dead ends: 17615 [2019-12-27 06:30:42,773 INFO L226 Difference]: Without dead ends: 17615 [2019-12-27 06:30:42,773 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 06:30:42,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17615 states. [2019-12-27 06:30:43,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17615 to 15395. [2019-12-27 06:30:43,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15395 states. [2019-12-27 06:30:43,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15395 states to 15395 states and 47626 transitions. [2019-12-27 06:30:43,155 INFO L78 Accepts]: Start accepts. Automaton has 15395 states and 47626 transitions. Word has length 64 [2019-12-27 06:30:43,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:30:43,155 INFO L462 AbstractCegarLoop]: Abstraction has 15395 states and 47626 transitions. [2019-12-27 06:30:43,155 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 06:30:43,155 INFO L276 IsEmpty]: Start isEmpty. Operand 15395 states and 47626 transitions. [2019-12-27 06:30:43,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 06:30:43,180 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:30:43,180 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:30:43,180 INFO L410 AbstractCegarLoop]: === Iteration 25 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:30:43,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:30:43,181 INFO L82 PathProgramCache]: Analyzing trace with hash -2130207003, now seen corresponding path program 1 times [2019-12-27 06:30:43,181 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:30:43,181 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1383561817] [2019-12-27 06:30:43,181 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:30:43,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:30:43,238 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:30:43,239 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1383561817] [2019-12-27 06:30:43,239 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:30:43,239 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 06:30:43,239 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [301863887] [2019-12-27 06:30:43,240 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 06:30:43,240 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:30:43,240 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 06:30:43,240 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 06:30:43,240 INFO L87 Difference]: Start difference. First operand 15395 states and 47626 transitions. Second operand 4 states. [2019-12-27 06:30:43,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:30:43,429 INFO L93 Difference]: Finished difference Result 19567 states and 60167 transitions. [2019-12-27 06:30:43,429 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 06:30:43,429 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 65 [2019-12-27 06:30:43,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:30:43,456 INFO L225 Difference]: With dead ends: 19567 [2019-12-27 06:30:43,457 INFO L226 Difference]: Without dead ends: 19567 [2019-12-27 06:30:43,457 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 06:30:43,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19567 states. [2019-12-27 06:30:43,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19567 to 15944. [2019-12-27 06:30:43,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15944 states. [2019-12-27 06:30:43,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15944 states to 15944 states and 49343 transitions. [2019-12-27 06:30:43,730 INFO L78 Accepts]: Start accepts. Automaton has 15944 states and 49343 transitions. Word has length 65 [2019-12-27 06:30:43,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:30:43,731 INFO L462 AbstractCegarLoop]: Abstraction has 15944 states and 49343 transitions. [2019-12-27 06:30:43,731 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 06:30:43,731 INFO L276 IsEmpty]: Start isEmpty. Operand 15944 states and 49343 transitions. [2019-12-27 06:30:43,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 06:30:43,747 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:30:43,747 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:30:43,747 INFO L410 AbstractCegarLoop]: === Iteration 26 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:30:43,747 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:30:43,747 INFO L82 PathProgramCache]: Analyzing trace with hash -1591994433, now seen corresponding path program 2 times [2019-12-27 06:30:43,747 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:30:43,748 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1224062678] [2019-12-27 06:30:43,748 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:30:43,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:30:43,875 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:30:43,876 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1224062678] [2019-12-27 06:30:43,876 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:30:43,876 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 06:30:43,876 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1734861732] [2019-12-27 06:30:43,877 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 06:30:43,877 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:30:43,878 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 06:30:43,878 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-27 06:30:43,878 INFO L87 Difference]: Start difference. First operand 15944 states and 49343 transitions. Second operand 9 states. [2019-12-27 06:30:45,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:30:45,153 INFO L93 Difference]: Finished difference Result 41264 states and 124013 transitions. [2019-12-27 06:30:45,154 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-12-27 06:30:45,154 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 65 [2019-12-27 06:30:45,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:30:45,201 INFO L225 Difference]: With dead ends: 41264 [2019-12-27 06:30:45,201 INFO L226 Difference]: Without dead ends: 33724 [2019-12-27 06:30:45,202 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 124 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=141, Invalid=459, Unknown=0, NotChecked=0, Total=600 [2019-12-27 06:30:45,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33724 states. [2019-12-27 06:30:45,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33724 to 15883. [2019-12-27 06:30:45,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15883 states. [2019-12-27 06:30:45,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15883 states to 15883 states and 48653 transitions. [2019-12-27 06:30:45,584 INFO L78 Accepts]: Start accepts. Automaton has 15883 states and 48653 transitions. Word has length 65 [2019-12-27 06:30:45,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:30:45,585 INFO L462 AbstractCegarLoop]: Abstraction has 15883 states and 48653 transitions. [2019-12-27 06:30:45,585 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 06:30:45,585 INFO L276 IsEmpty]: Start isEmpty. Operand 15883 states and 48653 transitions. [2019-12-27 06:30:45,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 06:30:45,609 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:30:45,609 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:30:45,610 INFO L410 AbstractCegarLoop]: === Iteration 27 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:30:45,610 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:30:45,610 INFO L82 PathProgramCache]: Analyzing trace with hash -1318305515, now seen corresponding path program 3 times [2019-12-27 06:30:45,610 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:30:45,610 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [801506691] [2019-12-27 06:30:45,610 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:30:45,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:30:45,726 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:30:45,726 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [801506691] [2019-12-27 06:30:45,726 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:30:45,727 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 06:30:45,727 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [532222145] [2019-12-27 06:30:45,727 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 06:30:45,727 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:30:45,727 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 06:30:45,728 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-27 06:30:45,728 INFO L87 Difference]: Start difference. First operand 15883 states and 48653 transitions. Second operand 9 states. [2019-12-27 06:30:46,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:30:46,648 INFO L93 Difference]: Finished difference Result 32475 states and 97537 transitions. [2019-12-27 06:30:46,648 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-27 06:30:46,648 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 65 [2019-12-27 06:30:46,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:30:46,688 INFO L225 Difference]: With dead ends: 32475 [2019-12-27 06:30:46,688 INFO L226 Difference]: Without dead ends: 28770 [2019-12-27 06:30:46,689 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=129, Invalid=423, Unknown=0, NotChecked=0, Total=552 [2019-12-27 06:30:46,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28770 states. [2019-12-27 06:30:46,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28770 to 15369. [2019-12-27 06:30:46,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15369 states. [2019-12-27 06:30:47,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15369 states to 15369 states and 47106 transitions. [2019-12-27 06:30:47,027 INFO L78 Accepts]: Start accepts. Automaton has 15369 states and 47106 transitions. Word has length 65 [2019-12-27 06:30:47,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:30:47,027 INFO L462 AbstractCegarLoop]: Abstraction has 15369 states and 47106 transitions. [2019-12-27 06:30:47,027 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 06:30:47,027 INFO L276 IsEmpty]: Start isEmpty. Operand 15369 states and 47106 transitions. [2019-12-27 06:30:47,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 06:30:47,045 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:30:47,045 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:30:47,045 INFO L410 AbstractCegarLoop]: === Iteration 28 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:30:47,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:30:47,046 INFO L82 PathProgramCache]: Analyzing trace with hash 2022119832, now seen corresponding path program 1 times [2019-12-27 06:30:47,046 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:30:47,046 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1519107000] [2019-12-27 06:30:47,046 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:30:47,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:30:47,124 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:30:47,125 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1519107000] [2019-12-27 06:30:47,125 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:30:47,125 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 06:30:47,125 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1623895485] [2019-12-27 06:30:47,125 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 06:30:47,126 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:30:47,126 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 06:30:47,126 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 06:30:47,126 INFO L87 Difference]: Start difference. First operand 15369 states and 47106 transitions. Second operand 3 states. [2019-12-27 06:30:47,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:30:47,201 INFO L93 Difference]: Finished difference Result 15369 states and 47105 transitions. [2019-12-27 06:30:47,201 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 06:30:47,202 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-27 06:30:47,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:30:47,233 INFO L225 Difference]: With dead ends: 15369 [2019-12-27 06:30:47,234 INFO L226 Difference]: Without dead ends: 15369 [2019-12-27 06:30:47,234 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 06:30:47,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15369 states. [2019-12-27 06:30:47,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15369 to 14435. [2019-12-27 06:30:47,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14435 states. [2019-12-27 06:30:47,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14435 states to 14435 states and 44555 transitions. [2019-12-27 06:30:47,696 INFO L78 Accepts]: Start accepts. Automaton has 14435 states and 44555 transitions. Word has length 65 [2019-12-27 06:30:47,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:30:47,697 INFO L462 AbstractCegarLoop]: Abstraction has 14435 states and 44555 transitions. [2019-12-27 06:30:47,697 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 06:30:47,697 INFO L276 IsEmpty]: Start isEmpty. Operand 14435 states and 44555 transitions. [2019-12-27 06:30:47,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 06:30:47,727 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:30:47,727 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:30:47,728 INFO L410 AbstractCegarLoop]: === Iteration 29 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:30:47,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:30:47,728 INFO L82 PathProgramCache]: Analyzing trace with hash -665679131, now seen corresponding path program 1 times [2019-12-27 06:30:47,728 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:30:47,729 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1956074952] [2019-12-27 06:30:47,729 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:30:47,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:30:47,823 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:30:47,823 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1956074952] [2019-12-27 06:30:47,824 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:30:47,824 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 06:30:47,824 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [624476848] [2019-12-27 06:30:47,825 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 06:30:47,825 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:30:47,825 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 06:30:47,825 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 06:30:47,826 INFO L87 Difference]: Start difference. First operand 14435 states and 44555 transitions. Second operand 3 states. [2019-12-27 06:30:47,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:30:47,907 INFO L93 Difference]: Finished difference Result 12651 states and 38448 transitions. [2019-12-27 06:30:47,908 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 06:30:47,908 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-12-27 06:30:47,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:30:47,937 INFO L225 Difference]: With dead ends: 12651 [2019-12-27 06:30:47,937 INFO L226 Difference]: Without dead ends: 12651 [2019-12-27 06:30:47,939 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 06:30:48,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12651 states. [2019-12-27 06:30:48,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12651 to 12398. [2019-12-27 06:30:48,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12398 states. [2019-12-27 06:30:48,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12398 states to 12398 states and 37729 transitions. [2019-12-27 06:30:48,434 INFO L78 Accepts]: Start accepts. Automaton has 12398 states and 37729 transitions. Word has length 66 [2019-12-27 06:30:48,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:30:48,434 INFO L462 AbstractCegarLoop]: Abstraction has 12398 states and 37729 transitions. [2019-12-27 06:30:48,435 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 06:30:48,435 INFO L276 IsEmpty]: Start isEmpty. Operand 12398 states and 37729 transitions. [2019-12-27 06:30:48,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 06:30:48,447 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:30:48,448 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:30:48,448 INFO L410 AbstractCegarLoop]: === Iteration 30 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:30:48,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:30:48,448 INFO L82 PathProgramCache]: Analyzing trace with hash -611821270, now seen corresponding path program 1 times [2019-12-27 06:30:48,448 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:30:48,448 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1119204714] [2019-12-27 06:30:48,448 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:30:48,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 06:30:48,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 06:30:48,548 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 06:30:48,549 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 06:30:48,552 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [898] [898] ULTIMATE.startENTRY-->L830: Formula: (let ((.cse0 (store |v_#valid_65| 0 0))) (and (= v_~main$tmp_guard1~0_17 0) (= v_~main$tmp_guard0~0_10 0) (= v_~x~0_11 0) (= 0 v_~a$mem_tmp~0_9) (= v_~a~0_26 0) (= v_~a$r_buff0_thd0~0_20 0) (= 0 v_~a$read_delayed_var~0.base_7) (= 0 v_~__unbuffered_cnt~0_20) (= v_~y~0_14 0) (= v_~a$r_buff0_thd2~0_19 0) (= |v_#NULL.offset_6| 0) (= 0 v_~a$read_delayed~0_7) (= (select .cse0 |v_ULTIMATE.start_main_~#t1105~0.base_23|) 0) (= v_~a$read_delayed_var~0.offset_7 0) (= 0 v_~a$r_buff1_thd1~0_19) (= 0 v_~z~0_6) (= 0 |v_ULTIMATE.start_main_~#t1105~0.offset_18|) (= |v_#length_25| (store |v_#length_26| |v_ULTIMATE.start_main_~#t1105~0.base_23| 4)) (< 0 |v_#StackHeapBarrier_19|) (= 0 v_~a$r_buff1_thd3~0_52) (= v_~a$r_buff0_thd3~0_77 0) (= v_~a$flush_delayed~0_12 0) (= (store .cse0 |v_ULTIMATE.start_main_~#t1105~0.base_23| 1) |v_#valid_63|) (= 0 v_~a$r_buff1_thd0~0_26) (= 0 v_~a$w_buff0~0_23) (= 0 v_~a$w_buff0_used~0_113) (= 0 |v_#NULL.base_6|) (= 0 v_~weak$$choice2~0_33) (= 0 v_~weak$$choice0~0_7) (= v_~a$r_buff0_thd1~0_28 0) (= v_~__unbuffered_p2_EBX~0_15 0) (= 0 v_~__unbuffered_p0_EAX~0_17) (< |v_#StackHeapBarrier_19| |v_ULTIMATE.start_main_~#t1105~0.base_23|) (= 0 v_~__unbuffered_p2_EAX~0_14) (= 0 v_~a$r_buff1_thd2~0_21) (= 0 v_~a$w_buff1~0_25) (= (store |v_#memory_int_22| |v_ULTIMATE.start_main_~#t1105~0.base_23| (store (select |v_#memory_int_22| |v_ULTIMATE.start_main_~#t1105~0.base_23|) |v_ULTIMATE.start_main_~#t1105~0.offset_18| 0)) |v_#memory_int_21|) (= 0 v_~a$w_buff1_used~0_76))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_19|, #valid=|v_#valid_65|, #memory_int=|v_#memory_int_22|, #length=|v_#length_26|} OutVars{ULTIMATE.start_main_~#t1107~0.offset=|v_ULTIMATE.start_main_~#t1107~0.offset_16|, ~a$r_buff1_thd2~0=v_~a$r_buff1_thd2~0_21, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_12|, #NULL.offset=|v_#NULL.offset_6|, ULTIMATE.start_main_#t~ite49=|v_ULTIMATE.start_main_#t~ite49_10|, ~a$r_buff0_thd0~0=v_~a$r_buff0_thd0~0_20, ULTIMATE.start_main_#t~ite50=|v_ULTIMATE.start_main_#t~ite50_10|, ~a~0=v_~a~0_26, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_23|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_17, #length=|v_#length_25|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_14, ULTIMATE.start_main_~#t1106~0.base=|v_ULTIMATE.start_main_~#t1106~0.base_21|, ULTIMATE.start_main_~#t1105~0.base=|v_ULTIMATE.start_main_~#t1105~0.base_23|, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_15, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_9|, ~a$r_buff1_thd3~0=v_~a$r_buff1_thd3~0_52, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_113, ~a$r_buff0_thd1~0=v_~a$r_buff0_thd1~0_28, ~weak$$choice0~0=v_~weak$$choice0~0_7, #StackHeapBarrier=|v_#StackHeapBarrier_19|, ~a$read_delayed_var~0.offset=v_~a$read_delayed_var~0.offset_7, ULTIMATE.start_main_~#t1105~0.offset=|v_ULTIMATE.start_main_~#t1105~0.offset_18|, ~a$w_buff0~0=v_~a$w_buff0~0_23, ~a$r_buff1_thd0~0=v_~a$r_buff1_thd0~0_26, ULTIMATE.start_main_~#t1106~0.offset=|v_ULTIMATE.start_main_~#t1106~0.offset_15|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_20, ~x~0=v_~x~0_11, ~a$read_delayed~0=v_~a$read_delayed~0_7, ~a$r_buff0_thd2~0=v_~a$r_buff0_thd2~0_19, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_17, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_12|, ULTIMATE.start_main_~#t1107~0.base=|v_ULTIMATE.start_main_~#t1107~0.base_20|, ~a$mem_tmp~0=v_~a$mem_tmp~0_9, ULTIMATE.start_main_#t~ite51=|v_ULTIMATE.start_main_#t~ite51_10|, ~a$w_buff1~0=v_~a$w_buff1~0_25, ~y~0=v_~y~0_14, ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_8|, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_9|, ~a$r_buff1_thd1~0=v_~a$r_buff1_thd1~0_19, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_77, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_10, #NULL.base=|v_#NULL.base_6|, ~a$flush_delayed~0=v_~a$flush_delayed~0_12, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_17|, #valid=|v_#valid_63|, #memory_int=|v_#memory_int_21|, ~z~0=v_~z~0_6, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_76, ~weak$$choice2~0=v_~weak$$choice2~0_33, ~a$read_delayed_var~0.base=v_~a$read_delayed_var~0.base_7} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1107~0.offset, ~a$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite47, #NULL.offset, ULTIMATE.start_main_#t~ite49, ~a$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite50, ~a~0, ULTIMATE.start_main_#t~ite52, ~__unbuffered_p0_EAX~0, #length, ~__unbuffered_p2_EAX~0, ULTIMATE.start_main_~#t1106~0.base, ULTIMATE.start_main_~#t1105~0.base, ~__unbuffered_p2_EBX~0, ULTIMATE.start_main_#t~nondet45, ~a$r_buff1_thd3~0, ~a$w_buff0_used~0, ~a$r_buff0_thd1~0, ~weak$$choice0~0, ~a$read_delayed_var~0.offset, ULTIMATE.start_main_~#t1105~0.offset, ~a$w_buff0~0, ~a$r_buff1_thd0~0, ULTIMATE.start_main_~#t1106~0.offset, ~__unbuffered_cnt~0, ~x~0, ~a$read_delayed~0, ~a$r_buff0_thd2~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite48, ULTIMATE.start_main_~#t1107~0.base, ~a$mem_tmp~0, ULTIMATE.start_main_#t~ite51, ~a$w_buff1~0, ~y~0, ULTIMATE.start_main_#t~nondet46, ULTIMATE.start_main_#t~nondet44, ~a$r_buff1_thd1~0, ~a$r_buff0_thd3~0, ~main$tmp_guard0~0, #NULL.base, ~a$flush_delayed~0, ULTIMATE.start_main_#res, #valid, #memory_int, ~z~0, ~a$w_buff1_used~0, ~weak$$choice2~0, ~a$read_delayed_var~0.base] because there is no mapped edge [2019-12-27 06:30:48,554 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [857] [857] L830-1-->L832: Formula: (and (= |v_#valid_34| (store |v_#valid_35| |v_ULTIMATE.start_main_~#t1106~0.base_9| 1)) (= (store |v_#length_16| |v_ULTIMATE.start_main_~#t1106~0.base_9| 4) |v_#length_15|) (not (= 0 |v_ULTIMATE.start_main_~#t1106~0.base_9|)) (= |v_#memory_int_11| (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1106~0.base_9| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1106~0.base_9|) |v_ULTIMATE.start_main_~#t1106~0.offset_7| 1))) (= |v_ULTIMATE.start_main_~#t1106~0.offset_7| 0) (= 0 (select |v_#valid_35| |v_ULTIMATE.start_main_~#t1106~0.base_9|)) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t1106~0.base_9|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_35|, #memory_int=|v_#memory_int_12|, #length=|v_#length_16|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_11|, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_4|, #valid=|v_#valid_34|, #memory_int=|v_#memory_int_11|, ULTIMATE.start_main_~#t1106~0.offset=|v_ULTIMATE.start_main_~#t1106~0.offset_7|, #length=|v_#length_15|, ULTIMATE.start_main_~#t1106~0.base=|v_ULTIMATE.start_main_~#t1106~0.base_9|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet44, #valid, #memory_int, ULTIMATE.start_main_~#t1106~0.offset, #length, ULTIMATE.start_main_~#t1106~0.base] because there is no mapped edge [2019-12-27 06:30:48,554 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [856] [856] L832-1-->L834: Formula: (and (= |v_ULTIMATE.start_main_~#t1107~0.offset_8| 0) (not (= 0 |v_ULTIMATE.start_main_~#t1107~0.base_9|)) (= 0 (select |v_#valid_33| |v_ULTIMATE.start_main_~#t1107~0.base_9|)) (< |v_#StackHeapBarrier_10| |v_ULTIMATE.start_main_~#t1107~0.base_9|) (= (store |v_#length_14| |v_ULTIMATE.start_main_~#t1107~0.base_9| 4) |v_#length_13|) (= |v_#memory_int_9| (store |v_#memory_int_10| |v_ULTIMATE.start_main_~#t1107~0.base_9| (store (select |v_#memory_int_10| |v_ULTIMATE.start_main_~#t1107~0.base_9|) |v_ULTIMATE.start_main_~#t1107~0.offset_8| 2))) (= |v_#valid_32| (store |v_#valid_33| |v_ULTIMATE.start_main_~#t1107~0.base_9| 1))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_33|, #memory_int=|v_#memory_int_10|, #length=|v_#length_14|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_10|, ULTIMATE.start_main_~#t1107~0.offset=|v_ULTIMATE.start_main_~#t1107~0.offset_8|, #valid=|v_#valid_32|, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_4|, #memory_int=|v_#memory_int_9|, #length=|v_#length_13|, ULTIMATE.start_main_~#t1107~0.base=|v_ULTIMATE.start_main_~#t1107~0.base_9|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1107~0.offset, #valid, ULTIMATE.start_main_#t~nondet45, #memory_int, #length, ULTIMATE.start_main_~#t1107~0.base] because there is no mapped edge [2019-12-27 06:30:48,555 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [878] [878] L4-->L748: Formula: (and (= ~__unbuffered_p0_EAX~0_Out-580914212 ~x~0_In-580914212) (not (= 0 P0Thread1of1ForFork1___VERIFIER_assert_~expression_In-580914212)) (= ~a$r_buff1_thd0~0_Out-580914212 ~a$r_buff0_thd0~0_In-580914212) (= ~a$r_buff1_thd3~0_Out-580914212 ~a$r_buff0_thd3~0_In-580914212) (= ~a$r_buff0_thd1~0_In-580914212 ~a$r_buff1_thd1~0_Out-580914212) (= ~a$r_buff0_thd2~0_In-580914212 ~a$r_buff1_thd2~0_Out-580914212) (= ~a$r_buff0_thd1~0_Out-580914212 1)) InVars {~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-580914212, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-580914212, P0Thread1of1ForFork1___VERIFIER_assert_~expression=P0Thread1of1ForFork1___VERIFIER_assert_~expression_In-580914212, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In-580914212, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-580914212, ~x~0=~x~0_In-580914212} OutVars{~__unbuffered_p0_EAX~0=~__unbuffered_p0_EAX~0_Out-580914212, ~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_Out-580914212, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_Out-580914212, ~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_Out-580914212, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_Out-580914212, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-580914212, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-580914212, P0Thread1of1ForFork1___VERIFIER_assert_~expression=P0Thread1of1ForFork1___VERIFIER_assert_~expression_In-580914212, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_Out-580914212, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-580914212, ~x~0=~x~0_In-580914212} AuxVars[] AssignedVars[~__unbuffered_p0_EAX~0, ~a$r_buff1_thd1~0, ~a$r_buff1_thd3~0, ~a$r_buff1_thd2~0, ~a$r_buff1_thd0~0, ~a$r_buff0_thd1~0] because there is no mapped edge [2019-12-27 06:30:48,557 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [826] [826] L768-2-->L768-5: Formula: (let ((.cse0 (= |P1Thread1of1ForFork2_#t~ite9_Out617357448| |P1Thread1of1ForFork2_#t~ite10_Out617357448|)) (.cse1 (= 0 (mod ~a$w_buff1_used~0_In617357448 256))) (.cse2 (= 0 (mod ~a$r_buff1_thd2~0_In617357448 256)))) (or (and .cse0 (or .cse1 .cse2) (= |P1Thread1of1ForFork2_#t~ite9_Out617357448| ~a~0_In617357448)) (and .cse0 (= |P1Thread1of1ForFork2_#t~ite9_Out617357448| ~a$w_buff1~0_In617357448) (not .cse1) (not .cse2)))) InVars {~a~0=~a~0_In617357448, ~a$w_buff1~0=~a$w_buff1~0_In617357448, ~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In617357448, ~a$w_buff1_used~0=~a$w_buff1_used~0_In617357448} OutVars{~a~0=~a~0_In617357448, P1Thread1of1ForFork2_#t~ite9=|P1Thread1of1ForFork2_#t~ite9_Out617357448|, ~a$w_buff1~0=~a$w_buff1~0_In617357448, ~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In617357448, P1Thread1of1ForFork2_#t~ite10=|P1Thread1of1ForFork2_#t~ite10_Out617357448|, ~a$w_buff1_used~0=~a$w_buff1_used~0_In617357448} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite9, P1Thread1of1ForFork2_#t~ite10] because there is no mapped edge [2019-12-27 06:30:48,558 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [876] [876] L796-->L796-8: Formula: (let ((.cse1 (= (mod ~weak$$choice2~0_In-1455238063 256) 0))) (or (and (= |P2Thread1of1ForFork0_#t~ite20_Out-1455238063| ~a$w_buff0~0_In-1455238063) (let ((.cse0 (= (mod ~a$r_buff0_thd3~0_In-1455238063 256) 0))) (or (and .cse0 (= (mod ~a$r_buff1_thd3~0_In-1455238063 256) 0)) (= 0 (mod ~a$w_buff0_used~0_In-1455238063 256)) (and .cse0 (= 0 (mod ~a$w_buff1_used~0_In-1455238063 256))))) .cse1 (= |P2Thread1of1ForFork0_#t~ite20_Out-1455238063| |P2Thread1of1ForFork0_#t~ite21_Out-1455238063|)) (and (= |P2Thread1of1ForFork0_#t~ite20_In-1455238063| |P2Thread1of1ForFork0_#t~ite20_Out-1455238063|) (= ~a$w_buff0~0_In-1455238063 |P2Thread1of1ForFork0_#t~ite21_Out-1455238063|) (not .cse1)))) InVars {~a$w_buff0~0=~a$w_buff0~0_In-1455238063, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-1455238063, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1455238063, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-1455238063, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1455238063, P2Thread1of1ForFork0_#t~ite20=|P2Thread1of1ForFork0_#t~ite20_In-1455238063|, ~weak$$choice2~0=~weak$$choice2~0_In-1455238063} OutVars{P2Thread1of1ForFork0_#t~ite21=|P2Thread1of1ForFork0_#t~ite21_Out-1455238063|, ~a$w_buff0~0=~a$w_buff0~0_In-1455238063, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-1455238063, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1455238063, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-1455238063, P2Thread1of1ForFork0_#t~ite20=|P2Thread1of1ForFork0_#t~ite20_Out-1455238063|, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1455238063, ~weak$$choice2~0=~weak$$choice2~0_In-1455238063} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite21, P2Thread1of1ForFork0_#t~ite20] because there is no mapped edge [2019-12-27 06:30:48,558 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [828] [828] L769-->L769-2: Formula: (let ((.cse1 (= (mod ~a$r_buff0_thd2~0_In-721663387 256) 0)) (.cse0 (= 0 (mod ~a$w_buff0_used~0_In-721663387 256)))) (or (and (= ~a$w_buff0_used~0_In-721663387 |P1Thread1of1ForFork2_#t~ite11_Out-721663387|) (or .cse0 .cse1)) (and (not .cse1) (= 0 |P1Thread1of1ForFork2_#t~ite11_Out-721663387|) (not .cse0)))) InVars {~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-721663387, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-721663387} OutVars{~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-721663387, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-721663387, P1Thread1of1ForFork2_#t~ite11=|P1Thread1of1ForFork2_#t~ite11_Out-721663387|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite11] because there is no mapped edge [2019-12-27 06:30:48,559 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [836] [836] L770-->L770-2: Formula: (let ((.cse2 (= (mod ~a$w_buff1_used~0_In-552085437 256) 0)) (.cse3 (= 0 (mod ~a$r_buff1_thd2~0_In-552085437 256))) (.cse1 (= 0 (mod ~a$r_buff0_thd2~0_In-552085437 256))) (.cse0 (= 0 (mod ~a$w_buff0_used~0_In-552085437 256)))) (or (and (= |P1Thread1of1ForFork2_#t~ite12_Out-552085437| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= ~a$w_buff1_used~0_In-552085437 |P1Thread1of1ForFork2_#t~ite12_Out-552085437|) (or .cse2 .cse3) (or .cse1 .cse0)))) InVars {~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In-552085437, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-552085437, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-552085437, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-552085437} OutVars{~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In-552085437, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-552085437, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-552085437, P1Thread1of1ForFork2_#t~ite12=|P1Thread1of1ForFork2_#t~ite12_Out-552085437|, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-552085437} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite12] because there is no mapped edge [2019-12-27 06:30:48,559 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [877] [877] L797-->L797-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-1180227170 256)))) (or (and (= |P2Thread1of1ForFork0_#t~ite24_Out-1180227170| |P2Thread1of1ForFork0_#t~ite23_Out-1180227170|) .cse0 (let ((.cse1 (= 0 (mod ~a$r_buff0_thd3~0_In-1180227170 256)))) (or (and (= 0 (mod ~a$r_buff1_thd3~0_In-1180227170 256)) .cse1) (= 0 (mod ~a$w_buff0_used~0_In-1180227170 256)) (and (= 0 (mod ~a$w_buff1_used~0_In-1180227170 256)) .cse1))) (= ~a$w_buff1~0_In-1180227170 |P2Thread1of1ForFork0_#t~ite23_Out-1180227170|)) (and (not .cse0) (= |P2Thread1of1ForFork0_#t~ite23_In-1180227170| |P2Thread1of1ForFork0_#t~ite23_Out-1180227170|) (= ~a$w_buff1~0_In-1180227170 |P2Thread1of1ForFork0_#t~ite24_Out-1180227170|)))) InVars {~a$w_buff1~0=~a$w_buff1~0_In-1180227170, P2Thread1of1ForFork0_#t~ite23=|P2Thread1of1ForFork0_#t~ite23_In-1180227170|, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-1180227170, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1180227170, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-1180227170, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1180227170, ~weak$$choice2~0=~weak$$choice2~0_In-1180227170} OutVars{~a$w_buff1~0=~a$w_buff1~0_In-1180227170, P2Thread1of1ForFork0_#t~ite23=|P2Thread1of1ForFork0_#t~ite23_Out-1180227170|, P2Thread1of1ForFork0_#t~ite24=|P2Thread1of1ForFork0_#t~ite24_Out-1180227170|, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-1180227170, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1180227170, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-1180227170, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1180227170, ~weak$$choice2~0=~weak$$choice2~0_In-1180227170} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite23, P2Thread1of1ForFork0_#t~ite24] because there is no mapped edge [2019-12-27 06:30:48,559 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [875] [875] L798-->L798-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-2138811024 256)))) (or (and .cse0 (let ((.cse1 (= (mod ~a$r_buff0_thd3~0_In-2138811024 256) 0))) (or (and (= (mod ~a$r_buff1_thd3~0_In-2138811024 256) 0) .cse1) (= (mod ~a$w_buff0_used~0_In-2138811024 256) 0) (and (= (mod ~a$w_buff1_used~0_In-2138811024 256) 0) .cse1))) (= ~a$w_buff0_used~0_In-2138811024 |P2Thread1of1ForFork0_#t~ite26_Out-2138811024|) (= |P2Thread1of1ForFork0_#t~ite27_Out-2138811024| |P2Thread1of1ForFork0_#t~ite26_Out-2138811024|)) (and (= |P2Thread1of1ForFork0_#t~ite26_In-2138811024| |P2Thread1of1ForFork0_#t~ite26_Out-2138811024|) (not .cse0) (= ~a$w_buff0_used~0_In-2138811024 |P2Thread1of1ForFork0_#t~ite27_Out-2138811024|)))) InVars {P2Thread1of1ForFork0_#t~ite26=|P2Thread1of1ForFork0_#t~ite26_In-2138811024|, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-2138811024, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-2138811024, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-2138811024, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-2138811024, ~weak$$choice2~0=~weak$$choice2~0_In-2138811024} OutVars{P2Thread1of1ForFork0_#t~ite26=|P2Thread1of1ForFork0_#t~ite26_Out-2138811024|, P2Thread1of1ForFork0_#t~ite27=|P2Thread1of1ForFork0_#t~ite27_Out-2138811024|, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-2138811024, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-2138811024, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-2138811024, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-2138811024, ~weak$$choice2~0=~weak$$choice2~0_In-2138811024} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite26, P2Thread1of1ForFork0_#t~ite27] because there is no mapped edge [2019-12-27 06:30:48,561 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [841] [841] L771-->L771-2: Formula: (let ((.cse0 (= (mod ~a$r_buff0_thd2~0_In-531156080 256) 0)) (.cse1 (= 0 (mod ~a$w_buff0_used~0_In-531156080 256)))) (or (and (= ~a$r_buff0_thd2~0_In-531156080 |P1Thread1of1ForFork2_#t~ite13_Out-531156080|) (or .cse0 .cse1)) (and (not .cse0) (not .cse1) (= 0 |P1Thread1of1ForFork2_#t~ite13_Out-531156080|)))) InVars {~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-531156080, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-531156080} OutVars{~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-531156080, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-531156080, P1Thread1of1ForFork2_#t~ite13=|P1Thread1of1ForFork2_#t~ite13_Out-531156080|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite13] because there is no mapped edge [2019-12-27 06:30:48,561 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [838] [838] L772-->L772-2: Formula: (let ((.cse3 (= (mod ~a$r_buff0_thd2~0_In180786417 256) 0)) (.cse2 (= (mod ~a$w_buff0_used~0_In180786417 256) 0)) (.cse0 (= 0 (mod ~a$r_buff1_thd2~0_In180786417 256))) (.cse1 (= 0 (mod ~a$w_buff1_used~0_In180786417 256)))) (or (and (or .cse0 .cse1) (= |P1Thread1of1ForFork2_#t~ite14_Out180786417| ~a$r_buff1_thd2~0_In180786417) (or .cse2 .cse3)) (and (= |P1Thread1of1ForFork2_#t~ite14_Out180786417| 0) (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1)))))) InVars {~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In180786417, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In180786417, ~a$w_buff0_used~0=~a$w_buff0_used~0_In180786417, ~a$w_buff1_used~0=~a$w_buff1_used~0_In180786417} OutVars{~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In180786417, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In180786417, ~a$w_buff0_used~0=~a$w_buff0_used~0_In180786417, ~a$w_buff1_used~0=~a$w_buff1_used~0_In180786417, P1Thread1of1ForFork2_#t~ite14=|P1Thread1of1ForFork2_#t~ite14_Out180786417|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite14] because there is no mapped edge [2019-12-27 06:30:48,561 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [872] [872] L772-2-->P1EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_16 1) v_~__unbuffered_cnt~0_15) (= 0 |v_P1Thread1of1ForFork2_#res.offset_5|) (= |v_P1Thread1of1ForFork2_#t~ite14_8| v_~a$r_buff1_thd2~0_17) (= 0 |v_P1Thread1of1ForFork2_#res.base_5|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_16, P1Thread1of1ForFork2_#t~ite14=|v_P1Thread1of1ForFork2_#t~ite14_8|} OutVars{P1Thread1of1ForFork2_#res.offset=|v_P1Thread1of1ForFork2_#res.offset_5|, ~a$r_buff1_thd2~0=v_~a$r_buff1_thd2~0_17, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_15, P1Thread1of1ForFork2_#t~ite14=|v_P1Thread1of1ForFork2_#t~ite14_7|, P1Thread1of1ForFork2_#res.base=|v_P1Thread1of1ForFork2_#res.base_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#res.offset, ~a$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork2_#t~ite14, P1Thread1of1ForFork2_#res.base] because there is no mapped edge [2019-12-27 06:30:48,562 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [767] [767] L800-->L801: Formula: (and (not (= 0 (mod v_~weak$$choice2~0_16 256))) (= v_~a$r_buff0_thd3~0_51 v_~a$r_buff0_thd3~0_50)) InVars {~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_51, ~weak$$choice2~0=v_~weak$$choice2~0_16} OutVars{P2Thread1of1ForFork0_#t~ite33=|v_P2Thread1of1ForFork0_#t~ite33_9|, P2Thread1of1ForFork0_#t~ite32=|v_P2Thread1of1ForFork0_#t~ite32_9|, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_50, P2Thread1of1ForFork0_#t~ite31=|v_P2Thread1of1ForFork0_#t~ite31_8|, ~weak$$choice2~0=v_~weak$$choice2~0_16} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite33, P2Thread1of1ForFork0_#t~ite32, ~a$r_buff0_thd3~0, P2Thread1of1ForFork0_#t~ite31] because there is no mapped edge [2019-12-27 06:30:48,563 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [790] [790] L803-->L807: Formula: (and (not (= 0 (mod v_~a$flush_delayed~0_8 256))) (= v_~a~0_19 v_~a$mem_tmp~0_5) (= v_~a$flush_delayed~0_7 0)) InVars {~a$mem_tmp~0=v_~a$mem_tmp~0_5, ~a$flush_delayed~0=v_~a$flush_delayed~0_8} OutVars{P2Thread1of1ForFork0_#t~ite37=|v_P2Thread1of1ForFork0_#t~ite37_7|, ~a~0=v_~a~0_19, ~a$mem_tmp~0=v_~a$mem_tmp~0_5, ~a$flush_delayed~0=v_~a$flush_delayed~0_7} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite37, ~a~0, ~a$flush_delayed~0] because there is no mapped edge [2019-12-27 06:30:48,563 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [820] [820] L807-2-->L807-4: Formula: (let ((.cse1 (= 0 (mod ~a$r_buff1_thd3~0_In-1700633892 256))) (.cse0 (= (mod ~a$w_buff1_used~0_In-1700633892 256) 0))) (or (and (or .cse0 .cse1) (= |P2Thread1of1ForFork0_#t~ite38_Out-1700633892| ~a~0_In-1700633892)) (and (not .cse1) (not .cse0) (= |P2Thread1of1ForFork0_#t~ite38_Out-1700633892| ~a$w_buff1~0_In-1700633892)))) InVars {~a~0=~a~0_In-1700633892, ~a$w_buff1~0=~a$w_buff1~0_In-1700633892, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-1700633892, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1700633892} OutVars{~a~0=~a~0_In-1700633892, P2Thread1of1ForFork0_#t~ite38=|P2Thread1of1ForFork0_#t~ite38_Out-1700633892|, ~a$w_buff1~0=~a$w_buff1~0_In-1700633892, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-1700633892, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1700633892} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite38] because there is no mapped edge [2019-12-27 06:30:48,563 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [768] [768] L807-4-->L808: Formula: (= v_~a~0_16 |v_P2Thread1of1ForFork0_#t~ite38_8|) InVars {P2Thread1of1ForFork0_#t~ite38=|v_P2Thread1of1ForFork0_#t~ite38_8|} OutVars{~a~0=v_~a~0_16, P2Thread1of1ForFork0_#t~ite39=|v_P2Thread1of1ForFork0_#t~ite39_7|, P2Thread1of1ForFork0_#t~ite38=|v_P2Thread1of1ForFork0_#t~ite38_7|} AuxVars[] AssignedVars[~a~0, P2Thread1of1ForFork0_#t~ite39, P2Thread1of1ForFork0_#t~ite38] because there is no mapped edge [2019-12-27 06:30:48,564 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [824] [824] L808-->L808-2: Formula: (let ((.cse1 (= 0 (mod ~a$w_buff0_used~0_In-446692651 256))) (.cse0 (= 0 (mod ~a$r_buff0_thd3~0_In-446692651 256)))) (or (and (= |P2Thread1of1ForFork0_#t~ite40_Out-446692651| 0) (not .cse0) (not .cse1)) (and (= ~a$w_buff0_used~0_In-446692651 |P2Thread1of1ForFork0_#t~ite40_Out-446692651|) (or .cse1 .cse0)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In-446692651, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-446692651} OutVars{P2Thread1of1ForFork0_#t~ite40=|P2Thread1of1ForFork0_#t~ite40_Out-446692651|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-446692651, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-446692651} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite40] because there is no mapped edge [2019-12-27 06:30:48,564 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [830] [830] L749-->L749-2: Formula: (let ((.cse1 (= 0 (mod ~a$w_buff0_used~0_In465092961 256))) (.cse0 (= 0 (mod ~a$r_buff0_thd1~0_In465092961 256)))) (or (and (= |P0Thread1of1ForFork1_#t~ite5_Out465092961| 0) (not .cse0) (not .cse1)) (and (= |P0Thread1of1ForFork1_#t~ite5_Out465092961| ~a$w_buff0_used~0_In465092961) (or .cse1 .cse0)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In465092961, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In465092961} OutVars{P0Thread1of1ForFork1_#t~ite5=|P0Thread1of1ForFork1_#t~ite5_Out465092961|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In465092961, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In465092961} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite5] because there is no mapped edge [2019-12-27 06:30:48,564 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [829] [829] L750-->L750-2: Formula: (let ((.cse2 (= (mod ~a$w_buff1_used~0_In1132783692 256) 0)) (.cse3 (= 0 (mod ~a$r_buff1_thd1~0_In1132783692 256))) (.cse1 (= 0 (mod ~a$r_buff0_thd1~0_In1132783692 256))) (.cse0 (= (mod ~a$w_buff0_used~0_In1132783692 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P0Thread1of1ForFork1_#t~ite6_Out1132783692| 0)) (and (= ~a$w_buff1_used~0_In1132783692 |P0Thread1of1ForFork1_#t~ite6_Out1132783692|) (or .cse2 .cse3) (or .cse1 .cse0)))) InVars {~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In1132783692, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1132783692, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In1132783692, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1132783692} OutVars{P0Thread1of1ForFork1_#t~ite6=|P0Thread1of1ForFork1_#t~ite6_Out1132783692|, ~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In1132783692, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1132783692, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In1132783692, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1132783692} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite6] because there is no mapped edge [2019-12-27 06:30:48,564 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [821] [821] L751-->L752: Formula: (let ((.cse0 (= (mod ~a$r_buff0_thd1~0_In-1117586418 256) 0)) (.cse1 (= 0 (mod ~a$w_buff0_used~0_In-1117586418 256)))) (or (and (not .cse0) (= ~a$r_buff0_thd1~0_Out-1117586418 0) (not .cse1)) (and (= ~a$r_buff0_thd1~0_In-1117586418 ~a$r_buff0_thd1~0_Out-1117586418) (or .cse0 .cse1)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In-1117586418, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In-1117586418} OutVars{P0Thread1of1ForFork1_#t~ite7=|P0Thread1of1ForFork1_#t~ite7_Out-1117586418|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1117586418, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_Out-1117586418} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite7, ~a$r_buff0_thd1~0] because there is no mapped edge [2019-12-27 06:30:48,565 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [823] [823] L752-->L752-2: Formula: (let ((.cse0 (= 0 (mod ~a$w_buff0_used~0_In-311583057 256))) (.cse1 (= 0 (mod ~a$r_buff0_thd1~0_In-311583057 256))) (.cse2 (= 0 (mod ~a$r_buff1_thd1~0_In-311583057 256))) (.cse3 (= 0 (mod ~a$w_buff1_used~0_In-311583057 256)))) (or (and (= |P0Thread1of1ForFork1_#t~ite8_Out-311583057| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P0Thread1of1ForFork1_#t~ite8_Out-311583057| ~a$r_buff1_thd1~0_In-311583057)))) InVars {~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In-311583057, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-311583057, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In-311583057, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-311583057} OutVars{P0Thread1of1ForFork1_#t~ite8=|P0Thread1of1ForFork1_#t~ite8_Out-311583057|, ~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In-311583057, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-311583057, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In-311583057, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-311583057} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite8] because there is no mapped edge [2019-12-27 06:30:48,565 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [865] [865] L752-2-->P0EXIT: Formula: (and (= v_~a$r_buff1_thd1~0_15 |v_P0Thread1of1ForFork1_#t~ite8_8|) (= v_~__unbuffered_cnt~0_13 (+ v_~__unbuffered_cnt~0_14 1)) (= 0 |v_P0Thread1of1ForFork1_#res.offset_5|) (= 0 |v_P0Thread1of1ForFork1_#res.base_5|)) InVars {P0Thread1of1ForFork1_#t~ite8=|v_P0Thread1of1ForFork1_#t~ite8_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_14} OutVars{P0Thread1of1ForFork1_#t~ite8=|v_P0Thread1of1ForFork1_#t~ite8_7|, P0Thread1of1ForFork1_#res.offset=|v_P0Thread1of1ForFork1_#res.offset_5|, ~a$r_buff1_thd1~0=v_~a$r_buff1_thd1~0_15, P0Thread1of1ForFork1_#res.base=|v_P0Thread1of1ForFork1_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_13} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite8, P0Thread1of1ForFork1_#res.offset, ~a$r_buff1_thd1~0, P0Thread1of1ForFork1_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-27 06:30:48,565 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [837] [837] L809-->L809-2: Formula: (let ((.cse0 (= 0 (mod ~a$r_buff1_thd3~0_In429154231 256))) (.cse1 (= 0 (mod ~a$w_buff1_used~0_In429154231 256))) (.cse3 (= (mod ~a$r_buff0_thd3~0_In429154231 256) 0)) (.cse2 (= 0 (mod ~a$w_buff0_used~0_In429154231 256)))) (or (and (or .cse0 .cse1) (= ~a$w_buff1_used~0_In429154231 |P2Thread1of1ForFork0_#t~ite41_Out429154231|) (or .cse2 .cse3)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2))) (= 0 |P2Thread1of1ForFork0_#t~ite41_Out429154231|)))) InVars {~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In429154231, ~a$w_buff0_used~0=~a$w_buff0_used~0_In429154231, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In429154231, ~a$w_buff1_used~0=~a$w_buff1_used~0_In429154231} OutVars{~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In429154231, ~a$w_buff0_used~0=~a$w_buff0_used~0_In429154231, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In429154231, ~a$w_buff1_used~0=~a$w_buff1_used~0_In429154231, P2Thread1of1ForFork0_#t~ite41=|P2Thread1of1ForFork0_#t~ite41_Out429154231|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite41] because there is no mapped edge [2019-12-27 06:30:48,566 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [832] [832] L810-->L810-2: Formula: (let ((.cse1 (= 0 (mod ~a$w_buff0_used~0_In-684723532 256))) (.cse0 (= 0 (mod ~a$r_buff0_thd3~0_In-684723532 256)))) (or (and (= |P2Thread1of1ForFork0_#t~ite42_Out-684723532| 0) (not .cse0) (not .cse1)) (and (= |P2Thread1of1ForFork0_#t~ite42_Out-684723532| ~a$r_buff0_thd3~0_In-684723532) (or .cse1 .cse0)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In-684723532, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-684723532} OutVars{~a$w_buff0_used~0=~a$w_buff0_used~0_In-684723532, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-684723532, P2Thread1of1ForFork0_#t~ite42=|P2Thread1of1ForFork0_#t~ite42_Out-684723532|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite42] because there is no mapped edge [2019-12-27 06:30:48,567 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [844] [844] L811-->L811-2: Formula: (let ((.cse0 (= (mod ~a$w_buff1_used~0_In-11021623 256) 0)) (.cse1 (= (mod ~a$r_buff1_thd3~0_In-11021623 256) 0)) (.cse2 (= 0 (mod ~a$r_buff0_thd3~0_In-11021623 256))) (.cse3 (= (mod ~a$w_buff0_used~0_In-11021623 256) 0))) (or (and (= 0 |P2Thread1of1ForFork0_#t~ite43_Out-11021623|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= ~a$r_buff1_thd3~0_In-11021623 |P2Thread1of1ForFork0_#t~ite43_Out-11021623|) (or .cse0 .cse1) (or .cse2 .cse3)))) InVars {~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-11021623, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-11021623, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-11021623, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-11021623} OutVars{P2Thread1of1ForFork0_#t~ite43=|P2Thread1of1ForFork0_#t~ite43_Out-11021623|, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-11021623, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-11021623, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-11021623, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-11021623} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite43] because there is no mapped edge [2019-12-27 06:30:48,567 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [848] [848] L811-2-->P2EXIT: Formula: (and (= |v_P2Thread1of1ForFork0_#res.offset_5| 0) (= v_~a$r_buff1_thd3~0_43 |v_P2Thread1of1ForFork0_#t~ite43_8|) (= (+ v_~__unbuffered_cnt~0_12 1) v_~__unbuffered_cnt~0_11) (= |v_P2Thread1of1ForFork0_#res.base_5| 0)) InVars {P2Thread1of1ForFork0_#t~ite43=|v_P2Thread1of1ForFork0_#t~ite43_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_12} OutVars{P2Thread1of1ForFork0_#res.base=|v_P2Thread1of1ForFork0_#res.base_5|, P2Thread1of1ForFork0_#t~ite43=|v_P2Thread1of1ForFork0_#t~ite43_7|, ~a$r_buff1_thd3~0=v_~a$r_buff1_thd3~0_43, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_11, P2Thread1of1ForFork0_#res.offset=|v_P2Thread1of1ForFork0_#res.offset_5|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#res.base, P2Thread1of1ForFork0_#t~ite43, ~a$r_buff1_thd3~0, ~__unbuffered_cnt~0, P2Thread1of1ForFork0_#res.offset] because there is no mapped edge [2019-12-27 06:30:48,567 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [806] [806] L834-1-->L840: Formula: (and (= 3 v_~__unbuffered_cnt~0_10) (= v_~main$tmp_guard0~0_4 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_10} OutVars{ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_10, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_4} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet46, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-27 06:30:48,567 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [840] [840] L840-2-->L840-5: Formula: (let ((.cse1 (= |ULTIMATE.start_main_#t~ite47_Out-745630467| |ULTIMATE.start_main_#t~ite48_Out-745630467|)) (.cse2 (= 0 (mod ~a$r_buff1_thd0~0_In-745630467 256))) (.cse0 (= (mod ~a$w_buff1_used~0_In-745630467 256) 0))) (or (and (= ~a$w_buff1~0_In-745630467 |ULTIMATE.start_main_#t~ite47_Out-745630467|) (not .cse0) .cse1 (not .cse2)) (and .cse1 (= ~a~0_In-745630467 |ULTIMATE.start_main_#t~ite47_Out-745630467|) (or .cse2 .cse0)))) InVars {~a~0=~a~0_In-745630467, ~a$w_buff1~0=~a$w_buff1~0_In-745630467, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In-745630467, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-745630467} OutVars{~a~0=~a~0_In-745630467, ~a$w_buff1~0=~a$w_buff1~0_In-745630467, ULTIMATE.start_main_#t~ite47=|ULTIMATE.start_main_#t~ite47_Out-745630467|, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In-745630467, ULTIMATE.start_main_#t~ite48=|ULTIMATE.start_main_#t~ite48_Out-745630467|, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-745630467} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite47, ULTIMATE.start_main_#t~ite48] because there is no mapped edge [2019-12-27 06:30:48,568 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [831] [831] L841-->L841-2: Formula: (let ((.cse1 (= (mod ~a$w_buff0_used~0_In904993362 256) 0)) (.cse0 (= (mod ~a$r_buff0_thd0~0_In904993362 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite49_Out904993362| ~a$w_buff0_used~0_In904993362) (or .cse0 .cse1)) (and (= 0 |ULTIMATE.start_main_#t~ite49_Out904993362|) (not .cse1) (not .cse0)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In904993362, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In904993362} OutVars{~a$w_buff0_used~0=~a$w_buff0_used~0_In904993362, ULTIMATE.start_main_#t~ite49=|ULTIMATE.start_main_#t~ite49_Out904993362|, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In904993362} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite49] because there is no mapped edge [2019-12-27 06:30:48,568 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [835] [835] L842-->L842-2: Formula: (let ((.cse2 (= 0 (mod ~a$w_buff1_used~0_In2040046241 256))) (.cse3 (= 0 (mod ~a$r_buff1_thd0~0_In2040046241 256))) (.cse0 (= (mod ~a$r_buff0_thd0~0_In2040046241 256) 0)) (.cse1 (= (mod ~a$w_buff0_used~0_In2040046241 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite50_Out2040046241|)) (and (= ~a$w_buff1_used~0_In2040046241 |ULTIMATE.start_main_#t~ite50_Out2040046241|) (or .cse2 .cse3) (or .cse0 .cse1)))) InVars {~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In2040046241, ~a$w_buff0_used~0=~a$w_buff0_used~0_In2040046241, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In2040046241, ~a$w_buff1_used~0=~a$w_buff1_used~0_In2040046241} OutVars{ULTIMATE.start_main_#t~ite50=|ULTIMATE.start_main_#t~ite50_Out2040046241|, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In2040046241, ~a$w_buff0_used~0=~a$w_buff0_used~0_In2040046241, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In2040046241, ~a$w_buff1_used~0=~a$w_buff1_used~0_In2040046241} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite50] because there is no mapped edge [2019-12-27 06:30:48,569 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [827] [827] L843-->L843-2: Formula: (let ((.cse0 (= (mod ~a$w_buff0_used~0_In244828431 256) 0)) (.cse1 (= 0 (mod ~a$r_buff0_thd0~0_In244828431 256)))) (or (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite51_Out244828431| 0)) (and (= |ULTIMATE.start_main_#t~ite51_Out244828431| ~a$r_buff0_thd0~0_In244828431) (or .cse0 .cse1)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In244828431, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In244828431} OutVars{ULTIMATE.start_main_#t~ite51=|ULTIMATE.start_main_#t~ite51_Out244828431|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In244828431, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In244828431} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite51] because there is no mapped edge [2019-12-27 06:30:48,569 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [834] [834] L844-->L844-2: Formula: (let ((.cse0 (= (mod ~a$r_buff0_thd0~0_In-131788477 256) 0)) (.cse1 (= 0 (mod ~a$w_buff0_used~0_In-131788477 256))) (.cse2 (= 0 (mod ~a$r_buff1_thd0~0_In-131788477 256))) (.cse3 (= (mod ~a$w_buff1_used~0_In-131788477 256) 0))) (or (and (= ~a$r_buff1_thd0~0_In-131788477 |ULTIMATE.start_main_#t~ite52_Out-131788477|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite52_Out-131788477|)))) InVars {~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In-131788477, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-131788477, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-131788477, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-131788477} OutVars{ULTIMATE.start_main_#t~ite52=|ULTIMATE.start_main_#t~ite52_Out-131788477|, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In-131788477, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-131788477, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-131788477, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-131788477} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52] because there is no mapped edge [2019-12-27 06:30:48,569 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [883] [883] L844-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_~__unbuffered_p2_EAX~0_8 1) (= v_~main$tmp_guard1~0_10 0) (= 2 v_~y~0_8) (= v_~__unbuffered_p2_EBX~0_9 0) (= v_ULTIMATE.start___VERIFIER_assert_~expression_15 0) (= |v_ULTIMATE.start_main_#t~ite52_12| v_~a$r_buff1_thd0~0_20) (= 0 v_~__unbuffered_p0_EAX~0_10) (= v_ULTIMATE.start___VERIFIER_assert_~expression_15 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_10|)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_10, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_12|, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_9, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_8, ~y~0=v_~y~0_8} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_10, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_11|, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_15, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_9, ~a$r_buff1_thd0~0=v_~a$r_buff1_thd0~0_20, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_10, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_8, ~y~0=v_~y~0_8, 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, ~a$r_buff1_thd0~0, ~main$tmp_guard1~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-27 06:30:48,666 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 06:30:48 BasicIcfg [2019-12-27 06:30:48,666 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 06:30:48,668 INFO L168 Benchmark]: Toolchain (without parser) took 89235.27 ms. Allocated memory was 146.3 MB in the beginning and 3.1 GB in the end (delta: 3.0 GB). Free memory was 103.1 MB in the beginning and 1.9 GB in the end (delta: -1.8 GB). Peak memory consumption was 1.2 GB. Max. memory is 7.1 GB. [2019-12-27 06:30:48,668 INFO L168 Benchmark]: CDTParser took 0.42 ms. Allocated memory is still 146.3 MB. Free memory was 122.6 MB in the beginning and 122.4 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. [2019-12-27 06:30:48,669 INFO L168 Benchmark]: CACSL2BoogieTranslator took 781.07 ms. Allocated memory was 146.3 MB in the beginning and 204.5 MB in the end (delta: 58.2 MB). Free memory was 102.6 MB in the beginning and 158.0 MB in the end (delta: -55.3 MB). Peak memory consumption was 22.2 MB. Max. memory is 7.1 GB. [2019-12-27 06:30:48,669 INFO L168 Benchmark]: Boogie Procedure Inliner took 70.19 ms. Allocated memory is still 204.5 MB. Free memory was 158.0 MB in the beginning and 155.4 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-12-27 06:30:48,670 INFO L168 Benchmark]: Boogie Preprocessor took 40.54 ms. Allocated memory is still 204.5 MB. Free memory was 155.4 MB in the beginning and 152.7 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-27 06:30:48,670 INFO L168 Benchmark]: RCFGBuilder took 865.85 ms. Allocated memory is still 204.5 MB. Free memory was 152.7 MB in the beginning and 102.7 MB in the end (delta: 50.0 MB). Peak memory consumption was 50.0 MB. Max. memory is 7.1 GB. [2019-12-27 06:30:48,671 INFO L168 Benchmark]: TraceAbstraction took 87472.11 ms. Allocated memory was 204.5 MB in the beginning and 3.1 GB in the end (delta: 2.9 GB). Free memory was 102.0 MB in the beginning and 1.9 GB in the end (delta: -1.8 GB). Peak memory consumption was 1.1 GB. Max. memory is 7.1 GB. [2019-12-27 06:30:48,673 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.42 ms. Allocated memory is still 146.3 MB. Free memory was 122.6 MB in the beginning and 122.4 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 781.07 ms. Allocated memory was 146.3 MB in the beginning and 204.5 MB in the end (delta: 58.2 MB). Free memory was 102.6 MB in the beginning and 158.0 MB in the end (delta: -55.3 MB). Peak memory consumption was 22.2 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 70.19 ms. Allocated memory is still 204.5 MB. Free memory was 158.0 MB in the beginning and 155.4 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 40.54 ms. Allocated memory is still 204.5 MB. Free memory was 155.4 MB in the beginning and 152.7 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 865.85 ms. Allocated memory is still 204.5 MB. Free memory was 152.7 MB in the beginning and 102.7 MB in the end (delta: 50.0 MB). Peak memory consumption was 50.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 87472.11 ms. Allocated memory was 204.5 MB in the beginning and 3.1 GB in the end (delta: 2.9 GB). Free memory was 102.0 MB in the beginning and 1.9 GB in the end (delta: -1.8 GB). Peak memory consumption was 1.1 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 4.0s, 177 ProgramPointsBefore, 93 ProgramPointsAfterwards, 214 TransitionsBefore, 102 TransitionsAfterwards, 19004 CoEnabledTransitionPairs, 7 FixpointIterations, 34 TrivialSequentialCompositions, 48 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 32 ConcurrentYvCompositions, 32 ChoiceCompositions, 7189 VarBasedMoverChecksPositive, 222 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 80962 CheckedPairsTotal, 114 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L830] FCALL, FORK 0 pthread_create(&t1105, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L733] 1 a$w_buff1 = a$w_buff0 [L734] 1 a$w_buff0 = 1 [L735] 1 a$w_buff1_used = a$w_buff0_used [L736] 1 a$w_buff0_used = (_Bool)1 [L832] FCALL, FORK 0 pthread_create(&t1106, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L834] FCALL, FORK 0 pthread_create(&t1107, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L762] 2 x = 1 [L765] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=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=1, y=1, z=0] [L768] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=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=1, y=1, z=0] [L782] 3 y = 2 [L785] 3 z = 1 [L788] 3 __unbuffered_p2_EAX = z [L791] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L792] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L793] 3 a$flush_delayed = weak$$choice2 [L794] 3 a$mem_tmp = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=1, y=2, z=1] [L795] EXPR 3 !a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff1) VAL [!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=1, y=2, z=1] [L768] 2 a = a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) [L795] 3 a = !a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff1) [L796] 3 a$w_buff0 = weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff0)) [L769] 2 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L797] 3 a$w_buff1 = weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff1 : a$w_buff1)) [L798] 3 a$w_buff0_used = weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used)) [L799] EXPR 3 weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))=0, x=1, y=2, z=1] [L799] 3 a$w_buff1_used = weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L770] 2 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used [L771] 2 a$r_buff0_thd2 = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L748] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=1, y=2, z=1] [L801] EXPR 3 weak$$choice2 ? a$r_buff1_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff1_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, weak$$choice2 ? a$r_buff1_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff1_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))=0, x=1, y=2, z=1] [L801] 3 a$r_buff1_thd3 = weak$$choice2 ? a$r_buff1_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff1_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L802] 3 __unbuffered_p2_EBX = a VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=1, y=2, z=1] [L748] 1 a = a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) [L807] 3 a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=1, y=2, z=1] [L749] 1 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L750] 1 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$w_buff1_used [L808] 3 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used [L809] 3 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$w_buff1_used [L810] 3 a$r_buff0_thd3 = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3 [L840] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=1, y=2, z=1] [L840] 0 a = a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L841] 0 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L842] 0 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$w_buff1_used [L843] 0 a$r_buff0_thd0 = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 168 locations, 2 error locations. Result: UNSAFE, OverallTime: 87.1s, OverallIterations: 30, TraceHistogramMax: 1, AutomataDifference: 27.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 6345 SDtfs, 9796 SDslu, 16016 SDs, 0 SdLazy, 9122 SolverSat, 519 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 8.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 331 GetRequests, 46 SyntacticMatches, 14 SemanticMatches, 271 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1095 ImplicationChecksByTransitivity, 3.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=141665occurred 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: 35.7s AutomataMinimizationTime, 29 MinimizatonAttempts, 266770 StatesRemovedByMinimization, 27 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 1.8s InterpolantComputationTime, 1274 NumberOfCodeBlocks, 1274 NumberOfCodeBlocksAsserted, 30 NumberOfCheckSat, 1178 ConstructedInterpolants, 0 QuantifiedInterpolants, 199591 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 29 InterpolantComputations, 29 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...