/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/mix031_rmo.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-fae578e [2019-12-18 13:15:04,957 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-18 13:15:04,959 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-18 13:15:04,972 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-18 13:15:04,973 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-18 13:15:04,974 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-18 13:15:04,975 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-18 13:15:04,977 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-18 13:15:04,979 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-18 13:15:04,980 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-18 13:15:04,981 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-18 13:15:04,982 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-18 13:15:04,982 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-18 13:15:04,983 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-18 13:15:04,984 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-18 13:15:04,985 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-18 13:15:04,986 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-18 13:15:04,988 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-18 13:15:04,990 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-18 13:15:04,994 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-18 13:15:04,996 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-18 13:15:05,001 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-18 13:15:05,003 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-18 13:15:05,004 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-18 13:15:05,006 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-18 13:15:05,006 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-18 13:15:05,007 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-18 13:15:05,007 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-18 13:15:05,010 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-18 13:15:05,011 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-18 13:15:05,012 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-18 13:15:05,012 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-18 13:15:05,016 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-18 13:15:05,017 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-18 13:15:05,018 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-18 13:15:05,018 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-18 13:15:05,019 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-18 13:15:05,019 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-18 13:15:05,020 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-18 13:15:05,024 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-18 13:15:05,028 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-18 13:15:05,029 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:05,050 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-18 13:15:05,050 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-18 13:15:05,052 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-18 13:15:05,052 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-18 13:15:05,052 INFO L138 SettingsManager]: * Use SBE=true [2019-12-18 13:15:05,053 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-18 13:15:05,053 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-18 13:15:05,053 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-18 13:15:05,053 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-18 13:15:05,053 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-18 13:15:05,055 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-18 13:15:05,055 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-18 13:15:05,055 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-18 13:15:05,056 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-18 13:15:05,056 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-18 13:15:05,056 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-18 13:15:05,056 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-18 13:15:05,057 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-18 13:15:05,057 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-18 13:15:05,057 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-18 13:15:05,057 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-18 13:15:05,058 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 13:15:05,058 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-18 13:15:05,058 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-18 13:15:05,058 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-18 13:15:05,059 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-18 13:15:05,059 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-18 13:15:05,059 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-18 13:15:05,059 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-18 13:15:05,059 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-18 13:15:05,351 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-18 13:15:05,364 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-18 13:15:05,367 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-18 13:15:05,369 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-18 13:15:05,369 INFO L275 PluginConnector]: CDTParser initialized [2019-12-18 13:15:05,370 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix031_rmo.oepc.i [2019-12-18 13:15:05,438 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0109fdf01/fd4c4fb688af4b9b905bed1034e835fe/FLAG0accdbba7 [2019-12-18 13:15:05,983 INFO L306 CDTParser]: Found 1 translation units. [2019-12-18 13:15:05,983 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix031_rmo.oepc.i [2019-12-18 13:15:06,004 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0109fdf01/fd4c4fb688af4b9b905bed1034e835fe/FLAG0accdbba7 [2019-12-18 13:15:06,266 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0109fdf01/fd4c4fb688af4b9b905bed1034e835fe [2019-12-18 13:15:06,276 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-18 13:15:06,278 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-18 13:15:06,280 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-18 13:15:06,281 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-18 13:15:06,284 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-18 13:15:06,285 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 01:15:06" (1/1) ... [2019-12-18 13:15:06,288 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@32100126 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:15:06, skipping insertion in model container [2019-12-18 13:15:06,288 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 01:15:06" (1/1) ... [2019-12-18 13:15:06,296 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-18 13:15:06,358 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-18 13:15:06,927 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 13:15:06,943 INFO L203 MainTranslator]: Completed pre-run [2019-12-18 13:15:07,022 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 13:15:07,090 INFO L208 MainTranslator]: Completed translation [2019-12-18 13:15:07,091 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:15:07 WrapperNode [2019-12-18 13:15:07,091 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-18 13:15:07,092 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-18 13:15:07,092 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-18 13:15:07,092 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-18 13:15:07,101 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:07" (1/1) ... [2019-12-18 13:15:07,120 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:07" (1/1) ... [2019-12-18 13:15:07,150 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-18 13:15:07,151 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-18 13:15:07,151 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-18 13:15:07,151 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-18 13:15:07,160 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:07" (1/1) ... [2019-12-18 13:15:07,160 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:07" (1/1) ... [2019-12-18 13:15:07,166 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:07" (1/1) ... [2019-12-18 13:15:07,166 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:07" (1/1) ... [2019-12-18 13:15:07,182 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:07" (1/1) ... [2019-12-18 13:15:07,188 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:07" (1/1) ... [2019-12-18 13:15:07,191 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:07" (1/1) ... [2019-12-18 13:15:07,210 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-18 13:15:07,210 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-18 13:15:07,211 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-18 13:15:07,211 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-18 13:15:07,214 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:15:07" (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:07,277 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-18 13:15:07,277 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-18 13:15:07,278 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-18 13:15:07,278 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-18 13:15:07,278 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-18 13:15:07,278 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-18 13:15:07,278 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-18 13:15:07,279 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-18 13:15:07,279 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-18 13:15:07,279 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-18 13:15:07,279 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-18 13:15:07,281 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:08,017 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-18 13:15:08,017 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-18 13:15:08,018 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 01:15:08 BoogieIcfgContainer [2019-12-18 13:15:08,019 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-18 13:15:08,021 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-18 13:15:08,021 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-18 13:15:08,024 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-18 13:15:08,024 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 01:15:06" (1/3) ... [2019-12-18 13:15:08,025 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@531f545d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 01:15:08, skipping insertion in model container [2019-12-18 13:15:08,025 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:15:07" (2/3) ... [2019-12-18 13:15:08,026 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@531f545d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 01:15:08, skipping insertion in model container [2019-12-18 13:15:08,026 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 01:15:08" (3/3) ... [2019-12-18 13:15:08,028 INFO L109 eAbstractionObserver]: Analyzing ICFG mix031_rmo.oepc.i [2019-12-18 13:15:08,038 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-18 13:15:08,039 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-18 13:15:08,046 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-18 13:15:08,048 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-18 13:15:08,085 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:08,086 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:08,086 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:08,086 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:08,086 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:08,087 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:08,087 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:08,087 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:08,088 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:08,088 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:08,088 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:08,089 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:08,089 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:08,089 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:08,090 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:08,090 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:08,090 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:08,090 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:08,091 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:08,091 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:08,091 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:08,091 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:08,092 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:08,092 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:08,092 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:08,092 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:08,093 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:08,093 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:08,093 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:08,093 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:08,094 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:08,094 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:08,094 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:08,094 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:08,096 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:08,096 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:08,096 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:08,096 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:08,096 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:08,097 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:08,097 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:08,097 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:08,097 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:08,098 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:08,098 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:08,098 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:08,099 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:08,099 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:08,099 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:08,100 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:08,100 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:08,100 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:08,100 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:08,101 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:08,101 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:08,101 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:08,101 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:08,102 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:08,102 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:08,102 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:08,102 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:08,103 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:08,103 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:08,103 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:08,103 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:08,104 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:08,104 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:08,104 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:08,104 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:08,105 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:08,105 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:08,105 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:08,105 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:08,106 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:08,106 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:08,106 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:08,106 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:08,106 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:08,107 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:08,107 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:08,107 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:08,108 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:08,108 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:08,108 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:08,108 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:08,109 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:08,109 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:08,109 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:08,109 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:08,109 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:08,110 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:08,110 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:08,110 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:08,110 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:08,111 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:08,111 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:08,111 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:08,112 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:08,112 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:08,112 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:08,112 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:08,112 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:08,113 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:08,113 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:08,113 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:08,114 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:08,114 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:08,114 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:08,114 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:08,115 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:08,115 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:08,115 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:08,130 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:08,134 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:08,135 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:08,135 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:08,135 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:08,135 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:08,135 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:08,136 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:08,136 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:08,136 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:08,136 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:08,137 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:08,137 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:08,137 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:08,137 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:08,138 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:08,138 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:08,138 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:08,138 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:08,139 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:08,139 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:08,139 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:08,139 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:08,139 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:08,140 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:08,140 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:08,140 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:08,140 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:08,140 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:08,141 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:08,141 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:08,141 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:08,141 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:08,141 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:08,142 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:08,142 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:08,142 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:08,142 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:08,142 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:08,143 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:08,146 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:08,146 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:08,146 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:08,147 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:08,147 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:08,147 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:08,147 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:08,147 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:08,148 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:08,148 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:08,148 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:08,148 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:08,153 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:08,153 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:08,153 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:08,153 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:08,154 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:08,155 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:08,155 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:08,155 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:08,155 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:08,155 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:08,156 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:08,157 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:08,157 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:08,158 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:08,158 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:08,158 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:08,158 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:08,158 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:08,158 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:08,159 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:08,159 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:08,159 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:08,159 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:08,159 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:08,160 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:08,160 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:08,160 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:08,160 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:08,160 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:08,160 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:08,161 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:08,161 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:08,161 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:08,181 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-18 13:15:08,198 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-18 13:15:08,199 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-18 13:15:08,199 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-18 13:15:08,199 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-18 13:15:08,199 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-18 13:15:08,199 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-18 13:15:08,199 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-18 13:15:08,200 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-18 13:15:08,219 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 151 places, 185 transitions [2019-12-18 13:15:08,221 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 151 places, 185 transitions [2019-12-18 13:15:08,327 INFO L126 PetriNetUnfolder]: 41/183 cut-off events. [2019-12-18 13:15:08,327 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 13:15:08,345 INFO L76 FinitePrefix]: Finished finitePrefix Result has 190 conditions, 183 events. 41/183 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 341 event pairs. 6/146 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-12-18 13:15:08,363 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 151 places, 185 transitions [2019-12-18 13:15:08,436 INFO L126 PetriNetUnfolder]: 41/183 cut-off events. [2019-12-18 13:15:08,437 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 13:15:08,445 INFO L76 FinitePrefix]: Finished finitePrefix Result has 190 conditions, 183 events. 41/183 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 341 event pairs. 6/146 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-12-18 13:15:08,461 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 12056 [2019-12-18 13:15:08,462 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-18 13:15:13,782 WARN L192 SmtUtils]: Spent 255.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 89 [2019-12-18 13:15:13,903 WARN L192 SmtUtils]: Spent 117.00 ms on a formula simplification that was a NOOP. DAG size: 87 [2019-12-18 13:15:13,927 INFO L206 etLargeBlockEncoding]: Checked pairs total: 55357 [2019-12-18 13:15:13,927 INFO L214 etLargeBlockEncoding]: Total number of compositions: 107 [2019-12-18 13:15:13,931 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 77 places, 89 transitions [2019-12-18 13:15:14,400 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 8640 states. [2019-12-18 13:15:14,402 INFO L276 IsEmpty]: Start isEmpty. Operand 8640 states. [2019-12-18 13:15:14,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-18 13:15:14,408 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:15:14,409 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-18 13:15:14,410 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:15:14,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:15:14,416 INFO L82 PathProgramCache]: Analyzing trace with hash 801135, now seen corresponding path program 1 times [2019-12-18 13:15:14,425 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:15:14,426 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1422364879] [2019-12-18 13:15:14,426 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:15:14,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:15:14,634 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:15:14,634 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1422364879] [2019-12-18 13:15:14,635 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:15:14,636 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 13:15:14,636 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1653905119] [2019-12-18 13:15:14,641 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 13:15:14,641 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:15:14,657 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 13:15:14,658 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 13:15:14,660 INFO L87 Difference]: Start difference. First operand 8640 states. Second operand 3 states. [2019-12-18 13:15:14,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:15:14,934 INFO L93 Difference]: Finished difference Result 8472 states and 28002 transitions. [2019-12-18 13:15:14,934 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 13:15:14,936 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-18 13:15:14,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:15:15,018 INFO L225 Difference]: With dead ends: 8472 [2019-12-18 13:15:15,019 INFO L226 Difference]: Without dead ends: 7980 [2019-12-18 13:15:15,020 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:15:15,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7980 states. [2019-12-18 13:15:15,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7980 to 7980. [2019-12-18 13:15:15,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7980 states. [2019-12-18 13:15:15,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7980 states to 7980 states and 26329 transitions. [2019-12-18 13:15:15,422 INFO L78 Accepts]: Start accepts. Automaton has 7980 states and 26329 transitions. Word has length 3 [2019-12-18 13:15:15,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:15:15,423 INFO L462 AbstractCegarLoop]: Abstraction has 7980 states and 26329 transitions. [2019-12-18 13:15:15,423 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 13:15:15,424 INFO L276 IsEmpty]: Start isEmpty. Operand 7980 states and 26329 transitions. [2019-12-18 13:15:15,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-18 13:15:15,429 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:15:15,429 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:15:15,430 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:15:15,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:15:15,430 INFO L82 PathProgramCache]: Analyzing trace with hash -337363797, now seen corresponding path program 1 times [2019-12-18 13:15:15,430 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:15:15,431 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [882631664] [2019-12-18 13:15:15,431 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:15:15,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:15:15,543 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:15:15,543 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [882631664] [2019-12-18 13:15:15,544 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:15:15,544 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 13:15:15,544 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1764694386] [2019-12-18 13:15:15,546 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 13:15:15,546 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:15:15,547 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 13:15:15,547 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 13:15:15,547 INFO L87 Difference]: Start difference. First operand 7980 states and 26329 transitions. Second operand 3 states. [2019-12-18 13:15:15,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:15:15,570 INFO L93 Difference]: Finished difference Result 1284 states and 2972 transitions. [2019-12-18 13:15:15,570 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 13:15:15,571 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2019-12-18 13:15:15,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:15:15,579 INFO L225 Difference]: With dead ends: 1284 [2019-12-18 13:15:15,579 INFO L226 Difference]: Without dead ends: 1284 [2019-12-18 13:15:15,580 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:15:15,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1284 states. [2019-12-18 13:15:15,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1284 to 1284. [2019-12-18 13:15:15,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1284 states. [2019-12-18 13:15:15,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1284 states to 1284 states and 2972 transitions. [2019-12-18 13:15:15,619 INFO L78 Accepts]: Start accepts. Automaton has 1284 states and 2972 transitions. Word has length 11 [2019-12-18 13:15:15,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:15:15,619 INFO L462 AbstractCegarLoop]: Abstraction has 1284 states and 2972 transitions. [2019-12-18 13:15:15,620 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 13:15:15,620 INFO L276 IsEmpty]: Start isEmpty. Operand 1284 states and 2972 transitions. [2019-12-18 13:15:15,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-18 13:15:15,621 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:15:15,621 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:15:15,622 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:15:15,622 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:15:15,622 INFO L82 PathProgramCache]: Analyzing trace with hash 254708639, now seen corresponding path program 1 times [2019-12-18 13:15:15,622 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:15:15,623 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2079709380] [2019-12-18 13:15:15,623 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:15:15,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:15:15,820 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:15:15,822 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2079709380] [2019-12-18 13:15:15,822 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:15:15,822 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 13:15:15,823 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1455976323] [2019-12-18 13:15:15,823 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 13:15:15,823 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:15:15,823 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 13:15:15,824 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 13:15:15,824 INFO L87 Difference]: Start difference. First operand 1284 states and 2972 transitions. Second operand 3 states. [2019-12-18 13:15:15,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:15:15,896 INFO L93 Difference]: Finished difference Result 1993 states and 4593 transitions. [2019-12-18 13:15:15,897 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 13:15:15,897 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2019-12-18 13:15:15,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:15:15,908 INFO L225 Difference]: With dead ends: 1993 [2019-12-18 13:15:15,908 INFO L226 Difference]: Without dead ends: 1993 [2019-12-18 13:15:15,909 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:15:15,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1993 states. [2019-12-18 13:15:15,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1993 to 1444. [2019-12-18 13:15:15,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1444 states. [2019-12-18 13:15:15,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1444 states to 1444 states and 3429 transitions. [2019-12-18 13:15:15,951 INFO L78 Accepts]: Start accepts. Automaton has 1444 states and 3429 transitions. Word has length 14 [2019-12-18 13:15:15,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:15:15,951 INFO L462 AbstractCegarLoop]: Abstraction has 1444 states and 3429 transitions. [2019-12-18 13:15:15,952 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 13:15:15,952 INFO L276 IsEmpty]: Start isEmpty. Operand 1444 states and 3429 transitions. [2019-12-18 13:15:15,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-18 13:15:15,953 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:15:15,953 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:15:15,953 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:15:15,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:15:15,954 INFO L82 PathProgramCache]: Analyzing trace with hash 254810970, now seen corresponding path program 1 times [2019-12-18 13:15:15,954 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:15:15,954 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1344574167] [2019-12-18 13:15:15,954 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:15:15,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:15:16,014 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:15:16,015 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1344574167] [2019-12-18 13:15:16,015 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:15:16,015 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 13:15:16,015 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1765381161] [2019-12-18 13:15:16,016 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 13:15:16,019 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:15:16,019 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 13:15:16,019 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 13:15:16,019 INFO L87 Difference]: Start difference. First operand 1444 states and 3429 transitions. Second operand 4 states. [2019-12-18 13:15:16,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:15:16,227 INFO L93 Difference]: Finished difference Result 1803 states and 4159 transitions. [2019-12-18 13:15:16,227 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 13:15:16,228 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-12-18 13:15:16,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:15:16,241 INFO L225 Difference]: With dead ends: 1803 [2019-12-18 13:15:16,242 INFO L226 Difference]: Without dead ends: 1803 [2019-12-18 13:15:16,243 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:15:16,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1803 states. [2019-12-18 13:15:16,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1803 to 1739. [2019-12-18 13:15:16,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1739 states. [2019-12-18 13:15:16,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1739 states to 1739 states and 4035 transitions. [2019-12-18 13:15:16,299 INFO L78 Accepts]: Start accepts. Automaton has 1739 states and 4035 transitions. Word has length 14 [2019-12-18 13:15:16,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:15:16,300 INFO L462 AbstractCegarLoop]: Abstraction has 1739 states and 4035 transitions. [2019-12-18 13:15:16,300 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 13:15:16,300 INFO L276 IsEmpty]: Start isEmpty. Operand 1739 states and 4035 transitions. [2019-12-18 13:15:16,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-18 13:15:16,301 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:15:16,301 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:15:16,302 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:15:16,302 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:15:16,302 INFO L82 PathProgramCache]: Analyzing trace with hash 32652836, now seen corresponding path program 1 times [2019-12-18 13:15:16,302 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:15:16,302 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1010394620] [2019-12-18 13:15:16,303 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:15:16,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:15:16,398 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:15:16,398 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1010394620] [2019-12-18 13:15:16,399 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:15:16,400 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 13:15:16,400 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [291989669] [2019-12-18 13:15:16,400 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 13:15:16,400 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:15:16,401 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 13:15:16,401 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 13:15:16,401 INFO L87 Difference]: Start difference. First operand 1739 states and 4035 transitions. Second operand 4 states. [2019-12-18 13:15:16,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:15:16,571 INFO L93 Difference]: Finished difference Result 2116 states and 4835 transitions. [2019-12-18 13:15:16,571 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 13:15:16,572 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-12-18 13:15:16,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:15:16,583 INFO L225 Difference]: With dead ends: 2116 [2019-12-18 13:15:16,583 INFO L226 Difference]: Without dead ends: 2116 [2019-12-18 13:15:16,583 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:15:16,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2116 states. [2019-12-18 13:15:16,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2116 to 1856. [2019-12-18 13:15:16,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1856 states. [2019-12-18 13:15:16,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1856 states to 1856 states and 4299 transitions. [2019-12-18 13:15:16,625 INFO L78 Accepts]: Start accepts. Automaton has 1856 states and 4299 transitions. Word has length 14 [2019-12-18 13:15:16,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:15:16,625 INFO L462 AbstractCegarLoop]: Abstraction has 1856 states and 4299 transitions. [2019-12-18 13:15:16,626 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 13:15:16,626 INFO L276 IsEmpty]: Start isEmpty. Operand 1856 states and 4299 transitions. [2019-12-18 13:15:16,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 13:15:16,628 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:15:16,628 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:15:16,629 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:15:16,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:15:16,629 INFO L82 PathProgramCache]: Analyzing trace with hash 1595600556, now seen corresponding path program 1 times [2019-12-18 13:15:16,629 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:15:16,629 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1916789330] [2019-12-18 13:15:16,630 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:15:16,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:15:16,712 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:15:16,713 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1916789330] [2019-12-18 13:15:16,713 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:15:16,713 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 13:15:16,713 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1676474065] [2019-12-18 13:15:16,714 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 13:15:16,715 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:15:16,715 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 13:15:16,715 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 13:15:16,715 INFO L87 Difference]: Start difference. First operand 1856 states and 4299 transitions. Second operand 5 states. [2019-12-18 13:15:16,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:15:16,963 INFO L93 Difference]: Finished difference Result 2383 states and 5349 transitions. [2019-12-18 13:15:16,964 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 13:15:16,964 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2019-12-18 13:15:16,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:15:16,991 INFO L225 Difference]: With dead ends: 2383 [2019-12-18 13:15:16,991 INFO L226 Difference]: Without dead ends: 2383 [2019-12-18 13:15:16,991 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-18 13:15:16,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2383 states. [2019-12-18 13:15:17,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2383 to 2127. [2019-12-18 13:15:17,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2127 states. [2019-12-18 13:15:17,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2127 states to 2127 states and 4855 transitions. [2019-12-18 13:15:17,049 INFO L78 Accepts]: Start accepts. Automaton has 2127 states and 4855 transitions. Word has length 25 [2019-12-18 13:15:17,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:15:17,049 INFO L462 AbstractCegarLoop]: Abstraction has 2127 states and 4855 transitions. [2019-12-18 13:15:17,050 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 13:15:17,050 INFO L276 IsEmpty]: Start isEmpty. Operand 2127 states and 4855 transitions. [2019-12-18 13:15:17,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-18 13:15:17,052 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:15:17,053 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] [2019-12-18 13:15:17,053 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:15:17,053 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:15:17,053 INFO L82 PathProgramCache]: Analyzing trace with hash 1878239565, now seen corresponding path program 1 times [2019-12-18 13:15:17,054 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:15:17,054 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [530555174] [2019-12-18 13:15:17,055 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:15:17,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:15:17,137 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:15:17,137 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [530555174] [2019-12-18 13:15:17,138 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:15:17,138 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 13:15:17,138 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [268429404] [2019-12-18 13:15:17,138 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 13:15:17,139 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:15:17,139 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 13:15:17,139 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 13:15:17,139 INFO L87 Difference]: Start difference. First operand 2127 states and 4855 transitions. Second operand 3 states. [2019-12-18 13:15:17,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:15:17,152 INFO L93 Difference]: Finished difference Result 2126 states and 4853 transitions. [2019-12-18 13:15:17,152 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 13:15:17,152 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2019-12-18 13:15:17,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:15:17,171 INFO L225 Difference]: With dead ends: 2126 [2019-12-18 13:15:17,172 INFO L226 Difference]: Without dead ends: 2126 [2019-12-18 13:15:17,172 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:15:17,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2126 states. [2019-12-18 13:15:17,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2126 to 2126. [2019-12-18 13:15:17,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2126 states. [2019-12-18 13:15:17,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2126 states to 2126 states and 4853 transitions. [2019-12-18 13:15:17,218 INFO L78 Accepts]: Start accepts. Automaton has 2126 states and 4853 transitions. Word has length 26 [2019-12-18 13:15:17,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:15:17,219 INFO L462 AbstractCegarLoop]: Abstraction has 2126 states and 4853 transitions. [2019-12-18 13:15:17,219 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 13:15:17,219 INFO L276 IsEmpty]: Start isEmpty. Operand 2126 states and 4853 transitions. [2019-12-18 13:15:17,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-18 13:15:17,222 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:15:17,222 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] [2019-12-18 13:15:17,223 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:15:17,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:15:17,223 INFO L82 PathProgramCache]: Analyzing trace with hash 532711466, now seen corresponding path program 1 times [2019-12-18 13:15:17,223 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:15:17,224 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [404782507] [2019-12-18 13:15:17,224 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:15:17,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:15:17,347 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:15:17,348 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [404782507] [2019-12-18 13:15:17,348 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:15:17,348 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 13:15:17,348 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1324992582] [2019-12-18 13:15:17,349 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 13:15:17,350 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:15:17,350 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 13:15:17,350 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 13:15:17,350 INFO L87 Difference]: Start difference. First operand 2126 states and 4853 transitions. Second operand 5 states. [2019-12-18 13:15:17,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:15:17,569 INFO L93 Difference]: Finished difference Result 2503 states and 5587 transitions. [2019-12-18 13:15:17,570 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 13:15:17,570 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2019-12-18 13:15:17,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:15:17,577 INFO L225 Difference]: With dead ends: 2503 [2019-12-18 13:15:17,577 INFO L226 Difference]: Without dead ends: 2503 [2019-12-18 13:15:17,578 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-18 13:15:17,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2503 states. [2019-12-18 13:15:17,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2503 to 1976. [2019-12-18 13:15:17,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1976 states. [2019-12-18 13:15:17,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1976 states to 1976 states and 4537 transitions. [2019-12-18 13:15:17,618 INFO L78 Accepts]: Start accepts. Automaton has 1976 states and 4537 transitions. Word has length 26 [2019-12-18 13:15:17,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:15:17,621 INFO L462 AbstractCegarLoop]: Abstraction has 1976 states and 4537 transitions. [2019-12-18 13:15:17,621 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 13:15:17,621 INFO L276 IsEmpty]: Start isEmpty. Operand 1976 states and 4537 transitions. [2019-12-18 13:15:17,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-18 13:15:17,623 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:15:17,624 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:15:17,624 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:15:17,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:15:17,624 INFO L82 PathProgramCache]: Analyzing trace with hash -1895680429, now seen corresponding path program 1 times [2019-12-18 13:15:17,624 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:15:17,625 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1848429520] [2019-12-18 13:15:17,625 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:15:17,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:15:17,683 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:15:17,684 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1848429520] [2019-12-18 13:15:17,684 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:15:17,685 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 13:15:17,685 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [586247917] [2019-12-18 13:15:17,685 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 13:15:17,685 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:15:17,686 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 13:15:17,686 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 13:15:17,686 INFO L87 Difference]: Start difference. First operand 1976 states and 4537 transitions. Second operand 4 states. [2019-12-18 13:15:17,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:15:17,716 INFO L93 Difference]: Finished difference Result 3149 states and 7351 transitions. [2019-12-18 13:15:17,716 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 13:15:17,716 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 27 [2019-12-18 13:15:17,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:15:17,725 INFO L225 Difference]: With dead ends: 3149 [2019-12-18 13:15:17,725 INFO L226 Difference]: Without dead ends: 1449 [2019-12-18 13:15:17,725 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:15:17,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1449 states. [2019-12-18 13:15:17,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1449 to 1433. [2019-12-18 13:15:17,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1433 states. [2019-12-18 13:15:17,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1433 states to 1433 states and 3305 transitions. [2019-12-18 13:15:17,757 INFO L78 Accepts]: Start accepts. Automaton has 1433 states and 3305 transitions. Word has length 27 [2019-12-18 13:15:17,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:15:17,758 INFO L462 AbstractCegarLoop]: Abstraction has 1433 states and 3305 transitions. [2019-12-18 13:15:17,758 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 13:15:17,758 INFO L276 IsEmpty]: Start isEmpty. Operand 1433 states and 3305 transitions. [2019-12-18 13:15:17,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-18 13:15:17,764 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:15:17,764 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:15:17,764 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:15:17,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:15:17,764 INFO L82 PathProgramCache]: Analyzing trace with hash -1902769443, now seen corresponding path program 2 times [2019-12-18 13:15:17,765 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:15:17,765 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [829437328] [2019-12-18 13:15:17,765 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:15:17,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:15:17,861 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:15:17,862 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [829437328] [2019-12-18 13:15:17,862 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:15:17,862 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 13:15:17,862 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1780578195] [2019-12-18 13:15:17,863 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 13:15:17,863 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:15:17,863 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 13:15:17,863 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 13:15:17,863 INFO L87 Difference]: Start difference. First operand 1433 states and 3305 transitions. Second operand 5 states. [2019-12-18 13:15:18,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:15:18,340 INFO L93 Difference]: Finished difference Result 2262 states and 5074 transitions. [2019-12-18 13:15:18,340 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 13:15:18,340 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2019-12-18 13:15:18,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:15:18,347 INFO L225 Difference]: With dead ends: 2262 [2019-12-18 13:15:18,348 INFO L226 Difference]: Without dead ends: 2262 [2019-12-18 13:15:18,348 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-18 13:15:18,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2262 states. [2019-12-18 13:15:18,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2262 to 2061. [2019-12-18 13:15:18,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2061 states. [2019-12-18 13:15:18,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2061 states to 2061 states and 4683 transitions. [2019-12-18 13:15:18,388 INFO L78 Accepts]: Start accepts. Automaton has 2061 states and 4683 transitions. Word has length 27 [2019-12-18 13:15:18,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:15:18,389 INFO L462 AbstractCegarLoop]: Abstraction has 2061 states and 4683 transitions. [2019-12-18 13:15:18,389 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 13:15:18,389 INFO L276 IsEmpty]: Start isEmpty. Operand 2061 states and 4683 transitions. [2019-12-18 13:15:18,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-18 13:15:18,392 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:15:18,392 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:15:18,393 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:15:18,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:15:18,393 INFO L82 PathProgramCache]: Analyzing trace with hash -348234267, now seen corresponding path program 1 times [2019-12-18 13:15:18,393 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:15:18,393 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [657446885] [2019-12-18 13:15:18,394 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:15:18,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:15:18,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:15:18,440 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [657446885] [2019-12-18 13:15:18,440 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:15:18,440 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 13:15:18,440 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1464094377] [2019-12-18 13:15:18,441 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 13:15:18,441 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:15:18,441 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 13:15:18,441 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 13:15:18,441 INFO L87 Difference]: Start difference. First operand 2061 states and 4683 transitions. Second operand 4 states. [2019-12-18 13:15:18,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:15:18,456 INFO L93 Difference]: Finished difference Result 1113 states and 2397 transitions. [2019-12-18 13:15:18,456 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 13:15:18,457 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 28 [2019-12-18 13:15:18,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:15:18,459 INFO L225 Difference]: With dead ends: 1113 [2019-12-18 13:15:18,459 INFO L226 Difference]: Without dead ends: 1002 [2019-12-18 13:15:18,460 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:15:18,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1002 states. [2019-12-18 13:15:18,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1002 to 960. [2019-12-18 13:15:18,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 960 states. [2019-12-18 13:15:18,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 960 states to 960 states and 2144 transitions. [2019-12-18 13:15:18,476 INFO L78 Accepts]: Start accepts. Automaton has 960 states and 2144 transitions. Word has length 28 [2019-12-18 13:15:18,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:15:18,477 INFO L462 AbstractCegarLoop]: Abstraction has 960 states and 2144 transitions. [2019-12-18 13:15:18,477 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 13:15:18,477 INFO L276 IsEmpty]: Start isEmpty. Operand 960 states and 2144 transitions. [2019-12-18 13:15:18,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-12-18 13:15:18,480 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:15:18,480 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] [2019-12-18 13:15:18,481 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:15:18,481 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:15:18,481 INFO L82 PathProgramCache]: Analyzing trace with hash -359202268, now seen corresponding path program 1 times [2019-12-18 13:15:18,481 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:15:18,481 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [438659864] [2019-12-18 13:15:18,481 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:15:18,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:15:18,604 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:15:18,604 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [438659864] [2019-12-18 13:15:18,604 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:15:18,604 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 13:15:18,605 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1869839257] [2019-12-18 13:15:18,605 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 13:15:18,605 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:15:18,605 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 13:15:18,606 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-18 13:15:18,606 INFO L87 Difference]: Start difference. First operand 960 states and 2144 transitions. Second operand 7 states. [2019-12-18 13:15:18,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:15:18,938 INFO L93 Difference]: Finished difference Result 2777 states and 5836 transitions. [2019-12-18 13:15:18,938 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-18 13:15:18,939 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 51 [2019-12-18 13:15:18,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:15:18,944 INFO L225 Difference]: With dead ends: 2777 [2019-12-18 13:15:18,944 INFO L226 Difference]: Without dead ends: 1853 [2019-12-18 13:15:18,945 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=157, Unknown=0, NotChecked=0, Total=210 [2019-12-18 13:15:18,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1853 states. [2019-12-18 13:15:18,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1853 to 998. [2019-12-18 13:15:18,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 998 states. [2019-12-18 13:15:18,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 998 states to 998 states and 2203 transitions. [2019-12-18 13:15:18,968 INFO L78 Accepts]: Start accepts. Automaton has 998 states and 2203 transitions. Word has length 51 [2019-12-18 13:15:18,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:15:18,968 INFO L462 AbstractCegarLoop]: Abstraction has 998 states and 2203 transitions. [2019-12-18 13:15:18,968 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 13:15:18,968 INFO L276 IsEmpty]: Start isEmpty. Operand 998 states and 2203 transitions. [2019-12-18 13:15:18,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-12-18 13:15:18,971 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:15:18,971 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] [2019-12-18 13:15:18,971 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:15:18,971 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:15:18,971 INFO L82 PathProgramCache]: Analyzing trace with hash -1598138544, now seen corresponding path program 2 times [2019-12-18 13:15:18,972 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:15:18,972 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1751092012] [2019-12-18 13:15:18,972 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:15:18,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:15:19,048 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:15:19,049 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1751092012] [2019-12-18 13:15:19,049 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:15:19,049 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 13:15:19,049 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [291874268] [2019-12-18 13:15:19,050 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 13:15:19,050 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:15:19,050 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 13:15:19,050 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 13:15:19,051 INFO L87 Difference]: Start difference. First operand 998 states and 2203 transitions. Second operand 5 states. [2019-12-18 13:15:19,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:15:19,235 INFO L93 Difference]: Finished difference Result 1135 states and 2453 transitions. [2019-12-18 13:15:19,235 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 13:15:19,235 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 51 [2019-12-18 13:15:19,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:15:19,238 INFO L225 Difference]: With dead ends: 1135 [2019-12-18 13:15:19,239 INFO L226 Difference]: Without dead ends: 1135 [2019-12-18 13:15:19,239 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-18 13:15:19,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1135 states. [2019-12-18 13:15:19,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1135 to 1047. [2019-12-18 13:15:19,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1047 states. [2019-12-18 13:15:19,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1047 states to 1047 states and 2300 transitions. [2019-12-18 13:15:19,261 INFO L78 Accepts]: Start accepts. Automaton has 1047 states and 2300 transitions. Word has length 51 [2019-12-18 13:15:19,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:15:19,262 INFO L462 AbstractCegarLoop]: Abstraction has 1047 states and 2300 transitions. [2019-12-18 13:15:19,262 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 13:15:19,262 INFO L276 IsEmpty]: Start isEmpty. Operand 1047 states and 2300 transitions. [2019-12-18 13:15:19,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-12-18 13:15:19,265 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:15:19,265 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] [2019-12-18 13:15:19,265 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:15:19,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:15:19,266 INFO L82 PathProgramCache]: Analyzing trace with hash -1838514274, now seen corresponding path program 3 times [2019-12-18 13:15:19,266 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:15:19,266 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1305296203] [2019-12-18 13:15:19,266 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:15:19,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:15:19,384 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:15:19,385 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1305296203] [2019-12-18 13:15:19,385 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:15:19,385 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 13:15:19,385 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [874640734] [2019-12-18 13:15:19,385 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 13:15:19,386 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:15:19,386 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 13:15:19,386 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 13:15:19,386 INFO L87 Difference]: Start difference. First operand 1047 states and 2300 transitions. Second operand 3 states. [2019-12-18 13:15:19,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:15:19,406 INFO L93 Difference]: Finished difference Result 1046 states and 2298 transitions. [2019-12-18 13:15:19,406 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 13:15:19,406 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 51 [2019-12-18 13:15:19,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:15:19,409 INFO L225 Difference]: With dead ends: 1046 [2019-12-18 13:15:19,409 INFO L226 Difference]: Without dead ends: 1046 [2019-12-18 13:15:19,410 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:15:19,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1046 states. [2019-12-18 13:15:19,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1046 to 931. [2019-12-18 13:15:19,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 931 states. [2019-12-18 13:15:19,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 931 states to 931 states and 2087 transitions. [2019-12-18 13:15:19,432 INFO L78 Accepts]: Start accepts. Automaton has 931 states and 2087 transitions. Word has length 51 [2019-12-18 13:15:19,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:15:19,433 INFO L462 AbstractCegarLoop]: Abstraction has 931 states and 2087 transitions. [2019-12-18 13:15:19,433 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 13:15:19,433 INFO L276 IsEmpty]: Start isEmpty. Operand 931 states and 2087 transitions. [2019-12-18 13:15:19,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-18 13:15:19,435 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:15:19,436 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] [2019-12-18 13:15:19,436 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:15:19,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:15:19,436 INFO L82 PathProgramCache]: Analyzing trace with hash 505389010, now seen corresponding path program 1 times [2019-12-18 13:15:19,436 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:15:19,437 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1008535626] [2019-12-18 13:15:19,437 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:15:19,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:15:19,577 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:15:19,578 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1008535626] [2019-12-18 13:15:19,578 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:15:19,578 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 13:15:19,578 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1891585159] [2019-12-18 13:15:19,579 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 13:15:19,579 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:15:19,579 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 13:15:19,579 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-18 13:15:19,579 INFO L87 Difference]: Start difference. First operand 931 states and 2087 transitions. Second operand 7 states. [2019-12-18 13:15:20,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:15:20,129 INFO L93 Difference]: Finished difference Result 1244 states and 2634 transitions. [2019-12-18 13:15:20,129 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-18 13:15:20,130 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 52 [2019-12-18 13:15:20,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:15:20,134 INFO L225 Difference]: With dead ends: 1244 [2019-12-18 13:15:20,134 INFO L226 Difference]: Without dead ends: 1244 [2019-12-18 13:15:20,134 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 4 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2019-12-18 13:15:20,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1244 states. [2019-12-18 13:15:20,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1244 to 736. [2019-12-18 13:15:20,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 736 states. [2019-12-18 13:15:20,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 736 states to 736 states and 1583 transitions. [2019-12-18 13:15:20,150 INFO L78 Accepts]: Start accepts. Automaton has 736 states and 1583 transitions. Word has length 52 [2019-12-18 13:15:20,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:15:20,150 INFO L462 AbstractCegarLoop]: Abstraction has 736 states and 1583 transitions. [2019-12-18 13:15:20,150 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 13:15:20,150 INFO L276 IsEmpty]: Start isEmpty. Operand 736 states and 1583 transitions. [2019-12-18 13:15:20,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-18 13:15:20,152 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:15:20,152 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] [2019-12-18 13:15:20,152 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:15:20,153 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:15:20,153 INFO L82 PathProgramCache]: Analyzing trace with hash 1643675972, now seen corresponding path program 2 times [2019-12-18 13:15:20,153 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:15:20,153 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1737547376] [2019-12-18 13:15:20,153 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:15:20,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:15:20,236 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:15:20,237 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1737547376] [2019-12-18 13:15:20,237 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:15:20,237 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 13:15:20,237 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [288371836] [2019-12-18 13:15:20,237 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 13:15:20,238 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:15:20,238 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 13:15:20,238 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 13:15:20,238 INFO L87 Difference]: Start difference. First operand 736 states and 1583 transitions. Second operand 4 states. [2019-12-18 13:15:20,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:15:20,308 INFO L93 Difference]: Finished difference Result 900 states and 1911 transitions. [2019-12-18 13:15:20,309 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 13:15:20,309 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 52 [2019-12-18 13:15:20,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:15:20,311 INFO L225 Difference]: With dead ends: 900 [2019-12-18 13:15:20,311 INFO L226 Difference]: Without dead ends: 900 [2019-12-18 13:15:20,311 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 13:15:20,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 900 states. [2019-12-18 13:15:20,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 900 to 750. [2019-12-18 13:15:20,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 750 states. [2019-12-18 13:15:20,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 750 states to 750 states and 1614 transitions. [2019-12-18 13:15:20,328 INFO L78 Accepts]: Start accepts. Automaton has 750 states and 1614 transitions. Word has length 52 [2019-12-18 13:15:20,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:15:20,328 INFO L462 AbstractCegarLoop]: Abstraction has 750 states and 1614 transitions. [2019-12-18 13:15:20,328 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 13:15:20,328 INFO L276 IsEmpty]: Start isEmpty. Operand 750 states and 1614 transitions. [2019-12-18 13:15:20,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-18 13:15:20,330 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:15:20,331 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] [2019-12-18 13:15:20,331 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:15:20,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:15:20,331 INFO L82 PathProgramCache]: Analyzing trace with hash -122108504, now seen corresponding path program 1 times [2019-12-18 13:15:20,331 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:15:20,332 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2126329358] [2019-12-18 13:15:20,332 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:15:20,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:15:20,390 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:15:20,390 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2126329358] [2019-12-18 13:15:20,391 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:15:20,391 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 13:15:20,391 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1420191095] [2019-12-18 13:15:20,391 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 13:15:20,392 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:15:20,392 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 13:15:20,392 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 13:15:20,392 INFO L87 Difference]: Start difference. First operand 750 states and 1614 transitions. Second operand 4 states. [2019-12-18 13:15:20,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:15:20,618 INFO L93 Difference]: Finished difference Result 1223 states and 2628 transitions. [2019-12-18 13:15:20,618 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 13:15:20,619 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 53 [2019-12-18 13:15:20,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:15:20,621 INFO L225 Difference]: With dead ends: 1223 [2019-12-18 13:15:20,622 INFO L226 Difference]: Without dead ends: 1223 [2019-12-18 13:15:20,622 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 13:15:20,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1223 states. [2019-12-18 13:15:20,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1223 to 825. [2019-12-18 13:15:20,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 825 states. [2019-12-18 13:15:20,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 825 states to 825 states and 1799 transitions. [2019-12-18 13:15:20,639 INFO L78 Accepts]: Start accepts. Automaton has 825 states and 1799 transitions. Word has length 53 [2019-12-18 13:15:20,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:15:20,639 INFO L462 AbstractCegarLoop]: Abstraction has 825 states and 1799 transitions. [2019-12-18 13:15:20,640 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 13:15:20,640 INFO L276 IsEmpty]: Start isEmpty. Operand 825 states and 1799 transitions. [2019-12-18 13:15:20,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-18 13:15:20,642 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:15:20,642 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] [2019-12-18 13:15:20,642 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:15:20,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:15:20,642 INFO L82 PathProgramCache]: Analyzing trace with hash 1190562228, now seen corresponding path program 1 times [2019-12-18 13:15:20,643 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:15:20,643 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1880480128] [2019-12-18 13:15:20,643 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:15:20,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:15:20,709 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:15:20,709 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1880480128] [2019-12-18 13:15:20,709 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:15:20,709 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 13:15:20,710 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [735283557] [2019-12-18 13:15:20,710 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 13:15:20,710 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:15:20,710 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 13:15:20,711 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 13:15:20,711 INFO L87 Difference]: Start difference. First operand 825 states and 1799 transitions. Second operand 5 states. [2019-12-18 13:15:20,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:15:20,953 INFO L93 Difference]: Finished difference Result 992 states and 2117 transitions. [2019-12-18 13:15:20,953 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 13:15:20,954 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 53 [2019-12-18 13:15:20,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:15:20,956 INFO L225 Difference]: With dead ends: 992 [2019-12-18 13:15:20,956 INFO L226 Difference]: Without dead ends: 992 [2019-12-18 13:15:20,956 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-12-18 13:15:20,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 992 states. [2019-12-18 13:15:20,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 992 to 878. [2019-12-18 13:15:20,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 878 states. [2019-12-18 13:15:20,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 878 states to 878 states and 1896 transitions. [2019-12-18 13:15:20,972 INFO L78 Accepts]: Start accepts. Automaton has 878 states and 1896 transitions. Word has length 53 [2019-12-18 13:15:20,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:15:20,972 INFO L462 AbstractCegarLoop]: Abstraction has 878 states and 1896 transitions. [2019-12-18 13:15:20,972 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 13:15:20,972 INFO L276 IsEmpty]: Start isEmpty. Operand 878 states and 1896 transitions. [2019-12-18 13:15:20,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-18 13:15:20,974 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:15:20,974 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] [2019-12-18 13:15:20,975 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:15:20,975 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:15:20,975 INFO L82 PathProgramCache]: Analyzing trace with hash 821991690, now seen corresponding path program 1 times [2019-12-18 13:15:20,975 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:15:20,976 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [276068161] [2019-12-18 13:15:20,976 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:15:20,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:15:21,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:15:21,043 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [276068161] [2019-12-18 13:15:21,043 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:15:21,043 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 13:15:21,043 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [549448623] [2019-12-18 13:15:21,044 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 13:15:21,044 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:15:21,044 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 13:15:21,044 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-18 13:15:21,044 INFO L87 Difference]: Start difference. First operand 878 states and 1896 transitions. Second operand 7 states. [2019-12-18 13:15:21,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:15:21,286 INFO L93 Difference]: Finished difference Result 2191 states and 4561 transitions. [2019-12-18 13:15:21,287 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-18 13:15:21,287 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 53 [2019-12-18 13:15:21,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:15:21,289 INFO L225 Difference]: With dead ends: 2191 [2019-12-18 13:15:21,290 INFO L226 Difference]: Without dead ends: 1789 [2019-12-18 13:15:21,290 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2019-12-18 13:15:21,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1789 states. [2019-12-18 13:15:21,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1789 to 873. [2019-12-18 13:15:21,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 873 states. [2019-12-18 13:15:21,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 873 states to 873 states and 1883 transitions. [2019-12-18 13:15:21,311 INFO L78 Accepts]: Start accepts. Automaton has 873 states and 1883 transitions. Word has length 53 [2019-12-18 13:15:21,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:15:21,311 INFO L462 AbstractCegarLoop]: Abstraction has 873 states and 1883 transitions. [2019-12-18 13:15:21,311 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 13:15:21,311 INFO L276 IsEmpty]: Start isEmpty. Operand 873 states and 1883 transitions. [2019-12-18 13:15:21,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-18 13:15:21,313 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:15:21,313 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] [2019-12-18 13:15:21,313 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:15:21,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:15:21,314 INFO L82 PathProgramCache]: Analyzing trace with hash 813658986, now seen corresponding path program 2 times [2019-12-18 13:15:21,314 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:15:21,314 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [779211702] [2019-12-18 13:15:21,314 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:15:21,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:15:21,417 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:15:21,418 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [779211702] [2019-12-18 13:15:21,418 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:15:21,418 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 13:15:21,418 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [382342822] [2019-12-18 13:15:21,419 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 13:15:21,419 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:15:21,419 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 13:15:21,419 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-18 13:15:21,420 INFO L87 Difference]: Start difference. First operand 873 states and 1883 transitions. Second operand 6 states. [2019-12-18 13:15:21,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:15:21,486 INFO L93 Difference]: Finished difference Result 860 states and 1840 transitions. [2019-12-18 13:15:21,487 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 13:15:21,487 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 53 [2019-12-18 13:15:21,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:15:21,488 INFO L225 Difference]: With dead ends: 860 [2019-12-18 13:15:21,488 INFO L226 Difference]: Without dead ends: 860 [2019-12-18 13:15:21,488 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-18 13:15:21,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 860 states. [2019-12-18 13:15:21,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 860 to 721. [2019-12-18 13:15:21,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 721 states. [2019-12-18 13:15:21,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 721 states to 721 states and 1538 transitions. [2019-12-18 13:15:21,502 INFO L78 Accepts]: Start accepts. Automaton has 721 states and 1538 transitions. Word has length 53 [2019-12-18 13:15:21,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:15:21,502 INFO L462 AbstractCegarLoop]: Abstraction has 721 states and 1538 transitions. [2019-12-18 13:15:21,502 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 13:15:21,502 INFO L276 IsEmpty]: Start isEmpty. Operand 721 states and 1538 transitions. [2019-12-18 13:15:21,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-18 13:15:21,508 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:15:21,508 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] [2019-12-18 13:15:21,508 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:15:21,509 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:15:21,509 INFO L82 PathProgramCache]: Analyzing trace with hash -1691396374, now seen corresponding path program 1 times [2019-12-18 13:15:21,509 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:15:21,510 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1885340646] [2019-12-18 13:15:21,511 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:15:21,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 13:15:21,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 13:15:21,702 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-18 13:15:21,702 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-18 13:15:21,708 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [781] [781] ULTIMATE.startENTRY-->L814: Formula: (let ((.cse0 (store |v_#valid_65| 0 0))) (and (= 0 v_~a$w_buff1~0_316) (= 0 v_~a$read_delayed_var~0.base_8) (= 0 v_~__unbuffered_cnt~0_62) (= v_~z~0_11 0) (= (store .cse0 |v_ULTIMATE.start_main_~#t841~0.base_35| 1) |v_#valid_63|) (= 0 v_~a$read_delayed~0_7) (= v_~y~0_90 0) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t841~0.base_35| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t841~0.base_35|) |v_ULTIMATE.start_main_~#t841~0.offset_23| 0)) |v_#memory_int_13|) (= 0 v_~a$r_buff1_thd2~0_271) (= v_~__unbuffered_p1_EBX~0_60 0) (= v_~a$flush_delayed~0_23 0) (= v_~main$tmp_guard1~0_43 0) (< 0 |v_#StackHeapBarrier_15|) (= 0 v_~a$w_buff0_used~0_830) (= 0 v_~a$w_buff1_used~0_501) (= 0 |v_#NULL.base_4|) (= (select .cse0 |v_ULTIMATE.start_main_~#t841~0.base_35|) 0) (= v_~x~0_85 0) (= 0 v_~a$r_buff1_thd1~0_132) (= 0 v_~weak$$choice0~0_11) (= (store |v_#length_16| |v_ULTIMATE.start_main_~#t841~0.base_35| 4) |v_#length_15|) (= 0 v_~a$r_buff0_thd1~0_236) (< |v_#StackHeapBarrier_15| |v_ULTIMATE.start_main_~#t841~0.base_35|) (= v_~main$tmp_guard0~0_21 0) (= 0 v_~a$r_buff0_thd2~0_373) (= |v_#NULL.offset_4| 0) (= v_~__unbuffered_p0_EBX~0_115 0) (= v_~a$mem_tmp~0_14 0) (= v_~weak$$choice2~0_107 0) (= |v_ULTIMATE.start_main_~#t841~0.offset_23| 0) (= v_~a~0_150 0) (= v_~a$read_delayed_var~0.offset_8 0) (= v_~a$r_buff1_thd0~0_178 0) (= v_~a$r_buff0_thd0~0_163 0) (= v_~a$w_buff0~0_518 0) (= 0 v_~__unbuffered_p1_EAX~0_46) (= 0 v_~__unbuffered_p0_EAX~0_117))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_15|, #valid=|v_#valid_65|, #memory_int=|v_#memory_int_14|, #length=|v_#length_16|} OutVars{~a$read_delayed~0=v_~a$read_delayed~0_7, ~a$r_buff1_thd2~0=v_~a$r_buff1_thd2~0_271, ~a$r_buff0_thd2~0=v_~a$r_buff0_thd2~0_373, #NULL.offset=|v_#NULL.offset_4|, ULTIMATE.start_main_~#t842~0.offset=|v_ULTIMATE.start_main_~#t842~0.offset_16|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_43, ~a$r_buff0_thd0~0=v_~a$r_buff0_thd0~0_163, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_75|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_63|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_87|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_37|, ~a$mem_tmp~0=v_~a$mem_tmp~0_14, ~a~0=v_~a~0_150, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_117, ~a$w_buff1~0=v_~a$w_buff1~0_316, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_46, ULTIMATE.start_main_~#t841~0.base=|v_ULTIMATE.start_main_~#t841~0.base_35|, #length=|v_#length_15|, ULTIMATE.start_main_~#t841~0.offset=|v_ULTIMATE.start_main_~#t841~0.offset_23|, ~y~0=v_~y~0_90, ULTIMATE.start_main_~#t842~0.base=|v_ULTIMATE.start_main_~#t842~0.base_27|, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_60, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_115, ~a$r_buff1_thd1~0=v_~a$r_buff1_thd1~0_132, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_830, ~a$r_buff0_thd1~0=v_~a$r_buff0_thd1~0_236, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_21, #NULL.base=|v_#NULL.base_4|, ~weak$$choice0~0=v_~weak$$choice0~0_11, #StackHeapBarrier=|v_#StackHeapBarrier_15|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_95|, ~a$read_delayed_var~0.offset=v_~a$read_delayed_var~0.offset_8, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_87|, ~a$w_buff0~0=v_~a$w_buff0~0_518, ~a$flush_delayed~0=v_~a$flush_delayed~0_23, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_25|, #valid=|v_#valid_63|, #memory_int=|v_#memory_int_13|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_8|, ~a$r_buff1_thd0~0=v_~a$r_buff1_thd0~0_178, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_62, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_19|, ~z~0=v_~z~0_11, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_501, ~weak$$choice2~0=v_~weak$$choice2~0_107, ~x~0=v_~x~0_85, ~a$read_delayed_var~0.base=v_~a$read_delayed_var~0.base_8} AuxVars[] AssignedVars[~a$read_delayed~0, ~a$r_buff1_thd2~0, ~a$r_buff0_thd2~0, #NULL.offset, ULTIMATE.start_main_~#t842~0.offset, ~main$tmp_guard1~0, ~a$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_#t~ite44, ~a$mem_tmp~0, ~a~0, ~__unbuffered_p0_EAX~0, ~a$w_buff1~0, ~__unbuffered_p1_EAX~0, ULTIMATE.start_main_~#t841~0.base, #length, ULTIMATE.start_main_~#t841~0.offset, ~y~0, ULTIMATE.start_main_~#t842~0.base, ~__unbuffered_p1_EBX~0, ~__unbuffered_p0_EBX~0, ~a$r_buff1_thd1~0, ~a$w_buff0_used~0, ~a$r_buff0_thd1~0, ~main$tmp_guard0~0, #NULL.base, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite41, ~a$read_delayed_var~0.offset, ULTIMATE.start_main_#t~ite40, ~a$w_buff0~0, ~a$flush_delayed~0, ULTIMATE.start_main_#res, #valid, #memory_int, ULTIMATE.start_main_#t~nondet38, ~a$r_buff1_thd0~0, ~__unbuffered_cnt~0, ULTIMATE.start_main_#t~nondet39, ~z~0, ~a$w_buff1_used~0, ~weak$$choice2~0, ~x~0, ~a$read_delayed_var~0.base] because there is no mapped edge [2019-12-18 13:15:21,710 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [759] [759] P0ENTRY-->L4-3: Formula: (and (= |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_Out447519581| 1) (= ~a$w_buff0~0_Out447519581 1) (= ~a$w_buff0_used~0_Out447519581 1) (= |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_Out447519581| P0Thread1of1ForFork0___VERIFIER_assert_~expression_Out447519581) (= P0Thread1of1ForFork0_~arg.offset_Out447519581 |P0Thread1of1ForFork0_#in~arg.offset_In447519581|) (= 0 (mod ~a$w_buff1_used~0_Out447519581 256)) (= |P0Thread1of1ForFork0_#in~arg.base_In447519581| P0Thread1of1ForFork0_~arg.base_Out447519581) (= ~a$w_buff0_used~0_In447519581 ~a$w_buff1_used~0_Out447519581) (= ~a$w_buff1~0_Out447519581 ~a$w_buff0~0_In447519581)) InVars {P0Thread1of1ForFork0_#in~arg.offset=|P0Thread1of1ForFork0_#in~arg.offset_In447519581|, ~a$w_buff0~0=~a$w_buff0~0_In447519581, P0Thread1of1ForFork0_#in~arg.base=|P0Thread1of1ForFork0_#in~arg.base_In447519581|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In447519581} OutVars{P0Thread1of1ForFork0_#in~arg.offset=|P0Thread1of1ForFork0_#in~arg.offset_In447519581|, ~a$w_buff1~0=~a$w_buff1~0_Out447519581, ~a$w_buff0~0=~a$w_buff0~0_Out447519581, P0Thread1of1ForFork0___VERIFIER_assert_~expression=P0Thread1of1ForFork0___VERIFIER_assert_~expression_Out447519581, P0Thread1of1ForFork0_#in~arg.base=|P0Thread1of1ForFork0_#in~arg.base_In447519581|, ~a$w_buff0_used~0=~a$w_buff0_used~0_Out447519581, ~a$w_buff1_used~0=~a$w_buff1_used~0_Out447519581, P0Thread1of1ForFork0_~arg.base=P0Thread1of1ForFork0_~arg.base_Out447519581, P0Thread1of1ForFork0___VERIFIER_assert_#in~expression=|P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_Out447519581|, P0Thread1of1ForFork0_~arg.offset=P0Thread1of1ForFork0_~arg.offset_Out447519581} AuxVars[] AssignedVars[~a$w_buff1~0, ~a$w_buff0~0, P0Thread1of1ForFork0___VERIFIER_assert_~expression, ~a$w_buff0_used~0, ~a$w_buff1_used~0, P0Thread1of1ForFork0_~arg.base, P0Thread1of1ForFork0___VERIFIER_assert_#in~expression, P0Thread1of1ForFork0_~arg.offset] because there is no mapped edge [2019-12-18 13:15:21,710 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [745] [745] L814-1-->L816: Formula: (and (not (= |v_ULTIMATE.start_main_~#t842~0.base_10| 0)) (= (select |v_#valid_20| |v_ULTIMATE.start_main_~#t842~0.base_10|) 0) (= (store |v_#valid_20| |v_ULTIMATE.start_main_~#t842~0.base_10| 1) |v_#valid_19|) (= |v_ULTIMATE.start_main_~#t842~0.offset_9| 0) (= |v_#memory_int_7| (store |v_#memory_int_8| |v_ULTIMATE.start_main_~#t842~0.base_10| (store (select |v_#memory_int_8| |v_ULTIMATE.start_main_~#t842~0.base_10|) |v_ULTIMATE.start_main_~#t842~0.offset_9| 1))) (= (store |v_#length_10| |v_ULTIMATE.start_main_~#t842~0.base_10| 4) |v_#length_9|) (< |v_#StackHeapBarrier_7| |v_ULTIMATE.start_main_~#t842~0.base_10|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_7|, #valid=|v_#valid_20|, #memory_int=|v_#memory_int_8|, #length=|v_#length_10|} OutVars{ULTIMATE.start_main_~#t842~0.base=|v_ULTIMATE.start_main_~#t842~0.base_10|, #StackHeapBarrier=|v_#StackHeapBarrier_7|, #valid=|v_#valid_19|, #memory_int=|v_#memory_int_7|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_4|, ULTIMATE.start_main_~#t842~0.offset=|v_ULTIMATE.start_main_~#t842~0.offset_9|, #length=|v_#length_9|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t842~0.base, #valid, #memory_int, ULTIMATE.start_main_#t~nondet38, ULTIMATE.start_main_~#t842~0.offset, #length] because there is no mapped edge [2019-12-18 13:15:21,722 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [760] [760] L783-->L783-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In-559131755 256) 0))) (or (and (= |P1Thread1of1ForFork1_#t~ite23_Out-559131755| |P1Thread1of1ForFork1_#t~ite24_Out-559131755|) .cse0 (= |P1Thread1of1ForFork1_#t~ite23_Out-559131755| ~a$w_buff1_used~0_In-559131755) (let ((.cse1 (= 0 (mod ~a$r_buff0_thd2~0_In-559131755 256)))) (or (and .cse1 (= 0 (mod ~a$w_buff1_used~0_In-559131755 256))) (= 0 (mod ~a$w_buff0_used~0_In-559131755 256)) (and .cse1 (= 0 (mod ~a$r_buff1_thd2~0_In-559131755 256)))))) (and (not .cse0) (= |P1Thread1of1ForFork1_#t~ite23_In-559131755| |P1Thread1of1ForFork1_#t~ite23_Out-559131755|) (= |P1Thread1of1ForFork1_#t~ite24_Out-559131755| ~a$w_buff1_used~0_In-559131755)))) InVars {~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In-559131755, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-559131755, P1Thread1of1ForFork1_#t~ite23=|P1Thread1of1ForFork1_#t~ite23_In-559131755|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-559131755, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-559131755, ~weak$$choice2~0=~weak$$choice2~0_In-559131755} OutVars{~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In-559131755, P1Thread1of1ForFork1_#t~ite23=|P1Thread1of1ForFork1_#t~ite23_Out-559131755|, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-559131755, P1Thread1of1ForFork1_#t~ite24=|P1Thread1of1ForFork1_#t~ite24_Out-559131755|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-559131755, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-559131755, ~weak$$choice2~0=~weak$$choice2~0_In-559131755} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite23, P1Thread1of1ForFork1_#t~ite24] because there is no mapped edge [2019-12-18 13:15:21,723 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [711] [711] L784-->L785: Formula: (and (not (= (mod v_~weak$$choice2~0_38 256) 0)) (= v_~a$r_buff0_thd2~0_146 v_~a$r_buff0_thd2~0_147)) InVars {~a$r_buff0_thd2~0=v_~a$r_buff0_thd2~0_147, ~weak$$choice2~0=v_~weak$$choice2~0_38} OutVars{~a$r_buff0_thd2~0=v_~a$r_buff0_thd2~0_146, P1Thread1of1ForFork1_#t~ite27=|v_P1Thread1of1ForFork1_#t~ite27_8|, ~weak$$choice2~0=v_~weak$$choice2~0_38, P1Thread1of1ForFork1_#t~ite25=|v_P1Thread1of1ForFork1_#t~ite25_15|, P1Thread1of1ForFork1_#t~ite26=|v_P1Thread1of1ForFork1_#t~ite26_12|} AuxVars[] AssignedVars[~a$r_buff0_thd2~0, P1Thread1of1ForFork1_#t~ite27, P1Thread1of1ForFork1_#t~ite25, P1Thread1of1ForFork1_#t~ite26] because there is no mapped edge [2019-12-18 13:15:21,726 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [720] [720] L753-->L753-2: Formula: (let ((.cse1 (= 0 (mod ~a$w_buff0_used~0_In1164755271 256))) (.cse0 (= (mod ~a$r_buff0_thd1~0_In1164755271 256) 0))) (or (and (or .cse0 .cse1) (= |P0Thread1of1ForFork0_#t~ite5_Out1164755271| ~a$w_buff0_used~0_In1164755271)) (and (= |P0Thread1of1ForFork0_#t~ite5_Out1164755271| 0) (not .cse1) (not .cse0)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In1164755271, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In1164755271} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out1164755271|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1164755271, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In1164755271} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-18 13:15:21,727 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [733] [733] L754-->L754-2: Formula: (let ((.cse0 (= 0 (mod ~a$w_buff1_used~0_In-1457447788 256))) (.cse1 (= (mod ~a$r_buff1_thd1~0_In-1457447788 256) 0)) (.cse3 (= 0 (mod ~a$r_buff0_thd1~0_In-1457447788 256))) (.cse2 (= (mod ~a$w_buff0_used~0_In-1457447788 256) 0))) (or (and (= ~a$w_buff1_used~0_In-1457447788 |P0Thread1of1ForFork0_#t~ite6_Out-1457447788|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2))) (= 0 |P0Thread1of1ForFork0_#t~ite6_Out-1457447788|)))) InVars {~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In-1457447788, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1457447788, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In-1457447788, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1457447788} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out-1457447788|, ~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In-1457447788, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1457447788, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In-1457447788, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1457447788} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-18 13:15:21,727 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [722] [722] L755-->L756: Formula: (let ((.cse0 (= (mod ~a$w_buff0_used~0_In-1808183265 256) 0)) (.cse1 (= (mod ~a$r_buff0_thd1~0_In-1808183265 256) 0))) (or (and (or .cse0 .cse1) (= ~a$r_buff0_thd1~0_Out-1808183265 ~a$r_buff0_thd1~0_In-1808183265)) (and (not .cse0) (= ~a$r_buff0_thd1~0_Out-1808183265 0) (not .cse1)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In-1808183265, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In-1808183265} OutVars{P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out-1808183265|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1808183265, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_Out-1808183265} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7, ~a$r_buff0_thd1~0] because there is no mapped edge [2019-12-18 13:15:21,728 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [717] [717] L756-->L756-2: Formula: (let ((.cse3 (= (mod ~a$w_buff0_used~0_In-86515874 256) 0)) (.cse2 (= (mod ~a$r_buff0_thd1~0_In-86515874 256) 0)) (.cse0 (= 0 (mod ~a$r_buff1_thd1~0_In-86515874 256))) (.cse1 (= 0 (mod ~a$w_buff1_used~0_In-86515874 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P0Thread1of1ForFork0_#t~ite8_Out-86515874| ~a$r_buff1_thd1~0_In-86515874)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1))) (= |P0Thread1of1ForFork0_#t~ite8_Out-86515874| 0)))) InVars {~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In-86515874, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-86515874, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In-86515874, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-86515874} OutVars{~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In-86515874, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out-86515874|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-86515874, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In-86515874, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-86515874} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-18 13:15:21,728 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [755] [755] L756-2-->P0EXIT: Formula: (and (= v_~a$r_buff1_thd1~0_63 |v_P0Thread1of1ForFork0_#t~ite8_30|) (= 0 |v_P0Thread1of1ForFork0_#res.base_5|) (= |v_P0Thread1of1ForFork0_#res.offset_5| 0) (= (+ v_~__unbuffered_cnt~0_40 1) v_~__unbuffered_cnt~0_39)) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_30|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_40} OutVars{P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_5|, ~a$r_buff1_thd1~0=v_~a$r_buff1_thd1~0_63, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_29|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_39} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#res.offset, ~a$r_buff1_thd1~0, P0Thread1of1ForFork0_#t~ite8, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-18 13:15:21,728 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [703] [703] L787-->L791: Formula: (and (not (= 0 (mod v_~a$flush_delayed~0_14 256))) (= v_~a~0_48 v_~a$mem_tmp~0_7) (= v_~a$flush_delayed~0_13 0)) InVars {~a$mem_tmp~0=v_~a$mem_tmp~0_7, ~a$flush_delayed~0=v_~a$flush_delayed~0_14} OutVars{~a~0=v_~a~0_48, ~a$mem_tmp~0=v_~a$mem_tmp~0_7, ~a$flush_delayed~0=v_~a$flush_delayed~0_13, P1Thread1of1ForFork1_#t~ite31=|v_P1Thread1of1ForFork1_#t~ite31_13|} AuxVars[] AssignedVars[~a~0, ~a$flush_delayed~0, P1Thread1of1ForFork1_#t~ite31] because there is no mapped edge [2019-12-18 13:15:21,729 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [725] [725] L791-2-->L791-5: Formula: (let ((.cse2 (= |P1Thread1of1ForFork1_#t~ite32_Out1430531986| |P1Thread1of1ForFork1_#t~ite33_Out1430531986|)) (.cse1 (= (mod ~a$r_buff1_thd2~0_In1430531986 256) 0)) (.cse0 (= 0 (mod ~a$w_buff1_used~0_In1430531986 256)))) (or (and (or .cse0 .cse1) .cse2 (= |P1Thread1of1ForFork1_#t~ite32_Out1430531986| ~a~0_In1430531986)) (and .cse2 (= ~a$w_buff1~0_In1430531986 |P1Thread1of1ForFork1_#t~ite32_Out1430531986|) (not .cse1) (not .cse0)))) InVars {~a~0=~a~0_In1430531986, ~a$w_buff1~0=~a$w_buff1~0_In1430531986, ~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In1430531986, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1430531986} OutVars{~a~0=~a~0_In1430531986, ~a$w_buff1~0=~a$w_buff1~0_In1430531986, ~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In1430531986, P1Thread1of1ForFork1_#t~ite32=|P1Thread1of1ForFork1_#t~ite32_Out1430531986|, P1Thread1of1ForFork1_#t~ite33=|P1Thread1of1ForFork1_#t~ite33_Out1430531986|, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1430531986} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite32, P1Thread1of1ForFork1_#t~ite33] because there is no mapped edge [2019-12-18 13:15:21,730 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [728] [728] L792-->L792-2: Formula: (let ((.cse1 (= 0 (mod ~a$w_buff0_used~0_In30741585 256))) (.cse0 (= 0 (mod ~a$r_buff0_thd2~0_In30741585 256)))) (or (and (= 0 |P1Thread1of1ForFork1_#t~ite34_Out30741585|) (not .cse0) (not .cse1)) (and (= |P1Thread1of1ForFork1_#t~ite34_Out30741585| ~a$w_buff0_used~0_In30741585) (or .cse1 .cse0)))) InVars {~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In30741585, ~a$w_buff0_used~0=~a$w_buff0_used~0_In30741585} OutVars{P1Thread1of1ForFork1_#t~ite34=|P1Thread1of1ForFork1_#t~ite34_Out30741585|, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In30741585, ~a$w_buff0_used~0=~a$w_buff0_used~0_In30741585} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite34] because there is no mapped edge [2019-12-18 13:15:21,730 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [721] [721] L793-->L793-2: Formula: (let ((.cse0 (= 0 (mod ~a$w_buff1_used~0_In275278182 256))) (.cse1 (= 0 (mod ~a$r_buff1_thd2~0_In275278182 256))) (.cse2 (= 0 (mod ~a$w_buff0_used~0_In275278182 256))) (.cse3 (= (mod ~a$r_buff0_thd2~0_In275278182 256) 0))) (or (and (= ~a$w_buff1_used~0_In275278182 |P1Thread1of1ForFork1_#t~ite35_Out275278182|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= 0 |P1Thread1of1ForFork1_#t~ite35_Out275278182|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))))) InVars {~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In275278182, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In275278182, ~a$w_buff0_used~0=~a$w_buff0_used~0_In275278182, ~a$w_buff1_used~0=~a$w_buff1_used~0_In275278182} OutVars{~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In275278182, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In275278182, ~a$w_buff0_used~0=~a$w_buff0_used~0_In275278182, P1Thread1of1ForFork1_#t~ite35=|P1Thread1of1ForFork1_#t~ite35_Out275278182|, ~a$w_buff1_used~0=~a$w_buff1_used~0_In275278182} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite35] because there is no mapped edge [2019-12-18 13:15:21,731 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [734] [734] L794-->L794-2: Formula: (let ((.cse0 (= 0 (mod ~a$w_buff0_used~0_In1040170427 256))) (.cse1 (= (mod ~a$r_buff0_thd2~0_In1040170427 256) 0))) (or (and (or .cse0 .cse1) (= ~a$r_buff0_thd2~0_In1040170427 |P1Thread1of1ForFork1_#t~ite36_Out1040170427|)) (and (= 0 |P1Thread1of1ForFork1_#t~ite36_Out1040170427|) (not .cse0) (not .cse1)))) InVars {~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In1040170427, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1040170427} OutVars{~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In1040170427, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1040170427, P1Thread1of1ForFork1_#t~ite36=|P1Thread1of1ForFork1_#t~ite36_Out1040170427|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite36] because there is no mapped edge [2019-12-18 13:15:21,732 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [724] [724] L795-->L795-2: Formula: (let ((.cse1 (= 0 (mod ~a$w_buff1_used~0_In495149856 256))) (.cse0 (= (mod ~a$r_buff1_thd2~0_In495149856 256) 0)) (.cse3 (= 0 (mod ~a$w_buff0_used~0_In495149856 256))) (.cse2 (= (mod ~a$r_buff0_thd2~0_In495149856 256) 0))) (or (and (= 0 |P1Thread1of1ForFork1_#t~ite37_Out495149856|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= |P1Thread1of1ForFork1_#t~ite37_Out495149856| ~a$r_buff1_thd2~0_In495149856) (or .cse1 .cse0) (or .cse3 .cse2)))) InVars {~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In495149856, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In495149856, ~a$w_buff0_used~0=~a$w_buff0_used~0_In495149856, ~a$w_buff1_used~0=~a$w_buff1_used~0_In495149856} OutVars{~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In495149856, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In495149856, ~a$w_buff0_used~0=~a$w_buff0_used~0_In495149856, ~a$w_buff1_used~0=~a$w_buff1_used~0_In495149856, P1Thread1of1ForFork1_#t~ite37=|P1Thread1of1ForFork1_#t~ite37_Out495149856|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-18 13:15:21,732 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [742] [742] L795-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork1_#res.base_5|) (= |v_P1Thread1of1ForFork1_#t~ite37_24| v_~a$r_buff1_thd2~0_110) (= (+ v_~__unbuffered_cnt~0_28 1) v_~__unbuffered_cnt~0_27) (= |v_P1Thread1of1ForFork1_#res.offset_5| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_28, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_24|} OutVars{P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_5|, ~a$r_buff1_thd2~0=v_~a$r_buff1_thd2~0_110, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_27, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_5|, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_23|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#res.offset, ~a$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#res.base, P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-18 13:15:21,732 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [672] [672] L816-1-->L822: Formula: (and (= 2 v_~__unbuffered_cnt~0_15) (= v_~main$tmp_guard0~0_9 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_15} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_15, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_9, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_7|} AuxVars[] AssignedVars[~main$tmp_guard0~0, ULTIMATE.start_main_#t~nondet39] because there is no mapped edge [2019-12-18 13:15:21,733 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [726] [726] L822-2-->L822-4: Formula: (let ((.cse0 (= (mod ~a$r_buff1_thd0~0_In1386011610 256) 0)) (.cse1 (= (mod ~a$w_buff1_used~0_In1386011610 256) 0))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite40_Out1386011610| ~a~0_In1386011610)) (and (not .cse0) (= |ULTIMATE.start_main_#t~ite40_Out1386011610| ~a$w_buff1~0_In1386011610) (not .cse1)))) InVars {~a~0=~a~0_In1386011610, ~a$w_buff1~0=~a$w_buff1~0_In1386011610, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In1386011610, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1386011610} OutVars{~a~0=~a~0_In1386011610, ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out1386011610|, ~a$w_buff1~0=~a$w_buff1~0_In1386011610, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In1386011610, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1386011610} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite40] because there is no mapped edge [2019-12-18 13:15:21,733 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [671] [671] L822-4-->L823: Formula: (= v_~a~0_26 |v_ULTIMATE.start_main_#t~ite40_17|) InVars {ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_17|} OutVars{~a~0=v_~a~0_26, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_20|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_16|} AuxVars[] AssignedVars[~a~0, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40] because there is no mapped edge [2019-12-18 13:15:21,734 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [715] [715] L823-->L823-2: Formula: (let ((.cse0 (= 0 (mod ~a$w_buff0_used~0_In2139517078 256))) (.cse1 (= (mod ~a$r_buff0_thd0~0_In2139517078 256) 0))) (or (and (or .cse0 .cse1) (= ~a$w_buff0_used~0_In2139517078 |ULTIMATE.start_main_#t~ite42_Out2139517078|)) (and (not .cse0) (= |ULTIMATE.start_main_#t~ite42_Out2139517078| 0) (not .cse1)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In2139517078, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In2139517078} OutVars{~a$w_buff0_used~0=~a$w_buff0_used~0_In2139517078, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In2139517078, ULTIMATE.start_main_#t~ite42=|ULTIMATE.start_main_#t~ite42_Out2139517078|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-18 13:15:21,735 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [714] [714] L824-->L824-2: Formula: (let ((.cse0 (= 0 (mod ~a$r_buff0_thd0~0_In-2007613353 256))) (.cse1 (= 0 (mod ~a$w_buff0_used~0_In-2007613353 256))) (.cse3 (= (mod ~a$r_buff1_thd0~0_In-2007613353 256) 0)) (.cse2 (= (mod ~a$w_buff1_used~0_In-2007613353 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite43_Out-2007613353| 0)) (and (= |ULTIMATE.start_main_#t~ite43_Out-2007613353| ~a$w_buff1_used~0_In-2007613353) (or .cse0 .cse1) (or .cse3 .cse2)))) InVars {~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In-2007613353, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-2007613353, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-2007613353, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-2007613353} OutVars{~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In-2007613353, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-2007613353, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-2007613353, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-2007613353, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out-2007613353|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43] because there is no mapped edge [2019-12-18 13:15:21,737 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [716] [716] L825-->L825-2: Formula: (let ((.cse1 (= 0 (mod ~a$r_buff0_thd0~0_In1785590499 256))) (.cse0 (= (mod ~a$w_buff0_used~0_In1785590499 256) 0))) (or (and (or .cse0 .cse1) (= ~a$r_buff0_thd0~0_In1785590499 |ULTIMATE.start_main_#t~ite44_Out1785590499|)) (and (not .cse1) (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite44_Out1785590499|)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In1785590499, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In1785590499} OutVars{~a$w_buff0_used~0=~a$w_buff0_used~0_In1785590499, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In1785590499, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out1785590499|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-18 13:15:21,738 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [723] [723] L826-->L826-2: Formula: (let ((.cse3 (= 0 (mod ~a$r_buff1_thd0~0_In-1926019141 256))) (.cse2 (= (mod ~a$w_buff1_used~0_In-1926019141 256) 0)) (.cse1 (= 0 (mod ~a$w_buff0_used~0_In-1926019141 256))) (.cse0 (= (mod ~a$r_buff0_thd0~0_In-1926019141 256) 0))) (or (and (= 0 |ULTIMATE.start_main_#t~ite45_Out-1926019141|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= ~a$r_buff1_thd0~0_In-1926019141 |ULTIMATE.start_main_#t~ite45_Out-1926019141|) (or .cse3 .cse2) (or .cse1 .cse0)))) InVars {~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In-1926019141, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1926019141, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-1926019141, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1926019141} OutVars{~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In-1926019141, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1926019141, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-1926019141, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1926019141, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out-1926019141|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-12-18 13:15:21,738 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [770] [770] L826-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_~main$tmp_guard1~0_18 0) (= v_ULTIMATE.start___VERIFIER_assert_~expression_18 0) (= v_~a$r_buff1_thd0~0_147 |v_ULTIMATE.start_main_#t~ite45_39|) (= v_~__unbuffered_p1_EBX~0_26 0) (= v_~__unbuffered_p0_EBX~0_86 0) (= 1 v_~__unbuffered_p1_EAX~0_18) (= 1 v_~__unbuffered_p0_EAX~0_88) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_10| (mod v_~main$tmp_guard1~0_18 256))) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_88, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_86, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_26, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_18, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_39|} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_88, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_18, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_86, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_26, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_18, ~a$r_buff1_thd0~0=v_~a$r_buff1_thd0~0_147, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_18, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_38|, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_10|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ~a$r_buff1_thd0~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite45, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-18 13:15:21,865 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.12 01:15:21 BasicIcfg [2019-12-18 13:15:21,865 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-18 13:15:21,868 INFO L168 Benchmark]: Toolchain (without parser) took 15590.27 ms. Allocated memory was 145.2 MB in the beginning and 440.4 MB in the end (delta: 295.2 MB). Free memory was 101.2 MB in the beginning and 122.0 MB in the end (delta: -20.8 MB). Peak memory consumption was 274.3 MB. Max. memory is 7.1 GB. [2019-12-18 13:15:21,869 INFO L168 Benchmark]: CDTParser took 0.51 ms. Allocated memory is still 145.2 MB. Free memory was 121.5 MB in the beginning and 121.3 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. [2019-12-18 13:15:21,870 INFO L168 Benchmark]: CACSL2BoogieTranslator took 810.94 ms. Allocated memory was 145.2 MB in the beginning and 202.9 MB in the end (delta: 57.7 MB). Free memory was 100.8 MB in the beginning and 155.2 MB in the end (delta: -54.4 MB). Peak memory consumption was 20.5 MB. Max. memory is 7.1 GB. [2019-12-18 13:15:21,870 INFO L168 Benchmark]: Boogie Procedure Inliner took 58.83 ms. Allocated memory is still 202.9 MB. Free memory was 155.2 MB in the beginning and 152.4 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-18 13:15:21,875 INFO L168 Benchmark]: Boogie Preprocessor took 59.36 ms. Allocated memory is still 202.9 MB. Free memory was 152.4 MB in the beginning and 150.4 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. [2019-12-18 13:15:21,876 INFO L168 Benchmark]: RCFGBuilder took 808.38 ms. Allocated memory is still 202.9 MB. Free memory was 150.4 MB in the beginning and 105.1 MB in the end (delta: 45.3 MB). Peak memory consumption was 45.3 MB. Max. memory is 7.1 GB. [2019-12-18 13:15:21,877 INFO L168 Benchmark]: TraceAbstraction took 13844.44 ms. Allocated memory was 202.9 MB in the beginning and 440.4 MB in the end (delta: 237.5 MB). Free memory was 104.4 MB in the beginning and 122.0 MB in the end (delta: -17.6 MB). Peak memory consumption was 219.9 MB. Max. memory is 7.1 GB. [2019-12-18 13:15:21,886 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.51 ms. Allocated memory is still 145.2 MB. Free memory was 121.5 MB in the beginning and 121.3 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 810.94 ms. Allocated memory was 145.2 MB in the beginning and 202.9 MB in the end (delta: 57.7 MB). Free memory was 100.8 MB in the beginning and 155.2 MB in the end (delta: -54.4 MB). Peak memory consumption was 20.5 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 58.83 ms. Allocated memory is still 202.9 MB. Free memory was 155.2 MB in the beginning and 152.4 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 59.36 ms. Allocated memory is still 202.9 MB. Free memory was 152.4 MB in the beginning and 150.4 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 808.38 ms. Allocated memory is still 202.9 MB. Free memory was 150.4 MB in the beginning and 105.1 MB in the end (delta: 45.3 MB). Peak memory consumption was 45.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 13844.44 ms. Allocated memory was 202.9 MB in the beginning and 440.4 MB in the end (delta: 237.5 MB). Free memory was 104.4 MB in the beginning and 122.0 MB in the end (delta: -17.6 MB). Peak memory consumption was 219.9 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 5.7s, 151 ProgramPointsBefore, 77 ProgramPointsAfterwards, 185 TransitionsBefore, 89 TransitionsAfterwards, 12056 CoEnabledTransitionPairs, 8 FixpointIterations, 33 TrivialSequentialCompositions, 40 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 34 ConcurrentYvCompositions, 25 ChoiceCompositions, 5174 VarBasedMoverChecksPositive, 220 VarBasedMoverChecksNegative, 43 SemBasedMoverChecksPositive, 239 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.8s, 0 MoverChecksTotal, 55357 CheckedPairsTotal, 107 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L814] FCALL, FORK 0 pthread_create(&t841, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L816] FCALL, FORK 0 pthread_create(&t842, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L737] 1 a$r_buff1_thd0 = a$r_buff0_thd0 [L738] 1 a$r_buff1_thd1 = a$r_buff0_thd1 [L739] 1 a$r_buff1_thd2 = a$r_buff0_thd2 [L740] 1 a$r_buff0_thd1 = (_Bool)1 [L743] 1 x = 1 [L746] 1 __unbuffered_p0_EAX = x [L749] 1 __unbuffered_p0_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L766] 2 y = 1 [L769] 2 z = 1 [L772] 2 __unbuffered_p1_EAX = z [L775] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L776] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L777] 2 a$flush_delayed = weak$$choice2 [L778] 2 a$mem_tmp = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=1] [L779] EXPR 2 !a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a : (a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : a$w_buff1) VAL [!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a : (a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : a$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=1] [L779] 2 a = !a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a : (a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : a$w_buff1) [L780] EXPR 2 weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : a$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : a$w_buff0))=1, x=1, y=1, z=1] [L780] 2 a$w_buff0 = weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : a$w_buff0)) [L752] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=1] [L781] EXPR 2 weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff1 : a$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff1 : a$w_buff1))=0, x=1, y=1, z=1] [L781] 2 a$w_buff1 = weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff1 : a$w_buff1)) [L782] EXPR 2 weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used))=1, x=1, y=1, z=1] [L782] 2 a$w_buff0_used = weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used)) [L783] 2 a$w_buff1_used = weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L785] EXPR 2 weak$$choice2 ? a$r_buff1_thd2 : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$r_buff1_thd2 : (a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? a$r_buff1_thd2 : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$r_buff1_thd2 : (a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=1, y=1, z=1] [L785] 2 a$r_buff1_thd2 = weak$$choice2 ? a$r_buff1_thd2 : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$r_buff1_thd2 : (a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L786] 2 __unbuffered_p1_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=1] [L752] 1 a = a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) [L753] 1 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L754] 1 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$w_buff1_used [L791] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=1] [L791] 2 a = a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) [L792] 2 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L793] 2 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used [L794] 2 a$r_buff0_thd2 = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L822] 0 a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=1] [L823] 0 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L824] 0 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$w_buff1_used [L825] 0 a$r_buff0_thd0 = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 145 locations, 2 error locations. Result: UNSAFE, OverallTime: 13.5s, OverallIterations: 21, TraceHistogramMax: 1, AutomataDifference: 3.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 2405 SDtfs, 2258 SDslu, 4441 SDs, 0 SdLazy, 2473 SolverSat, 108 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 123 GetRequests, 31 SyntacticMatches, 11 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=8640occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.9s AutomataMinimizationTime, 20 MinimizatonAttempts, 5198 StatesRemovedByMinimization, 17 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 737 NumberOfCodeBlocks, 737 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 664 ConstructedInterpolants, 0 QuantifiedInterpolants, 105381 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 20 InterpolantComputations, 20 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...