/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/mix011_rmo.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-26 21:30:06,063 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-26 21:30:06,067 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-26 21:30:06,080 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-26 21:30:06,081 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-26 21:30:06,082 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-26 21:30:06,083 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-26 21:30:06,085 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-26 21:30:06,087 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-26 21:30:06,088 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-26 21:30:06,089 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-26 21:30:06,090 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-26 21:30:06,090 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-26 21:30:06,091 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-26 21:30:06,092 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-26 21:30:06,093 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-26 21:30:06,094 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-26 21:30:06,095 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-26 21:30:06,096 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-26 21:30:06,099 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-26 21:30:06,100 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-26 21:30:06,101 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-26 21:30:06,102 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-26 21:30:06,103 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-26 21:30:06,106 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-26 21:30:06,106 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-26 21:30:06,106 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-26 21:30:06,107 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-26 21:30:06,107 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-26 21:30:06,108 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-26 21:30:06,109 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-26 21:30:06,109 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-26 21:30:06,110 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-26 21:30:06,111 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-26 21:30:06,112 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-26 21:30:06,112 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-26 21:30:06,113 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-26 21:30:06,113 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-26 21:30:06,113 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-26 21:30:06,114 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-26 21:30:06,115 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-26 21:30:06,116 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-26 21:30:06,130 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-26 21:30:06,130 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-26 21:30:06,131 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-26 21:30:06,132 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-26 21:30:06,132 INFO L138 SettingsManager]: * Use SBE=true [2019-12-26 21:30:06,132 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-26 21:30:06,132 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-26 21:30:06,132 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-26 21:30:06,133 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-26 21:30:06,133 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-26 21:30:06,133 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-26 21:30:06,133 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-26 21:30:06,133 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-26 21:30:06,134 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-26 21:30:06,134 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-26 21:30:06,134 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-26 21:30:06,134 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-26 21:30:06,134 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-26 21:30:06,135 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-26 21:30:06,135 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-26 21:30:06,135 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-26 21:30:06,135 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-26 21:30:06,135 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-26 21:30:06,136 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-26 21:30:06,136 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-26 21:30:06,136 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-26 21:30:06,136 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-26 21:30:06,136 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-26 21:30:06,137 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-26 21:30:06,137 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-26 21:30:06,395 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-26 21:30:06,407 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-26 21:30:06,411 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-26 21:30:06,412 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-26 21:30:06,412 INFO L275 PluginConnector]: CDTParser initialized [2019-12-26 21:30:06,414 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix011_rmo.oepc.i [2019-12-26 21:30:06,478 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aec79a894/8b4f9e88b39f40b4851cb15d6689d113/FLAG8473b3b1d [2019-12-26 21:30:07,068 INFO L306 CDTParser]: Found 1 translation units. [2019-12-26 21:30:07,068 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix011_rmo.oepc.i [2019-12-26 21:30:07,083 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aec79a894/8b4f9e88b39f40b4851cb15d6689d113/FLAG8473b3b1d [2019-12-26 21:30:07,359 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aec79a894/8b4f9e88b39f40b4851cb15d6689d113 [2019-12-26 21:30:07,368 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-26 21:30:07,370 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-26 21:30:07,371 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-26 21:30:07,372 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-26 21:30:07,375 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-26 21:30:07,376 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.12 09:30:07" (1/1) ... [2019-12-26 21:30:07,379 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5c1335d8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 09:30:07, skipping insertion in model container [2019-12-26 21:30:07,379 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.12 09:30:07" (1/1) ... [2019-12-26 21:30:07,387 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-26 21:30:07,441 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-26 21:30:07,921 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-26 21:30:07,945 INFO L203 MainTranslator]: Completed pre-run [2019-12-26 21:30:08,043 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-26 21:30:08,129 INFO L208 MainTranslator]: Completed translation [2019-12-26 21:30:08,129 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 09:30:08 WrapperNode [2019-12-26 21:30:08,130 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-26 21:30:08,130 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-26 21:30:08,131 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-26 21:30:08,131 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-26 21:30:08,139 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 09:30:08" (1/1) ... [2019-12-26 21:30:08,160 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 09:30:08" (1/1) ... [2019-12-26 21:30:08,196 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-26 21:30:08,197 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-26 21:30:08,197 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-26 21:30:08,197 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-26 21:30:08,208 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 09:30:08" (1/1) ... [2019-12-26 21:30:08,208 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 09:30:08" (1/1) ... [2019-12-26 21:30:08,213 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 09:30:08" (1/1) ... [2019-12-26 21:30:08,214 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 09:30:08" (1/1) ... [2019-12-26 21:30:08,225 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 09:30:08" (1/1) ... [2019-12-26 21:30:08,229 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 09:30:08" (1/1) ... [2019-12-26 21:30:08,233 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 09:30:08" (1/1) ... [2019-12-26 21:30:08,239 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-26 21:30:08,240 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-26 21:30:08,240 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-26 21:30:08,240 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-26 21:30:08,241 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 09:30:08" (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-26 21:30:08,329 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-26 21:30:08,329 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-26 21:30:08,329 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-26 21:30:08,329 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-26 21:30:08,330 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-26 21:30:08,330 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-26 21:30:08,330 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-26 21:30:08,330 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-26 21:30:08,330 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-26 21:30:08,330 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-26 21:30:08,331 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-26 21:30:08,331 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-26 21:30:08,331 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-26 21:30:08,333 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-26 21:30:09,129 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-26 21:30:09,130 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-26 21:30:09,131 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.12 09:30:09 BoogieIcfgContainer [2019-12-26 21:30:09,131 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-26 21:30:09,132 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-26 21:30:09,133 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-26 21:30:09,136 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-26 21:30:09,136 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.12 09:30:07" (1/3) ... [2019-12-26 21:30:09,137 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@59f04772 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.12 09:30:09, skipping insertion in model container [2019-12-26 21:30:09,137 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 09:30:08" (2/3) ... [2019-12-26 21:30:09,138 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@59f04772 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.12 09:30:09, skipping insertion in model container [2019-12-26 21:30:09,138 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.12 09:30:09" (3/3) ... [2019-12-26 21:30:09,140 INFO L109 eAbstractionObserver]: Analyzing ICFG mix011_rmo.oepc.i [2019-12-26 21:30:09,151 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-26 21:30:09,151 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-26 21:30:09,159 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-26 21:30:09,160 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-26 21:30:09,207 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:30:09,208 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:30:09,208 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:30:09,208 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:30:09,209 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:30:09,209 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:30:09,210 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:30:09,210 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:30:09,211 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:30:09,211 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:30:09,211 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:30:09,211 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:30:09,212 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:30:09,212 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:30:09,212 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:30:09,213 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:30:09,213 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:30:09,213 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:30:09,213 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:30:09,214 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:30:09,214 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:30:09,214 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:30:09,214 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:30:09,215 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:30:09,215 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:30:09,215 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:30:09,216 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:30:09,216 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:30:09,216 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:30:09,216 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:30:09,217 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:30:09,217 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:30:09,217 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:30:09,217 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:30:09,218 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:30:09,218 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:30:09,219 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:30:09,219 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:30:09,219 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:30:09,220 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:30:09,220 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:30:09,220 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:30:09,220 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:30:09,220 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:30:09,221 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:30:09,221 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:30:09,221 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:30:09,238 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:30:09,239 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:30:09,239 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:30:09,240 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:30:09,240 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:30:09,240 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:30:09,240 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:30:09,241 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:30:09,241 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:30:09,241 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:30:09,241 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:30:09,241 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:30:09,242 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:30:09,242 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:30:09,242 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:30:09,242 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:30:09,242 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:30:09,244 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:30:09,244 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:30:09,244 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:30:09,244 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:30:09,244 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:30:09,244 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:30:09,245 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:30:09,245 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:30:09,245 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:30:09,245 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:30:09,246 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:30:09,246 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:30:09,246 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:30:09,246 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:30:09,246 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:30:09,247 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:30:09,247 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:30:09,247 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:30:09,247 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:30:09,247 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:30:09,248 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:30:09,248 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:30:09,248 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:30:09,248 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:30:09,248 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:30:09,249 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:30:09,249 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:30:09,249 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:30:09,249 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:30:09,249 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:30:09,250 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:30:09,250 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:30:09,250 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:30:09,250 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:30:09,250 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:30:09,251 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:30:09,251 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:30:09,251 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:30:09,251 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:30:09,252 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:30:09,252 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:30:09,252 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:30:09,252 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:30:09,252 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:30:09,253 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:30:09,253 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:30:09,253 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:30:09,253 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:30:09,253 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:30:09,254 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:30:09,254 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:30:09,254 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:30:09,254 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:30:09,254 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:30:09,255 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:30:09,255 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:30:09,255 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:30:09,255 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:30:09,256 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:30:09,256 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:30:09,256 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:30:09,256 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:30:09,256 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:30:09,257 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:30:09,257 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:30:09,257 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:30:09,257 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:30:09,257 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:30:09,257 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:30:09,258 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:30:09,258 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:30:09,258 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:30:09,258 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:30:09,258 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:30:09,259 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:30:09,259 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:30:09,259 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:30:09,259 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:30:09,259 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:30:09,259 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:30:09,260 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:30:09,260 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:30:09,260 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:30:09,260 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:30:09,260 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:30:09,261 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:30:09,261 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:30:09,261 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:30:09,261 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:30:09,261 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:30:09,262 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:30:09,262 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:30:09,262 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:30:09,262 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:30:09,262 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:30:09,263 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:30:09,263 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:30:09,263 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:30:09,263 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:30:09,263 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:30:09,264 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:30:09,264 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:30:09,264 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:30:09,264 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:30:09,264 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:30:09,265 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:30:09,265 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:30:09,265 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:30:09,265 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:30:09,265 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:30:09,266 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:30:09,266 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:30:09,266 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:30:09,266 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:30:09,267 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:30:09,267 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:30:09,267 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:30:09,267 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:30:09,271 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:30:09,271 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:30:09,271 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:30:09,271 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:30:09,272 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:30:09,272 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:30:09,272 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:30:09,272 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:30:09,272 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:30:09,273 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:30:09,273 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:30:09,273 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:30:09,273 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:30:09,273 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:30:09,273 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:30:09,274 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:30:09,274 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:30:09,274 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:30:09,274 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:30:09,274 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:30:09,275 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:30:09,275 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:30:09,275 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:30:09,275 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:30:09,275 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:30:09,275 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:30:09,276 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:30:09,276 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:30:09,276 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:30:09,276 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:30:09,276 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:30:09,277 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:30:09,277 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:30:09,280 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:30:09,281 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:30:09,281 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:30:09,281 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:30:09,281 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:30:09,281 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:30:09,282 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:30:09,282 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:30:09,282 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:30:09,282 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:30:09,282 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:30:09,283 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:30:09,288 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:30:09,288 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:30:09,288 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:30:09,288 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:30:09,289 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:30:09,289 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:30:09,289 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:30:09,289 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:30:09,290 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:30:09,290 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:30:09,307 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-26 21:30:09,327 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-26 21:30:09,328 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-26 21:30:09,328 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-26 21:30:09,328 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-26 21:30:09,328 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-26 21:30:09,328 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-26 21:30:09,328 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-26 21:30:09,329 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-26 21:30:09,347 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 178 places, 215 transitions [2019-12-26 21:30:09,349 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 178 places, 215 transitions [2019-12-26 21:30:09,455 INFO L132 PetriNetUnfolder]: 47/212 cut-off events. [2019-12-26 21:30:09,456 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-26 21:30:09,475 INFO L76 FinitePrefix]: Finished finitePrefix Result has 222 conditions, 212 events. 47/212 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 426 event pairs. 0/163 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-26 21:30:09,499 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 178 places, 215 transitions [2019-12-26 21:30:09,555 INFO L132 PetriNetUnfolder]: 47/212 cut-off events. [2019-12-26 21:30:09,555 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-26 21:30:09,564 INFO L76 FinitePrefix]: Finished finitePrefix Result has 222 conditions, 212 events. 47/212 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 426 event pairs. 0/163 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-26 21:30:09,585 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 19004 [2019-12-26 21:30:09,587 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-26 21:30:14,903 WARN L192 SmtUtils]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 87 [2019-12-26 21:30:15,021 WARN L192 SmtUtils]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 87 [2019-12-26 21:30:15,311 WARN L192 SmtUtils]: Spent 264.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 93 [2019-12-26 21:30:15,443 WARN L192 SmtUtils]: Spent 129.00 ms on a formula simplification that was a NOOP. DAG size: 91 [2019-12-26 21:30:15,477 INFO L206 etLargeBlockEncoding]: Checked pairs total: 90866 [2019-12-26 21:30:15,477 INFO L214 etLargeBlockEncoding]: Total number of compositions: 114 [2019-12-26 21:30:15,481 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 94 places, 103 transitions [2019-12-26 21:30:36,314 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 123302 states. [2019-12-26 21:30:36,316 INFO L276 IsEmpty]: Start isEmpty. Operand 123302 states. [2019-12-26 21:30:36,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-26 21:30:36,321 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:30:36,322 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-26 21:30:36,322 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 21:30:36,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:30:36,327 INFO L82 PathProgramCache]: Analyzing trace with hash 918873, now seen corresponding path program 1 times [2019-12-26 21:30:36,335 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:30:36,335 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1690620161] [2019-12-26 21:30:36,336 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:30:36,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:30:36,546 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-26 21:30:36,547 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1690620161] [2019-12-26 21:30:36,548 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:30:36,548 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-26 21:30:36,549 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1563100481] [2019-12-26 21:30:36,554 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 21:30:36,554 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:30:36,569 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 21:30:36,570 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 21:30:36,572 INFO L87 Difference]: Start difference. First operand 123302 states. Second operand 3 states. [2019-12-26 21:30:40,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:30:40,650 INFO L93 Difference]: Finished difference Result 122174 states and 518852 transitions. [2019-12-26 21:30:40,651 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 21:30:40,652 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-26 21:30:40,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:30:41,566 INFO L225 Difference]: With dead ends: 122174 [2019-12-26 21:30:41,566 INFO L226 Difference]: Without dead ends: 115076 [2019-12-26 21:30:41,568 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-26 21:30:46,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115076 states. [2019-12-26 21:30:49,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115076 to 115076. [2019-12-26 21:30:49,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115076 states. [2019-12-26 21:30:50,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115076 states to 115076 states and 488094 transitions. [2019-12-26 21:30:50,031 INFO L78 Accepts]: Start accepts. Automaton has 115076 states and 488094 transitions. Word has length 3 [2019-12-26 21:30:50,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:30:50,031 INFO L462 AbstractCegarLoop]: Abstraction has 115076 states and 488094 transitions. [2019-12-26 21:30:50,031 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 21:30:50,031 INFO L276 IsEmpty]: Start isEmpty. Operand 115076 states and 488094 transitions. [2019-12-26 21:30:50,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-26 21:30:50,035 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:30:50,035 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 21:30:50,035 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 21:30:50,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:30:50,036 INFO L82 PathProgramCache]: Analyzing trace with hash 1360334080, now seen corresponding path program 1 times [2019-12-26 21:30:50,036 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:30:50,036 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1969051587] [2019-12-26 21:30:50,036 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:30:50,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:30:50,187 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-26 21:30:50,188 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1969051587] [2019-12-26 21:30:50,189 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:30:50,189 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 21:30:50,189 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1216706112] [2019-12-26 21:30:50,191 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-26 21:30:50,191 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:30:50,191 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-26 21:30:50,192 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-26 21:30:50,192 INFO L87 Difference]: Start difference. First operand 115076 states and 488094 transitions. Second operand 4 states. [2019-12-26 21:30:55,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:30:55,650 INFO L93 Difference]: Finished difference Result 178684 states and 728513 transitions. [2019-12-26 21:30:55,651 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-26 21:30:55,651 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-26 21:30:55,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:30:56,265 INFO L225 Difference]: With dead ends: 178684 [2019-12-26 21:30:56,265 INFO L226 Difference]: Without dead ends: 178635 [2019-12-26 21:30:56,266 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-26 21:31:05,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178635 states. [2019-12-26 21:31:08,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178635 to 162755. [2019-12-26 21:31:08,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162755 states. [2019-12-26 21:31:09,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162755 states to 162755 states and 672033 transitions. [2019-12-26 21:31:09,381 INFO L78 Accepts]: Start accepts. Automaton has 162755 states and 672033 transitions. Word has length 11 [2019-12-26 21:31:09,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:31:09,382 INFO L462 AbstractCegarLoop]: Abstraction has 162755 states and 672033 transitions. [2019-12-26 21:31:09,382 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-26 21:31:09,382 INFO L276 IsEmpty]: Start isEmpty. Operand 162755 states and 672033 transitions. [2019-12-26 21:31:09,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-26 21:31:09,390 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:31:09,390 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 21:31:09,390 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 21:31:09,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:31:09,391 INFO L82 PathProgramCache]: Analyzing trace with hash 1888852276, now seen corresponding path program 1 times [2019-12-26 21:31:09,391 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:31:09,391 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1217410392] [2019-12-26 21:31:09,391 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:31:09,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:31:09,457 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-26 21:31:09,458 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1217410392] [2019-12-26 21:31:09,458 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:31:09,458 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 21:31:09,458 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1082101999] [2019-12-26 21:31:09,459 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 21:31:09,460 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:31:09,460 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 21:31:09,460 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 21:31:09,461 INFO L87 Difference]: Start difference. First operand 162755 states and 672033 transitions. Second operand 3 states. [2019-12-26 21:31:09,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:31:09,607 INFO L93 Difference]: Finished difference Result 34587 states and 111811 transitions. [2019-12-26 21:31:09,607 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 21:31:09,607 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-26 21:31:09,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:31:09,665 INFO L225 Difference]: With dead ends: 34587 [2019-12-26 21:31:09,665 INFO L226 Difference]: Without dead ends: 34587 [2019-12-26 21:31:09,666 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-26 21:31:09,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34587 states. [2019-12-26 21:31:10,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34587 to 34587. [2019-12-26 21:31:10,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34587 states. [2019-12-26 21:31:15,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34587 states to 34587 states and 111811 transitions. [2019-12-26 21:31:15,790 INFO L78 Accepts]: Start accepts. Automaton has 34587 states and 111811 transitions. Word has length 13 [2019-12-26 21:31:15,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:31:15,791 INFO L462 AbstractCegarLoop]: Abstraction has 34587 states and 111811 transitions. [2019-12-26 21:31:15,791 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 21:31:15,791 INFO L276 IsEmpty]: Start isEmpty. Operand 34587 states and 111811 transitions. [2019-12-26 21:31:15,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-26 21:31:15,795 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:31:15,795 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 21:31:15,795 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 21:31:15,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:31:15,796 INFO L82 PathProgramCache]: Analyzing trace with hash -1220224201, now seen corresponding path program 1 times [2019-12-26 21:31:15,796 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:31:15,796 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1493340820] [2019-12-26 21:31:15,796 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:31:15,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:31:15,931 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-26 21:31:15,932 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1493340820] [2019-12-26 21:31:15,932 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:31:15,932 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 21:31:15,933 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [791566473] [2019-12-26 21:31:15,933 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-26 21:31:15,933 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:31:15,933 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-26 21:31:15,934 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-26 21:31:15,934 INFO L87 Difference]: Start difference. First operand 34587 states and 111811 transitions. Second operand 5 states. [2019-12-26 21:31:16,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:31:16,455 INFO L93 Difference]: Finished difference Result 47506 states and 151809 transitions. [2019-12-26 21:31:16,455 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-26 21:31:16,455 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2019-12-26 21:31:16,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:31:16,535 INFO L225 Difference]: With dead ends: 47506 [2019-12-26 21:31:16,535 INFO L226 Difference]: Without dead ends: 47506 [2019-12-26 21:31:16,535 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-26 21:31:16,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47506 states. [2019-12-26 21:31:17,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47506 to 39981. [2019-12-26 21:31:17,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39981 states. [2019-12-26 21:31:17,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39981 states to 39981 states and 128832 transitions. [2019-12-26 21:31:17,336 INFO L78 Accepts]: Start accepts. Automaton has 39981 states and 128832 transitions. Word has length 16 [2019-12-26 21:31:17,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:31:17,337 INFO L462 AbstractCegarLoop]: Abstraction has 39981 states and 128832 transitions. [2019-12-26 21:31:17,337 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-26 21:31:17,338 INFO L276 IsEmpty]: Start isEmpty. Operand 39981 states and 128832 transitions. [2019-12-26 21:31:17,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-26 21:31:17,347 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:31:17,347 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 21:31:17,347 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 21:31:17,347 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:31:17,348 INFO L82 PathProgramCache]: Analyzing trace with hash -1720601530, now seen corresponding path program 1 times [2019-12-26 21:31:17,348 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:31:17,348 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [776794562] [2019-12-26 21:31:17,348 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:31:17,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:31:17,440 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-26 21:31:17,440 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [776794562] [2019-12-26 21:31:17,440 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:31:17,441 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-26 21:31:17,441 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [10780505] [2019-12-26 21:31:17,441 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-26 21:31:17,441 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:31:17,442 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-26 21:31:17,442 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-26 21:31:17,442 INFO L87 Difference]: Start difference. First operand 39981 states and 128832 transitions. Second operand 6 states. [2019-12-26 21:31:18,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:31:18,311 INFO L93 Difference]: Finished difference Result 59624 states and 187628 transitions. [2019-12-26 21:31:18,311 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-26 21:31:18,311 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2019-12-26 21:31:18,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:31:18,409 INFO L225 Difference]: With dead ends: 59624 [2019-12-26 21:31:18,410 INFO L226 Difference]: Without dead ends: 59617 [2019-12-26 21:31:18,410 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2019-12-26 21:31:18,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59617 states. [2019-12-26 21:31:19,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59617 to 40463. [2019-12-26 21:31:19,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40463 states. [2019-12-26 21:31:19,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40463 states to 40463 states and 129749 transitions. [2019-12-26 21:31:19,540 INFO L78 Accepts]: Start accepts. Automaton has 40463 states and 129749 transitions. Word has length 22 [2019-12-26 21:31:19,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:31:19,540 INFO L462 AbstractCegarLoop]: Abstraction has 40463 states and 129749 transitions. [2019-12-26 21:31:19,540 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-26 21:31:19,540 INFO L276 IsEmpty]: Start isEmpty. Operand 40463 states and 129749 transitions. [2019-12-26 21:31:19,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-26 21:31:19,553 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:31:19,553 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-26 21:31:19,554 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 21:31:19,554 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:31:19,554 INFO L82 PathProgramCache]: Analyzing trace with hash -74763598, now seen corresponding path program 1 times [2019-12-26 21:31:19,554 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:31:19,555 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [198401825] [2019-12-26 21:31:19,555 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:31:19,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:31:19,621 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-26 21:31:19,621 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [198401825] [2019-12-26 21:31:19,621 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:31:19,622 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 21:31:19,622 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1145244775] [2019-12-26 21:31:19,622 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-26 21:31:19,623 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:31:19,623 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-26 21:31:19,623 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-26 21:31:19,623 INFO L87 Difference]: Start difference. First operand 40463 states and 129749 transitions. Second operand 4 states. [2019-12-26 21:31:19,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:31:19,705 INFO L93 Difference]: Finished difference Result 16096 states and 48753 transitions. [2019-12-26 21:31:19,706 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-26 21:31:19,706 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2019-12-26 21:31:19,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:31:19,744 INFO L225 Difference]: With dead ends: 16096 [2019-12-26 21:31:19,744 INFO L226 Difference]: Without dead ends: 16096 [2019-12-26 21:31:19,744 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-26 21:31:19,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16096 states. [2019-12-26 21:31:20,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16096 to 15803. [2019-12-26 21:31:20,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15803 states. [2019-12-26 21:31:20,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15803 states to 15803 states and 47917 transitions. [2019-12-26 21:31:20,177 INFO L78 Accepts]: Start accepts. Automaton has 15803 states and 47917 transitions. Word has length 25 [2019-12-26 21:31:20,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:31:20,177 INFO L462 AbstractCegarLoop]: Abstraction has 15803 states and 47917 transitions. [2019-12-26 21:31:20,177 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-26 21:31:20,177 INFO L276 IsEmpty]: Start isEmpty. Operand 15803 states and 47917 transitions. [2019-12-26 21:31:20,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-26 21:31:20,192 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:31:20,192 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-26 21:31:20,192 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 21:31:20,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:31:20,193 INFO L82 PathProgramCache]: Analyzing trace with hash 1856606199, now seen corresponding path program 1 times [2019-12-26 21:31:20,193 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:31:20,193 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [186363549] [2019-12-26 21:31:20,193 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:31:20,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:31:20,349 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-26 21:31:20,349 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [186363549] [2019-12-26 21:31:20,350 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:31:20,350 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-26 21:31:20,350 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1811687260] [2019-12-26 21:31:20,350 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-26 21:31:20,351 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:31:20,351 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-26 21:31:20,351 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-26 21:31:20,351 INFO L87 Difference]: Start difference. First operand 15803 states and 47917 transitions. Second operand 6 states. [2019-12-26 21:31:20,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:31:20,948 INFO L93 Difference]: Finished difference Result 22779 states and 67340 transitions. [2019-12-26 21:31:20,948 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-26 21:31:20,948 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2019-12-26 21:31:20,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:31:20,981 INFO L225 Difference]: With dead ends: 22779 [2019-12-26 21:31:20,981 INFO L226 Difference]: Without dead ends: 22779 [2019-12-26 21:31:20,982 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-12-26 21:31:21,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22779 states. [2019-12-26 21:31:21,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22779 to 18120. [2019-12-26 21:31:21,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18120 states. [2019-12-26 21:31:21,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18120 states to 18120 states and 54739 transitions. [2019-12-26 21:31:21,475 INFO L78 Accepts]: Start accepts. Automaton has 18120 states and 54739 transitions. Word has length 27 [2019-12-26 21:31:21,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:31:21,476 INFO L462 AbstractCegarLoop]: Abstraction has 18120 states and 54739 transitions. [2019-12-26 21:31:21,476 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-26 21:31:21,476 INFO L276 IsEmpty]: Start isEmpty. Operand 18120 states and 54739 transitions. [2019-12-26 21:31:21,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-26 21:31:21,497 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:31:21,497 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 21:31:21,497 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 21:31:21,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:31:21,498 INFO L82 PathProgramCache]: Analyzing trace with hash -1731527828, now seen corresponding path program 1 times [2019-12-26 21:31:21,498 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:31:21,498 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [76404380] [2019-12-26 21:31:21,498 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:31:21,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:31:21,600 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-26 21:31:21,600 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [76404380] [2019-12-26 21:31:21,600 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:31:21,600 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-26 21:31:21,601 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2127058998] [2019-12-26 21:31:21,601 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-26 21:31:21,601 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:31:21,602 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-26 21:31:21,602 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-26 21:31:21,602 INFO L87 Difference]: Start difference. First operand 18120 states and 54739 transitions. Second operand 7 states. [2019-12-26 21:31:22,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:31:22,694 INFO L93 Difference]: Finished difference Result 24798 states and 73024 transitions. [2019-12-26 21:31:22,694 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-26 21:31:22,694 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 33 [2019-12-26 21:31:22,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:31:22,729 INFO L225 Difference]: With dead ends: 24798 [2019-12-26 21:31:22,729 INFO L226 Difference]: Without dead ends: 24798 [2019-12-26 21:31:22,730 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=90, Invalid=252, Unknown=0, NotChecked=0, Total=342 [2019-12-26 21:31:22,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24798 states. [2019-12-26 21:31:22,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24798 to 16706. [2019-12-26 21:31:22,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16706 states. [2019-12-26 21:31:23,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16706 states to 16706 states and 50524 transitions. [2019-12-26 21:31:23,024 INFO L78 Accepts]: Start accepts. Automaton has 16706 states and 50524 transitions. Word has length 33 [2019-12-26 21:31:23,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:31:23,024 INFO L462 AbstractCegarLoop]: Abstraction has 16706 states and 50524 transitions. [2019-12-26 21:31:23,024 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-26 21:31:23,024 INFO L276 IsEmpty]: Start isEmpty. Operand 16706 states and 50524 transitions. [2019-12-26 21:31:23,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-26 21:31:23,047 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:31:23,047 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 21:31:23,047 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 21:31:23,047 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:31:23,047 INFO L82 PathProgramCache]: Analyzing trace with hash -1723865273, now seen corresponding path program 1 times [2019-12-26 21:31:23,048 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:31:23,048 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [579017816] [2019-12-26 21:31:23,048 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:31:23,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:31:23,113 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-26 21:31:23,113 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [579017816] [2019-12-26 21:31:23,113 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:31:23,114 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 21:31:23,114 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [827522525] [2019-12-26 21:31:23,114 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 21:31:23,114 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:31:23,115 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 21:31:23,115 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 21:31:23,115 INFO L87 Difference]: Start difference. First operand 16706 states and 50524 transitions. Second operand 3 states. [2019-12-26 21:31:23,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:31:23,230 INFO L93 Difference]: Finished difference Result 28297 states and 85903 transitions. [2019-12-26 21:31:23,230 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 21:31:23,230 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2019-12-26 21:31:23,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:31:23,259 INFO L225 Difference]: With dead ends: 28297 [2019-12-26 21:31:23,259 INFO L226 Difference]: Without dead ends: 14210 [2019-12-26 21:31:23,259 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-26 21:31:23,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14210 states. [2019-12-26 21:31:23,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14210 to 14150. [2019-12-26 21:31:23,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14150 states. [2019-12-26 21:31:23,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14150 states to 14150 states and 42128 transitions. [2019-12-26 21:31:23,640 INFO L78 Accepts]: Start accepts. Automaton has 14150 states and 42128 transitions. Word has length 39 [2019-12-26 21:31:23,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:31:23,640 INFO L462 AbstractCegarLoop]: Abstraction has 14150 states and 42128 transitions. [2019-12-26 21:31:23,640 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 21:31:23,641 INFO L276 IsEmpty]: Start isEmpty. Operand 14150 states and 42128 transitions. [2019-12-26 21:31:23,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-26 21:31:23,666 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:31:23,666 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 21:31:23,666 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 21:31:23,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:31:23,667 INFO L82 PathProgramCache]: Analyzing trace with hash 1940280365, now seen corresponding path program 2 times [2019-12-26 21:31:23,667 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:31:23,667 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2064368700] [2019-12-26 21:31:23,668 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:31:23,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:31:23,725 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 21:31:23,725 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2064368700] [2019-12-26 21:31:23,726 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:31:23,726 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-26 21:31:23,726 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [826669383] [2019-12-26 21:31:23,726 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 21:31:23,727 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:31:23,727 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 21:31:23,727 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 21:31:23,727 INFO L87 Difference]: Start difference. First operand 14150 states and 42128 transitions. Second operand 3 states. [2019-12-26 21:31:23,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:31:23,787 INFO L93 Difference]: Finished difference Result 14149 states and 42126 transitions. [2019-12-26 21:31:23,788 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 21:31:23,788 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2019-12-26 21:31:23,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:31:23,812 INFO L225 Difference]: With dead ends: 14149 [2019-12-26 21:31:23,813 INFO L226 Difference]: Without dead ends: 14149 [2019-12-26 21:31:23,813 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-26 21:31:23,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14149 states. [2019-12-26 21:31:24,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14149 to 14149. [2019-12-26 21:31:24,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14149 states. [2019-12-26 21:31:24,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14149 states to 14149 states and 42126 transitions. [2019-12-26 21:31:24,098 INFO L78 Accepts]: Start accepts. Automaton has 14149 states and 42126 transitions. Word has length 39 [2019-12-26 21:31:24,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:31:24,098 INFO L462 AbstractCegarLoop]: Abstraction has 14149 states and 42126 transitions. [2019-12-26 21:31:24,098 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 21:31:24,098 INFO L276 IsEmpty]: Start isEmpty. Operand 14149 states and 42126 transitions. [2019-12-26 21:31:24,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-26 21:31:24,115 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:31:24,116 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 21:31:24,116 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 21:31:24,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:31:24,116 INFO L82 PathProgramCache]: Analyzing trace with hash 140069502, now seen corresponding path program 1 times [2019-12-26 21:31:24,116 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:31:24,116 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1317743512] [2019-12-26 21:31:24,117 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:31:24,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:31:24,176 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-26 21:31:24,176 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1317743512] [2019-12-26 21:31:24,178 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:31:24,178 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-26 21:31:24,178 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1561542072] [2019-12-26 21:31:24,178 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-26 21:31:24,179 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:31:24,179 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-26 21:31:24,179 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-26 21:31:24,179 INFO L87 Difference]: Start difference. First operand 14149 states and 42126 transitions. Second operand 5 states. [2019-12-26 21:31:24,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:31:24,254 INFO L93 Difference]: Finished difference Result 13093 states and 39713 transitions. [2019-12-26 21:31:24,254 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-26 21:31:24,254 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 40 [2019-12-26 21:31:24,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:31:24,275 INFO L225 Difference]: With dead ends: 13093 [2019-12-26 21:31:24,276 INFO L226 Difference]: Without dead ends: 11563 [2019-12-26 21:31:24,276 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-26 21:31:24,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11563 states. [2019-12-26 21:31:24,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11563 to 11150. [2019-12-26 21:31:24,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11150 states. [2019-12-26 21:31:24,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11150 states to 11150 states and 34836 transitions. [2019-12-26 21:31:24,472 INFO L78 Accepts]: Start accepts. Automaton has 11150 states and 34836 transitions. Word has length 40 [2019-12-26 21:31:24,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:31:24,472 INFO L462 AbstractCegarLoop]: Abstraction has 11150 states and 34836 transitions. [2019-12-26 21:31:24,473 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-26 21:31:24,473 INFO L276 IsEmpty]: Start isEmpty. Operand 11150 states and 34836 transitions. [2019-12-26 21:31:24,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-26 21:31:24,484 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:31:24,485 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 21:31:24,485 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 21:31:24,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:31:24,485 INFO L82 PathProgramCache]: Analyzing trace with hash 1749898488, now seen corresponding path program 1 times [2019-12-26 21:31:24,485 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:31:24,485 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1013364658] [2019-12-26 21:31:24,486 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:31:24,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:31:24,529 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-26 21:31:24,530 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1013364658] [2019-12-26 21:31:24,530 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:31:24,530 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 21:31:24,530 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1937405894] [2019-12-26 21:31:24,531 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 21:31:24,531 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:31:24,531 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 21:31:24,531 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 21:31:24,532 INFO L87 Difference]: Start difference. First operand 11150 states and 34836 transitions. Second operand 3 states. [2019-12-26 21:31:24,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:31:24,733 INFO L93 Difference]: Finished difference Result 17888 states and 54761 transitions. [2019-12-26 21:31:24,733 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 21:31:24,734 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 64 [2019-12-26 21:31:24,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:31:24,757 INFO L225 Difference]: With dead ends: 17888 [2019-12-26 21:31:24,757 INFO L226 Difference]: Without dead ends: 17888 [2019-12-26 21:31:24,757 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-26 21:31:24,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17888 states. [2019-12-26 21:31:24,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17888 to 12900. [2019-12-26 21:31:24,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12900 states. [2019-12-26 21:31:24,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12900 states to 12900 states and 39991 transitions. [2019-12-26 21:31:24,994 INFO L78 Accepts]: Start accepts. Automaton has 12900 states and 39991 transitions. Word has length 64 [2019-12-26 21:31:24,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:31:24,994 INFO L462 AbstractCegarLoop]: Abstraction has 12900 states and 39991 transitions. [2019-12-26 21:31:24,994 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 21:31:24,994 INFO L276 IsEmpty]: Start isEmpty. Operand 12900 states and 39991 transitions. [2019-12-26 21:31:25,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-26 21:31:25,009 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:31:25,009 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 21:31:25,009 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 21:31:25,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:31:25,009 INFO L82 PathProgramCache]: Analyzing trace with hash 1943324054, now seen corresponding path program 1 times [2019-12-26 21:31:25,009 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:31:25,010 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1233520660] [2019-12-26 21:31:25,010 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:31:25,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:31:25,103 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-26 21:31:25,104 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1233520660] [2019-12-26 21:31:25,104 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:31:25,104 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-26 21:31:25,104 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1027998203] [2019-12-26 21:31:25,105 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-26 21:31:25,105 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:31:25,105 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-26 21:31:25,105 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-26 21:31:25,106 INFO L87 Difference]: Start difference. First operand 12900 states and 39991 transitions. Second operand 7 states. [2019-12-26 21:31:25,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:31:25,575 INFO L93 Difference]: Finished difference Result 37114 states and 114341 transitions. [2019-12-26 21:31:25,575 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-26 21:31:25,575 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 64 [2019-12-26 21:31:25,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:31:25,636 INFO L225 Difference]: With dead ends: 37114 [2019-12-26 21:31:25,636 INFO L226 Difference]: Without dead ends: 27250 [2019-12-26 21:31:25,637 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2019-12-26 21:31:25,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27250 states. [2019-12-26 21:31:26,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27250 to 15594. [2019-12-26 21:31:26,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15594 states. [2019-12-26 21:31:26,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15594 states to 15594 states and 48552 transitions. [2019-12-26 21:31:26,047 INFO L78 Accepts]: Start accepts. Automaton has 15594 states and 48552 transitions. Word has length 64 [2019-12-26 21:31:26,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:31:26,047 INFO L462 AbstractCegarLoop]: Abstraction has 15594 states and 48552 transitions. [2019-12-26 21:31:26,047 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-26 21:31:26,048 INFO L276 IsEmpty]: Start isEmpty. Operand 15594 states and 48552 transitions. [2019-12-26 21:31:26,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-26 21:31:26,068 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:31:26,068 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 21:31:26,068 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 21:31:26,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:31:26,068 INFO L82 PathProgramCache]: Analyzing trace with hash -1388273988, now seen corresponding path program 2 times [2019-12-26 21:31:26,069 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:31:26,069 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [161115383] [2019-12-26 21:31:26,069 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:31:26,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:31:26,155 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-26 21:31:26,155 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [161115383] [2019-12-26 21:31:26,155 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:31:26,155 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-26 21:31:26,156 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2086037902] [2019-12-26 21:31:26,156 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-26 21:31:26,156 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:31:26,156 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-26 21:31:26,157 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-26 21:31:26,157 INFO L87 Difference]: Start difference. First operand 15594 states and 48552 transitions. Second operand 7 states. [2019-12-26 21:31:26,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:31:26,632 INFO L93 Difference]: Finished difference Result 41160 states and 125962 transitions. [2019-12-26 21:31:26,632 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-26 21:31:26,635 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 64 [2019-12-26 21:31:26,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:31:26,678 INFO L225 Difference]: With dead ends: 41160 [2019-12-26 21:31:26,678 INFO L226 Difference]: Without dead ends: 29917 [2019-12-26 21:31:26,678 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2019-12-26 21:31:26,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29917 states. [2019-12-26 21:31:27,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29917 to 18174. [2019-12-26 21:31:27,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18174 states. [2019-12-26 21:31:27,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18174 states to 18174 states and 56555 transitions. [2019-12-26 21:31:27,068 INFO L78 Accepts]: Start accepts. Automaton has 18174 states and 56555 transitions. Word has length 64 [2019-12-26 21:31:27,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:31:27,068 INFO L462 AbstractCegarLoop]: Abstraction has 18174 states and 56555 transitions. [2019-12-26 21:31:27,068 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-26 21:31:27,069 INFO L276 IsEmpty]: Start isEmpty. Operand 18174 states and 56555 transitions. [2019-12-26 21:31:27,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-26 21:31:27,097 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:31:27,097 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 21:31:27,098 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 21:31:27,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:31:27,098 INFO L82 PathProgramCache]: Analyzing trace with hash -1006987750, now seen corresponding path program 3 times [2019-12-26 21:31:27,098 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:31:27,098 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1143641742] [2019-12-26 21:31:27,099 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:31:27,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:31:27,211 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-26 21:31:27,212 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1143641742] [2019-12-26 21:31:27,212 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:31:27,212 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-26 21:31:27,212 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [89589928] [2019-12-26 21:31:27,213 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-26 21:31:27,213 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:31:27,213 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-26 21:31:27,213 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-26 21:31:27,214 INFO L87 Difference]: Start difference. First operand 18174 states and 56555 transitions. Second operand 9 states. [2019-12-26 21:31:28,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:31:28,736 INFO L93 Difference]: Finished difference Result 69591 states and 211239 transitions. [2019-12-26 21:31:28,741 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-12-26 21:31:28,741 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 64 [2019-12-26 21:31:28,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:31:28,845 INFO L225 Difference]: With dead ends: 69591 [2019-12-26 21:31:28,845 INFO L226 Difference]: Without dead ends: 65149 [2019-12-26 21:31:28,846 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 217 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=229, Invalid=701, Unknown=0, NotChecked=0, Total=930 [2019-12-26 21:31:29,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65149 states. [2019-12-26 21:31:29,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65149 to 18319. [2019-12-26 21:31:29,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18319 states. [2019-12-26 21:31:29,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18319 states to 18319 states and 57144 transitions. [2019-12-26 21:31:29,495 INFO L78 Accepts]: Start accepts. Automaton has 18319 states and 57144 transitions. Word has length 64 [2019-12-26 21:31:29,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:31:29,495 INFO L462 AbstractCegarLoop]: Abstraction has 18319 states and 57144 transitions. [2019-12-26 21:31:29,496 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-26 21:31:29,496 INFO L276 IsEmpty]: Start isEmpty. Operand 18319 states and 57144 transitions. [2019-12-26 21:31:29,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-26 21:31:29,516 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:31:29,516 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 21:31:29,516 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 21:31:29,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:31:29,516 INFO L82 PathProgramCache]: Analyzing trace with hash -1302254906, now seen corresponding path program 1 times [2019-12-26 21:31:29,516 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:31:29,517 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1380036650] [2019-12-26 21:31:29,517 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:31:29,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:31:29,568 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-26 21:31:29,568 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1380036650] [2019-12-26 21:31:29,569 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:31:29,569 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 21:31:29,569 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [233950715] [2019-12-26 21:31:29,569 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 21:31:29,570 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:31:29,570 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 21:31:29,570 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 21:31:29,570 INFO L87 Difference]: Start difference. First operand 18319 states and 57144 transitions. Second operand 3 states. [2019-12-26 21:31:29,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:31:29,667 INFO L93 Difference]: Finished difference Result 23765 states and 72382 transitions. [2019-12-26 21:31:29,667 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 21:31:29,667 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 64 [2019-12-26 21:31:29,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:31:29,698 INFO L225 Difference]: With dead ends: 23765 [2019-12-26 21:31:29,698 INFO L226 Difference]: Without dead ends: 23765 [2019-12-26 21:31:29,699 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-26 21:31:29,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23765 states. [2019-12-26 21:31:29,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23765 to 18819. [2019-12-26 21:31:29,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18819 states. [2019-12-26 21:31:30,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18819 states to 18819 states and 57725 transitions. [2019-12-26 21:31:30,027 INFO L78 Accepts]: Start accepts. Automaton has 18819 states and 57725 transitions. Word has length 64 [2019-12-26 21:31:30,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:31:30,027 INFO L462 AbstractCegarLoop]: Abstraction has 18819 states and 57725 transitions. [2019-12-26 21:31:30,027 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 21:31:30,027 INFO L276 IsEmpty]: Start isEmpty. Operand 18819 states and 57725 transitions. [2019-12-26 21:31:30,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-26 21:31:30,047 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:31:30,047 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 21:31:30,047 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 21:31:30,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:31:30,048 INFO L82 PathProgramCache]: Analyzing trace with hash 479548822, now seen corresponding path program 4 times [2019-12-26 21:31:30,048 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:31:30,048 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [638407908] [2019-12-26 21:31:30,048 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:31:30,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:31:30,165 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 21:31:30,166 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [638407908] [2019-12-26 21:31:30,166 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:31:30,166 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-26 21:31:30,166 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2077820040] [2019-12-26 21:31:30,167 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-26 21:31:30,167 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:31:30,167 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-26 21:31:30,167 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-26 21:31:30,168 INFO L87 Difference]: Start difference. First operand 18819 states and 57725 transitions. Second operand 9 states. [2019-12-26 21:31:31,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:31:31,754 INFO L93 Difference]: Finished difference Result 63866 states and 192746 transitions. [2019-12-26 21:31:31,754 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-26 21:31:31,754 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 64 [2019-12-26 21:31:31,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:31:31,850 INFO L225 Difference]: With dead ends: 63866 [2019-12-26 21:31:31,851 INFO L226 Difference]: Without dead ends: 61442 [2019-12-26 21:31:31,851 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 144 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=157, Invalid=493, Unknown=0, NotChecked=0, Total=650 [2019-12-26 21:31:32,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61442 states. [2019-12-26 21:31:32,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61442 to 18847. [2019-12-26 21:31:32,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18847 states. [2019-12-26 21:31:32,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18847 states to 18847 states and 57879 transitions. [2019-12-26 21:31:32,417 INFO L78 Accepts]: Start accepts. Automaton has 18847 states and 57879 transitions. Word has length 64 [2019-12-26 21:31:32,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:31:32,418 INFO L462 AbstractCegarLoop]: Abstraction has 18847 states and 57879 transitions. [2019-12-26 21:31:32,418 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-26 21:31:32,418 INFO L276 IsEmpty]: Start isEmpty. Operand 18847 states and 57879 transitions. [2019-12-26 21:31:32,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-26 21:31:32,437 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:31:32,437 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 21:31:32,437 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 21:31:32,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:31:32,437 INFO L82 PathProgramCache]: Analyzing trace with hash 1651786320, now seen corresponding path program 5 times [2019-12-26 21:31:32,438 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:31:32,438 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [18941522] [2019-12-26 21:31:32,438 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:31:32,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:31:32,542 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-26 21:31:32,543 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [18941522] [2019-12-26 21:31:32,543 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:31:32,543 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-26 21:31:32,543 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1188262381] [2019-12-26 21:31:32,544 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-26 21:31:32,544 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:31:32,544 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-26 21:31:32,544 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-26 21:31:32,544 INFO L87 Difference]: Start difference. First operand 18847 states and 57879 transitions. Second operand 7 states. [2019-12-26 21:31:33,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:31:33,573 INFO L93 Difference]: Finished difference Result 33314 states and 98781 transitions. [2019-12-26 21:31:33,574 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-26 21:31:33,574 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 64 [2019-12-26 21:31:33,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:31:33,619 INFO L225 Difference]: With dead ends: 33314 [2019-12-26 21:31:33,619 INFO L226 Difference]: Without dead ends: 33146 [2019-12-26 21:31:33,620 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=158, Unknown=0, NotChecked=0, Total=210 [2019-12-26 21:31:33,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33146 states. [2019-12-26 21:31:34,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33146 to 26403. [2019-12-26 21:31:34,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26403 states. [2019-12-26 21:31:34,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26403 states to 26403 states and 79272 transitions. [2019-12-26 21:31:34,069 INFO L78 Accepts]: Start accepts. Automaton has 26403 states and 79272 transitions. Word has length 64 [2019-12-26 21:31:34,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:31:34,070 INFO L462 AbstractCegarLoop]: Abstraction has 26403 states and 79272 transitions. [2019-12-26 21:31:34,070 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-26 21:31:34,070 INFO L276 IsEmpty]: Start isEmpty. Operand 26403 states and 79272 transitions. [2019-12-26 21:31:34,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-26 21:31:34,095 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:31:34,095 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 21:31:34,095 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 21:31:34,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:31:34,096 INFO L82 PathProgramCache]: Analyzing trace with hash -2061800196, now seen corresponding path program 6 times [2019-12-26 21:31:34,096 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:31:34,096 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1523069205] [2019-12-26 21:31:34,096 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:31:34,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:31:34,151 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-26 21:31:34,151 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1523069205] [2019-12-26 21:31:34,151 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:31:34,151 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 21:31:34,151 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [980035520] [2019-12-26 21:31:34,152 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 21:31:34,152 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:31:34,152 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 21:31:34,152 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 21:31:34,153 INFO L87 Difference]: Start difference. First operand 26403 states and 79272 transitions. Second operand 3 states. [2019-12-26 21:31:34,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:31:34,283 INFO L93 Difference]: Finished difference Result 31436 states and 94494 transitions. [2019-12-26 21:31:34,283 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 21:31:34,283 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 64 [2019-12-26 21:31:34,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:31:34,323 INFO L225 Difference]: With dead ends: 31436 [2019-12-26 21:31:34,323 INFO L226 Difference]: Without dead ends: 31436 [2019-12-26 21:31:34,323 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 21:31:34,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31436 states. [2019-12-26 21:31:34,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31436 to 26427. [2019-12-26 21:31:34,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26427 states. [2019-12-26 21:31:34,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26427 states to 26427 states and 79898 transitions. [2019-12-26 21:31:34,959 INFO L78 Accepts]: Start accepts. Automaton has 26427 states and 79898 transitions. Word has length 64 [2019-12-26 21:31:34,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:31:34,959 INFO L462 AbstractCegarLoop]: Abstraction has 26427 states and 79898 transitions. [2019-12-26 21:31:34,959 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 21:31:34,960 INFO L276 IsEmpty]: Start isEmpty. Operand 26427 states and 79898 transitions. [2019-12-26 21:31:34,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-26 21:31:34,987 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:31:34,987 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 21:31:34,987 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 21:31:34,987 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:31:34,987 INFO L82 PathProgramCache]: Analyzing trace with hash 996367564, now seen corresponding path program 1 times [2019-12-26 21:31:34,987 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:31:34,988 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1860759223] [2019-12-26 21:31:34,988 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:31:35,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:31:35,087 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-26 21:31:35,087 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1860759223] [2019-12-26 21:31:35,087 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:31:35,087 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-26 21:31:35,088 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2036861410] [2019-12-26 21:31:35,088 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-26 21:31:35,088 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:31:35,088 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-26 21:31:35,089 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-26 21:31:35,089 INFO L87 Difference]: Start difference. First operand 26427 states and 79898 transitions. Second operand 9 states. [2019-12-26 21:31:36,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:31:36,425 INFO L93 Difference]: Finished difference Result 75091 states and 222713 transitions. [2019-12-26 21:31:36,425 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-12-26 21:31:36,426 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 65 [2019-12-26 21:31:36,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:31:36,529 INFO L225 Difference]: With dead ends: 75091 [2019-12-26 21:31:36,529 INFO L226 Difference]: Without dead ends: 70259 [2019-12-26 21:31:36,529 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 139 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=157, Invalid=493, Unknown=0, NotChecked=0, Total=650 [2019-12-26 21:31:36,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70259 states. [2019-12-26 21:31:37,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70259 to 26572. [2019-12-26 21:31:37,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26572 states. [2019-12-26 21:31:37,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26572 states to 26572 states and 80425 transitions. [2019-12-26 21:31:37,288 INFO L78 Accepts]: Start accepts. Automaton has 26572 states and 80425 transitions. Word has length 65 [2019-12-26 21:31:37,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:31:37,288 INFO L462 AbstractCegarLoop]: Abstraction has 26572 states and 80425 transitions. [2019-12-26 21:31:37,289 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-26 21:31:37,289 INFO L276 IsEmpty]: Start isEmpty. Operand 26572 states and 80425 transitions. [2019-12-26 21:31:37,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-26 21:31:37,317 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:31:37,317 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 21:31:37,318 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 21:31:37,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:31:37,318 INFO L82 PathProgramCache]: Analyzing trace with hash 2045608364, now seen corresponding path program 2 times [2019-12-26 21:31:37,318 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:31:37,318 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1270477145] [2019-12-26 21:31:37,319 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:31:37,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:31:37,444 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-26 21:31:37,444 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1270477145] [2019-12-26 21:31:37,445 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:31:37,445 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-26 21:31:37,445 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1982455659] [2019-12-26 21:31:37,445 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-26 21:31:37,446 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:31:37,446 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-26 21:31:37,446 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-26 21:31:37,446 INFO L87 Difference]: Start difference. First operand 26572 states and 80425 transitions. Second operand 9 states. [2019-12-26 21:31:38,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:31:38,755 INFO L93 Difference]: Finished difference Result 80705 states and 239117 transitions. [2019-12-26 21:31:38,756 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-26 21:31:38,756 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 65 [2019-12-26 21:31:38,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:31:39,144 INFO L225 Difference]: With dead ends: 80705 [2019-12-26 21:31:39,144 INFO L226 Difference]: Without dead ends: 75905 [2019-12-26 21:31:39,145 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 144 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=159, Invalid=491, Unknown=0, NotChecked=0, Total=650 [2019-12-26 21:31:39,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75905 states. [2019-12-26 21:31:39,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75905 to 26453. [2019-12-26 21:31:39,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26453 states. [2019-12-26 21:31:39,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26453 states to 26453 states and 79873 transitions. [2019-12-26 21:31:39,879 INFO L78 Accepts]: Start accepts. Automaton has 26453 states and 79873 transitions. Word has length 65 [2019-12-26 21:31:39,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:31:39,879 INFO L462 AbstractCegarLoop]: Abstraction has 26453 states and 79873 transitions. [2019-12-26 21:31:39,879 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-26 21:31:39,879 INFO L276 IsEmpty]: Start isEmpty. Operand 26453 states and 79873 transitions. [2019-12-26 21:31:39,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-26 21:31:39,910 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:31:39,911 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 21:31:39,911 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 21:31:39,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:31:39,911 INFO L82 PathProgramCache]: Analyzing trace with hash -848247963, now seen corresponding path program 1 times [2019-12-26 21:31:39,912 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:31:39,912 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1939453965] [2019-12-26 21:31:39,912 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:31:39,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:31:40,106 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-26 21:31:40,106 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1939453965] [2019-12-26 21:31:40,106 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:31:40,107 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-26 21:31:40,107 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1872496793] [2019-12-26 21:31:40,107 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-26 21:31:40,107 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:31:40,107 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-26 21:31:40,108 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2019-12-26 21:31:40,108 INFO L87 Difference]: Start difference. First operand 26453 states and 79873 transitions. Second operand 11 states. [2019-12-26 21:31:42,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:31:42,571 INFO L93 Difference]: Finished difference Result 41763 states and 123043 transitions. [2019-12-26 21:31:42,571 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-12-26 21:31:42,571 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 65 [2019-12-26 21:31:42,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:31:42,631 INFO L225 Difference]: With dead ends: 41763 [2019-12-26 21:31:42,631 INFO L226 Difference]: Without dead ends: 41523 [2019-12-26 21:31:42,631 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 4 SyntacticMatches, 4 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 340 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=262, Invalid=1070, Unknown=0, NotChecked=0, Total=1332 [2019-12-26 21:31:42,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41523 states. [2019-12-26 21:31:43,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41523 to 28887. [2019-12-26 21:31:43,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28887 states. [2019-12-26 21:31:43,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28887 states to 28887 states and 87051 transitions. [2019-12-26 21:31:43,177 INFO L78 Accepts]: Start accepts. Automaton has 28887 states and 87051 transitions. Word has length 65 [2019-12-26 21:31:43,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:31:43,178 INFO L462 AbstractCegarLoop]: Abstraction has 28887 states and 87051 transitions. [2019-12-26 21:31:43,178 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-26 21:31:43,178 INFO L276 IsEmpty]: Start isEmpty. Operand 28887 states and 87051 transitions. [2019-12-26 21:31:43,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-26 21:31:43,207 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:31:43,207 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 21:31:43,208 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 21:31:43,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:31:43,208 INFO L82 PathProgramCache]: Analyzing trace with hash -947164955, now seen corresponding path program 2 times [2019-12-26 21:31:43,208 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:31:43,208 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2130657062] [2019-12-26 21:31:43,208 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:31:43,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:31:43,578 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-26 21:31:43,578 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2130657062] [2019-12-26 21:31:43,578 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:31:43,579 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-26 21:31:43,579 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [464801619] [2019-12-26 21:31:43,579 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-26 21:31:43,579 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:31:43,579 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-26 21:31:43,580 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-26 21:31:43,580 INFO L87 Difference]: Start difference. First operand 28887 states and 87051 transitions. Second operand 6 states. [2019-12-26 21:31:44,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:31:44,250 INFO L93 Difference]: Finished difference Result 35840 states and 106531 transitions. [2019-12-26 21:31:44,250 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-26 21:31:44,250 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 65 [2019-12-26 21:31:44,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:31:44,298 INFO L225 Difference]: With dead ends: 35840 [2019-12-26 21:31:44,298 INFO L226 Difference]: Without dead ends: 35840 [2019-12-26 21:31:44,298 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 3 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-12-26 21:31:44,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35840 states. [2019-12-26 21:31:44,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35840 to 28862. [2019-12-26 21:31:44,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28862 states. [2019-12-26 21:31:44,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28862 states to 28862 states and 86928 transitions. [2019-12-26 21:31:44,763 INFO L78 Accepts]: Start accepts. Automaton has 28862 states and 86928 transitions. Word has length 65 [2019-12-26 21:31:44,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:31:44,763 INFO L462 AbstractCegarLoop]: Abstraction has 28862 states and 86928 transitions. [2019-12-26 21:31:44,764 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-26 21:31:44,764 INFO L276 IsEmpty]: Start isEmpty. Operand 28862 states and 86928 transitions. [2019-12-26 21:31:44,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-26 21:31:44,795 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:31:44,795 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 21:31:44,796 INFO L410 AbstractCegarLoop]: === Iteration 24 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 21:31:44,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:31:44,796 INFO L82 PathProgramCache]: Analyzing trace with hash 1625168593, now seen corresponding path program 3 times [2019-12-26 21:31:44,796 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:31:44,796 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [178736193] [2019-12-26 21:31:44,796 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:31:44,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:31:45,173 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-26 21:31:45,174 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [178736193] [2019-12-26 21:31:45,174 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:31:45,174 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-26 21:31:45,174 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1815194449] [2019-12-26 21:31:45,177 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-26 21:31:45,178 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:31:45,178 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-26 21:31:45,178 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2019-12-26 21:31:45,179 INFO L87 Difference]: Start difference. First operand 28862 states and 86928 transitions. Second operand 13 states. [2019-12-26 21:31:47,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:31:47,769 INFO L93 Difference]: Finished difference Result 48275 states and 144130 transitions. [2019-12-26 21:31:47,776 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-12-26 21:31:47,776 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 65 [2019-12-26 21:31:47,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:31:47,840 INFO L225 Difference]: With dead ends: 48275 [2019-12-26 21:31:47,840 INFO L226 Difference]: Without dead ends: 48055 [2019-12-26 21:31:47,841 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 2 SyntacticMatches, 4 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 231 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=253, Invalid=869, Unknown=0, NotChecked=0, Total=1122 [2019-12-26 21:31:47,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48055 states. [2019-12-26 21:31:48,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48055 to 34442. [2019-12-26 21:31:48,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34442 states. [2019-12-26 21:31:48,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34442 states to 34442 states and 103515 transitions. [2019-12-26 21:31:48,909 INFO L78 Accepts]: Start accepts. Automaton has 34442 states and 103515 transitions. Word has length 65 [2019-12-26 21:31:48,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:31:48,909 INFO L462 AbstractCegarLoop]: Abstraction has 34442 states and 103515 transitions. [2019-12-26 21:31:48,909 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-26 21:31:48,909 INFO L276 IsEmpty]: Start isEmpty. Operand 34442 states and 103515 transitions. [2019-12-26 21:31:48,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-26 21:31:48,948 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:31:48,948 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 21:31:48,948 INFO L410 AbstractCegarLoop]: === Iteration 25 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 21:31:48,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:31:48,949 INFO L82 PathProgramCache]: Analyzing trace with hash -323165651, now seen corresponding path program 4 times [2019-12-26 21:31:48,949 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:31:48,949 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1103784091] [2019-12-26 21:31:48,949 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:31:48,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:31:49,024 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-26 21:31:49,025 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1103784091] [2019-12-26 21:31:49,025 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:31:49,025 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 21:31:49,025 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1164167068] [2019-12-26 21:31:49,026 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 21:31:49,026 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:31:49,026 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 21:31:49,026 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 21:31:49,026 INFO L87 Difference]: Start difference. First operand 34442 states and 103515 transitions. Second operand 3 states. [2019-12-26 21:31:49,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:31:49,130 INFO L93 Difference]: Finished difference Result 24899 states and 74105 transitions. [2019-12-26 21:31:49,130 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 21:31:49,131 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-26 21:31:49,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:31:49,173 INFO L225 Difference]: With dead ends: 24899 [2019-12-26 21:31:49,173 INFO L226 Difference]: Without dead ends: 24899 [2019-12-26 21:31:49,173 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-26 21:31:49,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24899 states. [2019-12-26 21:31:49,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24899 to 23198. [2019-12-26 21:31:49,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23198 states. [2019-12-26 21:31:49,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23198 states to 23198 states and 68830 transitions. [2019-12-26 21:31:49,521 INFO L78 Accepts]: Start accepts. Automaton has 23198 states and 68830 transitions. Word has length 65 [2019-12-26 21:31:49,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:31:49,521 INFO L462 AbstractCegarLoop]: Abstraction has 23198 states and 68830 transitions. [2019-12-26 21:31:49,521 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 21:31:49,521 INFO L276 IsEmpty]: Start isEmpty. Operand 23198 states and 68830 transitions. [2019-12-26 21:31:49,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-26 21:31:49,543 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:31:49,543 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 21:31:49,543 INFO L410 AbstractCegarLoop]: === Iteration 26 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 21:31:49,544 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:31:49,544 INFO L82 PathProgramCache]: Analyzing trace with hash 422367122, now seen corresponding path program 1 times [2019-12-26 21:31:49,544 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:31:49,544 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1076920956] [2019-12-26 21:31:49,544 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:31:49,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:31:49,726 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 21:31:49,726 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1076920956] [2019-12-26 21:31:49,726 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:31:49,726 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-26 21:31:49,727 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1466486682] [2019-12-26 21:31:49,727 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-26 21:31:49,727 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:31:49,728 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-26 21:31:49,728 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2019-12-26 21:31:49,728 INFO L87 Difference]: Start difference. First operand 23198 states and 68830 transitions. Second operand 10 states. [2019-12-26 21:31:51,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:31:51,425 INFO L93 Difference]: Finished difference Result 42676 states and 126321 transitions. [2019-12-26 21:31:51,425 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-12-26 21:31:51,425 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 66 [2019-12-26 21:31:51,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:31:51,470 INFO L225 Difference]: With dead ends: 42676 [2019-12-26 21:31:51,470 INFO L226 Difference]: Without dead ends: 32725 [2019-12-26 21:31:51,471 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=88, Invalid=332, Unknown=0, NotChecked=0, Total=420 [2019-12-26 21:31:51,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32725 states. [2019-12-26 21:31:51,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32725 to 23919. [2019-12-26 21:31:51,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23919 states. [2019-12-26 21:31:51,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23919 states to 23919 states and 70737 transitions. [2019-12-26 21:31:51,892 INFO L78 Accepts]: Start accepts. Automaton has 23919 states and 70737 transitions. Word has length 66 [2019-12-26 21:31:51,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:31:51,892 INFO L462 AbstractCegarLoop]: Abstraction has 23919 states and 70737 transitions. [2019-12-26 21:31:51,892 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-26 21:31:51,892 INFO L276 IsEmpty]: Start isEmpty. Operand 23919 states and 70737 transitions. [2019-12-26 21:31:51,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-26 21:31:51,917 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:31:51,917 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 21:31:51,917 INFO L410 AbstractCegarLoop]: === Iteration 27 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 21:31:51,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:31:51,918 INFO L82 PathProgramCache]: Analyzing trace with hash -1740403892, now seen corresponding path program 2 times [2019-12-26 21:31:51,918 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:31:51,918 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [421450022] [2019-12-26 21:31:51,918 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:31:51,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:31:52,098 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-26 21:31:52,099 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [421450022] [2019-12-26 21:31:52,099 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:31:52,099 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-26 21:31:52,099 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1473699194] [2019-12-26 21:31:52,100 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-26 21:31:52,100 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:31:52,100 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-26 21:31:52,100 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-26 21:31:52,100 INFO L87 Difference]: Start difference. First operand 23919 states and 70737 transitions. Second operand 11 states. [2019-12-26 21:31:53,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:31:53,762 INFO L93 Difference]: Finished difference Result 37680 states and 110760 transitions. [2019-12-26 21:31:53,762 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-26 21:31:53,762 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 66 [2019-12-26 21:31:53,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:31:53,811 INFO L225 Difference]: With dead ends: 37680 [2019-12-26 21:31:53,811 INFO L226 Difference]: Without dead ends: 32341 [2019-12-26 21:31:53,811 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=85, Invalid=335, Unknown=0, NotChecked=0, Total=420 [2019-12-26 21:31:53,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32341 states. [2019-12-26 21:31:54,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32341 to 23799. [2019-12-26 21:31:54,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23799 states. [2019-12-26 21:31:54,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23799 states to 23799 states and 70379 transitions. [2019-12-26 21:31:54,421 INFO L78 Accepts]: Start accepts. Automaton has 23799 states and 70379 transitions. Word has length 66 [2019-12-26 21:31:54,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:31:54,421 INFO L462 AbstractCegarLoop]: Abstraction has 23799 states and 70379 transitions. [2019-12-26 21:31:54,422 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-26 21:31:54,422 INFO L276 IsEmpty]: Start isEmpty. Operand 23799 states and 70379 transitions. [2019-12-26 21:31:54,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-26 21:31:54,444 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:31:54,444 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 21:31:54,445 INFO L410 AbstractCegarLoop]: === Iteration 28 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 21:31:54,445 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:31:54,445 INFO L82 PathProgramCache]: Analyzing trace with hash 1863760888, now seen corresponding path program 3 times [2019-12-26 21:31:54,445 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:31:54,445 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [816385171] [2019-12-26 21:31:54,445 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:31:54,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:31:54,623 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-26 21:31:54,624 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [816385171] [2019-12-26 21:31:54,624 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:31:54,624 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-26 21:31:54,624 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1946076023] [2019-12-26 21:31:54,625 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-26 21:31:54,625 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:31:54,625 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-26 21:31:54,625 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-12-26 21:31:54,625 INFO L87 Difference]: Start difference. First operand 23799 states and 70379 transitions. Second operand 10 states. [2019-12-26 21:31:56,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:31:56,331 INFO L93 Difference]: Finished difference Result 41995 states and 123111 transitions. [2019-12-26 21:31:56,331 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-26 21:31:56,331 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 66 [2019-12-26 21:31:56,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:31:56,377 INFO L225 Difference]: With dead ends: 41995 [2019-12-26 21:31:56,377 INFO L226 Difference]: Without dead ends: 34772 [2019-12-26 21:31:56,378 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=241, Unknown=0, NotChecked=0, Total=306 [2019-12-26 21:31:56,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34772 states. [2019-12-26 21:31:56,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34772 to 24370. [2019-12-26 21:31:56,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24370 states. [2019-12-26 21:31:56,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24370 states to 24370 states and 71772 transitions. [2019-12-26 21:31:56,788 INFO L78 Accepts]: Start accepts. Automaton has 24370 states and 71772 transitions. Word has length 66 [2019-12-26 21:31:56,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:31:56,788 INFO L462 AbstractCegarLoop]: Abstraction has 24370 states and 71772 transitions. [2019-12-26 21:31:56,789 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-26 21:31:56,789 INFO L276 IsEmpty]: Start isEmpty. Operand 24370 states and 71772 transitions. [2019-12-26 21:31:56,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-26 21:31:56,811 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:31:56,811 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 21:31:56,811 INFO L410 AbstractCegarLoop]: === Iteration 29 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 21:31:56,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:31:56,811 INFO L82 PathProgramCache]: Analyzing trace with hash 2049544724, now seen corresponding path program 4 times [2019-12-26 21:31:56,811 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:31:56,812 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [640303791] [2019-12-26 21:31:56,812 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:31:56,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:31:56,986 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-26 21:31:56,986 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [640303791] [2019-12-26 21:31:56,986 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:31:56,986 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-26 21:31:56,987 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1641492230] [2019-12-26 21:31:56,987 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-26 21:31:56,987 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:31:56,987 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-26 21:31:56,988 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-26 21:31:56,988 INFO L87 Difference]: Start difference. First operand 24370 states and 71772 transitions. Second operand 11 states. [2019-12-26 21:31:58,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:31:58,722 INFO L93 Difference]: Finished difference Result 39814 states and 116658 transitions. [2019-12-26 21:31:58,723 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-26 21:31:58,723 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 66 [2019-12-26 21:31:58,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:31:58,774 INFO L225 Difference]: With dead ends: 39814 [2019-12-26 21:31:58,774 INFO L226 Difference]: Without dead ends: 34358 [2019-12-26 21:31:58,774 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=74, Invalid=306, Unknown=0, NotChecked=0, Total=380 [2019-12-26 21:31:58,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34358 states. [2019-12-26 21:31:59,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34358 to 23850. [2019-12-26 21:31:59,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23850 states. [2019-12-26 21:31:59,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23850 states to 23850 states and 70282 transitions. [2019-12-26 21:31:59,537 INFO L78 Accepts]: Start accepts. Automaton has 23850 states and 70282 transitions. Word has length 66 [2019-12-26 21:31:59,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:31:59,537 INFO L462 AbstractCegarLoop]: Abstraction has 23850 states and 70282 transitions. [2019-12-26 21:31:59,537 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-26 21:31:59,537 INFO L276 IsEmpty]: Start isEmpty. Operand 23850 states and 70282 transitions. [2019-12-26 21:31:59,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-26 21:31:59,563 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:31:59,563 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 21:31:59,564 INFO L410 AbstractCegarLoop]: === Iteration 30 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 21:31:59,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:31:59,564 INFO L82 PathProgramCache]: Analyzing trace with hash -1154412654, now seen corresponding path program 5 times [2019-12-26 21:31:59,564 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:31:59,564 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [440948926] [2019-12-26 21:31:59,564 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:31:59,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:31:59,729 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-26 21:31:59,730 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [440948926] [2019-12-26 21:31:59,730 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:31:59,730 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-26 21:31:59,730 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [656456369] [2019-12-26 21:31:59,731 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-26 21:31:59,731 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:31:59,732 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-26 21:31:59,732 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-26 21:31:59,733 INFO L87 Difference]: Start difference. First operand 23850 states and 70282 transitions. Second operand 11 states. [2019-12-26 21:32:00,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:32:00,998 INFO L93 Difference]: Finished difference Result 53853 states and 158844 transitions. [2019-12-26 21:32:00,999 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-12-26 21:32:00,999 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 66 [2019-12-26 21:32:00,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:32:01,066 INFO L225 Difference]: With dead ends: 53853 [2019-12-26 21:32:01,066 INFO L226 Difference]: Without dead ends: 48655 [2019-12-26 21:32:01,067 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 210 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=190, Invalid=802, Unknown=0, NotChecked=0, Total=992 [2019-12-26 21:32:01,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48655 states. [2019-12-26 21:32:01,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48655 to 26925. [2019-12-26 21:32:01,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26925 states. [2019-12-26 21:32:01,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26925 states to 26925 states and 78839 transitions. [2019-12-26 21:32:01,626 INFO L78 Accepts]: Start accepts. Automaton has 26925 states and 78839 transitions. Word has length 66 [2019-12-26 21:32:01,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:32:01,626 INFO L462 AbstractCegarLoop]: Abstraction has 26925 states and 78839 transitions. [2019-12-26 21:32:01,626 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-26 21:32:01,626 INFO L276 IsEmpty]: Start isEmpty. Operand 26925 states and 78839 transitions. [2019-12-26 21:32:01,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-26 21:32:01,654 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:32:01,654 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 21:32:01,654 INFO L410 AbstractCegarLoop]: === Iteration 31 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 21:32:01,654 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:32:01,655 INFO L82 PathProgramCache]: Analyzing trace with hash -1866843824, now seen corresponding path program 6 times [2019-12-26 21:32:01,655 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:32:01,655 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [627566872] [2019-12-26 21:32:01,655 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:32:01,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:32:01,814 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-26 21:32:01,814 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [627566872] [2019-12-26 21:32:01,814 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:32:01,814 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-26 21:32:01,814 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1371315156] [2019-12-26 21:32:01,815 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-26 21:32:01,815 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:32:01,815 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-26 21:32:01,815 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-26 21:32:01,816 INFO L87 Difference]: Start difference. First operand 26925 states and 78839 transitions. Second operand 11 states. [2019-12-26 21:32:02,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:32:02,850 INFO L93 Difference]: Finished difference Result 49432 states and 144453 transitions. [2019-12-26 21:32:02,850 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-26 21:32:02,850 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 66 [2019-12-26 21:32:02,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:32:02,909 INFO L225 Difference]: With dead ends: 49432 [2019-12-26 21:32:02,909 INFO L226 Difference]: Without dead ends: 41713 [2019-12-26 21:32:02,910 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=141, Invalid=509, Unknown=0, NotChecked=0, Total=650 [2019-12-26 21:32:03,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41713 states. [2019-12-26 21:32:03,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41713 to 22440. [2019-12-26 21:32:03,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22440 states. [2019-12-26 21:32:03,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22440 states to 22440 states and 66151 transitions. [2019-12-26 21:32:03,370 INFO L78 Accepts]: Start accepts. Automaton has 22440 states and 66151 transitions. Word has length 66 [2019-12-26 21:32:03,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:32:03,370 INFO L462 AbstractCegarLoop]: Abstraction has 22440 states and 66151 transitions. [2019-12-26 21:32:03,370 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-26 21:32:03,370 INFO L276 IsEmpty]: Start isEmpty. Operand 22440 states and 66151 transitions. [2019-12-26 21:32:03,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-26 21:32:03,395 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:32:03,395 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 21:32:03,395 INFO L410 AbstractCegarLoop]: === Iteration 32 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 21:32:03,395 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:32:03,395 INFO L82 PathProgramCache]: Analyzing trace with hash -1256766532, now seen corresponding path program 7 times [2019-12-26 21:32:03,395 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:32:03,396 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [582518840] [2019-12-26 21:32:03,396 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:32:03,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:32:03,448 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-26 21:32:03,449 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [582518840] [2019-12-26 21:32:03,449 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:32:03,449 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 21:32:03,449 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1271778965] [2019-12-26 21:32:03,450 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 21:32:03,450 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:32:03,450 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 21:32:03,450 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 21:32:03,450 INFO L87 Difference]: Start difference. First operand 22440 states and 66151 transitions. Second operand 3 states. [2019-12-26 21:32:03,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:32:03,545 INFO L93 Difference]: Finished difference Result 22439 states and 66149 transitions. [2019-12-26 21:32:03,546 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 21:32:03,546 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-12-26 21:32:03,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:32:03,586 INFO L225 Difference]: With dead ends: 22439 [2019-12-26 21:32:03,586 INFO L226 Difference]: Without dead ends: 22439 [2019-12-26 21:32:03,586 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-26 21:32:03,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22439 states. [2019-12-26 21:32:04,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22439 to 15080. [2019-12-26 21:32:04,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15080 states. [2019-12-26 21:32:04,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15080 states to 15080 states and 45114 transitions. [2019-12-26 21:32:04,210 INFO L78 Accepts]: Start accepts. Automaton has 15080 states and 45114 transitions. Word has length 66 [2019-12-26 21:32:04,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:32:04,210 INFO L462 AbstractCegarLoop]: Abstraction has 15080 states and 45114 transitions. [2019-12-26 21:32:04,210 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 21:32:04,211 INFO L276 IsEmpty]: Start isEmpty. Operand 15080 states and 45114 transitions. [2019-12-26 21:32:04,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-26 21:32:04,236 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:32:04,236 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 21:32:04,237 INFO L410 AbstractCegarLoop]: === Iteration 33 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 21:32:04,237 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:32:04,237 INFO L82 PathProgramCache]: Analyzing trace with hash 844805957, now seen corresponding path program 1 times [2019-12-26 21:32:04,238 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:32:04,238 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [477326362] [2019-12-26 21:32:04,238 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:32:04,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:32:04,403 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-26 21:32:04,403 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [477326362] [2019-12-26 21:32:04,404 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:32:04,404 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-26 21:32:04,404 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [786271698] [2019-12-26 21:32:04,404 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-26 21:32:04,405 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:32:04,405 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-26 21:32:04,405 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-26 21:32:04,405 INFO L87 Difference]: Start difference. First operand 15080 states and 45114 transitions. Second operand 11 states. [2019-12-26 21:32:05,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:32:05,841 INFO L93 Difference]: Finished difference Result 22077 states and 65900 transitions. [2019-12-26 21:32:05,842 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-26 21:32:05,842 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 67 [2019-12-26 21:32:05,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:32:05,873 INFO L225 Difference]: With dead ends: 22077 [2019-12-26 21:32:05,873 INFO L226 Difference]: Without dead ends: 21726 [2019-12-26 21:32:05,873 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=73, Invalid=307, Unknown=0, NotChecked=0, Total=380 [2019-12-26 21:32:05,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21726 states. [2019-12-26 21:32:06,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21726 to 15072. [2019-12-26 21:32:06,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15072 states. [2019-12-26 21:32:06,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15072 states to 15072 states and 45088 transitions. [2019-12-26 21:32:06,152 INFO L78 Accepts]: Start accepts. Automaton has 15072 states and 45088 transitions. Word has length 67 [2019-12-26 21:32:06,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:32:06,153 INFO L462 AbstractCegarLoop]: Abstraction has 15072 states and 45088 transitions. [2019-12-26 21:32:06,153 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-26 21:32:06,153 INFO L276 IsEmpty]: Start isEmpty. Operand 15072 states and 45088 transitions. [2019-12-26 21:32:06,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-26 21:32:06,170 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:32:06,170 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 21:32:06,170 INFO L410 AbstractCegarLoop]: === Iteration 34 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 21:32:06,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:32:06,170 INFO L82 PathProgramCache]: Analyzing trace with hash 1709159453, now seen corresponding path program 2 times [2019-12-26 21:32:06,170 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:32:06,170 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1566196827] [2019-12-26 21:32:06,171 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:32:06,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:32:06,425 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-26 21:32:06,426 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1566196827] [2019-12-26 21:32:06,426 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:32:06,426 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-26 21:32:06,427 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [958225201] [2019-12-26 21:32:06,427 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-26 21:32:06,427 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:32:06,428 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-26 21:32:06,428 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2019-12-26 21:32:06,428 INFO L87 Difference]: Start difference. First operand 15072 states and 45088 transitions. Second operand 12 states. [2019-12-26 21:32:07,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:32:07,400 INFO L93 Difference]: Finished difference Result 27346 states and 81899 transitions. [2019-12-26 21:32:07,401 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-26 21:32:07,401 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 67 [2019-12-26 21:32:07,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:32:07,438 INFO L225 Difference]: With dead ends: 27346 [2019-12-26 21:32:07,438 INFO L226 Difference]: Without dead ends: 26919 [2019-12-26 21:32:07,438 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=133, Invalid=569, Unknown=0, NotChecked=0, Total=702 [2019-12-26 21:32:07,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26919 states. [2019-12-26 21:32:07,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26919 to 14812. [2019-12-26 21:32:07,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14812 states. [2019-12-26 21:32:07,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14812 states to 14812 states and 44426 transitions. [2019-12-26 21:32:07,742 INFO L78 Accepts]: Start accepts. Automaton has 14812 states and 44426 transitions. Word has length 67 [2019-12-26 21:32:07,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:32:07,742 INFO L462 AbstractCegarLoop]: Abstraction has 14812 states and 44426 transitions. [2019-12-26 21:32:07,742 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-26 21:32:07,742 INFO L276 IsEmpty]: Start isEmpty. Operand 14812 states and 44426 transitions. [2019-12-26 21:32:07,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-26 21:32:07,757 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:32:07,758 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 21:32:07,758 INFO L410 AbstractCegarLoop]: === Iteration 35 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 21:32:07,758 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:32:07,758 INFO L82 PathProgramCache]: Analyzing trace with hash 656134515, now seen corresponding path program 3 times [2019-12-26 21:32:07,758 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:32:07,758 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [919547827] [2019-12-26 21:32:07,758 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:32:07,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-26 21:32:07,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-26 21:32:07,866 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-26 21:32:07,866 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-26 21:32:07,870 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [900] [900] ULTIMATE.startENTRY-->L835: Formula: (let ((.cse0 (store |v_#valid_72| 0 0))) (and (= v_~a$r_buff1_thd0~0_203 0) (= 0 v_~a$r_buff1_thd1~0_191) (= v_~z~0_36 0) (= (select .cse0 |v_ULTIMATE.start_main_~#t293~0.base_37|) 0) (= v_~a$r_buff0_thd0~0_228 0) (= 0 v_~a$r_buff0_thd1~0_317) (= 0 v_~a$read_delayed_var~0.base_8) (= 0 v_~a$r_buff0_thd2~0_205) (= |v_#length_25| (store |v_#length_26| |v_ULTIMATE.start_main_~#t293~0.base_37| 4)) (= v_~main$tmp_guard1~0_42 0) (= v_~a$r_buff0_thd3~0_430 0) (< |v_#StackHeapBarrier_15| |v_ULTIMATE.start_main_~#t293~0.base_37|) (= v_~main$tmp_guard0~0_25 0) (= 0 v_~__unbuffered_p2_EAX~0_47) (= v_~__unbuffered_cnt~0_111 0) (< 0 |v_#StackHeapBarrier_15|) (= 0 v_~x~0_176) (= v_~__unbuffered_p1_EBX~0_55 0) (= 0 v_~__unbuffered_p1_EAX~0_54) (= 0 |v_#NULL.base_4|) (= v_~a$mem_tmp~0_16 0) (= 0 v_~a$w_buff0_used~0_889) (= v_~a$w_buff0~0_416 0) (= v_~a$r_buff1_thd3~0_333 0) (= 0 v_~a$w_buff1_used~0_596) (= |v_#NULL.offset_4| 0) (= 0 v_~a$w_buff1~0_333) (= (store |v_#memory_int_24| |v_ULTIMATE.start_main_~#t293~0.base_37| (store (select |v_#memory_int_24| |v_ULTIMATE.start_main_~#t293~0.base_37|) |v_ULTIMATE.start_main_~#t293~0.offset_26| 0)) |v_#memory_int_23|) (= |v_#valid_70| (store .cse0 |v_ULTIMATE.start_main_~#t293~0.base_37| 1)) (= 0 v_~a$r_buff1_thd2~0_185) (= v_~a~0_191 0) (= v_~a$read_delayed_var~0.offset_8 0) (= v_~__unbuffered_p2_EBX~0_48 0) (= 0 v_~weak$$choice0~0_13) (= v_~weak$$choice2~0_131 0) (= |v_ULTIMATE.start_main_~#t293~0.offset_26| 0) (= v_~y~0_31 0) (= 0 v_~a$read_delayed~0_8) (= v_~a$flush_delayed~0_26 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_15|, #valid=|v_#valid_72|, #memory_int=|v_#memory_int_24|, #length=|v_#length_26|} OutVars{~a$r_buff1_thd2~0=v_~a$r_buff1_thd2~0_185, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_51|, #NULL.offset=|v_#NULL.offset_4|, ULTIMATE.start_main_#t~ite49=|v_ULTIMATE.start_main_#t~ite49_59|, ~a$r_buff0_thd0~0=v_~a$r_buff0_thd0~0_228, ULTIMATE.start_main_#t~ite50=|v_ULTIMATE.start_main_#t~ite50_127|, ~a~0=v_~a~0_191, ULTIMATE.start_main_~#t293~0.offset=|v_ULTIMATE.start_main_~#t293~0.offset_26|, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_83|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_54, ULTIMATE.start_main_~#t294~0.base=|v_ULTIMATE.start_main_~#t294~0.base_38|, #length=|v_#length_25|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_47, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_48, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_10|, ~a$r_buff1_thd3~0=v_~a$r_buff1_thd3~0_333, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_889, ~a$r_buff0_thd1~0=v_~a$r_buff0_thd1~0_317, ULTIMATE.start_main_~#t295~0.base=|v_ULTIMATE.start_main_~#t295~0.base_30|, ~weak$$choice0~0=v_~weak$$choice0~0_13, #StackHeapBarrier=|v_#StackHeapBarrier_15|, ~a$read_delayed_var~0.offset=v_~a$read_delayed_var~0.offset_8, ULTIMATE.start_main_~#t295~0.offset=|v_ULTIMATE.start_main_~#t295~0.offset_18|, ~a$w_buff0~0=v_~a$w_buff0~0_416, ~a$r_buff1_thd0~0=v_~a$r_buff1_thd0~0_203, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_111, ~x~0=v_~x~0_176, ULTIMATE.start_main_~#t294~0.offset=|v_ULTIMATE.start_main_~#t294~0.offset_26|, ~a$read_delayed~0=v_~a$read_delayed~0_8, ~a$r_buff0_thd2~0=v_~a$r_buff0_thd2~0_205, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_42, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_67|, ~a$mem_tmp~0=v_~a$mem_tmp~0_16, ULTIMATE.start_main_#t~ite51=|v_ULTIMATE.start_main_#t~ite51_43|, ~a$w_buff1~0=v_~a$w_buff1~0_333, ~y~0=v_~y~0_31, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_55, ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_23|, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_9|, ~a$r_buff1_thd1~0=v_~a$r_buff1_thd1~0_191, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_430, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_25, #NULL.base=|v_#NULL.base_4|, ~a$flush_delayed~0=v_~a$flush_delayed~0_26, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_25|, #valid=|v_#valid_70|, #memory_int=|v_#memory_int_23|, ~z~0=v_~z~0_36, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_596, ~weak$$choice2~0=v_~weak$$choice2~0_131, ~a$read_delayed_var~0.base=v_~a$read_delayed_var~0.base_8, ULTIMATE.start_main_~#t293~0.base=|v_ULTIMATE.start_main_~#t293~0.base_37|} AuxVars[] AssignedVars[~a$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite47, #NULL.offset, ULTIMATE.start_main_#t~ite49, ~a$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite50, ~a~0, ULTIMATE.start_main_~#t293~0.offset, ULTIMATE.start_main_#t~ite52, ~__unbuffered_p1_EAX~0, ULTIMATE.start_main_~#t294~0.base, #length, ~__unbuffered_p2_EAX~0, ~__unbuffered_p2_EBX~0, ULTIMATE.start_main_#t~nondet45, ~a$r_buff1_thd3~0, ~a$w_buff0_used~0, ~a$r_buff0_thd1~0, ULTIMATE.start_main_~#t295~0.base, ~weak$$choice0~0, ~a$read_delayed_var~0.offset, ULTIMATE.start_main_~#t295~0.offset, ~a$w_buff0~0, ~a$r_buff1_thd0~0, ~__unbuffered_cnt~0, ~x~0, ULTIMATE.start_main_~#t294~0.offset, ~a$read_delayed~0, ~a$r_buff0_thd2~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite48, ~a$mem_tmp~0, ULTIMATE.start_main_#t~ite51, ~a$w_buff1~0, ~y~0, ~__unbuffered_p1_EBX~0, ULTIMATE.start_main_#t~nondet46, ULTIMATE.start_main_#t~nondet44, ~a$r_buff1_thd1~0, ~a$r_buff0_thd3~0, ~main$tmp_guard0~0, #NULL.base, ~a$flush_delayed~0, ULTIMATE.start_main_#res, #valid, #memory_int, ~z~0, ~a$w_buff1_used~0, ~weak$$choice2~0, ~a$read_delayed_var~0.base, ULTIMATE.start_main_~#t293~0.base] because there is no mapped edge [2019-12-26 21:32:07,871 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [868] [868] L835-1-->L837: Formula: (and (= (select |v_#valid_41| |v_ULTIMATE.start_main_~#t294~0.base_13|) 0) (= (store |v_#valid_41| |v_ULTIMATE.start_main_~#t294~0.base_13| 1) |v_#valid_40|) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t294~0.base_13| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t294~0.base_13|) |v_ULTIMATE.start_main_~#t294~0.offset_11| 1)) |v_#memory_int_15|) (not (= 0 |v_ULTIMATE.start_main_~#t294~0.base_13|)) (= |v_ULTIMATE.start_main_~#t294~0.offset_11| 0) (= (store |v_#length_18| |v_ULTIMATE.start_main_~#t294~0.base_13| 4) |v_#length_17|) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t294~0.base_13|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_41|, #memory_int=|v_#memory_int_16|, #length=|v_#length_18|} OutVars{ULTIMATE.start_main_~#t294~0.offset=|v_ULTIMATE.start_main_~#t294~0.offset_11|, #StackHeapBarrier=|v_#StackHeapBarrier_11|, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_5|, ULTIMATE.start_main_~#t294~0.base=|v_ULTIMATE.start_main_~#t294~0.base_13|, #valid=|v_#valid_40|, #memory_int=|v_#memory_int_15|, #length=|v_#length_17|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t294~0.offset, ULTIMATE.start_main_#t~nondet44, ULTIMATE.start_main_~#t294~0.base, #valid, #memory_int, #length] because there is no mapped edge [2019-12-26 21:32:07,872 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [773] [773] L4-->L750: Formula: (and (= v_~a$r_buff0_thd1~0_28 v_~a$r_buff1_thd1~0_23) (= v_~a$r_buff0_thd2~0_20 v_~a$r_buff1_thd2~0_16) (= v_~a$r_buff0_thd0~0_18 v_~a$r_buff1_thd0~0_17) (not (= v_P0Thread1of1ForFork1___VERIFIER_assert_~expression_10 0)) (= v_~a$r_buff0_thd1~0_27 1) (= 1 v_~x~0_7) (= v_~a$r_buff0_thd3~0_73 v_~a$r_buff1_thd3~0_40)) InVars {~a$r_buff0_thd2~0=v_~a$r_buff0_thd2~0_20, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_73, P0Thread1of1ForFork1___VERIFIER_assert_~expression=v_P0Thread1of1ForFork1___VERIFIER_assert_~expression_10, ~a$r_buff0_thd1~0=v_~a$r_buff0_thd1~0_28, ~a$r_buff0_thd0~0=v_~a$r_buff0_thd0~0_18} OutVars{~a$r_buff1_thd1~0=v_~a$r_buff1_thd1~0_23, ~a$r_buff1_thd3~0=v_~a$r_buff1_thd3~0_40, ~a$r_buff1_thd2~0=v_~a$r_buff1_thd2~0_16, ~a$r_buff0_thd2~0=v_~a$r_buff0_thd2~0_20, ~a$r_buff1_thd0~0=v_~a$r_buff1_thd0~0_17, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_73, P0Thread1of1ForFork1___VERIFIER_assert_~expression=v_P0Thread1of1ForFork1___VERIFIER_assert_~expression_10, ~a$r_buff0_thd1~0=v_~a$r_buff0_thd1~0_27, ~a$r_buff0_thd0~0=v_~a$r_buff0_thd0~0_18, ~x~0=v_~x~0_7} AuxVars[] AssignedVars[~a$r_buff1_thd1~0, ~a$r_buff1_thd3~0, ~a$r_buff1_thd2~0, ~a$r_buff1_thd0~0, ~a$r_buff0_thd1~0, ~x~0] because there is no mapped edge [2019-12-26 21:32:07,874 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [825] [825] L776-2-->L776-4: Formula: (let ((.cse0 (= 0 (mod ~a$w_buff1_used~0_In-135580956 256))) (.cse1 (= 0 (mod ~a$r_buff1_thd2~0_In-135580956 256)))) (or (and (not .cse0) (not .cse1) (= |P1Thread1of1ForFork2_#t~ite9_Out-135580956| ~a$w_buff1~0_In-135580956)) (and (or .cse0 .cse1) (= |P1Thread1of1ForFork2_#t~ite9_Out-135580956| ~a~0_In-135580956)))) InVars {~a~0=~a~0_In-135580956, ~a$w_buff1~0=~a$w_buff1~0_In-135580956, ~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In-135580956, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-135580956} OutVars{~a~0=~a~0_In-135580956, P1Thread1of1ForFork2_#t~ite9=|P1Thread1of1ForFork2_#t~ite9_Out-135580956|, ~a$w_buff1~0=~a$w_buff1~0_In-135580956, ~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In-135580956, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-135580956} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite9] because there is no mapped edge [2019-12-26 21:32:07,875 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [788] [788] L776-4-->L777: Formula: (= |v_P1Thread1of1ForFork2_#t~ite9_16| v_~a~0_47) InVars {P1Thread1of1ForFork2_#t~ite9=|v_P1Thread1of1ForFork2_#t~ite9_16|} OutVars{~a~0=v_~a~0_47, P1Thread1of1ForFork2_#t~ite9=|v_P1Thread1of1ForFork2_#t~ite9_15|, P1Thread1of1ForFork2_#t~ite10=|v_P1Thread1of1ForFork2_#t~ite10_25|} AuxVars[] AssignedVars[~a~0, P1Thread1of1ForFork2_#t~ite9, P1Thread1of1ForFork2_#t~ite10] because there is no mapped edge [2019-12-26 21:32:07,875 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [828] [828] L751-->L751-2: Formula: (let ((.cse1 (= (mod ~a$w_buff0_used~0_In96228061 256) 0)) (.cse0 (= 0 (mod ~a$r_buff0_thd1~0_In96228061 256)))) (or (and (not .cse0) (not .cse1) (= 0 |P0Thread1of1ForFork1_#t~ite5_Out96228061|)) (and (or .cse1 .cse0) (= ~a$w_buff0_used~0_In96228061 |P0Thread1of1ForFork1_#t~ite5_Out96228061|)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In96228061, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In96228061} OutVars{P0Thread1of1ForFork1_#t~ite5=|P0Thread1of1ForFork1_#t~ite5_Out96228061|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In96228061, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In96228061} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite5] because there is no mapped edge [2019-12-26 21:32:07,876 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [823] [823] L752-->L752-2: Formula: (let ((.cse0 (= 0 (mod ~a$r_buff0_thd1~0_In-1750415336 256))) (.cse1 (= 0 (mod ~a$w_buff0_used~0_In-1750415336 256))) (.cse3 (= 0 (mod ~a$w_buff1_used~0_In-1750415336 256))) (.cse2 (= 0 (mod ~a$r_buff1_thd1~0_In-1750415336 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P0Thread1of1ForFork1_#t~ite6_Out-1750415336| 0)) (and (or .cse0 .cse1) (= |P0Thread1of1ForFork1_#t~ite6_Out-1750415336| ~a$w_buff1_used~0_In-1750415336) (or .cse3 .cse2)))) InVars {~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In-1750415336, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1750415336, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In-1750415336, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1750415336} OutVars{P0Thread1of1ForFork1_#t~ite6=|P0Thread1of1ForFork1_#t~ite6_Out-1750415336|, ~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In-1750415336, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1750415336, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In-1750415336, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1750415336} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite6] because there is no mapped edge [2019-12-26 21:32:07,877 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [832] [832] L753-->L754: Formula: (let ((.cse0 (= 0 (mod ~a$r_buff0_thd1~0_In-1005799140 256))) (.cse1 (= (mod ~a$w_buff0_used~0_In-1005799140 256) 0))) (or (and (or .cse0 .cse1) (= ~a$r_buff0_thd1~0_In-1005799140 ~a$r_buff0_thd1~0_Out-1005799140)) (and (not .cse0) (not .cse1) (= 0 ~a$r_buff0_thd1~0_Out-1005799140)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In-1005799140, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In-1005799140} OutVars{P0Thread1of1ForFork1_#t~ite7=|P0Thread1of1ForFork1_#t~ite7_Out-1005799140|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1005799140, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_Out-1005799140} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite7, ~a$r_buff0_thd1~0] because there is no mapped edge [2019-12-26 21:32:07,877 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [824] [824] L754-->L754-2: Formula: (let ((.cse2 (= 0 (mod ~a$w_buff0_used~0_In-238301901 256))) (.cse3 (= 0 (mod ~a$r_buff0_thd1~0_In-238301901 256))) (.cse0 (= 0 (mod ~a$w_buff1_used~0_In-238301901 256))) (.cse1 (= 0 (mod ~a$r_buff1_thd1~0_In-238301901 256)))) (or (and (= |P0Thread1of1ForFork1_#t~ite8_Out-238301901| ~a$r_buff1_thd1~0_In-238301901) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= |P0Thread1of1ForFork1_#t~ite8_Out-238301901| 0) (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1)))))) InVars {~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In-238301901, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-238301901, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In-238301901, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-238301901} OutVars{P0Thread1of1ForFork1_#t~ite8=|P0Thread1of1ForFork1_#t~ite8_Out-238301901|, ~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In-238301901, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-238301901, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In-238301901, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-238301901} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite8] because there is no mapped edge [2019-12-26 21:32:07,877 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [874] [874] L754-2-->P0EXIT: Formula: (and (= v_~a$r_buff1_thd1~0_148 |v_P0Thread1of1ForFork1_#t~ite8_52|) (= 0 |v_P0Thread1of1ForFork1_#res.offset_5|) (= 0 |v_P0Thread1of1ForFork1_#res.base_5|) (= v_~__unbuffered_cnt~0_77 (+ v_~__unbuffered_cnt~0_78 1))) InVars {P0Thread1of1ForFork1_#t~ite8=|v_P0Thread1of1ForFork1_#t~ite8_52|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_78} OutVars{P0Thread1of1ForFork1_#t~ite8=|v_P0Thread1of1ForFork1_#t~ite8_51|, P0Thread1of1ForFork1_#res.offset=|v_P0Thread1of1ForFork1_#res.offset_5|, ~a$r_buff1_thd1~0=v_~a$r_buff1_thd1~0_148, P0Thread1of1ForFork1_#res.base=|v_P0Thread1of1ForFork1_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_77} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite8, P0Thread1of1ForFork1_#res.offset, ~a$r_buff1_thd1~0, P0Thread1of1ForFork1_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-26 21:32:07,877 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [861] [861] L837-1-->L839: Formula: (and (not (= |v_ULTIMATE.start_main_~#t295~0.base_12| 0)) (< |v_#StackHeapBarrier_9| |v_ULTIMATE.start_main_~#t295~0.base_12|) (= 0 (select |v_#valid_37| |v_ULTIMATE.start_main_~#t295~0.base_12|)) (= |v_ULTIMATE.start_main_~#t295~0.offset_10| 0) (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t295~0.base_12| 4)) (= |v_#valid_36| (store |v_#valid_37| |v_ULTIMATE.start_main_~#t295~0.base_12| 1)) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t295~0.base_12| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t295~0.base_12|) |v_ULTIMATE.start_main_~#t295~0.offset_10| 2)) |v_#memory_int_13|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_37|, #memory_int=|v_#memory_int_14|, #length=|v_#length_16|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_9|, ULTIMATE.start_main_~#t295~0.offset=|v_ULTIMATE.start_main_~#t295~0.offset_10|, #valid=|v_#valid_36|, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_6|, #memory_int=|v_#memory_int_13|, #length=|v_#length_15|, ULTIMATE.start_main_~#t295~0.base=|v_ULTIMATE.start_main_~#t295~0.base_12|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t295~0.offset, #valid, ULTIMATE.start_main_#t~nondet45, #memory_int, #length, ULTIMATE.start_main_~#t295~0.base] because there is no mapped edge [2019-12-26 21:32:07,880 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [876] [876] L801-->L801-8: Formula: (let ((.cse1 (= 0 (mod ~weak$$choice2~0_In-1319415580 256)))) (or (and (let ((.cse0 (= (mod ~a$r_buff0_thd3~0_In-1319415580 256) 0))) (or (and (= (mod ~a$r_buff1_thd3~0_In-1319415580 256) 0) .cse0) (and (= (mod ~a$w_buff1_used~0_In-1319415580 256) 0) .cse0) (= (mod ~a$w_buff0_used~0_In-1319415580 256) 0))) .cse1 (= |P2Thread1of1ForFork0_#t~ite21_Out-1319415580| |P2Thread1of1ForFork0_#t~ite20_Out-1319415580|) (= |P2Thread1of1ForFork0_#t~ite20_Out-1319415580| ~a$w_buff0~0_In-1319415580)) (and (not .cse1) (= |P2Thread1of1ForFork0_#t~ite20_In-1319415580| |P2Thread1of1ForFork0_#t~ite20_Out-1319415580|) (= |P2Thread1of1ForFork0_#t~ite21_Out-1319415580| ~a$w_buff0~0_In-1319415580)))) InVars {~a$w_buff0~0=~a$w_buff0~0_In-1319415580, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-1319415580, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1319415580, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-1319415580, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1319415580, P2Thread1of1ForFork0_#t~ite20=|P2Thread1of1ForFork0_#t~ite20_In-1319415580|, ~weak$$choice2~0=~weak$$choice2~0_In-1319415580} OutVars{P2Thread1of1ForFork0_#t~ite21=|P2Thread1of1ForFork0_#t~ite21_Out-1319415580|, ~a$w_buff0~0=~a$w_buff0~0_In-1319415580, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-1319415580, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1319415580, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-1319415580, P2Thread1of1ForFork0_#t~ite20=|P2Thread1of1ForFork0_#t~ite20_Out-1319415580|, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1319415580, ~weak$$choice2~0=~weak$$choice2~0_In-1319415580} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite21, P2Thread1of1ForFork0_#t~ite20] because there is no mapped edge [2019-12-26 21:32:07,882 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [878] [878] L803-->L803-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-1731720664 256)))) (or (and (= |P2Thread1of1ForFork0_#t~ite27_Out-1731720664| |P2Thread1of1ForFork0_#t~ite26_Out-1731720664|) .cse0 (let ((.cse1 (= (mod ~a$r_buff0_thd3~0_In-1731720664 256) 0))) (or (and (= (mod ~a$r_buff1_thd3~0_In-1731720664 256) 0) .cse1) (= (mod ~a$w_buff0_used~0_In-1731720664 256) 0) (and .cse1 (= (mod ~a$w_buff1_used~0_In-1731720664 256) 0)))) (= ~a$w_buff0_used~0_In-1731720664 |P2Thread1of1ForFork0_#t~ite26_Out-1731720664|)) (and (= ~a$w_buff0_used~0_In-1731720664 |P2Thread1of1ForFork0_#t~ite27_Out-1731720664|) (= |P2Thread1of1ForFork0_#t~ite26_In-1731720664| |P2Thread1of1ForFork0_#t~ite26_Out-1731720664|) (not .cse0)))) InVars {P2Thread1of1ForFork0_#t~ite26=|P2Thread1of1ForFork0_#t~ite26_In-1731720664|, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-1731720664, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1731720664, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-1731720664, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1731720664, ~weak$$choice2~0=~weak$$choice2~0_In-1731720664} OutVars{P2Thread1of1ForFork0_#t~ite26=|P2Thread1of1ForFork0_#t~ite26_Out-1731720664|, P2Thread1of1ForFork0_#t~ite27=|P2Thread1of1ForFork0_#t~ite27_Out-1731720664|, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-1731720664, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1731720664, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-1731720664, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1731720664, ~weak$$choice2~0=~weak$$choice2~0_In-1731720664} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite26, P2Thread1of1ForFork0_#t~ite27] because there is no mapped edge [2019-12-26 21:32:07,883 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [877] [877] L804-->L804-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-1496243531 256)))) (or (and .cse0 (= |P2Thread1of1ForFork0_#t~ite30_Out-1496243531| |P2Thread1of1ForFork0_#t~ite29_Out-1496243531|) (let ((.cse1 (= (mod ~a$r_buff0_thd3~0_In-1496243531 256) 0))) (or (and .cse1 (= 0 (mod ~a$r_buff1_thd3~0_In-1496243531 256))) (= 0 (mod ~a$w_buff0_used~0_In-1496243531 256)) (and .cse1 (= 0 (mod ~a$w_buff1_used~0_In-1496243531 256))))) (= ~a$w_buff1_used~0_In-1496243531 |P2Thread1of1ForFork0_#t~ite29_Out-1496243531|)) (and (= |P2Thread1of1ForFork0_#t~ite30_Out-1496243531| ~a$w_buff1_used~0_In-1496243531) (= |P2Thread1of1ForFork0_#t~ite29_In-1496243531| |P2Thread1of1ForFork0_#t~ite29_Out-1496243531|) (not .cse0)))) InVars {~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-1496243531, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1496243531, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-1496243531, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1496243531, ~weak$$choice2~0=~weak$$choice2~0_In-1496243531, P2Thread1of1ForFork0_#t~ite29=|P2Thread1of1ForFork0_#t~ite29_In-1496243531|} OutVars{~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-1496243531, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1496243531, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-1496243531, P2Thread1of1ForFork0_#t~ite30=|P2Thread1of1ForFork0_#t~ite30_Out-1496243531|, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1496243531, P2Thread1of1ForFork0_#t~ite29=|P2Thread1of1ForFork0_#t~ite29_Out-1496243531|, ~weak$$choice2~0=~weak$$choice2~0_In-1496243531} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite30, P2Thread1of1ForFork0_#t~ite29] because there is no mapped edge [2019-12-26 21:32:07,883 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [813] [813] L805-->L806: Formula: (and (not (= (mod v_~weak$$choice2~0_32 256) 0)) (= v_~a$r_buff0_thd3~0_136 v_~a$r_buff0_thd3~0_135)) InVars {~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_136, ~weak$$choice2~0=v_~weak$$choice2~0_32} OutVars{P2Thread1of1ForFork0_#t~ite33=|v_P2Thread1of1ForFork0_#t~ite33_9|, P2Thread1of1ForFork0_#t~ite32=|v_P2Thread1of1ForFork0_#t~ite32_11|, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_135, P2Thread1of1ForFork0_#t~ite31=|v_P2Thread1of1ForFork0_#t~ite31_12|, ~weak$$choice2~0=v_~weak$$choice2~0_32} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite33, P2Thread1of1ForFork0_#t~ite32, ~a$r_buff0_thd3~0, P2Thread1of1ForFork0_#t~ite31] because there is no mapped edge [2019-12-26 21:32:07,884 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [796] [796] L808-->L812: Formula: (and (= v_~a$flush_delayed~0_12 0) (= v_~a~0_57 v_~a$mem_tmp~0_6) (not (= (mod v_~a$flush_delayed~0_13 256) 0))) InVars {~a$mem_tmp~0=v_~a$mem_tmp~0_6, ~a$flush_delayed~0=v_~a$flush_delayed~0_13} OutVars{P2Thread1of1ForFork0_#t~ite37=|v_P2Thread1of1ForFork0_#t~ite37_13|, ~a~0=v_~a~0_57, ~a$mem_tmp~0=v_~a$mem_tmp~0_6, ~a$flush_delayed~0=v_~a$flush_delayed~0_12} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite37, ~a~0, ~a$flush_delayed~0] because there is no mapped edge [2019-12-26 21:32:07,885 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [822] [822] L812-2-->L812-4: Formula: (let ((.cse1 (= (mod ~a$r_buff1_thd3~0_In-514919356 256) 0)) (.cse0 (= (mod ~a$w_buff1_used~0_In-514919356 256) 0))) (or (and (= |P2Thread1of1ForFork0_#t~ite38_Out-514919356| ~a~0_In-514919356) (or .cse0 .cse1)) (and (not .cse1) (not .cse0) (= |P2Thread1of1ForFork0_#t~ite38_Out-514919356| ~a$w_buff1~0_In-514919356)))) InVars {~a~0=~a~0_In-514919356, ~a$w_buff1~0=~a$w_buff1~0_In-514919356, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-514919356, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-514919356} OutVars{~a~0=~a~0_In-514919356, P2Thread1of1ForFork0_#t~ite38=|P2Thread1of1ForFork0_#t~ite38_Out-514919356|, ~a$w_buff1~0=~a$w_buff1~0_In-514919356, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-514919356, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-514919356} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite38] because there is no mapped edge [2019-12-26 21:32:07,885 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [755] [755] L812-4-->L813: Formula: (= v_~a~0_20 |v_P2Thread1of1ForFork0_#t~ite38_10|) InVars {P2Thread1of1ForFork0_#t~ite38=|v_P2Thread1of1ForFork0_#t~ite38_10|} OutVars{~a~0=v_~a~0_20, P2Thread1of1ForFork0_#t~ite39=|v_P2Thread1of1ForFork0_#t~ite39_13|, P2Thread1of1ForFork0_#t~ite38=|v_P2Thread1of1ForFork0_#t~ite38_9|} AuxVars[] AssignedVars[~a~0, P2Thread1of1ForFork0_#t~ite39, P2Thread1of1ForFork0_#t~ite38] because there is no mapped edge [2019-12-26 21:32:07,886 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [833] [833] L813-->L813-2: Formula: (let ((.cse1 (= 0 (mod ~a$w_buff0_used~0_In1724842717 256))) (.cse0 (= 0 (mod ~a$r_buff0_thd3~0_In1724842717 256)))) (or (and (or .cse0 .cse1) (= ~a$w_buff0_used~0_In1724842717 |P2Thread1of1ForFork0_#t~ite40_Out1724842717|)) (and (not .cse1) (= 0 |P2Thread1of1ForFork0_#t~ite40_Out1724842717|) (not .cse0)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In1724842717, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In1724842717} OutVars{P2Thread1of1ForFork0_#t~ite40=|P2Thread1of1ForFork0_#t~ite40_Out1724842717|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1724842717, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In1724842717} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite40] because there is no mapped edge [2019-12-26 21:32:07,886 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [819] [819] L814-->L814-2: Formula: (let ((.cse0 (= (mod ~a$r_buff0_thd3~0_In-552891993 256) 0)) (.cse1 (= 0 (mod ~a$w_buff0_used~0_In-552891993 256))) (.cse3 (= (mod ~a$r_buff1_thd3~0_In-552891993 256) 0)) (.cse2 (= 0 (mod ~a$w_buff1_used~0_In-552891993 256)))) (or (and (or .cse0 .cse1) (= ~a$w_buff1_used~0_In-552891993 |P2Thread1of1ForFork0_#t~ite41_Out-552891993|) (or .cse2 .cse3)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2))) (= 0 |P2Thread1of1ForFork0_#t~ite41_Out-552891993|)))) InVars {~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-552891993, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-552891993, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-552891993, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-552891993} OutVars{~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-552891993, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-552891993, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-552891993, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-552891993, P2Thread1of1ForFork0_#t~ite41=|P2Thread1of1ForFork0_#t~ite41_Out-552891993|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite41] because there is no mapped edge [2019-12-26 21:32:07,887 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [821] [821] L815-->L815-2: Formula: (let ((.cse0 (= 0 (mod ~a$w_buff0_used~0_In1348052965 256))) (.cse1 (= (mod ~a$r_buff0_thd3~0_In1348052965 256) 0))) (or (and (= |P2Thread1of1ForFork0_#t~ite42_Out1348052965| ~a$r_buff0_thd3~0_In1348052965) (or .cse0 .cse1)) (and (not .cse0) (= 0 |P2Thread1of1ForFork0_#t~ite42_Out1348052965|) (not .cse1)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In1348052965, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In1348052965} OutVars{~a$w_buff0_used~0=~a$w_buff0_used~0_In1348052965, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In1348052965, P2Thread1of1ForFork0_#t~ite42=|P2Thread1of1ForFork0_#t~ite42_Out1348052965|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite42] because there is no mapped edge [2019-12-26 21:32:07,888 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [842] [842] L816-->L816-2: Formula: (let ((.cse2 (= 0 (mod ~a$r_buff0_thd3~0_In1718058717 256))) (.cse3 (= (mod ~a$w_buff0_used~0_In1718058717 256) 0)) (.cse0 (= (mod ~a$r_buff1_thd3~0_In1718058717 256) 0)) (.cse1 (= (mod ~a$w_buff1_used~0_In1718058717 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~a$r_buff1_thd3~0_In1718058717 |P2Thread1of1ForFork0_#t~ite43_Out1718058717|)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1))) (= |P2Thread1of1ForFork0_#t~ite43_Out1718058717| 0)))) InVars {~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In1718058717, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1718058717, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In1718058717, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1718058717} OutVars{P2Thread1of1ForFork0_#t~ite43=|P2Thread1of1ForFork0_#t~ite43_Out1718058717|, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In1718058717, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1718058717, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In1718058717, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1718058717} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite43] because there is no mapped edge [2019-12-26 21:32:07,888 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [850] [850] L816-2-->P2EXIT: Formula: (and (= |v_P2Thread1of1ForFork0_#res.offset_5| 0) (= |v_P2Thread1of1ForFork0_#res.base_5| 0) (= (+ v_~__unbuffered_cnt~0_48 1) v_~__unbuffered_cnt~0_47) (= v_~a$r_buff1_thd3~0_122 |v_P2Thread1of1ForFork0_#t~ite43_34|)) InVars {P2Thread1of1ForFork0_#t~ite43=|v_P2Thread1of1ForFork0_#t~ite43_34|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_48} OutVars{P2Thread1of1ForFork0_#res.base=|v_P2Thread1of1ForFork0_#res.base_5|, P2Thread1of1ForFork0_#t~ite43=|v_P2Thread1of1ForFork0_#t~ite43_33|, ~a$r_buff1_thd3~0=v_~a$r_buff1_thd3~0_122, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_47, P2Thread1of1ForFork0_#res.offset=|v_P2Thread1of1ForFork0_#res.offset_5|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#res.base, P2Thread1of1ForFork0_#t~ite43, ~a$r_buff1_thd3~0, ~__unbuffered_cnt~0, P2Thread1of1ForFork0_#res.offset] because there is no mapped edge [2019-12-26 21:32:07,888 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [831] [831] L777-->L777-2: Formula: (let ((.cse0 (= 0 (mod ~a$w_buff0_used~0_In-1192023495 256))) (.cse1 (= 0 (mod ~a$r_buff0_thd2~0_In-1192023495 256)))) (or (and (or .cse0 .cse1) (= |P1Thread1of1ForFork2_#t~ite11_Out-1192023495| ~a$w_buff0_used~0_In-1192023495)) (and (not .cse0) (= |P1Thread1of1ForFork2_#t~ite11_Out-1192023495| 0) (not .cse1)))) InVars {~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-1192023495, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1192023495} OutVars{~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-1192023495, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1192023495, P1Thread1of1ForFork2_#t~ite11=|P1Thread1of1ForFork2_#t~ite11_Out-1192023495|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite11] because there is no mapped edge [2019-12-26 21:32:07,889 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [826] [826] L778-->L778-2: Formula: (let ((.cse1 (= 0 (mod ~a$w_buff0_used~0_In1661492931 256))) (.cse0 (= 0 (mod ~a$r_buff0_thd2~0_In1661492931 256))) (.cse3 (= (mod ~a$w_buff1_used~0_In1661492931 256) 0)) (.cse2 (= 0 (mod ~a$r_buff1_thd2~0_In1661492931 256)))) (or (and (= |P1Thread1of1ForFork2_#t~ite12_Out1661492931| ~a$w_buff1_used~0_In1661492931) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2))) (= |P1Thread1of1ForFork2_#t~ite12_Out1661492931| 0)))) InVars {~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In1661492931, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In1661492931, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1661492931, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1661492931} OutVars{~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In1661492931, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In1661492931, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1661492931, P1Thread1of1ForFork2_#t~ite12=|P1Thread1of1ForFork2_#t~ite12_Out1661492931|, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1661492931} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite12] because there is no mapped edge [2019-12-26 21:32:07,889 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [844] [844] L779-->L779-2: Formula: (let ((.cse0 (= (mod ~a$w_buff0_used~0_In-346318166 256) 0)) (.cse1 (= (mod ~a$r_buff0_thd2~0_In-346318166 256) 0))) (or (and (not .cse0) (not .cse1) (= |P1Thread1of1ForFork2_#t~ite13_Out-346318166| 0)) (and (or .cse0 .cse1) (= |P1Thread1of1ForFork2_#t~ite13_Out-346318166| ~a$r_buff0_thd2~0_In-346318166)))) InVars {~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-346318166, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-346318166} OutVars{~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-346318166, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-346318166, P1Thread1of1ForFork2_#t~ite13=|P1Thread1of1ForFork2_#t~ite13_Out-346318166|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite13] because there is no mapped edge [2019-12-26 21:32:07,890 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [829] [829] L780-->L780-2: Formula: (let ((.cse3 (= 0 (mod ~a$w_buff0_used~0_In-1275396001 256))) (.cse2 (= (mod ~a$r_buff0_thd2~0_In-1275396001 256) 0)) (.cse1 (= (mod ~a$w_buff1_used~0_In-1275396001 256) 0)) (.cse0 (= (mod ~a$r_buff1_thd2~0_In-1275396001 256) 0))) (or (and (or .cse0 .cse1) (= |P1Thread1of1ForFork2_#t~ite14_Out-1275396001| ~a$r_buff1_thd2~0_In-1275396001) (or .cse2 .cse3)) (and (= |P1Thread1of1ForFork2_#t~ite14_Out-1275396001| 0) (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0)))))) InVars {~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In-1275396001, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-1275396001, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1275396001, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1275396001} OutVars{~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In-1275396001, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-1275396001, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1275396001, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1275396001, P1Thread1of1ForFork2_#t~ite14=|P1Thread1of1ForFork2_#t~ite14_Out-1275396001|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite14] because there is no mapped edge [2019-12-26 21:32:07,890 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [855] [855] L780-2-->P1EXIT: Formula: (and (= |v_P1Thread1of1ForFork2_#t~ite14_24| v_~a$r_buff1_thd2~0_79) (= 0 |v_P1Thread1of1ForFork2_#res.offset_5|) (= (+ v_~__unbuffered_cnt~0_54 1) v_~__unbuffered_cnt~0_53) (= 0 |v_P1Thread1of1ForFork2_#res.base_5|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_54, P1Thread1of1ForFork2_#t~ite14=|v_P1Thread1of1ForFork2_#t~ite14_24|} OutVars{P1Thread1of1ForFork2_#res.offset=|v_P1Thread1of1ForFork2_#res.offset_5|, ~a$r_buff1_thd2~0=v_~a$r_buff1_thd2~0_79, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_53, P1Thread1of1ForFork2_#t~ite14=|v_P1Thread1of1ForFork2_#t~ite14_23|, P1Thread1of1ForFork2_#res.base=|v_P1Thread1of1ForFork2_#res.base_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#res.offset, ~a$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork2_#t~ite14, P1Thread1of1ForFork2_#res.base] because there is no mapped edge [2019-12-26 21:32:07,890 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [761] [761] L839-1-->L845: Formula: (and (= 3 v_~__unbuffered_cnt~0_13) (= v_~main$tmp_guard0~0_6 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_13} OutVars{ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_13, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_6} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet46, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-26 21:32:07,891 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [836] [836] L845-2-->L845-4: Formula: (let ((.cse0 (= 0 (mod ~a$w_buff1_used~0_In833009902 256))) (.cse1 (= (mod ~a$r_buff1_thd0~0_In833009902 256) 0))) (or (and (not .cse0) (= |ULTIMATE.start_main_#t~ite47_Out833009902| ~a$w_buff1~0_In833009902) (not .cse1)) (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite47_Out833009902| ~a~0_In833009902)))) InVars {~a~0=~a~0_In833009902, ~a$w_buff1~0=~a$w_buff1~0_In833009902, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In833009902, ~a$w_buff1_used~0=~a$w_buff1_used~0_In833009902} OutVars{~a~0=~a~0_In833009902, ~a$w_buff1~0=~a$w_buff1~0_In833009902, ULTIMATE.start_main_#t~ite47=|ULTIMATE.start_main_#t~ite47_Out833009902|, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In833009902, ~a$w_buff1_used~0=~a$w_buff1_used~0_In833009902} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite47] because there is no mapped edge [2019-12-26 21:32:07,891 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [764] [764] L845-4-->L846: Formula: (= v_~a~0_30 |v_ULTIMATE.start_main_#t~ite47_13|) InVars {ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_13|} OutVars{~a~0=v_~a~0_30, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_12|, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_16|} AuxVars[] AssignedVars[~a~0, ULTIMATE.start_main_#t~ite47, ULTIMATE.start_main_#t~ite48] because there is no mapped edge [2019-12-26 21:32:07,891 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [827] [827] L846-->L846-2: Formula: (let ((.cse0 (= 0 (mod ~a$r_buff0_thd0~0_In-1378987708 256))) (.cse1 (= (mod ~a$w_buff0_used~0_In-1378987708 256) 0))) (or (and (not .cse0) (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite49_Out-1378987708|)) (and (= ~a$w_buff0_used~0_In-1378987708 |ULTIMATE.start_main_#t~ite49_Out-1378987708|) (or .cse0 .cse1)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In-1378987708, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-1378987708} OutVars{~a$w_buff0_used~0=~a$w_buff0_used~0_In-1378987708, ULTIMATE.start_main_#t~ite49=|ULTIMATE.start_main_#t~ite49_Out-1378987708|, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-1378987708} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite49] because there is no mapped edge [2019-12-26 21:32:07,892 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [820] [820] L847-->L847-2: Formula: (let ((.cse2 (= (mod ~a$r_buff0_thd0~0_In1277589751 256) 0)) (.cse3 (= (mod ~a$w_buff0_used~0_In1277589751 256) 0)) (.cse0 (= 0 (mod ~a$w_buff1_used~0_In1277589751 256))) (.cse1 (= 0 (mod ~a$r_buff1_thd0~0_In1277589751 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~a$w_buff1_used~0_In1277589751 |ULTIMATE.start_main_#t~ite50_Out1277589751|)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1))) (= |ULTIMATE.start_main_#t~ite50_Out1277589751| 0)))) InVars {~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In1277589751, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1277589751, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In1277589751, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1277589751} OutVars{ULTIMATE.start_main_#t~ite50=|ULTIMATE.start_main_#t~ite50_Out1277589751|, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In1277589751, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1277589751, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In1277589751, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1277589751} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite50] because there is no mapped edge [2019-12-26 21:32:07,893 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [840] [840] L848-->L848-2: Formula: (let ((.cse1 (= 0 (mod ~a$r_buff0_thd0~0_In-437096581 256))) (.cse0 (= (mod ~a$w_buff0_used~0_In-437096581 256) 0))) (or (and (= ~a$r_buff0_thd0~0_In-437096581 |ULTIMATE.start_main_#t~ite51_Out-437096581|) (or .cse0 .cse1)) (and (not .cse1) (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite51_Out-437096581|)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In-437096581, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-437096581} OutVars{ULTIMATE.start_main_#t~ite51=|ULTIMATE.start_main_#t~ite51_Out-437096581|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-437096581, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-437096581} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite51] because there is no mapped edge [2019-12-26 21:32:07,894 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [839] [839] L849-->L849-2: Formula: (let ((.cse1 (= (mod ~a$r_buff1_thd0~0_In130284842 256) 0)) (.cse0 (= (mod ~a$w_buff1_used~0_In130284842 256) 0)) (.cse2 (= (mod ~a$w_buff0_used~0_In130284842 256) 0)) (.cse3 (= 0 (mod ~a$r_buff0_thd0~0_In130284842 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite52_Out130284842|)) (and (or .cse1 .cse0) (= |ULTIMATE.start_main_#t~ite52_Out130284842| ~a$r_buff1_thd0~0_In130284842) (or .cse2 .cse3)))) InVars {~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In130284842, ~a$w_buff0_used~0=~a$w_buff0_used~0_In130284842, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In130284842, ~a$w_buff1_used~0=~a$w_buff1_used~0_In130284842} OutVars{ULTIMATE.start_main_#t~ite52=|ULTIMATE.start_main_#t~ite52_Out130284842|, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In130284842, ~a$w_buff0_used~0=~a$w_buff0_used~0_In130284842, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In130284842, ~a$w_buff1_used~0=~a$w_buff1_used~0_In130284842} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52] because there is no mapped edge [2019-12-26 21:32:07,894 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [887] [887] L849-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= 1 v_~__unbuffered_p2_EAX~0_21) (= v_~main$tmp_guard1~0_18 0) (= 1 v_~__unbuffered_p1_EAX~0_20) (= v_~a$r_buff1_thd0~0_158 |v_ULTIMATE.start_main_#t~ite52_40|) (= 2 v_~x~0_125) (= v_~__unbuffered_p1_EBX~0_21 0) (= v_ULTIMATE.start___VERIFIER_assert_~expression_18 0) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_14| (mod v_~main$tmp_guard1~0_18 256)) (= v_~__unbuffered_p2_EBX~0_24 0)) InVars {ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_40|, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_21, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_24, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_20, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_21, ~x~0=v_~x~0_125} OutVars{ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_39|, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_18, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_21, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_24, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_20, ~a$r_buff1_thd0~0=v_~a$r_buff1_thd0~0_158, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_18, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_21, ~x~0=v_~x~0_125, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_14|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52, ULTIMATE.start___VERIFIER_assert_~expression, ~a$r_buff1_thd0~0, ~main$tmp_guard1~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-26 21:32:07,993 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.12 09:32:07 BasicIcfg [2019-12-26 21:32:07,993 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-26 21:32:07,994 INFO L168 Benchmark]: Toolchain (without parser) took 120625.19 ms. Allocated memory was 137.9 MB in the beginning and 3.7 GB in the end (delta: 3.6 GB). Free memory was 98.9 MB in the beginning and 1.4 GB in the end (delta: -1.3 GB). Peak memory consumption was 2.2 GB. Max. memory is 7.1 GB. [2019-12-26 21:32:07,995 INFO L168 Benchmark]: CDTParser took 1.65 ms. Allocated memory is still 137.9 MB. Free memory was 119.8 MB in the beginning and 119.6 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. [2019-12-26 21:32:07,995 INFO L168 Benchmark]: CACSL2BoogieTranslator took 758.63 ms. Allocated memory was 137.9 MB in the beginning and 202.4 MB in the end (delta: 64.5 MB). Free memory was 98.7 MB in the beginning and 154.5 MB in the end (delta: -55.8 MB). Peak memory consumption was 24.9 MB. Max. memory is 7.1 GB. [2019-12-26 21:32:07,995 INFO L168 Benchmark]: Boogie Procedure Inliner took 66.37 ms. Allocated memory is still 202.4 MB. Free memory was 154.5 MB in the beginning and 151.7 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. [2019-12-26 21:32:07,996 INFO L168 Benchmark]: Boogie Preprocessor took 42.55 ms. Allocated memory is still 202.4 MB. Free memory was 151.7 MB in the beginning and 149.7 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2019-12-26 21:32:07,996 INFO L168 Benchmark]: RCFGBuilder took 891.40 ms. Allocated memory is still 202.4 MB. Free memory was 149.7 MB in the beginning and 99.1 MB in the end (delta: 50.7 MB). Peak memory consumption was 50.7 MB. Max. memory is 7.1 GB. [2019-12-26 21:32:07,996 INFO L168 Benchmark]: TraceAbstraction took 118860.43 ms. Allocated memory was 202.4 MB in the beginning and 3.7 GB in the end (delta: 3.5 GB). Free memory was 98.4 MB in the beginning and 1.4 GB in the end (delta: -1.3 GB). Peak memory consumption was 2.2 GB. Max. memory is 7.1 GB. [2019-12-26 21:32:07,998 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.65 ms. Allocated memory is still 137.9 MB. Free memory was 119.8 MB in the beginning and 119.6 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 758.63 ms. Allocated memory was 137.9 MB in the beginning and 202.4 MB in the end (delta: 64.5 MB). Free memory was 98.7 MB in the beginning and 154.5 MB in the end (delta: -55.8 MB). Peak memory consumption was 24.9 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 66.37 ms. Allocated memory is still 202.4 MB. Free memory was 154.5 MB in the beginning and 151.7 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 42.55 ms. Allocated memory is still 202.4 MB. Free memory was 151.7 MB in the beginning and 149.7 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 891.40 ms. Allocated memory is still 202.4 MB. Free memory was 149.7 MB in the beginning and 99.1 MB in the end (delta: 50.7 MB). Peak memory consumption was 50.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 118860.43 ms. Allocated memory was 202.4 MB in the beginning and 3.7 GB in the end (delta: 3.5 GB). Free memory was 98.4 MB in the beginning and 1.4 GB in the end (delta: -1.3 GB). Peak memory consumption was 2.2 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 6.1s, 178 ProgramPointsBefore, 94 ProgramPointsAfterwards, 215 TransitionsBefore, 103 TransitionsAfterwards, 19004 CoEnabledTransitionPairs, 8 FixpointIterations, 35 TrivialSequentialCompositions, 49 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 30 ConcurrentYvCompositions, 32 ChoiceCompositions, 7568 VarBasedMoverChecksPositive, 290 VarBasedMoverChecksNegative, 97 SemBasedMoverChecksPositive, 263 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.8s, 0 MoverChecksTotal, 90866 CheckedPairsTotal, 114 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L835] FCALL, FORK 0 pthread_create(&t293, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L837] FCALL, FORK 0 pthread_create(&t294, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L735] 1 a$w_buff1 = a$w_buff0 [L736] 1 a$w_buff0 = 1 [L737] 1 a$w_buff1_used = a$w_buff0_used [L738] 1 a$w_buff0_used = (_Bool)1 [L750] 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_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L764] 2 x = 2 [L767] 2 y = 1 [L770] 2 __unbuffered_p1_EAX = y [L773] 2 __unbuffered_p1_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0] [L776] 2 a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0] [L750] 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) [L751] 1 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L752] 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 [L839] FCALL, FORK 0 pthread_create(&t295, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0] [L790] 3 z = 1 [L793] 3 __unbuffered_p2_EAX = z [L796] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L797] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L798] 3 a$flush_delayed = weak$$choice2 [L799] 3 a$mem_tmp = a VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=1, z=1] [L800] EXPR 3 !a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff1) VAL [!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff1)=0, __unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=1, z=1] [L800] 3 a = !a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff1) [L801] 3 a$w_buff0 = weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff0)) [L802] EXPR 3 weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff1 : a$w_buff1)) VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff1 : a$w_buff1))=0, x=2, y=1, z=1] [L802] 3 a$w_buff1 = weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff1 : a$w_buff1)) [L803] 3 a$w_buff0_used = weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used)) [L804] 3 a$w_buff1_used = weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L806] EXPR 3 weak$$choice2 ? a$r_buff1_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff1_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? a$r_buff1_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff1_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))=0, x=2, y=1, z=1] [L806] 3 a$r_buff1_thd3 = weak$$choice2 ? a$r_buff1_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff1_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L807] 3 __unbuffered_p2_EBX = a VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=1, z=1] [L812] 3 a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=1, z=1] [L813] 3 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used [L814] 3 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$w_buff1_used [L815] 3 a$r_buff0_thd3 = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3 [L777] 2 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L778] 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 [L779] 2 a$r_buff0_thd2 = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L845] 0 a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=1, z=1] [L846] 0 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L847] 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 [L848] 0 a$r_buff0_thd0 = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 169 locations, 2 error locations. Result: UNSAFE, OverallTime: 118.5s, OverallIterations: 35, TraceHistogramMax: 1, AutomataDifference: 42.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 9476 SDtfs, 13254 SDslu, 36466 SDs, 0 SdLazy, 20158 SolverSat, 593 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 16.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 520 GetRequests, 60 SyntacticMatches, 22 SemanticMatches, 438 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2003 ImplicationChecksByTransitivity, 5.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=162755occurred in iteration=2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 43.7s AutomataMinimizationTime, 34 MinimizatonAttempts, 424034 StatesRemovedByMinimization, 31 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 3.6s InterpolantComputationTime, 1833 NumberOfCodeBlocks, 1833 NumberOfCodeBlocksAsserted, 35 NumberOfCheckSat, 1732 ConstructedInterpolants, 0 QuantifiedInterpolants, 400678 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 34 InterpolantComputations, 34 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...