/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/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix032_power.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-fae578e [2019-12-18 13:15:28,957 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-18 13:15:28,960 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-18 13:15:28,976 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-18 13:15:28,976 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-18 13:15:28,977 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-18 13:15:28,979 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-18 13:15:28,981 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-18 13:15:28,982 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-18 13:15:28,983 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-18 13:15:28,984 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-18 13:15:28,985 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-18 13:15:28,986 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-18 13:15:28,987 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-18 13:15:28,989 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-18 13:15:28,990 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-18 13:15:28,992 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-18 13:15:28,993 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-18 13:15:28,997 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-18 13:15:29,003 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-18 13:15:29,004 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-18 13:15:29,009 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-18 13:15:29,011 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-18 13:15:29,012 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-18 13:15:29,014 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-18 13:15:29,014 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-18 13:15:29,014 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-18 13:15:29,015 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-18 13:15:29,015 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-18 13:15:29,018 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-18 13:15:29,019 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-18 13:15:29,021 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-18 13:15:29,021 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-18 13:15:29,022 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-18 13:15:29,023 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-18 13:15:29,023 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-18 13:15:29,024 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-18 13:15:29,024 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-18 13:15:29,025 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-18 13:15:29,025 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-18 13:15:29,026 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-18 13:15:29,027 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-18 13:15:29,045 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-18 13:15:29,046 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-18 13:15:29,047 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-18 13:15:29,048 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-18 13:15:29,048 INFO L138 SettingsManager]: * Use SBE=true [2019-12-18 13:15:29,048 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-18 13:15:29,048 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-18 13:15:29,048 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-18 13:15:29,049 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-18 13:15:29,049 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-18 13:15:29,050 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-18 13:15:29,050 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-18 13:15:29,050 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-18 13:15:29,051 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-18 13:15:29,051 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-18 13:15:29,051 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-18 13:15:29,051 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-18 13:15:29,052 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-18 13:15:29,052 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-18 13:15:29,052 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-18 13:15:29,053 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-18 13:15:29,053 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 13:15:29,053 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-18 13:15:29,053 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-18 13:15:29,053 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-18 13:15:29,054 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-18 13:15:29,054 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-18 13:15:29,054 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-18 13:15:29,054 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-18 13:15:29,054 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-18 13:15:29,360 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-18 13:15:29,380 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-18 13:15:29,386 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-18 13:15:29,387 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-18 13:15:29,388 INFO L275 PluginConnector]: CDTParser initialized [2019-12-18 13:15:29,389 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix032_power.oepc.i [2019-12-18 13:15:29,461 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/46d0c5540/bd59c9df8efa410db48d5cf3a1910409/FLAG8d15c2b94 [2019-12-18 13:15:30,066 INFO L306 CDTParser]: Found 1 translation units. [2019-12-18 13:15:30,067 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix032_power.oepc.i [2019-12-18 13:15:30,085 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/46d0c5540/bd59c9df8efa410db48d5cf3a1910409/FLAG8d15c2b94 [2019-12-18 13:15:30,365 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/46d0c5540/bd59c9df8efa410db48d5cf3a1910409 [2019-12-18 13:15:30,375 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-18 13:15:30,377 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-18 13:15:30,381 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-18 13:15:30,382 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-18 13:15:30,386 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-18 13:15:30,387 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 01:15:30" (1/1) ... [2019-12-18 13:15:30,390 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@12c3071f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:15:30, skipping insertion in model container [2019-12-18 13:15:30,390 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 01:15:30" (1/1) ... [2019-12-18 13:15:30,399 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-18 13:15:30,468 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-18 13:15:30,985 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 13:15:31,001 INFO L203 MainTranslator]: Completed pre-run [2019-12-18 13:15:31,095 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 13:15:31,172 INFO L208 MainTranslator]: Completed translation [2019-12-18 13:15:31,172 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:15:31 WrapperNode [2019-12-18 13:15:31,172 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-18 13:15:31,173 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-18 13:15:31,173 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-18 13:15:31,174 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-18 13:15:31,183 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:15:31" (1/1) ... [2019-12-18 13:15:31,205 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:15:31" (1/1) ... [2019-12-18 13:15:31,236 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-18 13:15:31,237 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-18 13:15:31,237 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-18 13:15:31,237 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-18 13:15:31,246 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:15:31" (1/1) ... [2019-12-18 13:15:31,246 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:15:31" (1/1) ... [2019-12-18 13:15:31,252 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:15:31" (1/1) ... [2019-12-18 13:15:31,252 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:15:31" (1/1) ... [2019-12-18 13:15:31,263 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:15:31" (1/1) ... [2019-12-18 13:15:31,271 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:15:31" (1/1) ... [2019-12-18 13:15:31,275 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:15:31" (1/1) ... [2019-12-18 13:15:31,280 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-18 13:15:31,281 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-18 13:15:31,281 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-18 13:15:31,281 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-18 13:15:31,282 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:15:31" (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-18 13:15:31,365 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-18 13:15:31,366 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-18 13:15:31,366 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-18 13:15:31,366 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-18 13:15:31,366 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-18 13:15:31,367 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-18 13:15:31,367 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-18 13:15:31,368 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-18 13:15:31,368 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-18 13:15:31,369 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-18 13:15:31,369 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-18 13:15:31,369 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-18 13:15:31,369 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-18 13:15:31,371 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-18 13:15:32,146 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-18 13:15:32,147 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-18 13:15:32,148 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 01:15:32 BoogieIcfgContainer [2019-12-18 13:15:32,149 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-18 13:15:32,150 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-18 13:15:32,150 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-18 13:15:32,153 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-18 13:15:32,153 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 01:15:30" (1/3) ... [2019-12-18 13:15:32,154 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@730f6f48 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 01:15:32, skipping insertion in model container [2019-12-18 13:15:32,155 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:15:31" (2/3) ... [2019-12-18 13:15:32,155 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@730f6f48 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 01:15:32, skipping insertion in model container [2019-12-18 13:15:32,155 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 01:15:32" (3/3) ... [2019-12-18 13:15:32,157 INFO L109 eAbstractionObserver]: Analyzing ICFG mix032_power.oepc.i [2019-12-18 13:15:32,168 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-18 13:15:32,168 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-18 13:15:32,176 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-18 13:15:32,177 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-18 13:15:32,222 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:32,223 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:32,223 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:32,223 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:32,223 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:32,224 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:32,224 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:32,224 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:32,225 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:32,225 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:32,226 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:32,244 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:32,245 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:32,245 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:32,246 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:32,246 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:32,246 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:32,247 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:32,247 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:32,247 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:32,247 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:32,247 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:32,248 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:32,248 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:32,248 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:32,249 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:32,251 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:32,252 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:32,253 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:32,254 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:32,254 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:32,254 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:32,254 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:32,254 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:32,256 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:32,256 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:32,257 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:32,257 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:32,258 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:32,259 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:32,259 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:32,259 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:32,259 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:32,259 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:32,260 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:32,260 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:32,260 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:32,261 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:32,261 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:32,261 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:32,261 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:32,261 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:32,262 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:32,262 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:32,262 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:32,262 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:32,262 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:32,263 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:32,263 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:32,264 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:32,264 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:32,264 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:32,265 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:32,265 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:32,272 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:32,272 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:32,273 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:32,273 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:32,273 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:32,273 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:32,273 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:32,273 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:32,274 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:32,274 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:32,274 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:32,274 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:32,274 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:32,275 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:32,275 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:32,275 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:32,276 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:32,276 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:32,277 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:32,277 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:32,277 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:32,278 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:32,279 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:32,279 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:32,279 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:32,279 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:32,280 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:32,280 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:32,280 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:32,280 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:32,280 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:32,281 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:32,281 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:32,281 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:32,281 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:32,281 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:32,282 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:32,282 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:32,286 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:32,287 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:32,287 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:32,287 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:32,296 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:32,296 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:32,296 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:32,297 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:32,298 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:32,298 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:32,298 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:32,298 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:32,298 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:32,299 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:32,299 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:32,299 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:32,299 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:32,299 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:32,301 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:32,302 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:32,302 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:32,302 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:32,303 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:32,303 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:32,304 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:32,304 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:32,304 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:32,304 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:32,305 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:32,305 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:32,305 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:32,305 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:32,305 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:32,306 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:32,306 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:32,306 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:32,306 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:32,306 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:32,306 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:32,307 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:32,307 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:32,307 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:32,307 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:32,307 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:32,308 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:32,308 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:32,308 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:32,308 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:32,308 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:32,309 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:32,309 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:32,309 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:32,309 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:32,309 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:32,310 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:32,310 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:32,310 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:32,310 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:32,310 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:32,311 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:32,311 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:32,311 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:32,311 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:32,311 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:32,312 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:32,312 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:32,312 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:32,312 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:32,312 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:32,312 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:32,313 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:32,313 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:32,313 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:32,313 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:32,313 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:32,314 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:32,316 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:32,317 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:32,317 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:32,317 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:32,323 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:32,324 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:32,324 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:32,324 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:32,324 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:32,324 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:32,325 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:32,325 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:32,325 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:32,326 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:32,328 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:32,329 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:32,329 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:32,329 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:32,329 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:32,330 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:32,330 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:32,330 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:32,330 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:32,330 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:32,330 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:32,331 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:32,331 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:32,331 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:32,331 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:32,331 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:32,331 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:32,332 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:32,332 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:32,332 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:32,332 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:32,333 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:32,333 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:32,333 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:32,334 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:32,334 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:32,334 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:32,341 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:32,341 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:32,341 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:32,341 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:32,342 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:32,342 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:32,347 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:32,347 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:32,347 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:32,348 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:32,349 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:32,349 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:32,349 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:32,350 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:32,354 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:32,354 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:32,354 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:32,354 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:32,375 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-18 13:15:32,396 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-18 13:15:32,396 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-18 13:15:32,396 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-18 13:15:32,396 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-18 13:15:32,396 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-18 13:15:32,396 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-18 13:15:32,396 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-18 13:15:32,397 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-18 13:15:32,413 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 180 places, 217 transitions [2019-12-18 13:15:32,415 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 180 places, 217 transitions [2019-12-18 13:15:32,509 INFO L126 PetriNetUnfolder]: 47/214 cut-off events. [2019-12-18 13:15:32,509 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 13:15:32,530 INFO L76 FinitePrefix]: Finished finitePrefix Result has 224 conditions, 214 events. 47/214 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 436 event pairs. 9/174 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-18 13:15:32,560 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 180 places, 217 transitions [2019-12-18 13:15:32,607 INFO L126 PetriNetUnfolder]: 47/214 cut-off events. [2019-12-18 13:15:32,607 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 13:15:32,615 INFO L76 FinitePrefix]: Finished finitePrefix Result has 224 conditions, 214 events. 47/214 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 436 event pairs. 9/174 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-18 13:15:32,638 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 19004 [2019-12-18 13:15:32,639 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-18 13:15:37,508 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 38 [2019-12-18 13:15:38,352 WARN L192 SmtUtils]: Spent 300.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 97 [2019-12-18 13:15:38,494 WARN L192 SmtUtils]: Spent 138.00 ms on a formula simplification that was a NOOP. DAG size: 95 [2019-12-18 13:15:38,541 INFO L206 etLargeBlockEncoding]: Checked pairs total: 83556 [2019-12-18 13:15:38,542 INFO L214 etLargeBlockEncoding]: Total number of compositions: 115 [2019-12-18 13:15:38,544 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 96 places, 105 transitions [2019-12-18 13:16:01,225 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 129602 states. [2019-12-18 13:16:01,227 INFO L276 IsEmpty]: Start isEmpty. Operand 129602 states. [2019-12-18 13:16:01,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-18 13:16:01,232 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:16:01,233 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-18 13:16:01,234 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-18 13:16:01,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:16:01,239 INFO L82 PathProgramCache]: Analyzing trace with hash 923865, now seen corresponding path program 1 times [2019-12-18 13:16:01,246 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:16:01,247 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1369036541] [2019-12-18 13:16:01,247 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:16:01,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:16:01,439 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-18 13:16:01,440 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1369036541] [2019-12-18 13:16:01,441 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:16:01,441 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 13:16:01,442 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [742403204] [2019-12-18 13:16:01,450 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 13:16:01,450 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:16:01,465 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 13:16:01,466 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 13:16:01,469 INFO L87 Difference]: Start difference. First operand 129602 states. Second operand 3 states. [2019-12-18 13:16:03,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:16:03,714 INFO L93 Difference]: Finished difference Result 128376 states and 546782 transitions. [2019-12-18 13:16:03,714 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 13:16:03,716 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-18 13:16:03,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:16:07,723 INFO L225 Difference]: With dead ends: 128376 [2019-12-18 13:16:07,723 INFO L226 Difference]: Without dead ends: 120914 [2019-12-18 13:16:07,725 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-18 13:16:13,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120914 states. [2019-12-18 13:16:15,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120914 to 120914. [2019-12-18 13:16:15,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120914 states. [2019-12-18 13:16:20,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120914 states to 120914 states and 514358 transitions. [2019-12-18 13:16:20,973 INFO L78 Accepts]: Start accepts. Automaton has 120914 states and 514358 transitions. Word has length 3 [2019-12-18 13:16:20,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:16:20,973 INFO L462 AbstractCegarLoop]: Abstraction has 120914 states and 514358 transitions. [2019-12-18 13:16:20,973 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 13:16:20,973 INFO L276 IsEmpty]: Start isEmpty. Operand 120914 states and 514358 transitions. [2019-12-18 13:16:20,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-18 13:16:20,978 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:16:20,978 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:16:20,978 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-18 13:16:20,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:16:20,979 INFO L82 PathProgramCache]: Analyzing trace with hash 2102120012, now seen corresponding path program 1 times [2019-12-18 13:16:20,979 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:16:20,980 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [964020915] [2019-12-18 13:16:20,980 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:16:21,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:16:21,115 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-18 13:16:21,116 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [964020915] [2019-12-18 13:16:21,117 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:16:21,117 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 13:16:21,117 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [741485032] [2019-12-18 13:16:21,119 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 13:16:21,119 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:16:21,119 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 13:16:21,119 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 13:16:21,120 INFO L87 Difference]: Start difference. First operand 120914 states and 514358 transitions. Second operand 4 states. [2019-12-18 13:16:22,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:16:22,561 INFO L93 Difference]: Finished difference Result 187704 states and 768206 transitions. [2019-12-18 13:16:22,562 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 13:16:22,562 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-18 13:16:22,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:16:28,924 INFO L225 Difference]: With dead ends: 187704 [2019-12-18 13:16:28,924 INFO L226 Difference]: Without dead ends: 187655 [2019-12-18 13:16:28,925 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-18 13:16:34,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187655 states. [2019-12-18 13:16:38,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187655 to 171775. [2019-12-18 13:16:38,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171775 states. [2019-12-18 13:16:45,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171775 states to 171775 states and 711726 transitions. [2019-12-18 13:16:45,500 INFO L78 Accepts]: Start accepts. Automaton has 171775 states and 711726 transitions. Word has length 11 [2019-12-18 13:16:45,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:16:45,500 INFO L462 AbstractCegarLoop]: Abstraction has 171775 states and 711726 transitions. [2019-12-18 13:16:45,501 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 13:16:45,501 INFO L276 IsEmpty]: Start isEmpty. Operand 171775 states and 711726 transitions. [2019-12-18 13:16:45,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-18 13:16:45,506 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:16:45,507 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:16:45,507 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-18 13:16:45,507 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:16:45,507 INFO L82 PathProgramCache]: Analyzing trace with hash -1617299066, now seen corresponding path program 1 times [2019-12-18 13:16:45,508 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:16:45,508 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1466846910] [2019-12-18 13:16:45,508 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:16:45,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:16:45,555 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-18 13:16:45,556 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1466846910] [2019-12-18 13:16:45,556 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:16:45,556 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 13:16:45,556 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [950016493] [2019-12-18 13:16:45,556 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 13:16:45,557 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:16:45,558 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 13:16:45,558 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 13:16:45,558 INFO L87 Difference]: Start difference. First operand 171775 states and 711726 transitions. Second operand 3 states. [2019-12-18 13:16:45,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:16:45,729 INFO L93 Difference]: Finished difference Result 36261 states and 117727 transitions. [2019-12-18 13:16:45,729 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 13:16:45,729 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-18 13:16:45,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:16:45,847 INFO L225 Difference]: With dead ends: 36261 [2019-12-18 13:16:45,848 INFO L226 Difference]: Without dead ends: 36261 [2019-12-18 13:16:45,848 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-18 13:16:46,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36261 states. [2019-12-18 13:16:46,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36261 to 36261. [2019-12-18 13:16:46,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36261 states. [2019-12-18 13:16:46,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36261 states to 36261 states and 117727 transitions. [2019-12-18 13:16:46,698 INFO L78 Accepts]: Start accepts. Automaton has 36261 states and 117727 transitions. Word has length 13 [2019-12-18 13:16:46,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:16:46,698 INFO L462 AbstractCegarLoop]: Abstraction has 36261 states and 117727 transitions. [2019-12-18 13:16:46,698 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 13:16:46,699 INFO L276 IsEmpty]: Start isEmpty. Operand 36261 states and 117727 transitions. [2019-12-18 13:16:46,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-18 13:16:46,701 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:16:46,702 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:16:46,702 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-18 13:16:46,702 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:16:46,702 INFO L82 PathProgramCache]: Analyzing trace with hash 947448332, now seen corresponding path program 1 times [2019-12-18 13:16:46,702 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:16:46,703 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [128431732] [2019-12-18 13:16:46,703 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:16:46,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:16:46,798 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:16:46,799 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [128431732] [2019-12-18 13:16:46,802 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:16:46,802 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 13:16:46,802 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2081524144] [2019-12-18 13:16:46,803 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 13:16:46,803 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:16:46,803 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 13:16:46,803 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-18 13:16:46,804 INFO L87 Difference]: Start difference. First operand 36261 states and 117727 transitions. Second operand 5 states. [2019-12-18 13:16:47,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:16:47,385 INFO L93 Difference]: Finished difference Result 50300 states and 161544 transitions. [2019-12-18 13:16:47,385 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 13:16:47,385 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2019-12-18 13:16:47,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:16:47,492 INFO L225 Difference]: With dead ends: 50300 [2019-12-18 13:16:47,492 INFO L226 Difference]: Without dead ends: 50300 [2019-12-18 13:16:47,493 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-18 13:16:48,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50300 states. [2019-12-18 13:16:49,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50300 to 43029. [2019-12-18 13:16:49,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43029 states. [2019-12-18 13:16:49,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43029 states to 43029 states and 139308 transitions. [2019-12-18 13:16:49,534 INFO L78 Accepts]: Start accepts. Automaton has 43029 states and 139308 transitions. Word has length 16 [2019-12-18 13:16:49,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:16:49,535 INFO L462 AbstractCegarLoop]: Abstraction has 43029 states and 139308 transitions. [2019-12-18 13:16:49,535 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 13:16:49,535 INFO L276 IsEmpty]: Start isEmpty. Operand 43029 states and 139308 transitions. [2019-12-18 13:16:49,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-18 13:16:49,545 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:16:49,545 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-18 13:16:49,545 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-18 13:16:49,546 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:16:49,546 INFO L82 PathProgramCache]: Analyzing trace with hash -282717849, now seen corresponding path program 1 times [2019-12-18 13:16:49,546 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:16:49,546 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [439241914] [2019-12-18 13:16:49,547 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:16:49,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:16:49,656 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-18 13:16:49,656 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [439241914] [2019-12-18 13:16:49,656 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:16:49,657 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 13:16:49,657 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1583323315] [2019-12-18 13:16:49,657 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 13:16:49,658 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:16:49,658 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 13:16:49,658 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-18 13:16:49,658 INFO L87 Difference]: Start difference. First operand 43029 states and 139308 transitions. Second operand 6 states. [2019-12-18 13:16:50,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:16:50,575 INFO L93 Difference]: Finished difference Result 64122 states and 202692 transitions. [2019-12-18 13:16:50,575 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 13:16:50,575 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2019-12-18 13:16:50,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:16:50,706 INFO L225 Difference]: With dead ends: 64122 [2019-12-18 13:16:50,706 INFO L226 Difference]: Without dead ends: 64115 [2019-12-18 13:16:50,707 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2019-12-18 13:16:51,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64115 states. [2019-12-18 13:16:52,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64115 to 42953. [2019-12-18 13:16:52,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42953 states. [2019-12-18 13:16:52,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42953 states to 42953 states and 138310 transitions. [2019-12-18 13:16:52,287 INFO L78 Accepts]: Start accepts. Automaton has 42953 states and 138310 transitions. Word has length 22 [2019-12-18 13:16:52,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:16:52,287 INFO L462 AbstractCegarLoop]: Abstraction has 42953 states and 138310 transitions. [2019-12-18 13:16:52,287 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 13:16:52,287 INFO L276 IsEmpty]: Start isEmpty. Operand 42953 states and 138310 transitions. [2019-12-18 13:16:52,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 13:16:52,301 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:16:52,301 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-18 13:16:52,302 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-18 13:16:52,302 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:16:52,302 INFO L82 PathProgramCache]: Analyzing trace with hash -71664384, now seen corresponding path program 1 times [2019-12-18 13:16:52,302 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:16:52,303 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1175653278] [2019-12-18 13:16:52,303 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:16:52,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:16:52,366 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-18 13:16:52,366 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1175653278] [2019-12-18 13:16:52,366 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:16:52,367 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 13:16:52,367 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [59756775] [2019-12-18 13:16:52,367 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 13:16:52,367 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:16:52,368 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 13:16:52,368 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 13:16:52,368 INFO L87 Difference]: Start difference. First operand 42953 states and 138310 transitions. Second operand 4 states. [2019-12-18 13:16:52,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:16:52,431 INFO L93 Difference]: Finished difference Result 17024 states and 51836 transitions. [2019-12-18 13:16:52,431 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 13:16:52,431 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2019-12-18 13:16:52,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:16:52,454 INFO L225 Difference]: With dead ends: 17024 [2019-12-18 13:16:52,455 INFO L226 Difference]: Without dead ends: 17024 [2019-12-18 13:16:52,455 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-18 13:16:52,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17024 states. [2019-12-18 13:16:52,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17024 to 16731. [2019-12-18 13:16:52,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16731 states. [2019-12-18 13:16:52,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16731 states to 16731 states and 51000 transitions. [2019-12-18 13:16:52,721 INFO L78 Accepts]: Start accepts. Automaton has 16731 states and 51000 transitions. Word has length 25 [2019-12-18 13:16:52,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:16:52,721 INFO L462 AbstractCegarLoop]: Abstraction has 16731 states and 51000 transitions. [2019-12-18 13:16:52,721 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 13:16:52,722 INFO L276 IsEmpty]: Start isEmpty. Operand 16731 states and 51000 transitions. [2019-12-18 13:16:52,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-18 13:16:52,737 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:16:52,737 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-18 13:16:52,738 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-18 13:16:52,738 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:16:52,738 INFO L82 PathProgramCache]: Analyzing trace with hash -1418175430, now seen corresponding path program 1 times [2019-12-18 13:16:52,738 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:16:52,738 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [286697677] [2019-12-18 13:16:52,738 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:16:52,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:16:52,782 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-18 13:16:52,783 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [286697677] [2019-12-18 13:16:52,783 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:16:52,783 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 13:16:52,783 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1434145653] [2019-12-18 13:16:52,784 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 13:16:52,784 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:16:52,784 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 13:16:52,784 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 13:16:52,784 INFO L87 Difference]: Start difference. First operand 16731 states and 51000 transitions. Second operand 3 states. [2019-12-18 13:16:52,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:16:52,893 INFO L93 Difference]: Finished difference Result 24375 states and 72822 transitions. [2019-12-18 13:16:52,894 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 13:16:52,894 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-12-18 13:16:52,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:16:52,927 INFO L225 Difference]: With dead ends: 24375 [2019-12-18 13:16:52,927 INFO L226 Difference]: Without dead ends: 24375 [2019-12-18 13:16:52,927 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-18 13:16:53,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24375 states. [2019-12-18 13:16:53,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24375 to 18589. [2019-12-18 13:16:53,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18589 states. [2019-12-18 13:16:53,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18589 states to 18589 states and 56096 transitions. [2019-12-18 13:16:53,249 INFO L78 Accepts]: Start accepts. Automaton has 18589 states and 56096 transitions. Word has length 27 [2019-12-18 13:16:53,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:16:53,249 INFO L462 AbstractCegarLoop]: Abstraction has 18589 states and 56096 transitions. [2019-12-18 13:16:53,249 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 13:16:53,250 INFO L276 IsEmpty]: Start isEmpty. Operand 18589 states and 56096 transitions. [2019-12-18 13:16:53,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-18 13:16:53,262 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:16:53,262 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-18 13:16:53,262 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-18 13:16:53,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:16:53,262 INFO L82 PathProgramCache]: Analyzing trace with hash 1834697800, now seen corresponding path program 1 times [2019-12-18 13:16:53,263 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:16:53,263 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [308945614] [2019-12-18 13:16:53,263 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:16:53,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:16:53,338 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-18 13:16:53,338 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [308945614] [2019-12-18 13:16:53,338 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:16:53,339 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 13:16:53,339 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1986052487] [2019-12-18 13:16:53,339 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 13:16:53,339 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:16:53,340 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 13:16:53,340 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-18 13:16:53,340 INFO L87 Difference]: Start difference. First operand 18589 states and 56096 transitions. Second operand 6 states. [2019-12-18 13:16:53,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:16:53,969 INFO L93 Difference]: Finished difference Result 26038 states and 76681 transitions. [2019-12-18 13:16:53,970 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-18 13:16:53,970 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2019-12-18 13:16:53,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:16:54,008 INFO L225 Difference]: With dead ends: 26038 [2019-12-18 13:16:54,008 INFO L226 Difference]: Without dead ends: 26038 [2019-12-18 13:16:54,009 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-12-18 13:16:54,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26038 states. [2019-12-18 13:16:54,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26038 to 21331. [2019-12-18 13:16:54,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21331 states. [2019-12-18 13:16:54,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21331 states to 21331 states and 64000 transitions. [2019-12-18 13:16:54,801 INFO L78 Accepts]: Start accepts. Automaton has 21331 states and 64000 transitions. Word has length 27 [2019-12-18 13:16:54,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:16:54,802 INFO L462 AbstractCegarLoop]: Abstraction has 21331 states and 64000 transitions. [2019-12-18 13:16:54,802 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 13:16:54,802 INFO L276 IsEmpty]: Start isEmpty. Operand 21331 states and 64000 transitions. [2019-12-18 13:16:54,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-18 13:16:54,824 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:16:54,824 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-18 13:16:54,824 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-18 13:16:54,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:16:54,825 INFO L82 PathProgramCache]: Analyzing trace with hash -2065332723, now seen corresponding path program 1 times [2019-12-18 13:16:54,825 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:16:54,825 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1346822728] [2019-12-18 13:16:54,825 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:16:54,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:16:54,936 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-18 13:16:54,936 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1346822728] [2019-12-18 13:16:54,938 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:16:54,938 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 13:16:54,938 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2101121926] [2019-12-18 13:16:54,939 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 13:16:54,940 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:16:54,940 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 13:16:54,940 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-18 13:16:54,940 INFO L87 Difference]: Start difference. First operand 21331 states and 64000 transitions. Second operand 7 states. [2019-12-18 13:16:56,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:16:56,136 INFO L93 Difference]: Finished difference Result 28794 states and 84449 transitions. [2019-12-18 13:16:56,136 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-18 13:16:56,136 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 33 [2019-12-18 13:16:56,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:16:56,178 INFO L225 Difference]: With dead ends: 28794 [2019-12-18 13:16:56,178 INFO L226 Difference]: Without dead ends: 28794 [2019-12-18 13:16:56,178 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=90, Invalid=252, Unknown=0, NotChecked=0, Total=342 [2019-12-18 13:16:56,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28794 states. [2019-12-18 13:16:56,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28794 to 19492. [2019-12-18 13:16:56,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19492 states. [2019-12-18 13:16:56,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19492 states to 19492 states and 58703 transitions. [2019-12-18 13:16:56,536 INFO L78 Accepts]: Start accepts. Automaton has 19492 states and 58703 transitions. Word has length 33 [2019-12-18 13:16:56,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:16:56,536 INFO L462 AbstractCegarLoop]: Abstraction has 19492 states and 58703 transitions. [2019-12-18 13:16:56,536 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 13:16:56,536 INFO L276 IsEmpty]: Start isEmpty. Operand 19492 states and 58703 transitions. [2019-12-18 13:16:56,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-18 13:16:56,562 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:16:56,562 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-18 13:16:56,562 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-18 13:16:56,562 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:16:56,563 INFO L82 PathProgramCache]: Analyzing trace with hash 603828080, now seen corresponding path program 1 times [2019-12-18 13:16:56,563 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:16:56,563 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1403931862] [2019-12-18 13:16:56,563 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:16:56,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:16:56,644 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-18 13:16:56,645 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1403931862] [2019-12-18 13:16:56,645 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:16:56,645 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 13:16:56,645 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2023250402] [2019-12-18 13:16:56,645 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 13:16:56,646 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:16:56,647 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 13:16:56,647 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 13:16:56,647 INFO L87 Difference]: Start difference. First operand 19492 states and 58703 transitions. Second operand 4 states. [2019-12-18 13:16:56,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:16:56,815 INFO L93 Difference]: Finished difference Result 33180 states and 100186 transitions. [2019-12-18 13:16:56,815 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 13:16:56,815 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 39 [2019-12-18 13:16:56,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:16:56,853 INFO L225 Difference]: With dead ends: 33180 [2019-12-18 13:16:56,853 INFO L226 Difference]: Without dead ends: 16657 [2019-12-18 13:16:56,854 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 13:16:57,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16657 states. [2019-12-18 13:16:57,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16657 to 16583. [2019-12-18 13:16:57,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16583 states. [2019-12-18 13:16:57,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16583 states to 16583 states and 49025 transitions. [2019-12-18 13:16:57,279 INFO L78 Accepts]: Start accepts. Automaton has 16583 states and 49025 transitions. Word has length 39 [2019-12-18 13:16:57,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:16:57,279 INFO L462 AbstractCegarLoop]: Abstraction has 16583 states and 49025 transitions. [2019-12-18 13:16:57,279 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 13:16:57,279 INFO L276 IsEmpty]: Start isEmpty. Operand 16583 states and 49025 transitions. [2019-12-18 13:16:57,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-18 13:16:57,309 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:16:57,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] [2019-12-18 13:16:57,309 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-18 13:16:57,309 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:16:57,309 INFO L82 PathProgramCache]: Analyzing trace with hash 1247651138, now seen corresponding path program 2 times [2019-12-18 13:16:57,310 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:16:57,310 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [744125026] [2019-12-18 13:16:57,310 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:16:57,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:16:57,387 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:16:57,387 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [744125026] [2019-12-18 13:16:57,388 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:16:57,388 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 13:16:57,388 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [295210765] [2019-12-18 13:16:57,389 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 13:16:57,389 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:16:57,389 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 13:16:57,389 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 13:16:57,389 INFO L87 Difference]: Start difference. First operand 16583 states and 49025 transitions. Second operand 3 states. [2019-12-18 13:16:57,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:16:57,450 INFO L93 Difference]: Finished difference Result 16582 states and 49023 transitions. [2019-12-18 13:16:57,450 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 13:16:57,451 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2019-12-18 13:16:57,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:16:57,473 INFO L225 Difference]: With dead ends: 16582 [2019-12-18 13:16:57,473 INFO L226 Difference]: Without dead ends: 16582 [2019-12-18 13:16:57,473 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-18 13:16:57,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16582 states. [2019-12-18 13:16:58,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16582 to 16582. [2019-12-18 13:16:58,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16582 states. [2019-12-18 13:16:58,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16582 states to 16582 states and 49023 transitions. [2019-12-18 13:16:58,136 INFO L78 Accepts]: Start accepts. Automaton has 16582 states and 49023 transitions. Word has length 39 [2019-12-18 13:16:58,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:16:58,137 INFO L462 AbstractCegarLoop]: Abstraction has 16582 states and 49023 transitions. [2019-12-18 13:16:58,137 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 13:16:58,137 INFO L276 IsEmpty]: Start isEmpty. Operand 16582 states and 49023 transitions. [2019-12-18 13:16:58,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-18 13:16:58,153 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:16:58,153 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-18 13:16:58,153 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-18 13:16:58,153 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:16:58,153 INFO L82 PathProgramCache]: Analyzing trace with hash -2020108147, now seen corresponding path program 1 times [2019-12-18 13:16:58,154 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:16:58,154 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [45277540] [2019-12-18 13:16:58,154 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:16:58,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:16:58,221 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-18 13:16:58,221 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [45277540] [2019-12-18 13:16:58,221 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:16:58,221 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 13:16:58,222 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [59300285] [2019-12-18 13:16:58,222 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 13:16:58,222 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:16:58,222 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 13:16:58,223 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 13:16:58,223 INFO L87 Difference]: Start difference. First operand 16582 states and 49023 transitions. Second operand 4 states. [2019-12-18 13:16:58,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:16:58,333 INFO L93 Difference]: Finished difference Result 26060 states and 77460 transitions. [2019-12-18 13:16:58,333 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 13:16:58,333 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 40 [2019-12-18 13:16:58,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:16:58,354 INFO L225 Difference]: With dead ends: 26060 [2019-12-18 13:16:58,354 INFO L226 Difference]: Without dead ends: 11670 [2019-12-18 13:16:58,355 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-18 13:16:58,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11670 states. [2019-12-18 13:16:58,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11670 to 11605. [2019-12-18 13:16:58,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11605 states. [2019-12-18 13:16:58,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11605 states to 11605 states and 33387 transitions. [2019-12-18 13:16:58,542 INFO L78 Accepts]: Start accepts. Automaton has 11605 states and 33387 transitions. Word has length 40 [2019-12-18 13:16:58,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:16:58,543 INFO L462 AbstractCegarLoop]: Abstraction has 11605 states and 33387 transitions. [2019-12-18 13:16:58,543 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 13:16:58,543 INFO L276 IsEmpty]: Start isEmpty. Operand 11605 states and 33387 transitions. [2019-12-18 13:16:58,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-18 13:16:58,553 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:16:58,554 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-18 13:16:58,554 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-18 13:16:58,554 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:16:58,554 INFO L82 PathProgramCache]: Analyzing trace with hash -1707989501, now seen corresponding path program 2 times [2019-12-18 13:16:58,554 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:16:58,554 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [545199354] [2019-12-18 13:16:58,554 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:16:58,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:16:58,620 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-18 13:16:58,621 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [545199354] [2019-12-18 13:16:58,621 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:16:58,621 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 13:16:58,621 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1016143107] [2019-12-18 13:16:58,622 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 13:16:58,622 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:16:58,622 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 13:16:58,622 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-18 13:16:58,622 INFO L87 Difference]: Start difference. First operand 11605 states and 33387 transitions. Second operand 5 states. [2019-12-18 13:16:58,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:16:58,676 INFO L93 Difference]: Finished difference Result 10656 states and 31273 transitions. [2019-12-18 13:16:58,677 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 13:16:58,677 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 40 [2019-12-18 13:16:58,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:16:58,689 INFO L225 Difference]: With dead ends: 10656 [2019-12-18 13:16:58,690 INFO L226 Difference]: Without dead ends: 7573 [2019-12-18 13:16:58,690 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-18 13:16:58,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7573 states. [2019-12-18 13:16:58,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7573 to 7573. [2019-12-18 13:16:58,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7573 states. [2019-12-18 13:16:58,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7573 states to 7573 states and 24358 transitions. [2019-12-18 13:16:58,823 INFO L78 Accepts]: Start accepts. Automaton has 7573 states and 24358 transitions. Word has length 40 [2019-12-18 13:16:58,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:16:58,823 INFO L462 AbstractCegarLoop]: Abstraction has 7573 states and 24358 transitions. [2019-12-18 13:16:58,824 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 13:16:58,824 INFO L276 IsEmpty]: Start isEmpty. Operand 7573 states and 24358 transitions. [2019-12-18 13:16:58,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-18 13:16:58,833 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:16:58,833 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-18 13:16:58,833 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-18 13:16:58,833 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:16:58,834 INFO L82 PathProgramCache]: Analyzing trace with hash -1827713058, now seen corresponding path program 1 times [2019-12-18 13:16:58,834 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:16:58,834 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1603244924] [2019-12-18 13:16:58,834 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:16:58,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:16:58,897 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:16:58,898 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1603244924] [2019-12-18 13:16:58,898 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:16:58,898 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 13:16:58,898 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1436305941] [2019-12-18 13:16:58,898 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 13:16:58,899 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:16:58,899 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 13:16:58,899 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 13:16:58,899 INFO L87 Difference]: Start difference. First operand 7573 states and 24358 transitions. Second operand 3 states. [2019-12-18 13:16:58,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:16:58,960 INFO L93 Difference]: Finished difference Result 10082 states and 31704 transitions. [2019-12-18 13:16:58,961 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 13:16:58,961 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 64 [2019-12-18 13:16:58,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:16:58,974 INFO L225 Difference]: With dead ends: 10082 [2019-12-18 13:16:58,974 INFO L226 Difference]: Without dead ends: 10082 [2019-12-18 13:16:58,975 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-18 13:16:59,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10082 states. [2019-12-18 13:16:59,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10082 to 7729. [2019-12-18 13:16:59,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7729 states. [2019-12-18 13:16:59,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7729 states to 7729 states and 24514 transitions. [2019-12-18 13:16:59,138 INFO L78 Accepts]: Start accepts. Automaton has 7729 states and 24514 transitions. Word has length 64 [2019-12-18 13:16:59,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:16:59,139 INFO L462 AbstractCegarLoop]: Abstraction has 7729 states and 24514 transitions. [2019-12-18 13:16:59,139 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 13:16:59,139 INFO L276 IsEmpty]: Start isEmpty. Operand 7729 states and 24514 transitions. [2019-12-18 13:16:59,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-18 13:16:59,149 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:16:59,149 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-18 13:16:59,149 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-18 13:16:59,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:16:59,150 INFO L82 PathProgramCache]: Analyzing trace with hash 572197328, now seen corresponding path program 1 times [2019-12-18 13:16:59,150 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:16:59,150 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [531462928] [2019-12-18 13:16:59,150 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:16:59,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:16:59,261 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-18 13:16:59,262 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [531462928] [2019-12-18 13:16:59,262 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:16:59,262 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 13:16:59,262 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [647431028] [2019-12-18 13:16:59,263 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 13:16:59,263 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:16:59,263 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 13:16:59,263 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-18 13:16:59,263 INFO L87 Difference]: Start difference. First operand 7729 states and 24514 transitions. Second operand 7 states. [2019-12-18 13:16:59,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:16:59,543 INFO L93 Difference]: Finished difference Result 15437 states and 48014 transitions. [2019-12-18 13:16:59,543 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-18 13:16:59,544 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 64 [2019-12-18 13:16:59,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:16:59,564 INFO L225 Difference]: With dead ends: 15437 [2019-12-18 13:16:59,564 INFO L226 Difference]: Without dead ends: 11573 [2019-12-18 13:16:59,565 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 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-18 13:16:59,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11573 states. [2019-12-18 13:16:59,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11573 to 9445. [2019-12-18 13:16:59,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9445 states. [2019-12-18 13:16:59,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9445 states to 9445 states and 29808 transitions. [2019-12-18 13:16:59,748 INFO L78 Accepts]: Start accepts. Automaton has 9445 states and 29808 transitions. Word has length 64 [2019-12-18 13:16:59,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:16:59,748 INFO L462 AbstractCegarLoop]: Abstraction has 9445 states and 29808 transitions. [2019-12-18 13:16:59,748 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 13:16:59,748 INFO L276 IsEmpty]: Start isEmpty. Operand 9445 states and 29808 transitions. [2019-12-18 13:16:59,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-18 13:16:59,761 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:16:59,761 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-18 13:16:59,761 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-18 13:16:59,762 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:16:59,762 INFO L82 PathProgramCache]: Analyzing trace with hash -22937850, now seen corresponding path program 2 times [2019-12-18 13:16:59,762 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:16:59,762 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1216340467] [2019-12-18 13:16:59,762 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:16:59,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:16:59,856 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-18 13:16:59,856 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1216340467] [2019-12-18 13:16:59,856 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:16:59,856 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 13:16:59,857 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [676391324] [2019-12-18 13:16:59,857 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 13:16:59,857 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:16:59,857 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 13:16:59,858 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-18 13:16:59,858 INFO L87 Difference]: Start difference. First operand 9445 states and 29808 transitions. Second operand 7 states. [2019-12-18 13:17:00,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:17:00,149 INFO L93 Difference]: Finished difference Result 17385 states and 53705 transitions. [2019-12-18 13:17:00,149 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-18 13:17:00,150 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 64 [2019-12-18 13:17:00,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:17:00,170 INFO L225 Difference]: With dead ends: 17385 [2019-12-18 13:17:00,170 INFO L226 Difference]: Without dead ends: 13105 [2019-12-18 13:17:00,171 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 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-18 13:17:00,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13105 states. [2019-12-18 13:17:00,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13105 to 10746. [2019-12-18 13:17:00,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10746 states. [2019-12-18 13:17:00,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10746 states to 10746 states and 33681 transitions. [2019-12-18 13:17:00,371 INFO L78 Accepts]: Start accepts. Automaton has 10746 states and 33681 transitions. Word has length 64 [2019-12-18 13:17:00,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:17:00,371 INFO L462 AbstractCegarLoop]: Abstraction has 10746 states and 33681 transitions. [2019-12-18 13:17:00,371 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 13:17:00,371 INFO L276 IsEmpty]: Start isEmpty. Operand 10746 states and 33681 transitions. [2019-12-18 13:17:00,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-18 13:17:00,383 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:17:00,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-18 13:17:00,383 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-18 13:17:00,383 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:17:00,384 INFO L82 PathProgramCache]: Analyzing trace with hash -1388618928, now seen corresponding path program 3 times [2019-12-18 13:17:00,384 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:17:00,384 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [693285128] [2019-12-18 13:17:00,384 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:17:00,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:17:00,499 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-18 13:17:00,500 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [693285128] [2019-12-18 13:17:00,500 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:17:00,500 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 13:17:00,501 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1169805463] [2019-12-18 13:17:00,502 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 13:17:00,502 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:17:00,502 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 13:17:00,502 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-18 13:17:00,502 INFO L87 Difference]: Start difference. First operand 10746 states and 33681 transitions. Second operand 9 states. [2019-12-18 13:17:01,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:17:01,960 INFO L93 Difference]: Finished difference Result 24832 states and 76056 transitions. [2019-12-18 13:17:01,960 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-12-18 13:17:01,960 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 64 [2019-12-18 13:17:01,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:17:01,992 INFO L225 Difference]: With dead ends: 24832 [2019-12-18 13:17:01,992 INFO L226 Difference]: Without dead ends: 22344 [2019-12-18 13:17:01,993 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 156 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=163, Invalid=539, Unknown=0, NotChecked=0, Total=702 [2019-12-18 13:17:02,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22344 states. [2019-12-18 13:17:02,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22344 to 10578. [2019-12-18 13:17:02,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10578 states. [2019-12-18 13:17:02,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10578 states to 10578 states and 33121 transitions. [2019-12-18 13:17:02,252 INFO L78 Accepts]: Start accepts. Automaton has 10578 states and 33121 transitions. Word has length 64 [2019-12-18 13:17:02,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:17:02,252 INFO L462 AbstractCegarLoop]: Abstraction has 10578 states and 33121 transitions. [2019-12-18 13:17:02,252 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 13:17:02,252 INFO L276 IsEmpty]: Start isEmpty. Operand 10578 states and 33121 transitions. [2019-12-18 13:17:02,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-18 13:17:02,264 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:17:02,264 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-18 13:17:02,264 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-18 13:17:02,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:17:02,265 INFO L82 PathProgramCache]: Analyzing trace with hash -1527941036, now seen corresponding path program 4 times [2019-12-18 13:17:02,265 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:17:02,265 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1926527284] [2019-12-18 13:17:02,265 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:17:02,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:17:02,395 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-18 13:17:02,395 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1926527284] [2019-12-18 13:17:02,395 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:17:02,395 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 13:17:02,396 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1048919384] [2019-12-18 13:17:02,396 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 13:17:02,396 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:17:02,396 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 13:17:02,397 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-18 13:17:02,397 INFO L87 Difference]: Start difference. First operand 10578 states and 33121 transitions. Second operand 9 states. [2019-12-18 13:17:03,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:17:03,397 INFO L93 Difference]: Finished difference Result 28772 states and 88210 transitions. [2019-12-18 13:17:03,397 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-12-18 13:17:03,397 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 64 [2019-12-18 13:17:03,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:17:03,433 INFO L225 Difference]: With dead ends: 28772 [2019-12-18 13:17:03,433 INFO L226 Difference]: Without dead ends: 26348 [2019-12-18 13:17:03,433 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 145 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=154, Invalid=496, Unknown=0, NotChecked=0, Total=650 [2019-12-18 13:17:03,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26348 states. [2019-12-18 13:17:03,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26348 to 10606. [2019-12-18 13:17:03,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10606 states. [2019-12-18 13:17:03,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10606 states to 10606 states and 33275 transitions. [2019-12-18 13:17:03,714 INFO L78 Accepts]: Start accepts. Automaton has 10606 states and 33275 transitions. Word has length 64 [2019-12-18 13:17:03,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:17:03,715 INFO L462 AbstractCegarLoop]: Abstraction has 10606 states and 33275 transitions. [2019-12-18 13:17:03,715 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 13:17:03,715 INFO L276 IsEmpty]: Start isEmpty. Operand 10606 states and 33275 transitions. [2019-12-18 13:17:03,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-18 13:17:03,727 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:17:03,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] [2019-12-18 13:17:03,727 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-18 13:17:03,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:17:03,728 INFO L82 PathProgramCache]: Analyzing trace with hash 1911526292, now seen corresponding path program 5 times [2019-12-18 13:17:03,728 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:17:03,728 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1225863035] [2019-12-18 13:17:03,728 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:17:03,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:17:03,796 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-18 13:17:03,797 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1225863035] [2019-12-18 13:17:03,797 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:17:03,797 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 13:17:03,797 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [395528983] [2019-12-18 13:17:03,798 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 13:17:03,798 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:17:03,799 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 13:17:03,799 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 13:17:03,799 INFO L87 Difference]: Start difference. First operand 10606 states and 33275 transitions. Second operand 3 states. [2019-12-18 13:17:03,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:17:03,892 INFO L93 Difference]: Finished difference Result 12322 states and 38579 transitions. [2019-12-18 13:17:03,892 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 13:17:03,892 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 64 [2019-12-18 13:17:03,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:17:03,909 INFO L225 Difference]: With dead ends: 12322 [2019-12-18 13:17:03,909 INFO L226 Difference]: Without dead ends: 12322 [2019-12-18 13:17:03,909 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-18 13:17:03,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12322 states. [2019-12-18 13:17:04,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12322 to 11074. [2019-12-18 13:17:04,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11074 states. [2019-12-18 13:17:04,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11074 states to 11074 states and 34835 transitions. [2019-12-18 13:17:04,102 INFO L78 Accepts]: Start accepts. Automaton has 11074 states and 34835 transitions. Word has length 64 [2019-12-18 13:17:04,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:17:04,103 INFO L462 AbstractCegarLoop]: Abstraction has 11074 states and 34835 transitions. [2019-12-18 13:17:04,103 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 13:17:04,103 INFO L276 IsEmpty]: Start isEmpty. Operand 11074 states and 34835 transitions. [2019-12-18 13:17:04,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 13:17:04,115 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:17:04,115 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-18 13:17:04,115 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-18 13:17:04,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:17:04,115 INFO L82 PathProgramCache]: Analyzing trace with hash -2140458066, now seen corresponding path program 1 times [2019-12-18 13:17:04,116 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:17:04,116 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1211259881] [2019-12-18 13:17:04,116 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:17:04,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:17:04,221 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-18 13:17:04,222 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1211259881] [2019-12-18 13:17:04,222 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:17:04,222 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 13:17:04,222 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [716704062] [2019-12-18 13:17:04,223 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-18 13:17:04,223 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:17:04,223 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-18 13:17:04,223 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-12-18 13:17:04,223 INFO L87 Difference]: Start difference. First operand 11074 states and 34835 transitions. Second operand 8 states. [2019-12-18 13:17:05,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:17:05,006 INFO L93 Difference]: Finished difference Result 29477 states and 90578 transitions. [2019-12-18 13:17:05,006 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-18 13:17:05,006 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 65 [2019-12-18 13:17:05,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:17:05,057 INFO L225 Difference]: With dead ends: 29477 [2019-12-18 13:17:05,058 INFO L226 Difference]: Without dead ends: 26544 [2019-12-18 13:17:05,058 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=94, Invalid=286, Unknown=0, NotChecked=0, Total=380 [2019-12-18 13:17:05,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26544 states. [2019-12-18 13:17:05,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26544 to 11347. [2019-12-18 13:17:05,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11347 states. [2019-12-18 13:17:05,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11347 states to 11347 states and 35865 transitions. [2019-12-18 13:17:05,778 INFO L78 Accepts]: Start accepts. Automaton has 11347 states and 35865 transitions. Word has length 65 [2019-12-18 13:17:05,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:17:05,778 INFO L462 AbstractCegarLoop]: Abstraction has 11347 states and 35865 transitions. [2019-12-18 13:17:05,778 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-18 13:17:05,778 INFO L276 IsEmpty]: Start isEmpty. Operand 11347 states and 35865 transitions. [2019-12-18 13:17:05,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 13:17:05,791 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:17:05,791 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-18 13:17:05,791 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-18 13:17:05,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:17:05,792 INFO L82 PathProgramCache]: Analyzing trace with hash -281745782, now seen corresponding path program 2 times [2019-12-18 13:17:05,792 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:17:05,792 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1196163117] [2019-12-18 13:17:05,792 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:17:05,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:17:05,907 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-18 13:17:05,907 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1196163117] [2019-12-18 13:17:05,908 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:17:05,908 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 13:17:05,908 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [948419911] [2019-12-18 13:17:05,908 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 13:17:05,908 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:17:05,909 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 13:17:05,909 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-18 13:17:05,909 INFO L87 Difference]: Start difference. First operand 11347 states and 35865 transitions. Second operand 9 states. [2019-12-18 13:17:06,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:17:06,826 INFO L93 Difference]: Finished difference Result 32061 states and 97811 transitions. [2019-12-18 13:17:06,827 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-18 13:17:06,827 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 65 [2019-12-18 13:17:06,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:17:06,866 INFO L225 Difference]: With dead ends: 32061 [2019-12-18 13:17:06,866 INFO L226 Difference]: Without dead ends: 29128 [2019-12-18 13:17:06,867 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 113 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=129, Invalid=423, Unknown=0, NotChecked=0, Total=552 [2019-12-18 13:17:06,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29128 states. [2019-12-18 13:17:07,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29128 to 11355. [2019-12-18 13:17:07,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11355 states. [2019-12-18 13:17:07,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11355 states to 11355 states and 35880 transitions. [2019-12-18 13:17:07,175 INFO L78 Accepts]: Start accepts. Automaton has 11355 states and 35880 transitions. Word has length 65 [2019-12-18 13:17:07,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:17:07,175 INFO L462 AbstractCegarLoop]: Abstraction has 11355 states and 35880 transitions. [2019-12-18 13:17:07,175 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 13:17:07,175 INFO L276 IsEmpty]: Start isEmpty. Operand 11355 states and 35880 transitions. [2019-12-18 13:17:07,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 13:17:07,188 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:17:07,188 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-18 13:17:07,188 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-18 13:17:07,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:17:07,189 INFO L82 PathProgramCache]: Analyzing trace with hash -1813356122, now seen corresponding path program 3 times [2019-12-18 13:17:07,189 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:17:07,189 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2098844592] [2019-12-18 13:17:07,189 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:17:07,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:17:07,312 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-18 13:17:07,312 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2098844592] [2019-12-18 13:17:07,313 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:17:07,313 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 13:17:07,313 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [841172006] [2019-12-18 13:17:07,313 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 13:17:07,313 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:17:07,314 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 13:17:07,314 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-18 13:17:07,314 INFO L87 Difference]: Start difference. First operand 11355 states and 35880 transitions. Second operand 9 states. [2019-12-18 13:17:08,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:17:08,586 INFO L93 Difference]: Finished difference Result 33909 states and 103392 transitions. [2019-12-18 13:17:08,587 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-18 13:17:08,587 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 65 [2019-12-18 13:17:08,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:17:08,632 INFO L225 Difference]: With dead ends: 33909 [2019-12-18 13:17:08,632 INFO L226 Difference]: Without dead ends: 30991 [2019-12-18 13:17:08,632 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=118, Invalid=388, Unknown=0, NotChecked=0, Total=506 [2019-12-18 13:17:08,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30991 states. [2019-12-18 13:17:08,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30991 to 11298. [2019-12-18 13:17:08,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11298 states. [2019-12-18 13:17:08,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11298 states to 11298 states and 35607 transitions. [2019-12-18 13:17:08,950 INFO L78 Accepts]: Start accepts. Automaton has 11298 states and 35607 transitions. Word has length 65 [2019-12-18 13:17:08,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:17:08,950 INFO L462 AbstractCegarLoop]: Abstraction has 11298 states and 35607 transitions. [2019-12-18 13:17:08,950 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 13:17:08,951 INFO L276 IsEmpty]: Start isEmpty. Operand 11298 states and 35607 transitions. [2019-12-18 13:17:08,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 13:17:08,963 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:17:08,963 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-18 13:17:08,963 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-18 13:17:08,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:17:08,964 INFO L82 PathProgramCache]: Analyzing trace with hash 1724524394, now seen corresponding path program 4 times [2019-12-18 13:17:08,964 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:17:08,964 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [475169144] [2019-12-18 13:17:08,964 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:17:08,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:17:09,042 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-18 13:17:09,043 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [475169144] [2019-12-18 13:17:09,043 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:17:09,043 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 13:17:09,043 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [74640466] [2019-12-18 13:17:09,043 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 13:17:09,044 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:17:09,045 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 13:17:09,045 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 13:17:09,045 INFO L87 Difference]: Start difference. First operand 11298 states and 35607 transitions. Second operand 4 states. [2019-12-18 13:17:09,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:17:09,143 INFO L93 Difference]: Finished difference Result 11142 states and 34983 transitions. [2019-12-18 13:17:09,143 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 13:17:09,143 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 65 [2019-12-18 13:17:09,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:17:09,162 INFO L225 Difference]: With dead ends: 11142 [2019-12-18 13:17:09,162 INFO L226 Difference]: Without dead ends: 11142 [2019-12-18 13:17:09,163 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 13:17:09,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11142 states. [2019-12-18 13:17:09,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11142 to 10674. [2019-12-18 13:17:09,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10674 states. [2019-12-18 13:17:09,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10674 states to 10674 states and 33423 transitions. [2019-12-18 13:17:09,354 INFO L78 Accepts]: Start accepts. Automaton has 10674 states and 33423 transitions. Word has length 65 [2019-12-18 13:17:09,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:17:09,355 INFO L462 AbstractCegarLoop]: Abstraction has 10674 states and 33423 transitions. [2019-12-18 13:17:09,355 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 13:17:09,355 INFO L276 IsEmpty]: Start isEmpty. Operand 10674 states and 33423 transitions. [2019-12-18 13:17:09,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 13:17:09,368 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:17:09,368 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-18 13:17:09,368 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-18 13:17:09,369 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:17:09,369 INFO L82 PathProgramCache]: Analyzing trace with hash 837718325, now seen corresponding path program 1 times [2019-12-18 13:17:09,369 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:17:09,369 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [97298010] [2019-12-18 13:17:09,369 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:17:09,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:17:09,428 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-18 13:17:09,429 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [97298010] [2019-12-18 13:17:09,429 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:17:09,429 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 13:17:09,429 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [606585267] [2019-12-18 13:17:09,430 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 13:17:09,430 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:17:09,430 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 13:17:09,430 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 13:17:09,430 INFO L87 Difference]: Start difference. First operand 10674 states and 33423 transitions. Second operand 3 states. [2019-12-18 13:17:09,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:17:09,481 INFO L93 Difference]: Finished difference Result 10673 states and 33421 transitions. [2019-12-18 13:17:09,481 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 13:17:09,481 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-18 13:17:09,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:17:09,501 INFO L225 Difference]: With dead ends: 10673 [2019-12-18 13:17:09,501 INFO L226 Difference]: Without dead ends: 10673 [2019-12-18 13:17:09,502 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-18 13:17:10,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10673 states. [2019-12-18 13:17:10,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10673 to 10673. [2019-12-18 13:17:10,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10673 states. [2019-12-18 13:17:10,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10673 states to 10673 states and 33421 transitions. [2019-12-18 13:17:10,242 INFO L78 Accepts]: Start accepts. Automaton has 10673 states and 33421 transitions. Word has length 65 [2019-12-18 13:17:10,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:17:10,242 INFO L462 AbstractCegarLoop]: Abstraction has 10673 states and 33421 transitions. [2019-12-18 13:17:10,243 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 13:17:10,243 INFO L276 IsEmpty]: Start isEmpty. Operand 10673 states and 33421 transitions. [2019-12-18 13:17:10,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 13:17:10,258 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:17:10,258 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-18 13:17:10,259 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-18 13:17:10,259 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:17:10,259 INFO L82 PathProgramCache]: Analyzing trace with hash 1101261716, now seen corresponding path program 1 times [2019-12-18 13:17:10,259 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:17:10,259 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [925615765] [2019-12-18 13:17:10,260 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:17:10,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:17:10,323 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-18 13:17:10,323 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [925615765] [2019-12-18 13:17:10,323 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:17:10,324 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 13:17:10,324 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [324680403] [2019-12-18 13:17:10,324 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 13:17:10,324 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:17:10,325 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 13:17:10,325 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 13:17:10,325 INFO L87 Difference]: Start difference. First operand 10673 states and 33421 transitions. Second operand 3 states. [2019-12-18 13:17:10,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:17:10,373 INFO L93 Difference]: Finished difference Result 8641 states and 26214 transitions. [2019-12-18 13:17:10,374 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 13:17:10,374 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-12-18 13:17:10,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:17:10,388 INFO L225 Difference]: With dead ends: 8641 [2019-12-18 13:17:10,389 INFO L226 Difference]: Without dead ends: 8641 [2019-12-18 13:17:10,389 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-18 13:17:10,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8641 states. [2019-12-18 13:17:10,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8641 to 8368. [2019-12-18 13:17:10,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8368 states. [2019-12-18 13:17:10,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8368 states to 8368 states and 25353 transitions. [2019-12-18 13:17:10,607 INFO L78 Accepts]: Start accepts. Automaton has 8368 states and 25353 transitions. Word has length 66 [2019-12-18 13:17:10,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:17:10,607 INFO L462 AbstractCegarLoop]: Abstraction has 8368 states and 25353 transitions. [2019-12-18 13:17:10,607 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 13:17:10,608 INFO L276 IsEmpty]: Start isEmpty. Operand 8368 states and 25353 transitions. [2019-12-18 13:17:10,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 13:17:10,621 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:17:10,621 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-18 13:17:10,621 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-18 13:17:10,622 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:17:10,622 INFO L82 PathProgramCache]: Analyzing trace with hash -1000943315, now seen corresponding path program 1 times [2019-12-18 13:17:10,622 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:17:10,622 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1840051742] [2019-12-18 13:17:10,623 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:17:10,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:17:10,799 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-18 13:17:10,799 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1840051742] [2019-12-18 13:17:10,800 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:17:10,800 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 13:17:10,800 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1966691650] [2019-12-18 13:17:10,800 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-18 13:17:10,801 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:17:10,801 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-18 13:17:10,801 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2019-12-18 13:17:10,801 INFO L87 Difference]: Start difference. First operand 8368 states and 25353 transitions. Second operand 10 states. [2019-12-18 13:17:12,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:17:12,076 INFO L93 Difference]: Finished difference Result 14716 states and 43783 transitions. [2019-12-18 13:17:12,076 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-18 13:17:12,077 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 67 [2019-12-18 13:17:12,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:17:12,092 INFO L225 Difference]: With dead ends: 14716 [2019-12-18 13:17:12,092 INFO L226 Difference]: Without dead ends: 11117 [2019-12-18 13:17:12,093 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=80, Invalid=300, Unknown=0, NotChecked=0, Total=380 [2019-12-18 13:17:12,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11117 states. [2019-12-18 13:17:12,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11117 to 8666. [2019-12-18 13:17:12,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8666 states. [2019-12-18 13:17:12,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8666 states to 8666 states and 26101 transitions. [2019-12-18 13:17:12,253 INFO L78 Accepts]: Start accepts. Automaton has 8666 states and 26101 transitions. Word has length 67 [2019-12-18 13:17:12,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:17:12,253 INFO L462 AbstractCegarLoop]: Abstraction has 8666 states and 26101 transitions. [2019-12-18 13:17:12,253 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-18 13:17:12,253 INFO L276 IsEmpty]: Start isEmpty. Operand 8666 states and 26101 transitions. [2019-12-18 13:17:12,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 13:17:12,262 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:17:12,262 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-18 13:17:12,262 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-18 13:17:12,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:17:12,262 INFO L82 PathProgramCache]: Analyzing trace with hash -1387520431, now seen corresponding path program 2 times [2019-12-18 13:17:12,262 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:17:12,263 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1992369667] [2019-12-18 13:17:12,263 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:17:12,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:17:12,443 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-18 13:17:12,443 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1992369667] [2019-12-18 13:17:12,443 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:17:12,443 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 13:17:12,444 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1359858146] [2019-12-18 13:17:12,444 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-18 13:17:12,444 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:17:12,445 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-18 13:17:12,445 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-12-18 13:17:12,445 INFO L87 Difference]: Start difference. First operand 8666 states and 26101 transitions. Second operand 10 states. [2019-12-18 13:17:13,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:17:13,703 INFO L93 Difference]: Finished difference Result 15216 states and 44769 transitions. [2019-12-18 13:17:13,703 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-18 13:17:13,703 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 67 [2019-12-18 13:17:13,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:17:13,721 INFO L225 Difference]: With dead ends: 15216 [2019-12-18 13:17:13,721 INFO L226 Difference]: Without dead ends: 12165 [2019-12-18 13:17:13,721 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=241, Unknown=0, NotChecked=0, Total=306 [2019-12-18 13:17:13,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12165 states. [2019-12-18 13:17:13,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12165 to 9002. [2019-12-18 13:17:13,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9002 states. [2019-12-18 13:17:13,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9002 states to 9002 states and 26931 transitions. [2019-12-18 13:17:13,889 INFO L78 Accepts]: Start accepts. Automaton has 9002 states and 26931 transitions. Word has length 67 [2019-12-18 13:17:13,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:17:13,889 INFO L462 AbstractCegarLoop]: Abstraction has 9002 states and 26931 transitions. [2019-12-18 13:17:13,889 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-18 13:17:13,889 INFO L276 IsEmpty]: Start isEmpty. Operand 9002 states and 26931 transitions. [2019-12-18 13:17:13,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 13:17:13,898 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:17:13,898 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-18 13:17:13,899 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-18 13:17:13,899 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:17:13,899 INFO L82 PathProgramCache]: Analyzing trace with hash 1156359029, now seen corresponding path program 3 times [2019-12-18 13:17:13,899 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:17:13,899 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [883222942] [2019-12-18 13:17:13,899 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:17:13,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:17:14,064 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-18 13:17:14,065 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [883222942] [2019-12-18 13:17:14,065 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:17:14,065 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-18 13:17:14,065 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [837071968] [2019-12-18 13:17:14,065 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-18 13:17:14,066 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:17:14,066 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-18 13:17:14,066 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-18 13:17:14,066 INFO L87 Difference]: Start difference. First operand 9002 states and 26931 transitions. Second operand 11 states. [2019-12-18 13:17:15,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:17:15,306 INFO L93 Difference]: Finished difference Result 14588 states and 42742 transitions. [2019-12-18 13:17:15,306 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-12-18 13:17:15,306 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 67 [2019-12-18 13:17:15,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:17:15,323 INFO L225 Difference]: With dead ends: 14588 [2019-12-18 13:17:15,323 INFO L226 Difference]: Without dead ends: 11765 [2019-12-18 13:17:15,323 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=79, Invalid=341, Unknown=0, NotChecked=0, Total=420 [2019-12-18 13:17:15,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11765 states. [2019-12-18 13:17:15,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11765 to 8714. [2019-12-18 13:17:15,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8714 states. [2019-12-18 13:17:15,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8714 states to 8714 states and 26091 transitions. [2019-12-18 13:17:15,881 INFO L78 Accepts]: Start accepts. Automaton has 8714 states and 26091 transitions. Word has length 67 [2019-12-18 13:17:15,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:17:15,882 INFO L462 AbstractCegarLoop]: Abstraction has 8714 states and 26091 transitions. [2019-12-18 13:17:15,882 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-18 13:17:15,882 INFO L276 IsEmpty]: Start isEmpty. Operand 8714 states and 26091 transitions. [2019-12-18 13:17:15,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 13:17:15,890 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:17:15,890 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-18 13:17:15,891 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-18 13:17:15,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:17:15,891 INFO L82 PathProgramCache]: Analyzing trace with hash -1555205525, now seen corresponding path program 4 times [2019-12-18 13:17:15,891 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:17:15,891 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [704451966] [2019-12-18 13:17:15,891 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:17:15,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:17:16,067 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-18 13:17:16,068 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [704451966] [2019-12-18 13:17:16,068 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:17:16,068 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-18 13:17:16,068 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [270855210] [2019-12-18 13:17:16,069 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-18 13:17:16,069 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:17:16,069 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-18 13:17:16,069 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-18 13:17:16,069 INFO L87 Difference]: Start difference. First operand 8714 states and 26091 transitions. Second operand 11 states. [2019-12-18 13:17:16,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:17:16,993 INFO L93 Difference]: Finished difference Result 13143 states and 38917 transitions. [2019-12-18 13:17:16,993 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-12-18 13:17:16,993 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 67 [2019-12-18 13:17:16,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:17:17,013 INFO L225 Difference]: With dead ends: 13143 [2019-12-18 13:17:17,014 INFO L226 Difference]: Without dead ends: 12124 [2019-12-18 13:17:17,015 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 139 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=148, Invalid=608, Unknown=0, NotChecked=0, Total=756 [2019-12-18 13:17:17,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12124 states. [2019-12-18 13:17:17,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12124 to 10298. [2019-12-18 13:17:17,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10298 states. [2019-12-18 13:17:17,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10298 states to 10298 states and 30723 transitions. [2019-12-18 13:17:17,212 INFO L78 Accepts]: Start accepts. Automaton has 10298 states and 30723 transitions. Word has length 67 [2019-12-18 13:17:17,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:17:17,213 INFO L462 AbstractCegarLoop]: Abstraction has 10298 states and 30723 transitions. [2019-12-18 13:17:17,213 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-18 13:17:17,213 INFO L276 IsEmpty]: Start isEmpty. Operand 10298 states and 30723 transitions. [2019-12-18 13:17:17,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 13:17:17,223 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:17:17,223 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-18 13:17:17,224 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-18 13:17:17,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:17:17,224 INFO L82 PathProgramCache]: Analyzing trace with hash 1250353067, now seen corresponding path program 5 times [2019-12-18 13:17:17,224 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:17:17,224 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1637305342] [2019-12-18 13:17:17,224 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:17:17,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:17:17,371 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-18 13:17:17,372 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1637305342] [2019-12-18 13:17:17,372 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:17:17,372 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-18 13:17:17,372 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [204868434] [2019-12-18 13:17:17,373 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-18 13:17:17,373 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:17:17,373 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-18 13:17:17,373 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-18 13:17:17,373 INFO L87 Difference]: Start difference. First operand 10298 states and 30723 transitions. Second operand 11 states. [2019-12-18 13:17:18,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:17:18,187 INFO L93 Difference]: Finished difference Result 12574 states and 36849 transitions. [2019-12-18 13:17:18,188 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-18 13:17:18,188 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 67 [2019-12-18 13:17:18,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:17:18,202 INFO L225 Difference]: With dead ends: 12574 [2019-12-18 13:17:18,202 INFO L226 Difference]: Without dead ends: 10559 [2019-12-18 13:17:18,204 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=141, Invalid=509, Unknown=0, NotChecked=0, Total=650 [2019-12-18 13:17:18,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10559 states. [2019-12-18 13:17:18,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10559 to 8416. [2019-12-18 13:17:18,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8416 states. [2019-12-18 13:17:18,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8416 states to 8416 states and 25159 transitions. [2019-12-18 13:17:18,355 INFO L78 Accepts]: Start accepts. Automaton has 8416 states and 25159 transitions. Word has length 67 [2019-12-18 13:17:18,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:17:18,356 INFO L462 AbstractCegarLoop]: Abstraction has 8416 states and 25159 transitions. [2019-12-18 13:17:18,356 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-18 13:17:18,356 INFO L276 IsEmpty]: Start isEmpty. Operand 8416 states and 25159 transitions. [2019-12-18 13:17:18,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 13:17:18,364 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:17:18,365 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-18 13:17:18,365 INFO L410 AbstractCegarLoop]: === Iteration 31 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:17:18,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:17:18,365 INFO L82 PathProgramCache]: Analyzing trace with hash -945042827, now seen corresponding path program 6 times [2019-12-18 13:17:18,365 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:17:18,365 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2082245696] [2019-12-18 13:17:18,365 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:17:18,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:17:18,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-18 13:17:18,566 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2082245696] [2019-12-18 13:17:18,566 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:17:18,566 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-18 13:17:18,566 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1105468474] [2019-12-18 13:17:18,567 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-18 13:17:18,567 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:17:18,567 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-18 13:17:18,567 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-18 13:17:18,567 INFO L87 Difference]: Start difference. First operand 8416 states and 25159 transitions. Second operand 11 states. [2019-12-18 13:17:19,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:17:19,291 INFO L93 Difference]: Finished difference Result 10608 states and 31112 transitions. [2019-12-18 13:17:19,291 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-18 13:17:19,291 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 67 [2019-12-18 13:17:19,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:17:19,308 INFO L225 Difference]: With dead ends: 10608 [2019-12-18 13:17:19,308 INFO L226 Difference]: Without dead ends: 10397 [2019-12-18 13:17:19,308 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 114 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=128, Invalid=522, Unknown=0, NotChecked=0, Total=650 [2019-12-18 13:17:19,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10397 states. [2019-12-18 13:17:19,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10397 to 8240. [2019-12-18 13:17:19,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8240 states. [2019-12-18 13:17:19,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8240 states to 8240 states and 24675 transitions. [2019-12-18 13:17:19,458 INFO L78 Accepts]: Start accepts. Automaton has 8240 states and 24675 transitions. Word has length 67 [2019-12-18 13:17:19,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:17:19,458 INFO L462 AbstractCegarLoop]: Abstraction has 8240 states and 24675 transitions. [2019-12-18 13:17:19,459 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-18 13:17:19,459 INFO L276 IsEmpty]: Start isEmpty. Operand 8240 states and 24675 transitions. [2019-12-18 13:17:19,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 13:17:19,466 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:17:19,467 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-18 13:17:19,467 INFO L410 AbstractCegarLoop]: === Iteration 32 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:17:19,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:17:19,467 INFO L82 PathProgramCache]: Analyzing trace with hash -1748623595, now seen corresponding path program 7 times [2019-12-18 13:17:19,467 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:17:19,468 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [206061761] [2019-12-18 13:17:19,468 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:17:19,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 13:17:19,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 13:17:19,605 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-18 13:17:19,606 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-18 13:17:19,610 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [905] [905] ULTIMATE.startENTRY-->L842: Formula: (let ((.cse0 (store |v_#valid_67| 0 0))) (and (= v_~b$r_buff1_thd0~0_230 0) (= v_~b$w_buff1~0_176 0) (= v_~b$mem_tmp~0_20 0) (= v_~weak$$choice2~0_144 0) (= 0 v_~b$r_buff1_thd3~0_337) (= 0 v_~b$read_delayed~0_7) (= 0 v_~b$r_buff0_thd2~0_182) (= (select .cse0 |v_ULTIMATE.start_main_~#t849~0.base_25|) 0) (= 0 v_~__unbuffered_p0_EAX~0_176) (= v_~__unbuffered_p1_EBX~0_38 0) (= |v_#length_25| (store |v_#length_26| |v_ULTIMATE.start_main_~#t849~0.base_25| 4)) (= v_~main$tmp_guard1~0_34 0) (= v_~y~0_19 0) (= 0 v_~__unbuffered_p1_EAX~0_38) (= v_~b$r_buff0_thd0~0_204 0) (< 0 |v_#StackHeapBarrier_17|) (< |v_#StackHeapBarrier_17| |v_ULTIMATE.start_main_~#t849~0.base_25|) (= 0 v_~b$r_buff1_thd1~0_215) (= v_~a~0_14 0) (= 0 v_~x~0_124) (= 0 v_~b$r_buff0_thd3~0_395) (= v_~__unbuffered_p2_EBX~0_38 0) (= v_~b$read_delayed_var~0.offset_7 0) (= v_~z~0_23 0) (= 0 |v_#NULL.base_4|) (= 0 v_~__unbuffered_p2_EAX~0_34) (= 0 v_~b$w_buff0_used~0_787) (= 0 |v_ULTIMATE.start_main_~#t849~0.offset_17|) (= |v_#NULL.offset_4| 0) (= (store |v_#memory_int_24| |v_ULTIMATE.start_main_~#t849~0.base_25| (store (select |v_#memory_int_24| |v_ULTIMATE.start_main_~#t849~0.base_25|) |v_ULTIMATE.start_main_~#t849~0.offset_17| 0)) |v_#memory_int_23|) (= 0 v_~b$w_buff0~0_250) (= v_~__unbuffered_cnt~0_137 0) (= 0 v_~b$w_buff1_used~0_450) (= 0 v_~b$r_buff1_thd2~0_222) (= 0 v_~weak$$choice0~0_13) (= v_~b~0_186 0) (= v_~main$tmp_guard0~0_24 0) (= v_~b$flush_delayed~0_35 0) (= 0 v_~b$read_delayed_var~0.base_7) (= 0 v_~b$r_buff0_thd1~0_323) (= (store .cse0 |v_ULTIMATE.start_main_~#t849~0.base_25| 1) |v_#valid_65|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_17|, #valid=|v_#valid_67|, #memory_int=|v_#memory_int_24|, #length=|v_#length_26|} OutVars{~b$r_buff0_thd3~0=v_~b$r_buff0_thd3~0_395, ~b$r_buff1_thd1~0=v_~b$r_buff1_thd1~0_215, ~b$read_delayed_var~0.offset=v_~b$read_delayed_var~0.offset_7, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_35|, #NULL.offset=|v_#NULL.offset_4|, ULTIMATE.start_main_#t~ite49=|v_ULTIMATE.start_main_#t~ite49_245|, ULTIMATE.start_main_#t~ite50=|v_ULTIMATE.start_main_#t~ite50_51|, ~b$w_buff0_used~0=v_~b$w_buff0_used~0_787, ~a~0=v_~a~0_14, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_68|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_176, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_38, ULTIMATE.start_main_~#t849~0.base=|v_ULTIMATE.start_main_~#t849~0.base_25|, #length=|v_#length_25|, ~b$w_buff0~0=v_~b$w_buff0~0_250, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_34, ~b$r_buff0_thd0~0=v_~b$r_buff0_thd0~0_204, ~b$r_buff0_thd2~0=v_~b$r_buff0_thd2~0_182, ~b$mem_tmp~0=v_~b$mem_tmp~0_20, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_38, ~b$flush_delayed~0=v_~b$flush_delayed~0_35, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_10|, ~b$read_delayed~0=v_~b$read_delayed~0_7, ULTIMATE.start_main_~#t850~0.offset=|v_ULTIMATE.start_main_~#t850~0.offset_17|, ~weak$$choice0~0=v_~weak$$choice0~0_13, #StackHeapBarrier=|v_#StackHeapBarrier_17|, ~b$w_buff1~0=v_~b$w_buff1~0_176, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_137, ~x~0=v_~x~0_124, ~b$r_buff0_thd1~0=v_~b$r_buff0_thd1~0_323, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_34, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_37|, ULTIMATE.start_main_#t~ite51=|v_ULTIMATE.start_main_#t~ite51_45|, ULTIMATE.start_main_~#t850~0.base=|v_ULTIMATE.start_main_~#t850~0.base_21|, ~b$w_buff1_used~0=v_~b$w_buff1_used~0_450, ULTIMATE.start_main_~#t849~0.offset=|v_ULTIMATE.start_main_~#t849~0.offset_17|, ~y~0=v_~y~0_19, ~b$r_buff1_thd2~0=v_~b$r_buff1_thd2~0_222, ULTIMATE.start_main_~#t851~0.offset=|v_ULTIMATE.start_main_~#t851~0.offset_17|, ~b$r_buff1_thd0~0=v_~b$r_buff1_thd0~0_230, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_38, ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_23|, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_9|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_24, #NULL.base=|v_#NULL.base_4|, ~b$read_delayed_var~0.base=v_~b$read_delayed_var~0.base_7, ~b~0=v_~b~0_186, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_28|, #valid=|v_#valid_65|, #memory_int=|v_#memory_int_23|, ULTIMATE.start_main_~#t851~0.base=|v_ULTIMATE.start_main_~#t851~0.base_21|, ~z~0=v_~z~0_23, ~weak$$choice2~0=v_~weak$$choice2~0_144, ~b$r_buff1_thd3~0=v_~b$r_buff1_thd3~0_337} AuxVars[] AssignedVars[~b$r_buff0_thd3~0, ~b$r_buff1_thd1~0, ~b$read_delayed_var~0.offset, ULTIMATE.start_main_#t~ite47, #NULL.offset, ULTIMATE.start_main_#t~ite49, ULTIMATE.start_main_#t~ite50, ~b$w_buff0_used~0, ~a~0, ULTIMATE.start_main_#t~ite52, ~__unbuffered_p0_EAX~0, ~__unbuffered_p1_EAX~0, ULTIMATE.start_main_~#t849~0.base, #length, ~b$w_buff0~0, ~__unbuffered_p2_EAX~0, ~b$r_buff0_thd0~0, ~b$r_buff0_thd2~0, ~b$mem_tmp~0, ~__unbuffered_p2_EBX~0, ~b$flush_delayed~0, ULTIMATE.start_main_#t~nondet45, ~b$read_delayed~0, ULTIMATE.start_main_~#t850~0.offset, ~weak$$choice0~0, ~b$w_buff1~0, ~__unbuffered_cnt~0, ~x~0, ~b$r_buff0_thd1~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite48, ULTIMATE.start_main_#t~ite51, ULTIMATE.start_main_~#t850~0.base, ~b$w_buff1_used~0, ULTIMATE.start_main_~#t849~0.offset, ~y~0, ~b$r_buff1_thd2~0, ULTIMATE.start_main_~#t851~0.offset, ~b$r_buff1_thd0~0, ~__unbuffered_p1_EBX~0, ULTIMATE.start_main_#t~nondet46, ULTIMATE.start_main_#t~nondet44, ~main$tmp_guard0~0, #NULL.base, ~b$read_delayed_var~0.base, ~b~0, ULTIMATE.start_main_#res, #valid, #memory_int, ULTIMATE.start_main_~#t851~0.base, ~z~0, ~weak$$choice2~0, ~b$r_buff1_thd3~0] because there is no mapped edge [2019-12-18 13:17:19,611 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [864] [864] L842-1-->L844: Formula: (and (= (store |v_#length_14| |v_ULTIMATE.start_main_~#t850~0.base_10| 4) |v_#length_13|) (not (= 0 |v_ULTIMATE.start_main_~#t850~0.base_10|)) (= |v_#valid_27| (store |v_#valid_28| |v_ULTIMATE.start_main_~#t850~0.base_10| 1)) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t850~0.base_10| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t850~0.base_10|) |v_ULTIMATE.start_main_~#t850~0.offset_9| 1)) |v_#memory_int_11|) (= (select |v_#valid_28| |v_ULTIMATE.start_main_~#t850~0.base_10|) 0) (< |v_#StackHeapBarrier_9| |v_ULTIMATE.start_main_~#t850~0.base_10|) (= |v_ULTIMATE.start_main_~#t850~0.offset_9| 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_28|, #memory_int=|v_#memory_int_12|, #length=|v_#length_14|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_9|, ULTIMATE.start_main_~#t850~0.base=|v_ULTIMATE.start_main_~#t850~0.base_10|, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_4|, #valid=|v_#valid_27|, #memory_int=|v_#memory_int_11|, #length=|v_#length_13|, ULTIMATE.start_main_~#t850~0.offset=|v_ULTIMATE.start_main_~#t850~0.offset_9|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t850~0.base, ULTIMATE.start_main_#t~nondet44, #valid, #memory_int, #length, ULTIMATE.start_main_~#t850~0.offset] because there is no mapped edge [2019-12-18 13:17:19,612 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [880] [880] L844-1-->L846: Formula: (and (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t851~0.base_13|) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t851~0.base_13| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t851~0.base_13|) |v_ULTIMATE.start_main_~#t851~0.offset_11| 2)) |v_#memory_int_15|) (= |v_ULTIMATE.start_main_~#t851~0.offset_11| 0) (= 0 (select |v_#valid_37| |v_ULTIMATE.start_main_~#t851~0.base_13|)) (not (= |v_ULTIMATE.start_main_~#t851~0.base_13| 0)) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t851~0.base_13| 4)) (= (store |v_#valid_37| |v_ULTIMATE.start_main_~#t851~0.base_13| 1) |v_#valid_36|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_37|, #memory_int=|v_#memory_int_16|, #length=|v_#length_18|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_36|, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_6|, #memory_int=|v_#memory_int_15|, #length=|v_#length_17|, ULTIMATE.start_main_~#t851~0.base=|v_ULTIMATE.start_main_~#t851~0.base_13|, ULTIMATE.start_main_~#t851~0.offset=|v_ULTIMATE.start_main_~#t851~0.offset_11|} AuxVars[] AssignedVars[#valid, ULTIMATE.start_main_#t~nondet45, #memory_int, #length, ULTIMATE.start_main_~#t851~0.base, ULTIMATE.start_main_~#t851~0.offset] because there is no mapped edge [2019-12-18 13:17:19,613 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [883] [883] L4-->L754: Formula: (and (= ~b$r_buff0_thd1~0_In-2126886093 ~b$r_buff1_thd1~0_Out-2126886093) (not (= 0 P0Thread1of1ForFork2___VERIFIER_assert_~expression_In-2126886093)) (= ~b$r_buff1_thd3~0_Out-2126886093 ~b$r_buff0_thd3~0_In-2126886093) (= ~b$r_buff0_thd2~0_In-2126886093 ~b$r_buff1_thd2~0_Out-2126886093) (= ~x~0_In-2126886093 ~__unbuffered_p0_EAX~0_Out-2126886093) (= ~b$r_buff1_thd0~0_Out-2126886093 ~b$r_buff0_thd0~0_In-2126886093) (= ~b$r_buff0_thd1~0_Out-2126886093 1)) InVars {~b$r_buff0_thd1~0=~b$r_buff0_thd1~0_In-2126886093, ~b$r_buff0_thd2~0=~b$r_buff0_thd2~0_In-2126886093, ~b$r_buff0_thd3~0=~b$r_buff0_thd3~0_In-2126886093, P0Thread1of1ForFork2___VERIFIER_assert_~expression=P0Thread1of1ForFork2___VERIFIER_assert_~expression_In-2126886093, ~x~0=~x~0_In-2126886093, ~b$r_buff0_thd0~0=~b$r_buff0_thd0~0_In-2126886093} OutVars{~b$r_buff0_thd1~0=~b$r_buff0_thd1~0_Out-2126886093, ~b$r_buff0_thd2~0=~b$r_buff0_thd2~0_In-2126886093, ~__unbuffered_p0_EAX~0=~__unbuffered_p0_EAX~0_Out-2126886093, ~b$r_buff0_thd3~0=~b$r_buff0_thd3~0_In-2126886093, ~b$r_buff1_thd1~0=~b$r_buff1_thd1~0_Out-2126886093, ~b$r_buff1_thd0~0=~b$r_buff1_thd0~0_Out-2126886093, P0Thread1of1ForFork2___VERIFIER_assert_~expression=P0Thread1of1ForFork2___VERIFIER_assert_~expression_In-2126886093, ~b$r_buff1_thd2~0=~b$r_buff1_thd2~0_Out-2126886093, ~b$r_buff1_thd3~0=~b$r_buff1_thd3~0_Out-2126886093, ~x~0=~x~0_In-2126886093, ~b$r_buff0_thd0~0=~b$r_buff0_thd0~0_In-2126886093} AuxVars[] AssignedVars[~b$r_buff0_thd1~0, ~__unbuffered_p0_EAX~0, ~b$r_buff1_thd1~0, ~b$r_buff1_thd0~0, ~b$r_buff1_thd2~0, ~b$r_buff1_thd3~0] because there is no mapped edge [2019-12-18 13:17:19,616 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [836] [836] L780-2-->L780-4: Formula: (let ((.cse0 (= 0 (mod ~b$r_buff1_thd2~0_In-2068525748 256))) (.cse1 (= (mod ~b$w_buff1_used~0_In-2068525748 256) 0))) (or (and (or .cse0 .cse1) (= ~b~0_In-2068525748 |P1Thread1of1ForFork0_#t~ite9_Out-2068525748|)) (and (= ~b$w_buff1~0_In-2068525748 |P1Thread1of1ForFork0_#t~ite9_Out-2068525748|) (not .cse0) (not .cse1)))) InVars {~b$w_buff1_used~0=~b$w_buff1_used~0_In-2068525748, ~b~0=~b~0_In-2068525748, ~b$w_buff1~0=~b$w_buff1~0_In-2068525748, ~b$r_buff1_thd2~0=~b$r_buff1_thd2~0_In-2068525748} OutVars{~b$w_buff1_used~0=~b$w_buff1_used~0_In-2068525748, ~b~0=~b~0_In-2068525748, ~b$w_buff1~0=~b$w_buff1~0_In-2068525748, P1Thread1of1ForFork0_#t~ite9=|P1Thread1of1ForFork0_#t~ite9_Out-2068525748|, ~b$r_buff1_thd2~0=~b$r_buff1_thd2~0_In-2068525748} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite9] because there is no mapped edge [2019-12-18 13:17:19,617 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [825] [825] L780-4-->L781: Formula: (= v_~b~0_66 |v_P1Thread1of1ForFork0_#t~ite9_34|) InVars {P1Thread1of1ForFork0_#t~ite9=|v_P1Thread1of1ForFork0_#t~ite9_34|} OutVars{~b~0=v_~b~0_66, P1Thread1of1ForFork0_#t~ite10=|v_P1Thread1of1ForFork0_#t~ite10_53|, P1Thread1of1ForFork0_#t~ite9=|v_P1Thread1of1ForFork0_#t~ite9_33|} AuxVars[] AssignedVars[~b~0, P1Thread1of1ForFork0_#t~ite10, P1Thread1of1ForFork0_#t~ite9] because there is no mapped edge [2019-12-18 13:17:19,617 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [845] [845] L781-->L781-2: Formula: (let ((.cse1 (= (mod ~b$w_buff0_used~0_In55791427 256) 0)) (.cse0 (= 0 (mod ~b$r_buff0_thd2~0_In55791427 256)))) (or (and (= ~b$w_buff0_used~0_In55791427 |P1Thread1of1ForFork0_#t~ite11_Out55791427|) (or .cse0 .cse1)) (and (not .cse1) (not .cse0) (= 0 |P1Thread1of1ForFork0_#t~ite11_Out55791427|)))) InVars {~b$w_buff0_used~0=~b$w_buff0_used~0_In55791427, ~b$r_buff0_thd2~0=~b$r_buff0_thd2~0_In55791427} OutVars{~b$w_buff0_used~0=~b$w_buff0_used~0_In55791427, ~b$r_buff0_thd2~0=~b$r_buff0_thd2~0_In55791427, P1Thread1of1ForFork0_#t~ite11=|P1Thread1of1ForFork0_#t~ite11_Out55791427|} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite11] because there is no mapped edge [2019-12-18 13:17:19,618 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [827] [827] L782-->L782-2: Formula: (let ((.cse0 (= 0 (mod ~b$w_buff1_used~0_In-2129505063 256))) (.cse1 (= 0 (mod ~b$r_buff1_thd2~0_In-2129505063 256))) (.cse3 (= 0 (mod ~b$w_buff0_used~0_In-2129505063 256))) (.cse2 (= (mod ~b$r_buff0_thd2~0_In-2129505063 256) 0))) (or (and (= |P1Thread1of1ForFork0_#t~ite12_Out-2129505063| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= |P1Thread1of1ForFork0_#t~ite12_Out-2129505063| ~b$w_buff1_used~0_In-2129505063) (or .cse0 .cse1) (or .cse3 .cse2)))) InVars {~b$w_buff0_used~0=~b$w_buff0_used~0_In-2129505063, ~b$r_buff0_thd2~0=~b$r_buff0_thd2~0_In-2129505063, ~b$w_buff1_used~0=~b$w_buff1_used~0_In-2129505063, ~b$r_buff1_thd2~0=~b$r_buff1_thd2~0_In-2129505063} OutVars{~b$w_buff0_used~0=~b$w_buff0_used~0_In-2129505063, ~b$r_buff0_thd2~0=~b$r_buff0_thd2~0_In-2129505063, ~b$w_buff1_used~0=~b$w_buff1_used~0_In-2129505063, P1Thread1of1ForFork0_#t~ite12=|P1Thread1of1ForFork0_#t~ite12_Out-2129505063|, ~b$r_buff1_thd2~0=~b$r_buff1_thd2~0_In-2129505063} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite12] because there is no mapped edge [2019-12-18 13:17:19,619 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [848] [848] L783-->L783-2: Formula: (let ((.cse0 (= 0 (mod ~b$r_buff0_thd2~0_In1557490530 256))) (.cse1 (= 0 (mod ~b$w_buff0_used~0_In1557490530 256)))) (or (and (= ~b$r_buff0_thd2~0_In1557490530 |P1Thread1of1ForFork0_#t~ite13_Out1557490530|) (or .cse0 .cse1)) (and (not .cse0) (= 0 |P1Thread1of1ForFork0_#t~ite13_Out1557490530|) (not .cse1)))) InVars {~b$w_buff0_used~0=~b$w_buff0_used~0_In1557490530, ~b$r_buff0_thd2~0=~b$r_buff0_thd2~0_In1557490530} OutVars{~b$w_buff0_used~0=~b$w_buff0_used~0_In1557490530, ~b$r_buff0_thd2~0=~b$r_buff0_thd2~0_In1557490530, P1Thread1of1ForFork0_#t~ite13=|P1Thread1of1ForFork0_#t~ite13_Out1557490530|} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite13] because there is no mapped edge [2019-12-18 13:17:19,620 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [849] [849] L784-->L784-2: Formula: (let ((.cse0 (= (mod ~b$r_buff0_thd2~0_In-2129051094 256) 0)) (.cse1 (= (mod ~b$w_buff0_used~0_In-2129051094 256) 0)) (.cse3 (= 0 (mod ~b$w_buff1_used~0_In-2129051094 256))) (.cse2 (= (mod ~b$r_buff1_thd2~0_In-2129051094 256) 0))) (or (and (= |P1Thread1of1ForFork0_#t~ite14_Out-2129051094| ~b$r_buff1_thd2~0_In-2129051094) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2))) (= |P1Thread1of1ForFork0_#t~ite14_Out-2129051094| 0)))) InVars {~b$w_buff0_used~0=~b$w_buff0_used~0_In-2129051094, ~b$r_buff0_thd2~0=~b$r_buff0_thd2~0_In-2129051094, ~b$w_buff1_used~0=~b$w_buff1_used~0_In-2129051094, ~b$r_buff1_thd2~0=~b$r_buff1_thd2~0_In-2129051094} OutVars{~b$w_buff0_used~0=~b$w_buff0_used~0_In-2129051094, ~b$r_buff0_thd2~0=~b$r_buff0_thd2~0_In-2129051094, ~b$w_buff1_used~0=~b$w_buff1_used~0_In-2129051094, P1Thread1of1ForFork0_#t~ite14=|P1Thread1of1ForFork0_#t~ite14_Out-2129051094|, ~b$r_buff1_thd2~0=~b$r_buff1_thd2~0_In-2129051094} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite14] because there is no mapped edge [2019-12-18 13:17:19,620 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [860] [860] L784-2-->P1EXIT: Formula: (and (= v_~__unbuffered_cnt~0_68 (+ v_~__unbuffered_cnt~0_69 1)) (= v_~b$r_buff1_thd2~0_85 |v_P1Thread1of1ForFork0_#t~ite14_32|) (= 0 |v_P1Thread1of1ForFork0_#res.base_5|) (= 0 |v_P1Thread1of1ForFork0_#res.offset_5|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_69, P1Thread1of1ForFork0_#t~ite14=|v_P1Thread1of1ForFork0_#t~ite14_32|} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_68, P1Thread1of1ForFork0_#t~ite14=|v_P1Thread1of1ForFork0_#t~ite14_31|, P1Thread1of1ForFork0_#res.offset=|v_P1Thread1of1ForFork0_#res.offset_5|, ~b$r_buff1_thd2~0=v_~b$r_buff1_thd2~0_85, P1Thread1of1ForFork0_#res.base=|v_P1Thread1of1ForFork0_#res.base_5|} AuxVars[] AssignedVars[~__unbuffered_cnt~0, P1Thread1of1ForFork0_#t~ite14, P1Thread1of1ForFork0_#res.offset, ~b$r_buff1_thd2~0, P1Thread1of1ForFork0_#res.base] because there is no mapped edge [2019-12-18 13:17:19,623 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [884] [884] L808-->L808-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-1980660995 256)))) (or (and (= |P2Thread1of1ForFork1_#t~ite20_In-1980660995| |P2Thread1of1ForFork1_#t~ite20_Out-1980660995|) (= |P2Thread1of1ForFork1_#t~ite21_Out-1980660995| ~b$w_buff0~0_In-1980660995) (not .cse0)) (and .cse0 (= |P2Thread1of1ForFork1_#t~ite21_Out-1980660995| |P2Thread1of1ForFork1_#t~ite20_Out-1980660995|) (= |P2Thread1of1ForFork1_#t~ite20_Out-1980660995| ~b$w_buff0~0_In-1980660995) (let ((.cse1 (= (mod ~b$r_buff0_thd3~0_In-1980660995 256) 0))) (or (and (= 0 (mod ~b$r_buff1_thd3~0_In-1980660995 256)) .cse1) (= 0 (mod ~b$w_buff0_used~0_In-1980660995 256)) (and .cse1 (= (mod ~b$w_buff1_used~0_In-1980660995 256) 0))))))) InVars {~b$w_buff0_used~0=~b$w_buff0_used~0_In-1980660995, ~b$r_buff0_thd3~0=~b$r_buff0_thd3~0_In-1980660995, P2Thread1of1ForFork1_#t~ite20=|P2Thread1of1ForFork1_#t~ite20_In-1980660995|, ~b$w_buff1_used~0=~b$w_buff1_used~0_In-1980660995, ~b$w_buff0~0=~b$w_buff0~0_In-1980660995, ~weak$$choice2~0=~weak$$choice2~0_In-1980660995, ~b$r_buff1_thd3~0=~b$r_buff1_thd3~0_In-1980660995} OutVars{~b$w_buff0_used~0=~b$w_buff0_used~0_In-1980660995, ~b$r_buff0_thd3~0=~b$r_buff0_thd3~0_In-1980660995, P2Thread1of1ForFork1_#t~ite20=|P2Thread1of1ForFork1_#t~ite20_Out-1980660995|, P2Thread1of1ForFork1_#t~ite21=|P2Thread1of1ForFork1_#t~ite21_Out-1980660995|, ~b$w_buff1_used~0=~b$w_buff1_used~0_In-1980660995, ~b$w_buff0~0=~b$w_buff0~0_In-1980660995, ~weak$$choice2~0=~weak$$choice2~0_In-1980660995, ~b$r_buff1_thd3~0=~b$r_buff1_thd3~0_In-1980660995} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite20, P2Thread1of1ForFork1_#t~ite21] because there is no mapped edge [2019-12-18 13:17:19,625 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [885] [885] L810-->L810-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In933673424 256)))) (or (and (= |P2Thread1of1ForFork1_#t~ite26_In933673424| |P2Thread1of1ForFork1_#t~ite26_Out933673424|) (= ~b$w_buff0_used~0_In933673424 |P2Thread1of1ForFork1_#t~ite27_Out933673424|) (not .cse0)) (and (let ((.cse1 (= 0 (mod ~b$r_buff0_thd3~0_In933673424 256)))) (or (and .cse1 (= (mod ~b$w_buff1_used~0_In933673424 256) 0)) (and .cse1 (= (mod ~b$r_buff1_thd3~0_In933673424 256) 0)) (= (mod ~b$w_buff0_used~0_In933673424 256) 0))) .cse0 (= |P2Thread1of1ForFork1_#t~ite26_Out933673424| |P2Thread1of1ForFork1_#t~ite27_Out933673424|) (= |P2Thread1of1ForFork1_#t~ite26_Out933673424| ~b$w_buff0_used~0_In933673424)))) InVars {~b$w_buff0_used~0=~b$w_buff0_used~0_In933673424, ~b$r_buff0_thd3~0=~b$r_buff0_thd3~0_In933673424, P2Thread1of1ForFork1_#t~ite26=|P2Thread1of1ForFork1_#t~ite26_In933673424|, ~b$w_buff1_used~0=~b$w_buff1_used~0_In933673424, ~weak$$choice2~0=~weak$$choice2~0_In933673424, ~b$r_buff1_thd3~0=~b$r_buff1_thd3~0_In933673424} OutVars{~b$w_buff0_used~0=~b$w_buff0_used~0_In933673424, P2Thread1of1ForFork1_#t~ite26=|P2Thread1of1ForFork1_#t~ite26_Out933673424|, ~b$r_buff0_thd3~0=~b$r_buff0_thd3~0_In933673424, P2Thread1of1ForFork1_#t~ite27=|P2Thread1of1ForFork1_#t~ite27_Out933673424|, ~b$w_buff1_used~0=~b$w_buff1_used~0_In933673424, ~weak$$choice2~0=~weak$$choice2~0_In933673424, ~b$r_buff1_thd3~0=~b$r_buff1_thd3~0_In933673424} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite26, P2Thread1of1ForFork1_#t~ite27] because there is no mapped edge [2019-12-18 13:17:19,628 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [768] [768] L812-->L813: Formula: (and (not (= 0 (mod v_~weak$$choice2~0_15 256))) (= v_~b$r_buff0_thd3~0_79 v_~b$r_buff0_thd3~0_78)) InVars {~b$r_buff0_thd3~0=v_~b$r_buff0_thd3~0_79, ~weak$$choice2~0=v_~weak$$choice2~0_15} OutVars{~b$r_buff0_thd3~0=v_~b$r_buff0_thd3~0_78, P2Thread1of1ForFork1_#t~ite32=|v_P2Thread1of1ForFork1_#t~ite32_9|, P2Thread1of1ForFork1_#t~ite31=|v_P2Thread1of1ForFork1_#t~ite31_8|, P2Thread1of1ForFork1_#t~ite33=|v_P2Thread1of1ForFork1_#t~ite33_9|, ~weak$$choice2~0=v_~weak$$choice2~0_15} AuxVars[] AssignedVars[~b$r_buff0_thd3~0, P2Thread1of1ForFork1_#t~ite32, P2Thread1of1ForFork1_#t~ite31, P2Thread1of1ForFork1_#t~ite33] because there is no mapped edge [2019-12-18 13:17:19,630 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [791] [791] L815-->L819: Formula: (and (= v_~b$flush_delayed~0_7 0) (not (= (mod v_~b$flush_delayed~0_8 256) 0)) (= v_~b~0_30 v_~b$mem_tmp~0_5)) InVars {~b$mem_tmp~0=v_~b$mem_tmp~0_5, ~b$flush_delayed~0=v_~b$flush_delayed~0_8} OutVars{~b$mem_tmp~0=v_~b$mem_tmp~0_5, P2Thread1of1ForFork1_#t~ite37=|v_P2Thread1of1ForFork1_#t~ite37_7|, ~b~0=v_~b~0_30, ~b$flush_delayed~0=v_~b$flush_delayed~0_7} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite37, ~b~0, ~b$flush_delayed~0] because there is no mapped edge [2019-12-18 13:17:19,631 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [844] [844] L819-2-->L819-4: Formula: (let ((.cse0 (= 0 (mod ~b$w_buff1_used~0_In-1051398823 256))) (.cse1 (= (mod ~b$r_buff1_thd3~0_In-1051398823 256) 0))) (or (and (= |P2Thread1of1ForFork1_#t~ite38_Out-1051398823| ~b~0_In-1051398823) (or .cse0 .cse1)) (and (not .cse0) (not .cse1) (= |P2Thread1of1ForFork1_#t~ite38_Out-1051398823| ~b$w_buff1~0_In-1051398823)))) InVars {~b$w_buff1_used~0=~b$w_buff1_used~0_In-1051398823, ~b~0=~b~0_In-1051398823, ~b$w_buff1~0=~b$w_buff1~0_In-1051398823, ~b$r_buff1_thd3~0=~b$r_buff1_thd3~0_In-1051398823} OutVars{P2Thread1of1ForFork1_#t~ite38=|P2Thread1of1ForFork1_#t~ite38_Out-1051398823|, ~b$w_buff1_used~0=~b$w_buff1_used~0_In-1051398823, ~b~0=~b~0_In-1051398823, ~b$w_buff1~0=~b$w_buff1~0_In-1051398823, ~b$r_buff1_thd3~0=~b$r_buff1_thd3~0_In-1051398823} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite38] because there is no mapped edge [2019-12-18 13:17:19,631 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [795] [795] L819-4-->L820: Formula: (= v_~b~0_46 |v_P2Thread1of1ForFork1_#t~ite38_12|) InVars {P2Thread1of1ForFork1_#t~ite38=|v_P2Thread1of1ForFork1_#t~ite38_12|} OutVars{P2Thread1of1ForFork1_#t~ite38=|v_P2Thread1of1ForFork1_#t~ite38_11|, ~b~0=v_~b~0_46, P2Thread1of1ForFork1_#t~ite39=|v_P2Thread1of1ForFork1_#t~ite39_7|} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite38, ~b~0, P2Thread1of1ForFork1_#t~ite39] because there is no mapped edge [2019-12-18 13:17:19,631 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [840] [840] L820-->L820-2: Formula: (let ((.cse0 (= 0 (mod ~b$w_buff0_used~0_In-1829524812 256))) (.cse1 (= (mod ~b$r_buff0_thd3~0_In-1829524812 256) 0))) (or (and (or .cse0 .cse1) (= ~b$w_buff0_used~0_In-1829524812 |P2Thread1of1ForFork1_#t~ite40_Out-1829524812|)) (and (not .cse0) (= |P2Thread1of1ForFork1_#t~ite40_Out-1829524812| 0) (not .cse1)))) InVars {~b$w_buff0_used~0=~b$w_buff0_used~0_In-1829524812, ~b$r_buff0_thd3~0=~b$r_buff0_thd3~0_In-1829524812} OutVars{~b$w_buff0_used~0=~b$w_buff0_used~0_In-1829524812, ~b$r_buff0_thd3~0=~b$r_buff0_thd3~0_In-1829524812, P2Thread1of1ForFork1_#t~ite40=|P2Thread1of1ForFork1_#t~ite40_Out-1829524812|} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite40] because there is no mapped edge [2019-12-18 13:17:19,632 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [846] [846] L821-->L821-2: Formula: (let ((.cse2 (= 0 (mod ~b$w_buff0_used~0_In1670576863 256))) (.cse3 (= 0 (mod ~b$r_buff0_thd3~0_In1670576863 256))) (.cse0 (= (mod ~b$r_buff1_thd3~0_In1670576863 256) 0)) (.cse1 (= 0 (mod ~b$w_buff1_used~0_In1670576863 256)))) (or (and (= ~b$w_buff1_used~0_In1670576863 |P2Thread1of1ForFork1_#t~ite41_Out1670576863|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1))) (= 0 |P2Thread1of1ForFork1_#t~ite41_Out1670576863|)))) InVars {~b$w_buff0_used~0=~b$w_buff0_used~0_In1670576863, ~b$r_buff0_thd3~0=~b$r_buff0_thd3~0_In1670576863, ~b$w_buff1_used~0=~b$w_buff1_used~0_In1670576863, ~b$r_buff1_thd3~0=~b$r_buff1_thd3~0_In1670576863} OutVars{~b$w_buff0_used~0=~b$w_buff0_used~0_In1670576863, ~b$r_buff0_thd3~0=~b$r_buff0_thd3~0_In1670576863, ~b$w_buff1_used~0=~b$w_buff1_used~0_In1670576863, P2Thread1of1ForFork1_#t~ite41=|P2Thread1of1ForFork1_#t~ite41_Out1670576863|, ~b$r_buff1_thd3~0=~b$r_buff1_thd3~0_In1670576863} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite41] because there is no mapped edge [2019-12-18 13:17:19,633 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [839] [839] L822-->L822-2: Formula: (let ((.cse1 (= (mod ~b$r_buff0_thd3~0_In-1251179043 256) 0)) (.cse0 (= 0 (mod ~b$w_buff0_used~0_In-1251179043 256)))) (or (and (not .cse0) (= |P2Thread1of1ForFork1_#t~ite42_Out-1251179043| 0) (not .cse1)) (and (or .cse1 .cse0) (= |P2Thread1of1ForFork1_#t~ite42_Out-1251179043| ~b$r_buff0_thd3~0_In-1251179043)))) InVars {~b$w_buff0_used~0=~b$w_buff0_used~0_In-1251179043, ~b$r_buff0_thd3~0=~b$r_buff0_thd3~0_In-1251179043} OutVars{~b$w_buff0_used~0=~b$w_buff0_used~0_In-1251179043, ~b$r_buff0_thd3~0=~b$r_buff0_thd3~0_In-1251179043, P2Thread1of1ForFork1_#t~ite42=|P2Thread1of1ForFork1_#t~ite42_Out-1251179043|} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite42] because there is no mapped edge [2019-12-18 13:17:19,634 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [829] [829] L823-->L823-2: Formula: (let ((.cse0 (= 0 (mod ~b$r_buff0_thd3~0_In325690761 256))) (.cse1 (= (mod ~b$w_buff0_used~0_In325690761 256) 0)) (.cse3 (= (mod ~b$w_buff1_used~0_In325690761 256) 0)) (.cse2 (= (mod ~b$r_buff1_thd3~0_In325690761 256) 0))) (or (and (= |P2Thread1of1ForFork1_#t~ite43_Out325690761| ~b$r_buff1_thd3~0_In325690761) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= 0 |P2Thread1of1ForFork1_#t~ite43_Out325690761|) (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2)))))) InVars {~b$w_buff0_used~0=~b$w_buff0_used~0_In325690761, ~b$r_buff0_thd3~0=~b$r_buff0_thd3~0_In325690761, ~b$w_buff1_used~0=~b$w_buff1_used~0_In325690761, ~b$r_buff1_thd3~0=~b$r_buff1_thd3~0_In325690761} OutVars{~b$w_buff0_used~0=~b$w_buff0_used~0_In325690761, ~b$r_buff0_thd3~0=~b$r_buff0_thd3~0_In325690761, P2Thread1of1ForFork1_#t~ite43=|P2Thread1of1ForFork1_#t~ite43_Out325690761|, ~b$w_buff1_used~0=~b$w_buff1_used~0_In325690761, ~b$r_buff1_thd3~0=~b$r_buff1_thd3~0_In325690761} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite43] because there is no mapped edge [2019-12-18 13:17:19,634 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [859] [859] L823-2-->P2EXIT: Formula: (and (= 0 |v_P2Thread1of1ForFork1_#res.offset_5|) (= 0 |v_P2Thread1of1ForFork1_#res.base_5|) (= |v_P2Thread1of1ForFork1_#t~ite43_44| v_~b$r_buff1_thd3~0_140) (= (+ v_~__unbuffered_cnt~0_63 1) v_~__unbuffered_cnt~0_62)) InVars {P2Thread1of1ForFork1_#t~ite43=|v_P2Thread1of1ForFork1_#t~ite43_44|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_63} OutVars{P2Thread1of1ForFork1_#t~ite43=|v_P2Thread1of1ForFork1_#t~ite43_43|, P2Thread1of1ForFork1_#res.base=|v_P2Thread1of1ForFork1_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_62, ~b$r_buff1_thd3~0=v_~b$r_buff1_thd3~0_140, P2Thread1of1ForFork1_#res.offset=|v_P2Thread1of1ForFork1_#res.offset_5|} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite43, P2Thread1of1ForFork1_#res.base, ~__unbuffered_cnt~0, ~b$r_buff1_thd3~0, P2Thread1of1ForFork1_#res.offset] because there is no mapped edge [2019-12-18 13:17:19,635 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [847] [847] L755-->L755-2: Formula: (let ((.cse0 (= 0 (mod ~b$w_buff0_used~0_In-896659464 256))) (.cse1 (= 0 (mod ~b$r_buff0_thd1~0_In-896659464 256)))) (or (and (= ~b$w_buff0_used~0_In-896659464 |P0Thread1of1ForFork2_#t~ite5_Out-896659464|) (or .cse0 .cse1)) (and (not .cse0) (= 0 |P0Thread1of1ForFork2_#t~ite5_Out-896659464|) (not .cse1)))) InVars {~b$w_buff0_used~0=~b$w_buff0_used~0_In-896659464, ~b$r_buff0_thd1~0=~b$r_buff0_thd1~0_In-896659464} OutVars{~b$w_buff0_used~0=~b$w_buff0_used~0_In-896659464, ~b$r_buff0_thd1~0=~b$r_buff0_thd1~0_In-896659464, P0Thread1of1ForFork2_#t~ite5=|P0Thread1of1ForFork2_#t~ite5_Out-896659464|} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite5] because there is no mapped edge [2019-12-18 13:17:19,636 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [837] [837] L756-->L756-2: Formula: (let ((.cse3 (= (mod ~b$r_buff1_thd1~0_In-1710584297 256) 0)) (.cse2 (= 0 (mod ~b$w_buff1_used~0_In-1710584297 256))) (.cse1 (= (mod ~b$w_buff0_used~0_In-1710584297 256) 0)) (.cse0 (= (mod ~b$r_buff0_thd1~0_In-1710584297 256) 0))) (or (and (or .cse0 .cse1) (= |P0Thread1of1ForFork2_#t~ite6_Out-1710584297| ~b$w_buff1_used~0_In-1710584297) (or .cse2 .cse3)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0))) (= 0 |P0Thread1of1ForFork2_#t~ite6_Out-1710584297|)))) InVars {~b$w_buff0_used~0=~b$w_buff0_used~0_In-1710584297, ~b$r_buff0_thd1~0=~b$r_buff0_thd1~0_In-1710584297, ~b$r_buff1_thd1~0=~b$r_buff1_thd1~0_In-1710584297, ~b$w_buff1_used~0=~b$w_buff1_used~0_In-1710584297} OutVars{~b$w_buff0_used~0=~b$w_buff0_used~0_In-1710584297, ~b$r_buff0_thd1~0=~b$r_buff0_thd1~0_In-1710584297, ~b$r_buff1_thd1~0=~b$r_buff1_thd1~0_In-1710584297, ~b$w_buff1_used~0=~b$w_buff1_used~0_In-1710584297, P0Thread1of1ForFork2_#t~ite6=|P0Thread1of1ForFork2_#t~ite6_Out-1710584297|} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite6] because there is no mapped edge [2019-12-18 13:17:19,637 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [841] [841] L757-->L758: Formula: (let ((.cse1 (= 0 (mod ~b$r_buff0_thd1~0_In-1171663172 256))) (.cse0 (= (mod ~b$w_buff0_used~0_In-1171663172 256) 0))) (or (and (not .cse0) (not .cse1) (= 0 ~b$r_buff0_thd1~0_Out-1171663172)) (and (or .cse1 .cse0) (= ~b$r_buff0_thd1~0_In-1171663172 ~b$r_buff0_thd1~0_Out-1171663172)))) InVars {~b$w_buff0_used~0=~b$w_buff0_used~0_In-1171663172, ~b$r_buff0_thd1~0=~b$r_buff0_thd1~0_In-1171663172} OutVars{~b$w_buff0_used~0=~b$w_buff0_used~0_In-1171663172, ~b$r_buff0_thd1~0=~b$r_buff0_thd1~0_Out-1171663172, P0Thread1of1ForFork2_#t~ite7=|P0Thread1of1ForFork2_#t~ite7_Out-1171663172|} AuxVars[] AssignedVars[~b$r_buff0_thd1~0, P0Thread1of1ForFork2_#t~ite7] because there is no mapped edge [2019-12-18 13:17:19,637 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [833] [833] L758-->L758-2: Formula: (let ((.cse3 (= 0 (mod ~b$r_buff1_thd1~0_In135087458 256))) (.cse2 (= (mod ~b$w_buff1_used~0_In135087458 256) 0)) (.cse1 (= (mod ~b$w_buff0_used~0_In135087458 256) 0)) (.cse0 (= (mod ~b$r_buff0_thd1~0_In135087458 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P0Thread1of1ForFork2_#t~ite8_Out135087458| 0)) (and (or .cse3 .cse2) (or .cse1 .cse0) (= ~b$r_buff1_thd1~0_In135087458 |P0Thread1of1ForFork2_#t~ite8_Out135087458|)))) InVars {~b$w_buff0_used~0=~b$w_buff0_used~0_In135087458, ~b$r_buff0_thd1~0=~b$r_buff0_thd1~0_In135087458, ~b$r_buff1_thd1~0=~b$r_buff1_thd1~0_In135087458, ~b$w_buff1_used~0=~b$w_buff1_used~0_In135087458} OutVars{~b$w_buff0_used~0=~b$w_buff0_used~0_In135087458, ~b$r_buff0_thd1~0=~b$r_buff0_thd1~0_In135087458, ~b$r_buff1_thd1~0=~b$r_buff1_thd1~0_In135087458, ~b$w_buff1_used~0=~b$w_buff1_used~0_In135087458, P0Thread1of1ForFork2_#t~ite8=|P0Thread1of1ForFork2_#t~ite8_Out135087458|} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite8] because there is no mapped edge [2019-12-18 13:17:19,637 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [868] [868] L758-2-->P0EXIT: Formula: (and (= |v_P0Thread1of1ForFork2_#res.offset_5| 0) (= 0 |v_P0Thread1of1ForFork2_#res.base_5|) (= |v_P0Thread1of1ForFork2_#t~ite8_36| v_~b$r_buff1_thd1~0_103) (= (+ v_~__unbuffered_cnt~0_81 1) v_~__unbuffered_cnt~0_80)) InVars {P0Thread1of1ForFork2_#t~ite8=|v_P0Thread1of1ForFork2_#t~ite8_36|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_81} OutVars{~b$r_buff1_thd1~0=v_~b$r_buff1_thd1~0_103, P0Thread1of1ForFork2_#t~ite8=|v_P0Thread1of1ForFork2_#t~ite8_35|, P0Thread1of1ForFork2_#res.offset=|v_P0Thread1of1ForFork2_#res.offset_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_80, P0Thread1of1ForFork2_#res.base=|v_P0Thread1of1ForFork2_#res.base_5|} AuxVars[] AssignedVars[~b$r_buff1_thd1~0, P0Thread1of1ForFork2_#t~ite8, P0Thread1of1ForFork2_#res.offset, ~__unbuffered_cnt~0, P0Thread1of1ForFork2_#res.base] because there is no mapped edge [2019-12-18 13:17:19,637 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [766] [766] L846-1-->L852: Formula: (and (= 3 v_~__unbuffered_cnt~0_33) (= v_~main$tmp_guard0~0_8 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_33} OutVars{ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_33, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet46, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-18 13:17:19,638 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [831] [831] L852-2-->L852-4: Formula: (let ((.cse0 (= (mod ~b$r_buff1_thd0~0_In-837934623 256) 0)) (.cse1 (= (mod ~b$w_buff1_used~0_In-837934623 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite47_Out-837934623| ~b~0_In-837934623) (or .cse0 .cse1)) (and (not .cse0) (= ~b$w_buff1~0_In-837934623 |ULTIMATE.start_main_#t~ite47_Out-837934623|) (not .cse1)))) InVars {~b$r_buff1_thd0~0=~b$r_buff1_thd0~0_In-837934623, ~b$w_buff1_used~0=~b$w_buff1_used~0_In-837934623, ~b~0=~b~0_In-837934623, ~b$w_buff1~0=~b$w_buff1~0_In-837934623} OutVars{~b$r_buff1_thd0~0=~b$r_buff1_thd0~0_In-837934623, ~b$w_buff1_used~0=~b$w_buff1_used~0_In-837934623, ~b~0=~b~0_In-837934623, ULTIMATE.start_main_#t~ite47=|ULTIMATE.start_main_#t~ite47_Out-837934623|, ~b$w_buff1~0=~b$w_buff1~0_In-837934623} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite47] because there is no mapped edge [2019-12-18 13:17:19,638 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [798] [798] L852-4-->L853: Formula: (= v_~b~0_51 |v_ULTIMATE.start_main_#t~ite47_11|) InVars {ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_11|} OutVars{~b~0=v_~b~0_51, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_10|, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_6|} AuxVars[] AssignedVars[~b~0, ULTIMATE.start_main_#t~ite47, ULTIMATE.start_main_#t~ite48] because there is no mapped edge [2019-12-18 13:17:19,638 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [842] [842] L853-->L853-2: Formula: (let ((.cse0 (= (mod ~b$r_buff0_thd0~0_In-1960795915 256) 0)) (.cse1 (= 0 (mod ~b$w_buff0_used~0_In-1960795915 256)))) (or (and (= ~b$w_buff0_used~0_In-1960795915 |ULTIMATE.start_main_#t~ite49_Out-1960795915|) (or .cse0 .cse1)) (and (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite49_Out-1960795915|) (not .cse1)))) InVars {~b$w_buff0_used~0=~b$w_buff0_used~0_In-1960795915, ~b$r_buff0_thd0~0=~b$r_buff0_thd0~0_In-1960795915} OutVars{~b$w_buff0_used~0=~b$w_buff0_used~0_In-1960795915, ULTIMATE.start_main_#t~ite49=|ULTIMATE.start_main_#t~ite49_Out-1960795915|, ~b$r_buff0_thd0~0=~b$r_buff0_thd0~0_In-1960795915} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite49] because there is no mapped edge [2019-12-18 13:17:19,639 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [853] [853] L854-->L854-2: Formula: (let ((.cse2 (= 0 (mod ~b$w_buff1_used~0_In-1035363642 256))) (.cse3 (= 0 (mod ~b$r_buff1_thd0~0_In-1035363642 256))) (.cse0 (= (mod ~b$r_buff0_thd0~0_In-1035363642 256) 0)) (.cse1 (= (mod ~b$w_buff0_used~0_In-1035363642 256) 0))) (or (and (= ~b$w_buff1_used~0_In-1035363642 |ULTIMATE.start_main_#t~ite50_Out-1035363642|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1))) (= 0 |ULTIMATE.start_main_#t~ite50_Out-1035363642|)))) InVars {~b$w_buff0_used~0=~b$w_buff0_used~0_In-1035363642, ~b$r_buff1_thd0~0=~b$r_buff1_thd0~0_In-1035363642, ~b$w_buff1_used~0=~b$w_buff1_used~0_In-1035363642, ~b$r_buff0_thd0~0=~b$r_buff0_thd0~0_In-1035363642} OutVars{ULTIMATE.start_main_#t~ite50=|ULTIMATE.start_main_#t~ite50_Out-1035363642|, ~b$w_buff0_used~0=~b$w_buff0_used~0_In-1035363642, ~b$r_buff1_thd0~0=~b$r_buff1_thd0~0_In-1035363642, ~b$w_buff1_used~0=~b$w_buff1_used~0_In-1035363642, ~b$r_buff0_thd0~0=~b$r_buff0_thd0~0_In-1035363642} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite50] because there is no mapped edge [2019-12-18 13:17:19,640 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [843] [843] L855-->L855-2: Formula: (let ((.cse0 (= (mod ~b$r_buff0_thd0~0_In-908902816 256) 0)) (.cse1 (= (mod ~b$w_buff0_used~0_In-908902816 256) 0))) (or (and (not .cse0) (= |ULTIMATE.start_main_#t~ite51_Out-908902816| 0) (not .cse1)) (and (= |ULTIMATE.start_main_#t~ite51_Out-908902816| ~b$r_buff0_thd0~0_In-908902816) (or .cse0 .cse1)))) InVars {~b$w_buff0_used~0=~b$w_buff0_used~0_In-908902816, ~b$r_buff0_thd0~0=~b$r_buff0_thd0~0_In-908902816} OutVars{~b$w_buff0_used~0=~b$w_buff0_used~0_In-908902816, ULTIMATE.start_main_#t~ite51=|ULTIMATE.start_main_#t~ite51_Out-908902816|, ~b$r_buff0_thd0~0=~b$r_buff0_thd0~0_In-908902816} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite51] because there is no mapped edge [2019-12-18 13:17:19,641 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [832] [832] L856-->L856-2: Formula: (let ((.cse2 (= (mod ~b$r_buff1_thd0~0_In-638706311 256) 0)) (.cse3 (= 0 (mod ~b$w_buff1_used~0_In-638706311 256))) (.cse1 (= (mod ~b$r_buff0_thd0~0_In-638706311 256) 0)) (.cse0 (= 0 (mod ~b$w_buff0_used~0_In-638706311 256)))) (or (and (= |ULTIMATE.start_main_#t~ite52_Out-638706311| ~b$r_buff1_thd0~0_In-638706311) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0))) (= |ULTIMATE.start_main_#t~ite52_Out-638706311| 0)))) InVars {~b$w_buff0_used~0=~b$w_buff0_used~0_In-638706311, ~b$r_buff1_thd0~0=~b$r_buff1_thd0~0_In-638706311, ~b$w_buff1_used~0=~b$w_buff1_used~0_In-638706311, ~b$r_buff0_thd0~0=~b$r_buff0_thd0~0_In-638706311} OutVars{~b$w_buff0_used~0=~b$w_buff0_used~0_In-638706311, ULTIMATE.start_main_#t~ite52=|ULTIMATE.start_main_#t~ite52_Out-638706311|, ~b$r_buff1_thd0~0=~b$r_buff1_thd0~0_In-638706311, ~b$w_buff1_used~0=~b$w_buff1_used~0_In-638706311, ~b$r_buff0_thd0~0=~b$r_buff0_thd0~0_In-638706311} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52] because there is no mapped edge [2019-12-18 13:17:19,642 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [890] [890] L856-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= 1 v_~__unbuffered_p2_EAX~0_19) (= v_~b$r_buff1_thd0~0_185 |v_ULTIMATE.start_main_#t~ite52_39|) (= v_~main$tmp_guard1~0_18 0) (= v_~__unbuffered_p1_EBX~0_20 0) (= 1 v_~__unbuffered_p1_EAX~0_20) (= v_ULTIMATE.start___VERIFIER_assert_~expression_16 0) (= 0 v_~__unbuffered_p0_EAX~0_139) (= v_~__unbuffered_p2_EBX~0_26 0) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_11| (mod v_~main$tmp_guard1~0_18 256))) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_139, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_39|, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_20, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_26, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_20, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_19} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_139, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_38|, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_16, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_20, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_26, ~b$r_buff1_thd0~0=v_~b$r_buff1_thd0~0_185, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_20, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_18, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_19, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52, ULTIMATE.start___VERIFIER_assert_~expression, ~b$r_buff1_thd0~0, ~main$tmp_guard1~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-18 13:17:19,724 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.12 01:17:19 BasicIcfg [2019-12-18 13:17:19,724 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-18 13:17:19,726 INFO L168 Benchmark]: Toolchain (without parser) took 109349.20 ms. Allocated memory was 139.5 MB in the beginning and 4.3 GB in the end (delta: 4.1 GB). Free memory was 102.0 MB in the beginning and 1.2 GB in the end (delta: -1.1 GB). Peak memory consumption was 3.1 GB. Max. memory is 7.1 GB. [2019-12-18 13:17:19,726 INFO L168 Benchmark]: CDTParser took 0.50 ms. Allocated memory is still 139.5 MB. Free memory is still 122.3 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-12-18 13:17:19,727 INFO L168 Benchmark]: CACSL2BoogieTranslator took 791.63 ms. Allocated memory was 139.5 MB in the beginning and 201.9 MB in the end (delta: 62.4 MB). Free memory was 102.0 MB in the beginning and 155.0 MB in the end (delta: -53.0 MB). Peak memory consumption was 26.9 MB. Max. memory is 7.1 GB. [2019-12-18 13:17:19,727 INFO L168 Benchmark]: Boogie Procedure Inliner took 63.35 ms. Allocated memory is still 201.9 MB. Free memory was 155.0 MB in the beginning and 152.3 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. [2019-12-18 13:17:19,727 INFO L168 Benchmark]: Boogie Preprocessor took 43.70 ms. Allocated memory is still 201.9 MB. Free memory was 152.3 MB in the beginning and 149.5 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. [2019-12-18 13:17:19,733 INFO L168 Benchmark]: RCFGBuilder took 867.76 ms. Allocated memory is still 201.9 MB. Free memory was 149.5 MB in the beginning and 99.1 MB in the end (delta: 50.4 MB). Peak memory consumption was 50.4 MB. Max. memory is 7.1 GB. [2019-12-18 13:17:19,733 INFO L168 Benchmark]: TraceAbstraction took 107574.36 ms. Allocated memory was 201.9 MB in the beginning and 4.3 GB in the end (delta: 4.1 GB). Free memory was 99.1 MB in the beginning and 1.2 GB in the end (delta: -1.1 GB). Peak memory consumption was 3.0 GB. Max. memory is 7.1 GB. [2019-12-18 13:17:19,736 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.50 ms. Allocated memory is still 139.5 MB. Free memory is still 122.3 MB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 791.63 ms. Allocated memory was 139.5 MB in the beginning and 201.9 MB in the end (delta: 62.4 MB). Free memory was 102.0 MB in the beginning and 155.0 MB in the end (delta: -53.0 MB). Peak memory consumption was 26.9 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 63.35 ms. Allocated memory is still 201.9 MB. Free memory was 155.0 MB in the beginning and 152.3 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 43.70 ms. Allocated memory is still 201.9 MB. Free memory was 152.3 MB in the beginning and 149.5 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. * RCFGBuilder took 867.76 ms. Allocated memory is still 201.9 MB. Free memory was 149.5 MB in the beginning and 99.1 MB in the end (delta: 50.4 MB). Peak memory consumption was 50.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 107574.36 ms. Allocated memory was 201.9 MB in the beginning and 4.3 GB in the end (delta: 4.1 GB). Free memory was 99.1 MB in the beginning and 1.2 GB in the end (delta: -1.1 GB). Peak memory consumption was 3.0 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 6.1s, 180 ProgramPointsBefore, 96 ProgramPointsAfterwards, 217 TransitionsBefore, 105 TransitionsAfterwards, 19004 CoEnabledTransitionPairs, 7 FixpointIterations, 37 TrivialSequentialCompositions, 47 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 31 ConcurrentYvCompositions, 32 ChoiceCompositions, 7698 VarBasedMoverChecksPositive, 261 VarBasedMoverChecksNegative, 64 SemBasedMoverChecksPositive, 271 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.9s, 0 MoverChecksTotal, 83556 CheckedPairsTotal, 115 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L842] FCALL, FORK 0 pthread_create(&t849, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=0, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=0, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L844] FCALL, FORK 0 pthread_create(&t850, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=0, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=0, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L846] FCALL, FORK 0 pthread_create(&t851, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=0, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=0, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L739] 1 b$w_buff1 = b$w_buff0 [L740] 1 b$w_buff0 = 1 [L741] 1 b$w_buff1_used = b$w_buff0_used [L742] 1 b$w_buff0_used = (_Bool)1 [L754] EXPR 1 b$w_buff0_used && b$r_buff0_thd1 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd1 ? b$w_buff1 : b) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L768] 2 x = 1 [L771] 2 y = 1 [L774] 2 __unbuffered_p1_EAX = y [L777] 2 __unbuffered_p1_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L780] 2 b$w_buff0_used && b$r_buff0_thd2 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd2 ? b$w_buff1 : b) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L754] 1 b = b$w_buff0_used && b$r_buff0_thd1 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd1 ? b$w_buff1 : b) [L781] 2 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd2 ? (_Bool)0 : b$w_buff0_used [L782] 2 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd2 || b$w_buff1_used && b$r_buff1_thd2 ? (_Bool)0 : b$w_buff1_used [L783] 2 b$r_buff0_thd2 = b$w_buff0_used && b$r_buff0_thd2 ? (_Bool)0 : b$r_buff0_thd2 [L794] 3 z = 1 [L797] 3 a = 1 [L800] 3 __unbuffered_p2_EAX = a [L803] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L804] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L805] 3 b$flush_delayed = weak$$choice2 [L806] 3 b$mem_tmp = b VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=1, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=1, z=1] [L807] EXPR 3 !b$w_buff0_used || !b$r_buff0_thd3 && !b$w_buff1_used || !b$r_buff0_thd3 && !b$r_buff1_thd3 ? b : (b$w_buff0_used && b$r_buff0_thd3 ? b$w_buff0 : b$w_buff1) VAL [!b$w_buff0_used || !b$r_buff0_thd3 && !b$w_buff1_used || !b$r_buff0_thd3 && !b$r_buff1_thd3 ? b : (b$w_buff0_used && b$r_buff0_thd3 ? b$w_buff0 : b$w_buff1)=0, \result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=1, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=1, z=1] [L807] 3 b = !b$w_buff0_used || !b$r_buff0_thd3 && !b$w_buff1_used || !b$r_buff0_thd3 && !b$r_buff1_thd3 ? b : (b$w_buff0_used && b$r_buff0_thd3 ? b$w_buff0 : b$w_buff1) [L808] 3 b$w_buff0 = weak$$choice2 ? b$w_buff0 : (!b$w_buff0_used || !b$r_buff0_thd3 && !b$w_buff1_used || !b$r_buff0_thd3 && !b$r_buff1_thd3 ? b$w_buff0 : (b$w_buff0_used && b$r_buff0_thd3 ? b$w_buff0 : b$w_buff0)) [L809] EXPR 3 weak$$choice2 ? b$w_buff1 : (!b$w_buff0_used || !b$r_buff0_thd3 && !b$w_buff1_used || !b$r_buff0_thd3 && !b$r_buff1_thd3 ? b$w_buff1 : (b$w_buff0_used && b$r_buff0_thd3 ? b$w_buff1 : b$w_buff1)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=1, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? b$w_buff1 : (!b$w_buff0_used || !b$r_buff0_thd3 && !b$w_buff1_used || !b$r_buff0_thd3 && !b$r_buff1_thd3 ? b$w_buff1 : (b$w_buff0_used && b$r_buff0_thd3 ? b$w_buff1 : b$w_buff1))=0, x=1, y=1, z=1] [L809] 3 b$w_buff1 = weak$$choice2 ? b$w_buff1 : (!b$w_buff0_used || !b$r_buff0_thd3 && !b$w_buff1_used || !b$r_buff0_thd3 && !b$r_buff1_thd3 ? b$w_buff1 : (b$w_buff0_used && b$r_buff0_thd3 ? b$w_buff1 : b$w_buff1)) [L810] 3 b$w_buff0_used = weak$$choice2 ? b$w_buff0_used : (!b$w_buff0_used || !b$r_buff0_thd3 && !b$w_buff1_used || !b$r_buff0_thd3 && !b$r_buff1_thd3 ? b$w_buff0_used : (b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : b$w_buff0_used)) [L811] EXPR 3 weak$$choice2 ? b$w_buff1_used : (!b$w_buff0_used || !b$r_buff0_thd3 && !b$w_buff1_used || !b$r_buff0_thd3 && !b$r_buff1_thd3 ? b$w_buff1_used : (b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=1, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? b$w_buff1_used : (!b$w_buff0_used || !b$r_buff0_thd3 && !b$w_buff1_used || !b$r_buff0_thd3 && !b$r_buff1_thd3 ? b$w_buff1_used : (b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))=0, x=1, y=1, z=1] [L811] 3 b$w_buff1_used = weak$$choice2 ? b$w_buff1_used : (!b$w_buff0_used || !b$r_buff0_thd3 && !b$w_buff1_used || !b$r_buff0_thd3 && !b$r_buff1_thd3 ? b$w_buff1_used : (b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L813] EXPR 3 weak$$choice2 ? b$r_buff1_thd3 : (!b$w_buff0_used || !b$r_buff0_thd3 && !b$w_buff1_used || !b$r_buff0_thd3 && !b$r_buff1_thd3 ? b$r_buff1_thd3 : (b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=1, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? b$r_buff1_thd3 : (!b$w_buff0_used || !b$r_buff0_thd3 && !b$w_buff1_used || !b$r_buff0_thd3 && !b$r_buff1_thd3 ? b$r_buff1_thd3 : (b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))=0, x=1, y=1, z=1] [L813] 3 b$r_buff1_thd3 = weak$$choice2 ? b$r_buff1_thd3 : (!b$w_buff0_used || !b$r_buff0_thd3 && !b$w_buff1_used || !b$r_buff0_thd3 && !b$r_buff1_thd3 ? b$r_buff1_thd3 : (b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L814] 3 __unbuffered_p2_EBX = b VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=1, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=1, z=1] [L819] 3 b$w_buff0_used && b$r_buff0_thd3 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd3 ? b$w_buff1 : b) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=1, z=1] [L820] 3 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : b$w_buff0_used [L821] 3 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd3 || b$w_buff1_used && b$r_buff1_thd3 ? (_Bool)0 : b$w_buff1_used [L822] 3 b$r_buff0_thd3 = b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : b$r_buff0_thd3 [L755] 1 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd1 ? (_Bool)0 : b$w_buff0_used [L756] 1 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd1 || b$w_buff1_used && b$r_buff1_thd1 ? (_Bool)0 : b$w_buff1_used [L852] 0 b$w_buff0_used && b$r_buff0_thd0 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd0 ? b$w_buff1 : b) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=1, z=1] [L853] 0 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd0 ? (_Bool)0 : b$w_buff0_used [L854] 0 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd0 || b$w_buff1_used && b$r_buff1_thd0 ? (_Bool)0 : b$w_buff1_used [L855] 0 b$r_buff0_thd0 = b$w_buff0_used && b$r_buff0_thd0 ? (_Bool)0 : b$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 171 locations, 2 error locations. Result: UNSAFE, OverallTime: 107.2s, OverallIterations: 32, TraceHistogramMax: 1, AutomataDifference: 31.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 6776 SDtfs, 10637 SDslu, 23447 SDs, 0 SdLazy, 10735 SolverSat, 426 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 9.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 401 GetRequests, 68 SyntacticMatches, 10 SemanticMatches, 323 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1161 ImplicationChecksByTransitivity, 4.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=171775occurred 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: 42.5s AutomataMinimizationTime, 31 MinimizatonAttempts, 168331 StatesRemovedByMinimization, 26 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.5s InterpolantComputationTime, 1579 NumberOfCodeBlocks, 1579 NumberOfCodeBlocksAsserted, 32 NumberOfCheckSat, 1481 ConstructedInterpolants, 0 QuantifiedInterpolants, 265493 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 31 InterpolantComputations, 31 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...