/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/safe024_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 00:03:39,945 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 00:03:39,947 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 00:03:39,959 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 00:03:39,960 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 00:03:39,961 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 00:03:39,962 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 00:03:39,964 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 00:03:39,968 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 00:03:39,969 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 00:03:39,970 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 00:03:39,972 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 00:03:39,973 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 00:03:39,974 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 00:03:39,977 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 00:03:39,979 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 00:03:39,980 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 00:03:39,983 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 00:03:39,986 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 00:03:39,988 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 00:03:39,992 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 00:03:39,994 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 00:03:39,997 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 00:03:39,997 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 00:03:39,999 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 00:03:40,001 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 00:03:40,001 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 00:03:40,004 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 00:03:40,006 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 00:03:40,008 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 00:03:40,008 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 00:03:40,009 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 00:03:40,010 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 00:03:40,011 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 00:03:40,014 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 00:03:40,015 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 00:03:40,016 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 00:03:40,016 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 00:03:40,016 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 00:03:40,017 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 00:03:40,018 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 00:03:40,019 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-27 00:03:40,041 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 00:03:40,041 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 00:03:40,042 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 00:03:40,043 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 00:03:40,043 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 00:03:40,043 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 00:03:40,043 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 00:03:40,043 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 00:03:40,044 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 00:03:40,044 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 00:03:40,044 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 00:03:40,044 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 00:03:40,044 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 00:03:40,045 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 00:03:40,045 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 00:03:40,045 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 00:03:40,045 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 00:03:40,045 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 00:03:40,046 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 00:03:40,046 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 00:03:40,046 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 00:03:40,046 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 00:03:40,046 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 00:03:40,047 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 00:03:40,047 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 00:03:40,047 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 00:03:40,047 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 00:03:40,047 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 00:03:40,048 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-27 00:03:40,048 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 00:03:40,322 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 00:03:40,342 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 00:03:40,346 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 00:03:40,347 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 00:03:40,348 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 00:03:40,349 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe024_rmo.opt.i [2019-12-27 00:03:40,430 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b90f295fe/1a0b563b30524dd885f8ca4ad8744c18/FLAG3622a2dcd [2019-12-27 00:03:41,038 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 00:03:41,039 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe024_rmo.opt.i [2019-12-27 00:03:41,064 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b90f295fe/1a0b563b30524dd885f8ca4ad8744c18/FLAG3622a2dcd [2019-12-27 00:03:41,347 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b90f295fe/1a0b563b30524dd885f8ca4ad8744c18 [2019-12-27 00:03:41,356 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 00:03:41,358 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 00:03:41,358 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 00:03:41,359 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 00:03:41,362 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 00:03:41,363 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 12:03:41" (1/1) ... [2019-12-27 00:03:41,366 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@23588bd6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 12:03:41, skipping insertion in model container [2019-12-27 00:03:41,366 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 12:03:41" (1/1) ... [2019-12-27 00:03:41,373 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 00:03:41,423 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 00:03:41,955 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 00:03:41,968 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 00:03:42,057 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 00:03:42,135 INFO L208 MainTranslator]: Completed translation [2019-12-27 00:03:42,136 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 12:03:42 WrapperNode [2019-12-27 00:03:42,136 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 00:03:42,137 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 00:03:42,137 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 00:03:42,137 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 00:03:42,146 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 12:03:42" (1/1) ... [2019-12-27 00:03:42,166 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 12:03:42" (1/1) ... [2019-12-27 00:03:42,200 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 00:03:42,202 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 00:03:42,202 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 00:03:42,202 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 00:03:42,210 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 12:03:42" (1/1) ... [2019-12-27 00:03:42,210 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 12:03:42" (1/1) ... [2019-12-27 00:03:42,215 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 12:03:42" (1/1) ... [2019-12-27 00:03:42,215 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 12:03:42" (1/1) ... [2019-12-27 00:03:42,226 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 12:03:42" (1/1) ... [2019-12-27 00:03:42,231 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 12:03:42" (1/1) ... [2019-12-27 00:03:42,235 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 12:03:42" (1/1) ... [2019-12-27 00:03:42,240 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 00:03:42,240 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 00:03:42,241 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 00:03:42,241 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 00:03:42,242 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 12:03:42" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 00:03:42,300 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 00:03:42,300 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 00:03:42,300 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 00:03:42,300 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 00:03:42,301 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 00:03:42,301 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 00:03:42,301 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 00:03:42,301 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 00:03:42,301 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-27 00:03:42,301 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-27 00:03:42,302 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 00:03:42,302 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 00:03:42,302 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 00:03:42,304 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-27 00:03:43,028 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 00:03:43,028 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 00:03:43,029 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 12:03:43 BoogieIcfgContainer [2019-12-27 00:03:43,030 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 00:03:43,031 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 00:03:43,031 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 00:03:43,034 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 00:03:43,035 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 12:03:41" (1/3) ... [2019-12-27 00:03:43,036 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ba9323c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 12:03:43, skipping insertion in model container [2019-12-27 00:03:43,036 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 12:03:42" (2/3) ... [2019-12-27 00:03:43,037 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ba9323c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 12:03:43, skipping insertion in model container [2019-12-27 00:03:43,037 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 12:03:43" (3/3) ... [2019-12-27 00:03:43,039 INFO L109 eAbstractionObserver]: Analyzing ICFG safe024_rmo.opt.i [2019-12-27 00:03:43,050 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 00:03:43,050 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 00:03:43,061 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 00:03:43,062 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 00:03:43,120 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:03:43,121 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:03:43,121 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:03:43,122 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:03:43,122 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:03:43,122 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:03:43,122 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:03:43,122 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:03:43,123 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:03:43,123 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:03:43,124 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:03:43,124 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:03:43,124 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:03:43,124 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:03:43,125 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:03:43,125 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:03:43,125 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:03:43,126 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:03:43,126 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:03:43,126 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:03:43,126 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:03:43,127 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:03:43,127 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:03:43,128 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:03:43,128 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:03:43,128 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:03:43,128 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:03:43,129 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:03:43,129 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:03:43,129 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:03:43,129 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:03:43,130 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:03:43,130 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:03:43,130 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:03:43,130 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:03:43,131 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:03:43,131 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:03:43,131 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:03:43,131 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:03:43,132 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:03:43,132 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:03:43,132 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:03:43,132 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:03:43,133 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:03:43,133 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:03:43,133 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:03:43,133 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:03:43,134 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:03:43,134 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:03:43,134 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:03:43,135 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:03:43,135 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:03:43,135 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:03:43,135 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:03:43,135 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:03:43,136 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:03:43,136 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:03:43,136 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:03:43,137 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:03:43,137 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:03:43,137 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:03:43,137 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:03:43,137 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:03:43,138 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:03:43,138 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:03:43,138 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:03:43,138 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:03:43,139 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:03:43,139 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:03:43,139 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:03:43,139 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:03:43,140 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:03:43,140 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:03:43,140 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:03:43,140 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:03:43,141 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:03:43,141 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:03:43,141 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:03:43,141 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:03:43,142 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:03:43,142 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:03:43,142 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:03:43,142 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:03:43,143 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:03:43,143 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:03:43,143 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:03:43,143 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:03:43,144 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:03:43,144 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:03:43,144 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:03:43,144 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:03:43,145 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:03:43,145 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:03:43,145 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:03:43,146 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:03:43,146 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:03:43,146 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:03:43,147 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:03:43,147 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:03:43,147 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:03:43,147 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:03:43,148 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:03:43,148 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:03:43,148 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:03:43,149 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:03:43,149 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:03:43,149 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:03:43,149 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:03:43,150 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:03:43,150 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:03:43,150 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:03:43,151 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:03:43,151 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:03:43,151 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:03:43,151 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:03:43,151 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:03:43,152 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:03:43,152 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:03:43,152 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:03:43,152 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:03:43,153 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:03:43,153 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:03:43,153 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:03:43,153 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:03:43,154 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:03:43,154 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:03:43,154 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:03:43,154 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:03:43,155 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:03:43,155 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:03:43,155 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:03:43,155 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:03:43,156 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:03:43,156 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:03:43,156 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:03:43,156 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:03:43,157 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:03:43,157 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:03:43,157 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:03:43,157 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:03:43,158 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:03:43,158 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:03:43,158 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:03:43,158 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:03:43,159 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:03:43,159 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:03:43,159 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:03:43,159 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:03:43,160 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:03:43,160 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:03:43,160 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:03:43,160 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:03:43,160 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:03:43,161 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:03:43,161 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:03:43,161 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:03:43,162 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:03:43,162 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:03:43,182 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:03:43,183 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:03:43,183 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:03:43,183 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:03:43,184 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:03:43,184 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:03:43,184 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:03:43,184 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:03:43,184 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:03:43,184 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:03:43,185 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:03:43,185 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:03:43,188 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:03:43,188 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:03:43,188 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:03:43,188 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:03:43,189 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:03:43,189 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:03:43,189 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:03:43,189 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:03:43,189 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:03:43,190 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:03:43,192 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:03:43,193 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:03:43,193 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:03:43,193 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:03:43,193 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:03:43,193 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:03:43,194 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:03:43,194 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:03:43,194 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:03:43,194 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:03:43,194 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:03:43,194 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:03:43,195 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:03:43,195 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:03:43,195 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:03:43,195 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:03:43,195 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:03:43,196 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:03:43,196 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:03:43,196 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:03:43,196 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:03:43,196 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:03:43,197 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:03:43,197 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:03:43,197 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:03:43,197 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:03:43,197 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:03:43,213 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-27 00:03:43,234 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 00:03:43,235 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 00:03:43,235 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 00:03:43,235 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-27 00:03:43,235 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 00:03:43,235 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 00:03:43,235 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 00:03:43,236 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 00:03:43,253 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 164 places, 195 transitions [2019-12-27 00:03:43,255 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 164 places, 195 transitions [2019-12-27 00:03:43,351 INFO L132 PetriNetUnfolder]: 41/192 cut-off events. [2019-12-27 00:03:43,352 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 00:03:43,367 INFO L76 FinitePrefix]: Finished finitePrefix Result has 202 conditions, 192 events. 41/192 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 449 event pairs. 0/149 useless extension candidates. Maximal degree in co-relation 161. Up to 2 conditions per place. [2019-12-27 00:03:43,390 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 164 places, 195 transitions [2019-12-27 00:03:43,440 INFO L132 PetriNetUnfolder]: 41/192 cut-off events. [2019-12-27 00:03:43,440 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 00:03:43,449 INFO L76 FinitePrefix]: Finished finitePrefix Result has 202 conditions, 192 events. 41/192 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 449 event pairs. 0/149 useless extension candidates. Maximal degree in co-relation 161. Up to 2 conditions per place. [2019-12-27 00:03:43,470 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 16696 [2019-12-27 00:03:43,471 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-27 00:03:48,960 WARN L192 SmtUtils]: Spent 245.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 89 [2019-12-27 00:03:49,086 WARN L192 SmtUtils]: Spent 124.00 ms on a formula simplification that was a NOOP. DAG size: 87 [2019-12-27 00:03:49,110 INFO L206 etLargeBlockEncoding]: Checked pairs total: 66430 [2019-12-27 00:03:49,110 INFO L214 etLargeBlockEncoding]: Total number of compositions: 109 [2019-12-27 00:03:49,114 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 83 places, 89 transitions [2019-12-27 00:04:00,879 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 89098 states. [2019-12-27 00:04:00,881 INFO L276 IsEmpty]: Start isEmpty. Operand 89098 states. [2019-12-27 00:04:00,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-12-27 00:04:00,888 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:04:00,888 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-12-27 00:04:00,889 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 00:04:00,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:04:00,896 INFO L82 PathProgramCache]: Analyzing trace with hash 797474656, now seen corresponding path program 1 times [2019-12-27 00:04:00,907 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:04:00,907 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [804902271] [2019-12-27 00:04:00,908 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:04:01,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:04:01,168 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 00:04:01,169 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [804902271] [2019-12-27 00:04:01,169 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:04:01,170 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 00:04:01,173 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [400040240] [2019-12-27 00:04:01,178 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 00:04:01,178 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:04:01,193 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 00:04:01,194 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 00:04:01,196 INFO L87 Difference]: Start difference. First operand 89098 states. Second operand 3 states. [2019-12-27 00:04:04,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:04:04,293 INFO L93 Difference]: Finished difference Result 87834 states and 374974 transitions. [2019-12-27 00:04:04,294 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 00:04:04,295 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-12-27 00:04:04,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:04:04,909 INFO L225 Difference]: With dead ends: 87834 [2019-12-27 00:04:04,909 INFO L226 Difference]: Without dead ends: 82738 [2019-12-27 00:04:04,910 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 00:04:08,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82738 states. [2019-12-27 00:04:12,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82738 to 82738. [2019-12-27 00:04:12,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82738 states. [2019-12-27 00:04:16,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82738 states to 82738 states and 352742 transitions. [2019-12-27 00:04:16,124 INFO L78 Accepts]: Start accepts. Automaton has 82738 states and 352742 transitions. Word has length 5 [2019-12-27 00:04:16,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:04:16,125 INFO L462 AbstractCegarLoop]: Abstraction has 82738 states and 352742 transitions. [2019-12-27 00:04:16,125 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 00:04:16,125 INFO L276 IsEmpty]: Start isEmpty. Operand 82738 states and 352742 transitions. [2019-12-27 00:04:16,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 00:04:16,136 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:04:16,137 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 00:04:16,137 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 00:04:16,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:04:16,137 INFO L82 PathProgramCache]: Analyzing trace with hash 334215788, now seen corresponding path program 1 times [2019-12-27 00:04:16,137 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:04:16,138 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [156561815] [2019-12-27 00:04:16,138 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:04:16,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:04:16,315 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 00:04:16,316 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [156561815] [2019-12-27 00:04:16,316 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:04:16,316 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 00:04:16,317 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1156129002] [2019-12-27 00:04:16,318 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 00:04:16,318 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:04:16,319 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 00:04:16,319 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 00:04:16,319 INFO L87 Difference]: Start difference. First operand 82738 states and 352742 transitions. Second operand 4 states. [2019-12-27 00:04:17,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:04:17,309 INFO L93 Difference]: Finished difference Result 127286 states and 521114 transitions. [2019-12-27 00:04:17,309 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 00:04:17,310 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-27 00:04:17,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:04:18,046 INFO L225 Difference]: With dead ends: 127286 [2019-12-27 00:04:18,046 INFO L226 Difference]: Without dead ends: 127202 [2019-12-27 00:04:18,047 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 00:04:25,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127202 states. [2019-12-27 00:04:28,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127202 to 115962. [2019-12-27 00:04:28,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115962 states. [2019-12-27 00:04:29,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115962 states to 115962 states and 480151 transitions. [2019-12-27 00:04:29,063 INFO L78 Accepts]: Start accepts. Automaton has 115962 states and 480151 transitions. Word has length 13 [2019-12-27 00:04:29,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:04:29,064 INFO L462 AbstractCegarLoop]: Abstraction has 115962 states and 480151 transitions. [2019-12-27 00:04:29,064 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 00:04:29,064 INFO L276 IsEmpty]: Start isEmpty. Operand 115962 states and 480151 transitions. [2019-12-27 00:04:29,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 00:04:29,068 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:04:29,068 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 00:04:29,069 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 00:04:29,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:04:29,069 INFO L82 PathProgramCache]: Analyzing trace with hash -1013985610, now seen corresponding path program 1 times [2019-12-27 00:04:29,069 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:04:29,070 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1098569239] [2019-12-27 00:04:29,070 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:04:29,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:04:29,152 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 00:04:29,153 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1098569239] [2019-12-27 00:04:29,153 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:04:29,153 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 00:04:29,153 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [939567173] [2019-12-27 00:04:29,154 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 00:04:29,154 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:04:29,154 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 00:04:29,154 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 00:04:29,155 INFO L87 Difference]: Start difference. First operand 115962 states and 480151 transitions. Second operand 3 states. [2019-12-27 00:04:29,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:04:29,263 INFO L93 Difference]: Finished difference Result 28492 states and 95363 transitions. [2019-12-27 00:04:29,263 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 00:04:29,264 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-27 00:04:29,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:04:29,318 INFO L225 Difference]: With dead ends: 28492 [2019-12-27 00:04:29,318 INFO L226 Difference]: Without dead ends: 28492 [2019-12-27 00:04:29,318 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 00:04:29,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28492 states. [2019-12-27 00:04:29,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28492 to 28492. [2019-12-27 00:04:29,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28492 states. [2019-12-27 00:04:30,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28492 states to 28492 states and 95363 transitions. [2019-12-27 00:04:30,045 INFO L78 Accepts]: Start accepts. Automaton has 28492 states and 95363 transitions. Word has length 13 [2019-12-27 00:04:30,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:04:30,045 INFO L462 AbstractCegarLoop]: Abstraction has 28492 states and 95363 transitions. [2019-12-27 00:04:30,045 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 00:04:30,045 INFO L276 IsEmpty]: Start isEmpty. Operand 28492 states and 95363 transitions. [2019-12-27 00:04:30,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-27 00:04:30,048 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:04:30,048 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 00:04:30,048 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 00:04:30,049 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:04:30,049 INFO L82 PathProgramCache]: Analyzing trace with hash 319138254, now seen corresponding path program 1 times [2019-12-27 00:04:30,049 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:04:30,049 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2006435867] [2019-12-27 00:04:30,050 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:04:30,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:04:30,164 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 00:04:30,165 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2006435867] [2019-12-27 00:04:30,165 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:04:30,165 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 00:04:30,166 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1136753117] [2019-12-27 00:04:30,166 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 00:04:30,166 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:04:30,167 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 00:04:30,167 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 00:04:30,167 INFO L87 Difference]: Start difference. First operand 28492 states and 95363 transitions. Second operand 5 states. [2019-12-27 00:04:32,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:04:32,413 INFO L93 Difference]: Finished difference Result 41156 states and 135447 transitions. [2019-12-27 00:04:32,413 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 00:04:32,414 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2019-12-27 00:04:32,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:04:32,539 INFO L225 Difference]: With dead ends: 41156 [2019-12-27 00:04:32,539 INFO L226 Difference]: Without dead ends: 41141 [2019-12-27 00:04:32,540 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-27 00:04:32,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41141 states. [2019-12-27 00:04:33,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41141 to 31619. [2019-12-27 00:04:33,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31619 states. [2019-12-27 00:04:33,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31619 states to 31619 states and 105299 transitions. [2019-12-27 00:04:33,230 INFO L78 Accepts]: Start accepts. Automaton has 31619 states and 105299 transitions. Word has length 14 [2019-12-27 00:04:33,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:04:33,231 INFO L462 AbstractCegarLoop]: Abstraction has 31619 states and 105299 transitions. [2019-12-27 00:04:33,231 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 00:04:33,231 INFO L276 IsEmpty]: Start isEmpty. Operand 31619 states and 105299 transitions. [2019-12-27 00:04:33,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-27 00:04:33,242 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:04:33,242 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 00:04:33,242 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 00:04:33,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:04:33,243 INFO L82 PathProgramCache]: Analyzing trace with hash 436639450, now seen corresponding path program 1 times [2019-12-27 00:04:33,243 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:04:33,243 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1274185470] [2019-12-27 00:04:33,243 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:04:33,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:04:33,505 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 00:04:33,506 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1274185470] [2019-12-27 00:04:33,506 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:04:33,506 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 00:04:33,506 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1216718335] [2019-12-27 00:04:33,507 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 00:04:33,507 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:04:33,507 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 00:04:33,507 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-12-27 00:04:33,508 INFO L87 Difference]: Start difference. First operand 31619 states and 105299 transitions. Second operand 8 states. [2019-12-27 00:04:34,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:04:34,517 INFO L93 Difference]: Finished difference Result 48171 states and 157719 transitions. [2019-12-27 00:04:34,518 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-27 00:04:34,518 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 22 [2019-12-27 00:04:34,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:04:34,635 INFO L225 Difference]: With dead ends: 48171 [2019-12-27 00:04:34,635 INFO L226 Difference]: Without dead ends: 48157 [2019-12-27 00:04:34,636 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=83, Invalid=157, Unknown=0, NotChecked=0, Total=240 [2019-12-27 00:04:35,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48157 states. [2019-12-27 00:04:35,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48157 to 31596. [2019-12-27 00:04:35,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31596 states. [2019-12-27 00:04:35,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31596 states to 31596 states and 105222 transitions. [2019-12-27 00:04:35,701 INFO L78 Accepts]: Start accepts. Automaton has 31596 states and 105222 transitions. Word has length 22 [2019-12-27 00:04:35,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:04:35,701 INFO L462 AbstractCegarLoop]: Abstraction has 31596 states and 105222 transitions. [2019-12-27 00:04:35,701 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 00:04:35,701 INFO L276 IsEmpty]: Start isEmpty. Operand 31596 states and 105222 transitions. [2019-12-27 00:04:35,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-27 00:04:35,710 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:04:35,710 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 00:04:35,710 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 00:04:35,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:04:35,711 INFO L82 PathProgramCache]: Analyzing trace with hash 552377370, now seen corresponding path program 2 times [2019-12-27 00:04:35,711 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:04:35,711 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [643567343] [2019-12-27 00:04:35,712 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:04:35,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:04:35,842 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 00:04:35,843 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [643567343] [2019-12-27 00:04:35,843 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:04:35,843 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 00:04:35,843 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [317120371] [2019-12-27 00:04:35,844 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 00:04:35,844 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:04:35,844 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 00:04:35,845 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 00:04:35,845 INFO L87 Difference]: Start difference. First operand 31596 states and 105222 transitions. Second operand 6 states. [2019-12-27 00:04:36,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:04:36,545 INFO L93 Difference]: Finished difference Result 50504 states and 164652 transitions. [2019-12-27 00:04:36,545 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-27 00:04:36,546 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2019-12-27 00:04:36,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:04:36,634 INFO L225 Difference]: With dead ends: 50504 [2019-12-27 00:04:36,634 INFO L226 Difference]: Without dead ends: 50489 [2019-12-27 00:04:36,635 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2019-12-27 00:04:36,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50489 states. [2019-12-27 00:04:37,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50489 to 33912. [2019-12-27 00:04:37,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33912 states. [2019-12-27 00:04:37,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33912 states to 33912 states and 112011 transitions. [2019-12-27 00:04:37,656 INFO L78 Accepts]: Start accepts. Automaton has 33912 states and 112011 transitions. Word has length 22 [2019-12-27 00:04:37,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:04:37,656 INFO L462 AbstractCegarLoop]: Abstraction has 33912 states and 112011 transitions. [2019-12-27 00:04:37,656 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 00:04:37,656 INFO L276 IsEmpty]: Start isEmpty. Operand 33912 states and 112011 transitions. [2019-12-27 00:04:37,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-27 00:04:37,666 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:04:37,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] [2019-12-27 00:04:37,666 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 00:04:37,666 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:04:37,667 INFO L82 PathProgramCache]: Analyzing trace with hash -324366654, now seen corresponding path program 1 times [2019-12-27 00:04:37,667 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:04:37,667 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [958732562] [2019-12-27 00:04:37,667 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:04:37,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:04:37,788 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 00:04:37,788 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [958732562] [2019-12-27 00:04:37,788 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:04:37,789 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 00:04:37,789 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1339167691] [2019-12-27 00:04:37,789 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 00:04:37,789 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:04:37,790 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 00:04:37,790 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 00:04:37,790 INFO L87 Difference]: Start difference. First operand 33912 states and 112011 transitions. Second operand 6 states. [2019-12-27 00:04:38,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:04:38,606 INFO L93 Difference]: Finished difference Result 58332 states and 188079 transitions. [2019-12-27 00:04:38,606 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-27 00:04:38,606 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2019-12-27 00:04:38,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:04:38,716 INFO L225 Difference]: With dead ends: 58332 [2019-12-27 00:04:38,716 INFO L226 Difference]: Without dead ends: 58317 [2019-12-27 00:04:38,717 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2019-12-27 00:04:38,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58317 states. [2019-12-27 00:04:39,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58317 to 39114. [2019-12-27 00:04:39,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39114 states. [2019-12-27 00:04:40,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39114 states to 39114 states and 127576 transitions. [2019-12-27 00:04:40,052 INFO L78 Accepts]: Start accepts. Automaton has 39114 states and 127576 transitions. Word has length 22 [2019-12-27 00:04:40,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:04:40,053 INFO L462 AbstractCegarLoop]: Abstraction has 39114 states and 127576 transitions. [2019-12-27 00:04:40,053 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 00:04:40,053 INFO L276 IsEmpty]: Start isEmpty. Operand 39114 states and 127576 transitions. [2019-12-27 00:04:40,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-27 00:04:40,060 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:04:40,060 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 00:04:40,061 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 00:04:40,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:04:40,061 INFO L82 PathProgramCache]: Analyzing trace with hash -1455790486, now seen corresponding path program 3 times [2019-12-27 00:04:40,061 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:04:40,061 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [29459155] [2019-12-27 00:04:40,061 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:04:40,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:04:40,226 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 00:04:40,226 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [29459155] [2019-12-27 00:04:40,226 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:04:40,227 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 00:04:40,227 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [683888326] [2019-12-27 00:04:40,227 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 00:04:40,227 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:04:40,228 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 00:04:40,228 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-12-27 00:04:40,228 INFO L87 Difference]: Start difference. First operand 39114 states and 127576 transitions. Second operand 7 states. [2019-12-27 00:04:41,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:04:41,336 INFO L93 Difference]: Finished difference Result 57661 states and 185585 transitions. [2019-12-27 00:04:41,336 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-27 00:04:41,336 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 22 [2019-12-27 00:04:41,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:04:41,443 INFO L225 Difference]: With dead ends: 57661 [2019-12-27 00:04:41,443 INFO L226 Difference]: Without dead ends: 57646 [2019-12-27 00:04:41,443 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=144, Unknown=0, NotChecked=0, Total=210 [2019-12-27 00:04:41,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57646 states. [2019-12-27 00:04:42,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57646 to 37466. [2019-12-27 00:04:42,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37466 states. [2019-12-27 00:04:42,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37466 states to 37466 states and 122495 transitions. [2019-12-27 00:04:42,251 INFO L78 Accepts]: Start accepts. Automaton has 37466 states and 122495 transitions. Word has length 22 [2019-12-27 00:04:42,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:04:42,251 INFO L462 AbstractCegarLoop]: Abstraction has 37466 states and 122495 transitions. [2019-12-27 00:04:42,252 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 00:04:42,252 INFO L276 IsEmpty]: Start isEmpty. Operand 37466 states and 122495 transitions. [2019-12-27 00:04:42,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 00:04:42,265 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:04:42,265 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 00:04:42,266 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 00:04:42,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:04:42,266 INFO L82 PathProgramCache]: Analyzing trace with hash -1832050687, now seen corresponding path program 1 times [2019-12-27 00:04:42,266 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:04:42,266 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1224826775] [2019-12-27 00:04:42,266 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:04:42,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:04:42,319 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 00:04:42,320 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1224826775] [2019-12-27 00:04:42,320 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:04:42,320 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 00:04:42,320 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [326361730] [2019-12-27 00:04:42,321 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 00:04:42,321 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:04:42,321 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 00:04:42,321 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 00:04:42,322 INFO L87 Difference]: Start difference. First operand 37466 states and 122495 transitions. Second operand 4 states. [2019-12-27 00:04:42,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:04:42,386 INFO L93 Difference]: Finished difference Result 14641 states and 44308 transitions. [2019-12-27 00:04:42,386 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 00:04:42,386 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2019-12-27 00:04:42,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:04:42,406 INFO L225 Difference]: With dead ends: 14641 [2019-12-27 00:04:42,406 INFO L226 Difference]: Without dead ends: 14641 [2019-12-27 00:04:42,406 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 00:04:42,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14641 states. [2019-12-27 00:04:42,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14641 to 14486. [2019-12-27 00:04:42,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14486 states. [2019-12-27 00:04:42,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14486 states to 14486 states and 43853 transitions. [2019-12-27 00:04:42,927 INFO L78 Accepts]: Start accepts. Automaton has 14486 states and 43853 transitions. Word has length 25 [2019-12-27 00:04:42,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:04:42,927 INFO L462 AbstractCegarLoop]: Abstraction has 14486 states and 43853 transitions. [2019-12-27 00:04:42,927 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 00:04:42,927 INFO L276 IsEmpty]: Start isEmpty. Operand 14486 states and 43853 transitions. [2019-12-27 00:04:42,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-27 00:04:42,946 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:04:42,947 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 00:04:42,947 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 00:04:42,947 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:04:42,947 INFO L82 PathProgramCache]: Analyzing trace with hash 207279171, now seen corresponding path program 1 times [2019-12-27 00:04:42,947 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:04:42,949 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [605979147] [2019-12-27 00:04:42,949 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:04:42,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:04:43,013 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 00:04:43,014 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [605979147] [2019-12-27 00:04:43,014 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:04:43,014 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 00:04:43,014 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1385187866] [2019-12-27 00:04:43,015 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 00:04:43,015 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:04:43,015 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 00:04:43,015 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 00:04:43,016 INFO L87 Difference]: Start difference. First operand 14486 states and 43853 transitions. Second operand 5 states. [2019-12-27 00:04:43,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:04:43,100 INFO L93 Difference]: Finished difference Result 13120 states and 40364 transitions. [2019-12-27 00:04:43,100 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 00:04:43,101 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 39 [2019-12-27 00:04:43,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:04:43,129 INFO L225 Difference]: With dead ends: 13120 [2019-12-27 00:04:43,129 INFO L226 Difference]: Without dead ends: 13120 [2019-12-27 00:04:43,129 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 00:04:43,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13120 states. [2019-12-27 00:04:43,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13120 to 12654. [2019-12-27 00:04:43,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12654 states. [2019-12-27 00:04:43,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12654 states to 12654 states and 39049 transitions. [2019-12-27 00:04:43,454 INFO L78 Accepts]: Start accepts. Automaton has 12654 states and 39049 transitions. Word has length 39 [2019-12-27 00:04:43,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:04:43,455 INFO L462 AbstractCegarLoop]: Abstraction has 12654 states and 39049 transitions. [2019-12-27 00:04:43,455 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 00:04:43,455 INFO L276 IsEmpty]: Start isEmpty. Operand 12654 states and 39049 transitions. [2019-12-27 00:04:43,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-27 00:04:43,483 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:04:43,483 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 00:04:43,483 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 00:04:43,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:04:43,484 INFO L82 PathProgramCache]: Analyzing trace with hash 1179829373, now seen corresponding path program 1 times [2019-12-27 00:04:43,484 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:04:43,485 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1803320944] [2019-12-27 00:04:43,485 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:04:43,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:04:43,580 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 00:04:43,581 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1803320944] [2019-12-27 00:04:43,581 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:04:43,581 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 00:04:43,581 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [131862897] [2019-12-27 00:04:43,582 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 00:04:43,582 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:04:43,582 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 00:04:43,583 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 00:04:43,583 INFO L87 Difference]: Start difference. First operand 12654 states and 39049 transitions. Second operand 4 states. [2019-12-27 00:04:43,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:04:43,686 INFO L93 Difference]: Finished difference Result 23069 states and 71102 transitions. [2019-12-27 00:04:43,686 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 00:04:43,687 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 53 [2019-12-27 00:04:43,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:04:43,713 INFO L225 Difference]: With dead ends: 23069 [2019-12-27 00:04:43,714 INFO L226 Difference]: Without dead ends: 11042 [2019-12-27 00:04:43,714 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 00:04:43,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11042 states. [2019-12-27 00:04:43,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11042 to 11042. [2019-12-27 00:04:43,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11042 states. [2019-12-27 00:04:43,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11042 states to 11042 states and 33895 transitions. [2019-12-27 00:04:43,982 INFO L78 Accepts]: Start accepts. Automaton has 11042 states and 33895 transitions. Word has length 53 [2019-12-27 00:04:43,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:04:43,982 INFO L462 AbstractCegarLoop]: Abstraction has 11042 states and 33895 transitions. [2019-12-27 00:04:43,982 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 00:04:43,983 INFO L276 IsEmpty]: Start isEmpty. Operand 11042 states and 33895 transitions. [2019-12-27 00:04:44,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-27 00:04:44,009 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:04:44,010 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 00:04:44,010 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 00:04:44,010 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:04:44,010 INFO L82 PathProgramCache]: Analyzing trace with hash 383407097, now seen corresponding path program 2 times [2019-12-27 00:04:44,011 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:04:44,011 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1765572806] [2019-12-27 00:04:44,011 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:04:44,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:04:44,126 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 00:04:44,126 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1765572806] [2019-12-27 00:04:44,126 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:04:44,126 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 00:04:44,127 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2053424228] [2019-12-27 00:04:44,128 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 00:04:44,128 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:04:44,129 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 00:04:44,129 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-27 00:04:44,129 INFO L87 Difference]: Start difference. First operand 11042 states and 33895 transitions. Second operand 7 states. [2019-12-27 00:04:44,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:04:44,555 INFO L93 Difference]: Finished difference Result 26731 states and 81978 transitions. [2019-12-27 00:04:44,556 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 00:04:44,556 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 53 [2019-12-27 00:04:44,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:04:44,602 INFO L225 Difference]: With dead ends: 26731 [2019-12-27 00:04:44,602 INFO L226 Difference]: Without dead ends: 21825 [2019-12-27 00:04:44,603 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-27 00:04:44,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21825 states. [2019-12-27 00:04:44,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21825 to 12839. [2019-12-27 00:04:44,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12839 states. [2019-12-27 00:04:44,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12839 states to 12839 states and 39761 transitions. [2019-12-27 00:04:44,892 INFO L78 Accepts]: Start accepts. Automaton has 12839 states and 39761 transitions. Word has length 53 [2019-12-27 00:04:44,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:04:44,893 INFO L462 AbstractCegarLoop]: Abstraction has 12839 states and 39761 transitions. [2019-12-27 00:04:44,893 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 00:04:44,893 INFO L276 IsEmpty]: Start isEmpty. Operand 12839 states and 39761 transitions. [2019-12-27 00:04:44,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-27 00:04:44,907 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:04:44,907 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 00:04:44,907 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 00:04:44,907 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:04:44,908 INFO L82 PathProgramCache]: Analyzing trace with hash 1401815865, now seen corresponding path program 3 times [2019-12-27 00:04:44,908 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:04:44,908 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1466442203] [2019-12-27 00:04:44,908 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:04:44,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:04:44,991 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 00:04:44,992 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1466442203] [2019-12-27 00:04:44,992 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:04:44,992 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 00:04:44,992 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [712120728] [2019-12-27 00:04:44,993 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 00:04:44,993 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:04:44,993 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 00:04:44,993 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-27 00:04:44,993 INFO L87 Difference]: Start difference. First operand 12839 states and 39761 transitions. Second operand 7 states. [2019-12-27 00:04:45,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:04:45,401 INFO L93 Difference]: Finished difference Result 33675 states and 101714 transitions. [2019-12-27 00:04:45,401 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 00:04:45,401 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 53 [2019-12-27 00:04:45,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:04:45,437 INFO L225 Difference]: With dead ends: 33675 [2019-12-27 00:04:45,437 INFO L226 Difference]: Without dead ends: 23645 [2019-12-27 00:04:45,437 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2019-12-27 00:04:45,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23645 states. [2019-12-27 00:04:45,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23645 to 14877. [2019-12-27 00:04:45,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14877 states. [2019-12-27 00:04:45,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14877 states to 14877 states and 45900 transitions. [2019-12-27 00:04:45,917 INFO L78 Accepts]: Start accepts. Automaton has 14877 states and 45900 transitions. Word has length 53 [2019-12-27 00:04:45,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:04:45,917 INFO L462 AbstractCegarLoop]: Abstraction has 14877 states and 45900 transitions. [2019-12-27 00:04:45,917 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 00:04:45,917 INFO L276 IsEmpty]: Start isEmpty. Operand 14877 states and 45900 transitions. [2019-12-27 00:04:45,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-27 00:04:45,935 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:04:45,935 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 00:04:45,935 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 00:04:45,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:04:45,936 INFO L82 PathProgramCache]: Analyzing trace with hash 1901485579, now seen corresponding path program 4 times [2019-12-27 00:04:45,936 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:04:45,936 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1619406586] [2019-12-27 00:04:45,936 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:04:45,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:04:46,013 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 00:04:46,013 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1619406586] [2019-12-27 00:04:46,014 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:04:46,014 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 00:04:46,014 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [128753385] [2019-12-27 00:04:46,014 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 00:04:46,015 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:04:46,015 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 00:04:46,015 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-27 00:04:46,015 INFO L87 Difference]: Start difference. First operand 14877 states and 45900 transitions. Second operand 7 states. [2019-12-27 00:04:46,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:04:46,387 INFO L93 Difference]: Finished difference Result 29447 states and 90372 transitions. [2019-12-27 00:04:46,387 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-27 00:04:46,388 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 53 [2019-12-27 00:04:46,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:04:46,428 INFO L225 Difference]: With dead ends: 29447 [2019-12-27 00:04:46,428 INFO L226 Difference]: Without dead ends: 27476 [2019-12-27 00:04:46,429 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2019-12-27 00:04:46,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27476 states. [2019-12-27 00:04:46,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27476 to 14943. [2019-12-27 00:04:46,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14943 states. [2019-12-27 00:04:46,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14943 states to 14943 states and 46185 transitions. [2019-12-27 00:04:46,735 INFO L78 Accepts]: Start accepts. Automaton has 14943 states and 46185 transitions. Word has length 53 [2019-12-27 00:04:46,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:04:46,735 INFO L462 AbstractCegarLoop]: Abstraction has 14943 states and 46185 transitions. [2019-12-27 00:04:46,735 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 00:04:46,735 INFO L276 IsEmpty]: Start isEmpty. Operand 14943 states and 46185 transitions. [2019-12-27 00:04:46,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-27 00:04:46,752 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:04:46,753 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 00:04:46,753 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 00:04:46,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:04:46,753 INFO L82 PathProgramCache]: Analyzing trace with hash -9451933, now seen corresponding path program 1 times [2019-12-27 00:04:46,753 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:04:46,754 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [94001161] [2019-12-27 00:04:46,754 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:04:46,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:04:46,807 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 00:04:46,807 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [94001161] [2019-12-27 00:04:46,807 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:04:46,807 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 00:04:46,808 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1570491771] [2019-12-27 00:04:46,808 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 00:04:46,808 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:04:46,808 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 00:04:46,809 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 00:04:46,809 INFO L87 Difference]: Start difference. First operand 14943 states and 46185 transitions. Second operand 3 states. [2019-12-27 00:04:46,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:04:46,912 INFO L93 Difference]: Finished difference Result 20151 states and 62759 transitions. [2019-12-27 00:04:46,912 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 00:04:46,912 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 53 [2019-12-27 00:04:46,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:04:46,948 INFO L225 Difference]: With dead ends: 20151 [2019-12-27 00:04:46,948 INFO L226 Difference]: Without dead ends: 20151 [2019-12-27 00:04:46,949 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 00:04:47,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20151 states. [2019-12-27 00:04:47,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20151 to 16555. [2019-12-27 00:04:47,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16555 states. [2019-12-27 00:04:47,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16555 states to 16555 states and 52509 transitions. [2019-12-27 00:04:47,227 INFO L78 Accepts]: Start accepts. Automaton has 16555 states and 52509 transitions. Word has length 53 [2019-12-27 00:04:47,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:04:47,227 INFO L462 AbstractCegarLoop]: Abstraction has 16555 states and 52509 transitions. [2019-12-27 00:04:47,227 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 00:04:47,227 INFO L276 IsEmpty]: Start isEmpty. Operand 16555 states and 52509 transitions. [2019-12-27 00:04:47,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-27 00:04:47,252 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:04:47,252 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 00:04:47,253 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 00:04:47,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:04:47,253 INFO L82 PathProgramCache]: Analyzing trace with hash 2081547793, now seen corresponding path program 5 times [2019-12-27 00:04:47,253 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:04:47,253 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1598419869] [2019-12-27 00:04:47,254 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:04:47,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:04:47,346 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 00:04:47,347 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1598419869] [2019-12-27 00:04:47,347 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:04:47,347 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 00:04:47,347 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1304338776] [2019-12-27 00:04:47,348 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 00:04:47,348 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:04:47,348 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 00:04:47,348 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 00:04:47,348 INFO L87 Difference]: Start difference. First operand 16555 states and 52509 transitions. Second operand 6 states. [2019-12-27 00:04:48,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:04:48,012 INFO L93 Difference]: Finished difference Result 31129 states and 96493 transitions. [2019-12-27 00:04:48,012 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 00:04:48,012 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 53 [2019-12-27 00:04:48,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:04:48,061 INFO L225 Difference]: With dead ends: 31129 [2019-12-27 00:04:48,062 INFO L226 Difference]: Without dead ends: 31045 [2019-12-27 00:04:48,062 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-12-27 00:04:48,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31045 states. [2019-12-27 00:04:48,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31045 to 19566. [2019-12-27 00:04:48,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19566 states. [2019-12-27 00:04:48,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19566 states to 19566 states and 61294 transitions. [2019-12-27 00:04:48,437 INFO L78 Accepts]: Start accepts. Automaton has 19566 states and 61294 transitions. Word has length 53 [2019-12-27 00:04:48,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:04:48,438 INFO L462 AbstractCegarLoop]: Abstraction has 19566 states and 61294 transitions. [2019-12-27 00:04:48,438 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 00:04:48,438 INFO L276 IsEmpty]: Start isEmpty. Operand 19566 states and 61294 transitions. [2019-12-27 00:04:48,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-27 00:04:48,698 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:04:48,698 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 00:04:48,698 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 00:04:48,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:04:48,698 INFO L82 PathProgramCache]: Analyzing trace with hash -1629843107, now seen corresponding path program 6 times [2019-12-27 00:04:48,698 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:04:48,699 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [257888380] [2019-12-27 00:04:48,699 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:04:48,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:04:48,807 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 00:04:48,808 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [257888380] [2019-12-27 00:04:48,808 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:04:48,808 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 00:04:48,808 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1652449996] [2019-12-27 00:04:48,809 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 00:04:48,809 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:04:48,809 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 00:04:48,809 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-27 00:04:48,810 INFO L87 Difference]: Start difference. First operand 19566 states and 61294 transitions. Second operand 7 states. [2019-12-27 00:04:49,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:04:49,754 INFO L93 Difference]: Finished difference Result 31592 states and 95412 transitions. [2019-12-27 00:04:49,754 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-27 00:04:49,754 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 53 [2019-12-27 00:04:49,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:04:49,800 INFO L225 Difference]: With dead ends: 31592 [2019-12-27 00:04:49,800 INFO L226 Difference]: Without dead ends: 31470 [2019-12-27 00:04:49,801 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-27 00:04:49,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31470 states. [2019-12-27 00:04:50,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31470 to 25009. [2019-12-27 00:04:50,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25009 states. [2019-12-27 00:04:50,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25009 states to 25009 states and 77193 transitions. [2019-12-27 00:04:50,228 INFO L78 Accepts]: Start accepts. Automaton has 25009 states and 77193 transitions. Word has length 53 [2019-12-27 00:04:50,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:04:50,228 INFO L462 AbstractCegarLoop]: Abstraction has 25009 states and 77193 transitions. [2019-12-27 00:04:50,228 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 00:04:50,228 INFO L276 IsEmpty]: Start isEmpty. Operand 25009 states and 77193 transitions. [2019-12-27 00:04:50,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-27 00:04:50,254 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:04:50,254 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 00:04:50,255 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 00:04:50,255 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:04:50,255 INFO L82 PathProgramCache]: Analyzing trace with hash -1109995221, now seen corresponding path program 7 times [2019-12-27 00:04:50,255 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:04:50,255 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1236890539] [2019-12-27 00:04:50,255 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:04:50,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:04:50,384 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 00:04:50,385 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1236890539] [2019-12-27 00:04:50,385 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:04:50,385 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 00:04:50,385 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1241363611] [2019-12-27 00:04:50,386 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 00:04:50,386 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:04:50,386 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 00:04:50,386 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-12-27 00:04:50,386 INFO L87 Difference]: Start difference. First operand 25009 states and 77193 transitions. Second operand 9 states. [2019-12-27 00:04:52,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:04:52,144 INFO L93 Difference]: Finished difference Result 40635 states and 123380 transitions. [2019-12-27 00:04:52,144 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-12-27 00:04:52,144 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 53 [2019-12-27 00:04:52,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:04:52,206 INFO L225 Difference]: With dead ends: 40635 [2019-12-27 00:04:52,206 INFO L226 Difference]: Without dead ends: 40635 [2019-12-27 00:04:52,207 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 15 SyntacticMatches, 2 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 140 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=138, Invalid=512, Unknown=0, NotChecked=0, Total=650 [2019-12-27 00:04:52,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40635 states. [2019-12-27 00:04:52,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40635 to 23556. [2019-12-27 00:04:52,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23556 states. [2019-12-27 00:04:53,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23556 states to 23556 states and 73044 transitions. [2019-12-27 00:04:53,057 INFO L78 Accepts]: Start accepts. Automaton has 23556 states and 73044 transitions. Word has length 53 [2019-12-27 00:04:53,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:04:53,057 INFO L462 AbstractCegarLoop]: Abstraction has 23556 states and 73044 transitions. [2019-12-27 00:04:53,057 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 00:04:53,057 INFO L276 IsEmpty]: Start isEmpty. Operand 23556 states and 73044 transitions. [2019-12-27 00:04:53,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-27 00:04:53,082 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:04:53,083 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 00:04:53,083 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 00:04:53,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:04:53,083 INFO L82 PathProgramCache]: Analyzing trace with hash 2099294685, now seen corresponding path program 8 times [2019-12-27 00:04:53,083 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:04:53,083 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [933473859] [2019-12-27 00:04:53,083 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:04:53,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:04:53,145 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 00:04:53,145 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [933473859] [2019-12-27 00:04:53,146 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:04:53,146 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 00:04:53,146 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1228540318] [2019-12-27 00:04:53,146 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 00:04:53,146 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:04:53,147 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 00:04:53,147 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 00:04:53,147 INFO L87 Difference]: Start difference. First operand 23556 states and 73044 transitions. Second operand 3 states. [2019-12-27 00:04:53,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:04:53,240 INFO L93 Difference]: Finished difference Result 17418 states and 53184 transitions. [2019-12-27 00:04:53,240 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 00:04:53,241 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 53 [2019-12-27 00:04:53,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:04:53,282 INFO L225 Difference]: With dead ends: 17418 [2019-12-27 00:04:53,282 INFO L226 Difference]: Without dead ends: 17418 [2019-12-27 00:04:53,283 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 00:04:53,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17418 states. [2019-12-27 00:04:53,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17418 to 16845. [2019-12-27 00:04:53,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16845 states. [2019-12-27 00:04:53,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16845 states to 16845 states and 51304 transitions. [2019-12-27 00:04:53,747 INFO L78 Accepts]: Start accepts. Automaton has 16845 states and 51304 transitions. Word has length 53 [2019-12-27 00:04:53,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:04:53,747 INFO L462 AbstractCegarLoop]: Abstraction has 16845 states and 51304 transitions. [2019-12-27 00:04:53,747 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 00:04:53,747 INFO L276 IsEmpty]: Start isEmpty. Operand 16845 states and 51304 transitions. [2019-12-27 00:04:53,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-27 00:04:53,774 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:04:53,774 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] [2019-12-27 00:04:53,774 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 00:04:53,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:04:53,774 INFO L82 PathProgramCache]: Analyzing trace with hash -2130494140, now seen corresponding path program 1 times [2019-12-27 00:04:53,774 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:04:53,775 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1588455730] [2019-12-27 00:04:53,775 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:04:53,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:04:53,970 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 00:04:53,970 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1588455730] [2019-12-27 00:04:53,970 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:04:53,971 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 00:04:53,971 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1484107169] [2019-12-27 00:04:53,971 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 00:04:53,972 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:04:53,972 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 00:04:53,972 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-27 00:04:53,972 INFO L87 Difference]: Start difference. First operand 16845 states and 51304 transitions. Second operand 11 states. [2019-12-27 00:04:55,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:04:55,073 INFO L93 Difference]: Finished difference Result 34904 states and 106417 transitions. [2019-12-27 00:04:55,073 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-12-27 00:04:55,073 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 54 [2019-12-27 00:04:55,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:04:55,151 INFO L225 Difference]: With dead ends: 34904 [2019-12-27 00:04:55,151 INFO L226 Difference]: Without dead ends: 33854 [2019-12-27 00:04:55,152 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 216 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=190, Invalid=802, Unknown=0, NotChecked=0, Total=992 [2019-12-27 00:04:55,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33854 states. [2019-12-27 00:04:55,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33854 to 21618. [2019-12-27 00:04:55,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21618 states. [2019-12-27 00:04:55,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21618 states to 21618 states and 65921 transitions. [2019-12-27 00:04:55,584 INFO L78 Accepts]: Start accepts. Automaton has 21618 states and 65921 transitions. Word has length 54 [2019-12-27 00:04:55,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:04:55,584 INFO L462 AbstractCegarLoop]: Abstraction has 21618 states and 65921 transitions. [2019-12-27 00:04:55,584 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 00:04:55,585 INFO L276 IsEmpty]: Start isEmpty. Operand 21618 states and 65921 transitions. [2019-12-27 00:04:55,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-27 00:04:55,608 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:04:55,608 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] [2019-12-27 00:04:55,608 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 00:04:55,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:04:55,608 INFO L82 PathProgramCache]: Analyzing trace with hash 211798304, now seen corresponding path program 2 times [2019-12-27 00:04:55,608 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:04:55,608 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1173190771] [2019-12-27 00:04:55,609 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:04:55,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:04:55,775 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 00:04:55,775 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1173190771] [2019-12-27 00:04:55,775 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:04:55,775 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 00:04:55,776 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1721924607] [2019-12-27 00:04:55,776 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 00:04:55,776 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:04:55,776 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 00:04:55,777 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-27 00:04:55,777 INFO L87 Difference]: Start difference. First operand 21618 states and 65921 transitions. Second operand 11 states. [2019-12-27 00:04:56,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:04:56,769 INFO L93 Difference]: Finished difference Result 34597 states and 104764 transitions. [2019-12-27 00:04:56,769 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-27 00:04:56,770 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 54 [2019-12-27 00:04:56,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:04:56,808 INFO L225 Difference]: With dead ends: 34597 [2019-12-27 00:04:56,808 INFO L226 Difference]: Without dead ends: 25901 [2019-12-27 00:04:56,808 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=141, Invalid=509, Unknown=0, NotChecked=0, Total=650 [2019-12-27 00:04:56,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25901 states. [2019-12-27 00:04:57,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25901 to 16668. [2019-12-27 00:04:57,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16668 states. [2019-12-27 00:04:57,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16668 states to 16668 states and 50247 transitions. [2019-12-27 00:04:57,360 INFO L78 Accepts]: Start accepts. Automaton has 16668 states and 50247 transitions. Word has length 54 [2019-12-27 00:04:57,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:04:57,360 INFO L462 AbstractCegarLoop]: Abstraction has 16668 states and 50247 transitions. [2019-12-27 00:04:57,360 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 00:04:57,360 INFO L276 IsEmpty]: Start isEmpty. Operand 16668 states and 50247 transitions. [2019-12-27 00:04:57,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-27 00:04:57,378 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:04:57,378 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] [2019-12-27 00:04:57,378 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 00:04:57,378 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:04:57,378 INFO L82 PathProgramCache]: Analyzing trace with hash -1398179606, now seen corresponding path program 3 times [2019-12-27 00:04:57,379 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:04:57,379 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [87767608] [2019-12-27 00:04:57,379 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:04:57,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:04:57,543 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 00:04:57,544 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [87767608] [2019-12-27 00:04:57,544 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:04:57,544 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-27 00:04:57,544 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1413547035] [2019-12-27 00:04:57,545 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-27 00:04:57,545 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:04:57,545 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-27 00:04:57,545 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2019-12-27 00:04:57,545 INFO L87 Difference]: Start difference. First operand 16668 states and 50247 transitions. Second operand 12 states. [2019-12-27 00:04:58,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:04:58,536 INFO L93 Difference]: Finished difference Result 26440 states and 79178 transitions. [2019-12-27 00:04:58,537 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-27 00:04:58,537 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 54 [2019-12-27 00:04:58,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:04:58,573 INFO L225 Difference]: With dead ends: 26440 [2019-12-27 00:04:58,573 INFO L226 Difference]: Without dead ends: 25711 [2019-12-27 00:04:58,574 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=133, Invalid=569, Unknown=0, NotChecked=0, Total=702 [2019-12-27 00:04:58,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25711 states. [2019-12-27 00:04:58,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25711 to 16350. [2019-12-27 00:04:58,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16350 states. [2019-12-27 00:04:58,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16350 states to 16350 states and 49383 transitions. [2019-12-27 00:04:58,881 INFO L78 Accepts]: Start accepts. Automaton has 16350 states and 49383 transitions. Word has length 54 [2019-12-27 00:04:58,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:04:58,881 INFO L462 AbstractCegarLoop]: Abstraction has 16350 states and 49383 transitions. [2019-12-27 00:04:58,881 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-27 00:04:58,882 INFO L276 IsEmpty]: Start isEmpty. Operand 16350 states and 49383 transitions. [2019-12-27 00:04:58,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-27 00:04:58,898 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:04:58,898 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 00:04:58,898 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 00:04:58,899 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:04:58,899 INFO L82 PathProgramCache]: Analyzing trace with hash -139497916, now seen corresponding path program 4 times [2019-12-27 00:04:58,899 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:04:58,899 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1975215589] [2019-12-27 00:04:58,899 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:04:58,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:04:58,955 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 00:04:58,956 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1975215589] [2019-12-27 00:04:58,956 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:04:58,956 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 00:04:58,956 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [614385086] [2019-12-27 00:04:58,957 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 00:04:58,957 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:04:58,957 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 00:04:58,957 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 00:04:58,957 INFO L87 Difference]: Start difference. First operand 16350 states and 49383 transitions. Second operand 3 states. [2019-12-27 00:04:59,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:04:59,027 INFO L93 Difference]: Finished difference Result 16348 states and 49378 transitions. [2019-12-27 00:04:59,027 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 00:04:59,027 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 54 [2019-12-27 00:04:59,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:04:59,057 INFO L225 Difference]: With dead ends: 16348 [2019-12-27 00:04:59,057 INFO L226 Difference]: Without dead ends: 16348 [2019-12-27 00:04:59,057 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 00:04:59,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16348 states. [2019-12-27 00:04:59,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16348 to 14804. [2019-12-27 00:04:59,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14804 states. [2019-12-27 00:04:59,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14804 states to 14804 states and 45140 transitions. [2019-12-27 00:04:59,299 INFO L78 Accepts]: Start accepts. Automaton has 14804 states and 45140 transitions. Word has length 54 [2019-12-27 00:04:59,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:04:59,299 INFO L462 AbstractCegarLoop]: Abstraction has 14804 states and 45140 transitions. [2019-12-27 00:04:59,299 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 00:04:59,299 INFO L276 IsEmpty]: Start isEmpty. Operand 14804 states and 45140 transitions. [2019-12-27 00:04:59,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-27 00:04:59,316 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:04:59,316 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] [2019-12-27 00:04:59,316 INFO L410 AbstractCegarLoop]: === Iteration 24 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 00:04:59,317 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:04:59,317 INFO L82 PathProgramCache]: Analyzing trace with hash -1678920401, now seen corresponding path program 1 times [2019-12-27 00:04:59,317 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:04:59,317 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [568250892] [2019-12-27 00:04:59,317 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:04:59,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 00:04:59,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 00:04:59,431 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 00:04:59,432 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 00:04:59,435 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [810] [810] ULTIMATE.startENTRY-->L820: Formula: (let ((.cse0 (store |v_#valid_61| 0 0))) (and (= 0 v_~x$read_delayed_var~0.base_6) (= 0 v_~x$read_delayed_var~0.offset_6) (= (store |v_#length_24| |v_ULTIMATE.start_main_~#t2360~0.base_24| 4) |v_#length_23|) (= 0 v_~x$w_buff1_used~0_531) (= (store |v_#memory_int_24| |v_ULTIMATE.start_main_~#t2360~0.base_24| (store (select |v_#memory_int_24| |v_ULTIMATE.start_main_~#t2360~0.base_24|) |v_ULTIMATE.start_main_~#t2360~0.offset_18| 0)) |v_#memory_int_23|) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t2360~0.base_24|)) (< |v_#StackHeapBarrier_16| |v_ULTIMATE.start_main_~#t2360~0.base_24|) (= v_~x$r_buff0_thd1~0_337 0) (= |v_#NULL.offset_6| 0) (= 0 v_~x$w_buff1~0_304) (= 0 v_~x$r_buff1_thd3~0_123) (< 0 |v_#StackHeapBarrier_16|) (= v_~y~0_70 0) (= v_~x$mem_tmp~0_42 0) (= v_~z~0_50 0) (= 0 v_~x$r_buff0_thd2~0_165) (= v_~x$r_buff1_thd1~0_232 0) (= 0 v_~x$r_buff0_thd3~0_134) (= 0 v_~x$read_delayed~0_6) (= 0 |v_#NULL.base_6|) (= 0 v_~__unbuffered_p2_EAX~0_49) (= 0 v_~x$r_buff1_thd2~0_115) (= v_~x$r_buff0_thd0~0_141 0) (= v_~main$tmp_guard0~0_21 0) (= v_~__unbuffered_p2_EBX~0_49 0) (= 0 |v_ULTIMATE.start_main_~#t2360~0.offset_18|) (= |v_#valid_59| (store .cse0 |v_ULTIMATE.start_main_~#t2360~0.base_24| 1)) (= 0 v_~x~0_214) (= v_~__unbuffered_cnt~0_139 0) (= 0 v_~x$w_buff0~0_515) (= v_~weak$$choice2~0_149 0) (= v_~x$flush_delayed~0_77 0) (= 0 v_~weak$$choice0~0_34) (= 0 v_~__unbuffered_p0_EAX~0_48) (= v_~x$r_buff1_thd0~0_132 0) (= 0 v_~x$w_buff0_used~0_899) (= v_~main$tmp_guard1~0_40 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_16|, #valid=|v_#valid_61|, #memory_int=|v_#memory_int_24|, #length=|v_#length_24|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_515, ULTIMATE.start_main_~#t2362~0.offset=|v_ULTIMATE.start_main_~#t2362~0.offset_19|, ~x$flush_delayed~0=v_~x$flush_delayed~0_77, #NULL.offset=|v_#NULL.offset_6|, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_232, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_134, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_44|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_34|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_48, #length=|v_#length_23|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_49, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_141, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_49, ~x$w_buff1~0=v_~x$w_buff1~0_304, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_531, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_115, ~x$read_delayed_var~0.base=v_~x$read_delayed_var~0.base_6, ~weak$$choice0~0=v_~weak$$choice0~0_34, #StackHeapBarrier=|v_#StackHeapBarrier_16|, ULTIMATE.start_main_~#t2360~0.base=|v_ULTIMATE.start_main_~#t2360~0.base_24|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_139, ~x~0=v_~x~0_214, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_337, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_82|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_123, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_40, ~x$mem_tmp~0=v_~x$mem_tmp~0_42, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_68|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_38|, ~y~0=v_~y~0_70, ULTIMATE.start_main_~#t2361~0.base=|v_ULTIMATE.start_main_~#t2361~0.base_26|, ULTIMATE.start_main_~#t2361~0.offset=|v_ULTIMATE.start_main_~#t2361~0.offset_19|, ULTIMATE.start_main_#t~nondet40=|v_ULTIMATE.start_main_#t~nondet40_20|, ULTIMATE.start_main_~#t2362~0.base=|v_ULTIMATE.start_main_~#t2362~0.base_26|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_21, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_132, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_165, #NULL.base=|v_#NULL.base_6|, ULTIMATE.start_main_~#t2360~0.offset=|v_ULTIMATE.start_main_~#t2360~0.offset_18|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_899, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_60|, ~x$read_delayed_var~0.offset=v_~x$read_delayed_var~0.offset_6, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_25|, #valid=|v_#valid_59|, #memory_int=|v_#memory_int_23|, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_8|, ~z~0=v_~z~0_50, ~weak$$choice2~0=v_~weak$$choice2~0_149, ~x$read_delayed~0=v_~x$read_delayed~0_6} AuxVars[] AssignedVars[~x$w_buff0~0, ULTIMATE.start_main_~#t2362~0.offset, ~x$flush_delayed~0, #NULL.offset, ~x$r_buff1_thd1~0, ~x$r_buff0_thd3~0, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite45, ~__unbuffered_p0_EAX~0, #length, ~__unbuffered_p2_EAX~0, ~x$r_buff0_thd0~0, ~__unbuffered_p2_EBX~0, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd2~0, ~x$read_delayed_var~0.base, ~weak$$choice0~0, ULTIMATE.start_main_~#t2360~0.base, ULTIMATE.start_main_#t~nondet38, ~__unbuffered_cnt~0, ~x~0, ~x$r_buff0_thd1~0, ULTIMATE.start_main_#t~ite46, ~x$r_buff1_thd3~0, ~main$tmp_guard1~0, ~x$mem_tmp~0, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite44, ~y~0, ULTIMATE.start_main_~#t2361~0.base, ULTIMATE.start_main_~#t2361~0.offset, ULTIMATE.start_main_#t~nondet40, ULTIMATE.start_main_~#t2362~0.base, ~main$tmp_guard0~0, ~x$r_buff1_thd0~0, ~x$r_buff0_thd2~0, #NULL.base, ULTIMATE.start_main_~#t2360~0.offset, ~x$w_buff0_used~0, ULTIMATE.start_main_#t~ite41, ~x$read_delayed_var~0.offset, ULTIMATE.start_main_#res, #valid, #memory_int, ULTIMATE.start_main_#t~nondet39, ~z~0, ~weak$$choice2~0, ~x$read_delayed~0] because there is no mapped edge [2019-12-27 00:04:59,436 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [783] [783] L820-1-->L822: Formula: (and (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t2361~0.base_13| 4)) (= 0 |v_ULTIMATE.start_main_~#t2361~0.offset_11|) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t2361~0.base_13| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t2361~0.base_13|) |v_ULTIMATE.start_main_~#t2361~0.offset_11| 1)) |v_#memory_int_15|) (< |v_#StackHeapBarrier_10| |v_ULTIMATE.start_main_~#t2361~0.base_13|) (= 0 (select |v_#valid_37| |v_ULTIMATE.start_main_~#t2361~0.base_13|)) (not (= 0 |v_ULTIMATE.start_main_~#t2361~0.base_13|)) (= |v_#valid_36| (store |v_#valid_37| |v_ULTIMATE.start_main_~#t2361~0.base_13| 1))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_37|, #memory_int=|v_#memory_int_16|, #length=|v_#length_16|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_36|, #memory_int=|v_#memory_int_15|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_5|, #length=|v_#length_15|, ULTIMATE.start_main_~#t2361~0.base=|v_ULTIMATE.start_main_~#t2361~0.base_13|, ULTIMATE.start_main_~#t2361~0.offset=|v_ULTIMATE.start_main_~#t2361~0.offset_11|} AuxVars[] AssignedVars[#valid, #memory_int, ULTIMATE.start_main_#t~nondet38, #length, ULTIMATE.start_main_~#t2361~0.base, ULTIMATE.start_main_~#t2361~0.offset] because there is no mapped edge [2019-12-27 00:04:59,437 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [785] [785] L822-1-->L824: Formula: (and (= (store |v_#valid_39| |v_ULTIMATE.start_main_~#t2362~0.base_13| 1) |v_#valid_38|) (= (select |v_#valid_39| |v_ULTIMATE.start_main_~#t2362~0.base_13|) 0) (not (= |v_ULTIMATE.start_main_~#t2362~0.base_13| 0)) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t2362~0.base_13| 4)) (= 0 |v_ULTIMATE.start_main_~#t2362~0.offset_11|) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t2362~0.base_13| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t2362~0.base_13|) |v_ULTIMATE.start_main_~#t2362~0.offset_11| 2)) |v_#memory_int_17|) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t2362~0.base_13|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_39|, #memory_int=|v_#memory_int_18|, #length=|v_#length_18|} OutVars{ULTIMATE.start_main_~#t2362~0.offset=|v_ULTIMATE.start_main_~#t2362~0.offset_11|, #StackHeapBarrier=|v_#StackHeapBarrier_11|, ULTIMATE.start_main_~#t2362~0.base=|v_ULTIMATE.start_main_~#t2362~0.base_13|, #valid=|v_#valid_38|, #memory_int=|v_#memory_int_17|, #length=|v_#length_17|, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2362~0.offset, ULTIMATE.start_main_~#t2362~0.base, #valid, #memory_int, #length, ULTIMATE.start_main_#t~nondet39] because there is no mapped edge [2019-12-27 00:04:59,437 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [791] [791] P1ENTRY-->L5-3: Formula: (and (= P1Thread1of1ForFork0_~arg.base_Out-1372490426 |P1Thread1of1ForFork0_#in~arg.base_In-1372490426|) (= 0 (mod ~x$w_buff1_used~0_Out-1372490426 256)) (= ~x$w_buff0~0_In-1372490426 ~x$w_buff1~0_Out-1372490426) (= |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression_Out-1372490426| P1Thread1of1ForFork0___VERIFIER_assert_~expression_Out-1372490426) (= ~x$w_buff0_used~0_Out-1372490426 1) (= ~x$w_buff0~0_Out-1372490426 1) (= |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression_Out-1372490426| 1) (= ~x$w_buff1_used~0_Out-1372490426 ~x$w_buff0_used~0_In-1372490426) (= |P1Thread1of1ForFork0_#in~arg.offset_In-1372490426| P1Thread1of1ForFork0_~arg.offset_Out-1372490426)) InVars {~x$w_buff0~0=~x$w_buff0~0_In-1372490426, P1Thread1of1ForFork0_#in~arg.base=|P1Thread1of1ForFork0_#in~arg.base_In-1372490426|, P1Thread1of1ForFork0_#in~arg.offset=|P1Thread1of1ForFork0_#in~arg.offset_In-1372490426|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1372490426} OutVars{~x$w_buff0~0=~x$w_buff0~0_Out-1372490426, P1Thread1of1ForFork0___VERIFIER_assert_~expression=P1Thread1of1ForFork0___VERIFIER_assert_~expression_Out-1372490426, P1Thread1of1ForFork0_~arg.offset=P1Thread1of1ForFork0_~arg.offset_Out-1372490426, P1Thread1of1ForFork0_~arg.base=P1Thread1of1ForFork0_~arg.base_Out-1372490426, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression=|P1Thread1of1ForFork0___VERIFIER_assert_#in~expression_Out-1372490426|, P1Thread1of1ForFork0_#in~arg.base=|P1Thread1of1ForFork0_#in~arg.base_In-1372490426|, ~x$w_buff1~0=~x$w_buff1~0_Out-1372490426, P1Thread1of1ForFork0_#in~arg.offset=|P1Thread1of1ForFork0_#in~arg.offset_In-1372490426|, ~x$w_buff1_used~0=~x$w_buff1_used~0_Out-1372490426, ~x$w_buff0_used~0=~x$w_buff0_used~0_Out-1372490426} AuxVars[] AssignedVars[~x$w_buff0~0, P1Thread1of1ForFork0___VERIFIER_assert_~expression, P1Thread1of1ForFork0_~arg.offset, P1Thread1of1ForFork0_~arg.base, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$w_buff0_used~0] because there is no mapped edge [2019-12-27 00:04:59,441 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [741] [741] L797-2-->L797-4: Formula: (let ((.cse1 (= (mod ~x$r_buff1_thd3~0_In1527388511 256) 0)) (.cse0 (= (mod ~x$w_buff1_used~0_In1527388511 256) 0))) (or (and (not .cse0) (not .cse1) (= ~x$w_buff1~0_In1527388511 |P2Thread1of1ForFork1_#t~ite32_Out1527388511|)) (and (= ~x~0_In1527388511 |P2Thread1of1ForFork1_#t~ite32_Out1527388511|) (or .cse1 .cse0)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In1527388511, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1527388511, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In1527388511, ~x~0=~x~0_In1527388511} OutVars{P2Thread1of1ForFork1_#t~ite32=|P2Thread1of1ForFork1_#t~ite32_Out1527388511|, ~x$w_buff1~0=~x$w_buff1~0_In1527388511, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1527388511, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In1527388511, ~x~0=~x~0_In1527388511} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite32] because there is no mapped edge [2019-12-27 00:04:59,441 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [722] [722] L797-4-->L798: Formula: (= v_~x~0_64 |v_P2Thread1of1ForFork1_#t~ite32_22|) InVars {P2Thread1of1ForFork1_#t~ite32=|v_P2Thread1of1ForFork1_#t~ite32_22|} OutVars{P2Thread1of1ForFork1_#t~ite32=|v_P2Thread1of1ForFork1_#t~ite32_21|, P2Thread1of1ForFork1_#t~ite33=|v_P2Thread1of1ForFork1_#t~ite33_29|, ~x~0=v_~x~0_64} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite32, P2Thread1of1ForFork1_#t~ite33, ~x~0] because there is no mapped edge [2019-12-27 00:04:59,441 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [759] [759] L798-->L798-2: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff0_used~0_In-863019813 256))) (.cse0 (= (mod ~x$r_buff0_thd3~0_In-863019813 256) 0))) (or (and (= ~x$w_buff0_used~0_In-863019813 |P2Thread1of1ForFork1_#t~ite34_Out-863019813|) (or .cse0 .cse1)) (and (not .cse1) (not .cse0) (= |P2Thread1of1ForFork1_#t~ite34_Out-863019813| 0)))) InVars {~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-863019813, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-863019813} OutVars{P2Thread1of1ForFork1_#t~ite34=|P2Thread1of1ForFork1_#t~ite34_Out-863019813|, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-863019813, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-863019813} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite34] because there is no mapped edge [2019-12-27 00:04:59,444 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [743] [743] L778-->L778-2: Formula: (let ((.cse0 (= (mod ~x$w_buff0_used~0_In1092814395 256) 0)) (.cse1 (= 0 (mod ~x$r_buff0_thd2~0_In1092814395 256)))) (or (and (= |P1Thread1of1ForFork0_#t~ite28_Out1092814395| 0) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= |P1Thread1of1ForFork0_#t~ite28_Out1092814395| ~x$w_buff0_used~0_In1092814395)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1092814395, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1092814395} OutVars{~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1092814395, P1Thread1of1ForFork0_#t~ite28=|P1Thread1of1ForFork0_#t~ite28_Out1092814395|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1092814395} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite28] because there is no mapped edge [2019-12-27 00:04:59,445 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [757] [757] L779-->L779-2: Formula: (let ((.cse3 (= (mod ~x$w_buff0_used~0_In1334762387 256) 0)) (.cse2 (= (mod ~x$r_buff0_thd2~0_In1334762387 256) 0)) (.cse1 (= (mod ~x$w_buff1_used~0_In1334762387 256) 0)) (.cse0 (= 0 (mod ~x$r_buff1_thd2~0_In1334762387 256)))) (or (and (= |P1Thread1of1ForFork0_#t~ite29_Out1334762387| ~x$w_buff1_used~0_In1334762387) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0))) (= |P1Thread1of1ForFork0_#t~ite29_Out1334762387| 0)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In1334762387, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In1334762387, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1334762387, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1334762387} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In1334762387, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In1334762387, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1334762387, P1Thread1of1ForFork0_#t~ite29=|P1Thread1of1ForFork0_#t~ite29_Out1334762387|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1334762387} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite29] because there is no mapped edge [2019-12-27 00:04:59,446 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [745] [745] L780-->L781: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff0_thd2~0_In-690538032 256))) (.cse0 (= (mod ~x$w_buff0_used~0_In-690538032 256) 0))) (or (and (not .cse0) (= ~x$r_buff0_thd2~0_Out-690538032 0) (not .cse1)) (and (or .cse1 .cse0) (= ~x$r_buff0_thd2~0_In-690538032 ~x$r_buff0_thd2~0_Out-690538032)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-690538032, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-690538032} OutVars{P1Thread1of1ForFork0_#t~ite30=|P1Thread1of1ForFork0_#t~ite30_Out-690538032|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_Out-690538032, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-690538032} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite30, ~x$r_buff0_thd2~0] because there is no mapped edge [2019-12-27 00:04:59,446 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [746] [746] L781-->L781-2: Formula: (let ((.cse2 (= (mod ~x$w_buff0_used~0_In-884259670 256) 0)) (.cse3 (= 0 (mod ~x$r_buff0_thd2~0_In-884259670 256))) (.cse0 (= (mod ~x$r_buff1_thd2~0_In-884259670 256) 0)) (.cse1 (= 0 (mod ~x$w_buff1_used~0_In-884259670 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P1Thread1of1ForFork0_#t~ite31_Out-884259670| 0)) (and (= |P1Thread1of1ForFork0_#t~ite31_Out-884259670| ~x$r_buff1_thd2~0_In-884259670) (or .cse2 .cse3) (or .cse0 .cse1)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-884259670, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-884259670, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-884259670, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-884259670} OutVars{P1Thread1of1ForFork0_#t~ite31=|P1Thread1of1ForFork0_#t~ite31_Out-884259670|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-884259670, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-884259670, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-884259670, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-884259670} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite31] because there is no mapped edge [2019-12-27 00:04:59,446 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [764] [764] L781-2-->P1EXIT: Formula: (and (= v_~x$r_buff1_thd2~0_55 |v_P1Thread1of1ForFork0_#t~ite31_38|) (= 0 |v_P1Thread1of1ForFork0_#res.base_5|) (= 0 |v_P1Thread1of1ForFork0_#res.offset_5|) (= v_~__unbuffered_cnt~0_67 (+ v_~__unbuffered_cnt~0_68 1))) InVars {P1Thread1of1ForFork0_#t~ite31=|v_P1Thread1of1ForFork0_#t~ite31_38|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_68} OutVars{P1Thread1of1ForFork0_#t~ite31=|v_P1Thread1of1ForFork0_#t~ite31_37|, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_55, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_67, P1Thread1of1ForFork0_#res.offset=|v_P1Thread1of1ForFork0_#res.offset_5|, P1Thread1of1ForFork0_#res.base=|v_P1Thread1of1ForFork0_#res.base_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite31, ~x$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork0_#res.offset, P1Thread1of1ForFork0_#res.base] because there is no mapped edge [2019-12-27 00:04:59,448 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [790] [790] L743-->L743-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In-206117564 256) 0))) (or (and (= |P0Thread1of1ForFork2_#t~ite11_Out-206117564| |P0Thread1of1ForFork2_#t~ite12_Out-206117564|) (= |P0Thread1of1ForFork2_#t~ite11_Out-206117564| ~x$w_buff1~0_In-206117564) .cse0 (let ((.cse1 (= 0 (mod ~x$r_buff0_thd1~0_In-206117564 256)))) (or (and .cse1 (= 0 (mod ~x$r_buff1_thd1~0_In-206117564 256))) (= (mod ~x$w_buff0_used~0_In-206117564 256) 0) (and .cse1 (= (mod ~x$w_buff1_used~0_In-206117564 256) 0))))) (and (not .cse0) (= |P0Thread1of1ForFork2_#t~ite11_In-206117564| |P0Thread1of1ForFork2_#t~ite11_Out-206117564|) (= |P0Thread1of1ForFork2_#t~ite12_Out-206117564| ~x$w_buff1~0_In-206117564)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-206117564, ~x$w_buff1~0=~x$w_buff1~0_In-206117564, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-206117564, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-206117564, ~weak$$choice2~0=~weak$$choice2~0_In-206117564, P0Thread1of1ForFork2_#t~ite11=|P0Thread1of1ForFork2_#t~ite11_In-206117564|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-206117564} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-206117564, ~x$w_buff1~0=~x$w_buff1~0_In-206117564, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-206117564, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-206117564, ~weak$$choice2~0=~weak$$choice2~0_In-206117564, P0Thread1of1ForFork2_#t~ite12=|P0Thread1of1ForFork2_#t~ite12_Out-206117564|, P0Thread1of1ForFork2_#t~ite11=|P0Thread1of1ForFork2_#t~ite11_Out-206117564|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-206117564} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite12, P0Thread1of1ForFork2_#t~ite11] because there is no mapped edge [2019-12-27 00:04:59,449 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [792] [792] L744-->L744-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-1992089948 256)))) (or (and (= ~x$w_buff0_used~0_In-1992089948 |P0Thread1of1ForFork2_#t~ite15_Out-1992089948|) (= |P0Thread1of1ForFork2_#t~ite14_In-1992089948| |P0Thread1of1ForFork2_#t~ite14_Out-1992089948|) (not .cse0)) (and (= ~x$w_buff0_used~0_In-1992089948 |P0Thread1of1ForFork2_#t~ite14_Out-1992089948|) (let ((.cse1 (= (mod ~x$r_buff0_thd1~0_In-1992089948 256) 0))) (or (and (= 0 (mod ~x$w_buff1_used~0_In-1992089948 256)) .cse1) (= (mod ~x$w_buff0_used~0_In-1992089948 256) 0) (and (= (mod ~x$r_buff1_thd1~0_In-1992089948 256) 0) .cse1))) .cse0 (= |P0Thread1of1ForFork2_#t~ite15_Out-1992089948| |P0Thread1of1ForFork2_#t~ite14_Out-1992089948|)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1992089948, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1992089948, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-1992089948, P0Thread1of1ForFork2_#t~ite14=|P0Thread1of1ForFork2_#t~ite14_In-1992089948|, ~weak$$choice2~0=~weak$$choice2~0_In-1992089948, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1992089948} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1992089948, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1992089948, P0Thread1of1ForFork2_#t~ite15=|P0Thread1of1ForFork2_#t~ite15_Out-1992089948|, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-1992089948, P0Thread1of1ForFork2_#t~ite14=|P0Thread1of1ForFork2_#t~ite14_Out-1992089948|, ~weak$$choice2~0=~weak$$choice2~0_In-1992089948, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1992089948} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite15, P0Thread1of1ForFork2_#t~ite14] because there is no mapped edge [2019-12-27 00:04:59,450 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [789] [789] L745-->L745-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In1078342637 256) 0))) (or (and .cse0 (= |P0Thread1of1ForFork2_#t~ite17_Out1078342637| |P0Thread1of1ForFork2_#t~ite18_Out1078342637|) (let ((.cse1 (= 0 (mod ~x$r_buff0_thd1~0_In1078342637 256)))) (or (and (= 0 (mod ~x$r_buff1_thd1~0_In1078342637 256)) .cse1) (= (mod ~x$w_buff0_used~0_In1078342637 256) 0) (and (= (mod ~x$w_buff1_used~0_In1078342637 256) 0) .cse1))) (= |P0Thread1of1ForFork2_#t~ite17_Out1078342637| ~x$w_buff1_used~0_In1078342637)) (and (= |P0Thread1of1ForFork2_#t~ite18_Out1078342637| ~x$w_buff1_used~0_In1078342637) (= |P0Thread1of1ForFork2_#t~ite17_In1078342637| |P0Thread1of1ForFork2_#t~ite17_Out1078342637|) (not .cse0)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1078342637, P0Thread1of1ForFork2_#t~ite17=|P0Thread1of1ForFork2_#t~ite17_In1078342637|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1078342637, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In1078342637, ~weak$$choice2~0=~weak$$choice2~0_In1078342637, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1078342637} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1078342637, P0Thread1of1ForFork2_#t~ite18=|P0Thread1of1ForFork2_#t~ite18_Out1078342637|, P0Thread1of1ForFork2_#t~ite17=|P0Thread1of1ForFork2_#t~ite17_Out1078342637|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1078342637, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In1078342637, ~weak$$choice2~0=~weak$$choice2~0_In1078342637, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1078342637} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite18, P0Thread1of1ForFork2_#t~ite17] because there is no mapped edge [2019-12-27 00:04:59,451 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [804] [804] L746-->L747-8: Formula: (and (= |v_P0Thread1of1ForFork2_#t~ite23_39| |v_P0Thread1of1ForFork2_#t~ite23_40|) (= v_~x$r_buff1_thd1~0_214 |v_P0Thread1of1ForFork2_#t~ite24_35|) (= v_~x$r_buff0_thd1~0_321 v_~x$r_buff0_thd1~0_320) (not (= 0 (mod v_~weak$$choice2~0_142 256))) (= |v_P0Thread1of1ForFork2_#t~ite22_36| |v_P0Thread1of1ForFork2_#t~ite22_35|)) InVars {~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_321, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_214, ~weak$$choice2~0=v_~weak$$choice2~0_142, P0Thread1of1ForFork2_#t~ite23=|v_P0Thread1of1ForFork2_#t~ite23_40|, P0Thread1of1ForFork2_#t~ite22=|v_P0Thread1of1ForFork2_#t~ite22_36|} OutVars{P0Thread1of1ForFork2_#t~ite20=|v_P0Thread1of1ForFork2_#t~ite20_31|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_320, P0Thread1of1ForFork2_#t~ite19=|v_P0Thread1of1ForFork2_#t~ite19_27|, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_214, P0Thread1of1ForFork2_#t~ite24=|v_P0Thread1of1ForFork2_#t~ite24_35|, ~weak$$choice2~0=v_~weak$$choice2~0_142, P0Thread1of1ForFork2_#t~ite23=|v_P0Thread1of1ForFork2_#t~ite23_39|, P0Thread1of1ForFork2_#t~ite22=|v_P0Thread1of1ForFork2_#t~ite22_35|, P0Thread1of1ForFork2_#t~ite21=|v_P0Thread1of1ForFork2_#t~ite21_15|} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite20, ~x$r_buff0_thd1~0, P0Thread1of1ForFork2_#t~ite19, P0Thread1of1ForFork2_#t~ite24, P0Thread1of1ForFork2_#t~ite23, P0Thread1of1ForFork2_#t~ite22, P0Thread1of1ForFork2_#t~ite21] because there is no mapped edge [2019-12-27 00:04:59,452 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [721] [721] L749-->L757: Formula: (and (= v_~x~0_54 v_~x$mem_tmp~0_11) (not (= 0 (mod v_~x$flush_delayed~0_20 256))) (= (+ v_~__unbuffered_cnt~0_42 1) v_~__unbuffered_cnt~0_41) (= v_~x$flush_delayed~0_19 0)) InVars {~x$flush_delayed~0=v_~x$flush_delayed~0_20, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_42, ~x$mem_tmp~0=v_~x$mem_tmp~0_11} OutVars{P0Thread1of1ForFork2_#t~ite25=|v_P0Thread1of1ForFork2_#t~ite25_19|, ~x$flush_delayed~0=v_~x$flush_delayed~0_19, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_41, ~x$mem_tmp~0=v_~x$mem_tmp~0_11, ~x~0=v_~x~0_54} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite25, ~x$flush_delayed~0, ~__unbuffered_cnt~0, ~x~0] because there is no mapped edge [2019-12-27 00:04:59,453 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [751] [751] L799-->L799-2: Formula: (let ((.cse3 (= (mod ~x$r_buff0_thd3~0_In1051126137 256) 0)) (.cse2 (= (mod ~x$w_buff0_used~0_In1051126137 256) 0)) (.cse1 (= 0 (mod ~x$r_buff1_thd3~0_In1051126137 256))) (.cse0 (= 0 (mod ~x$w_buff1_used~0_In1051126137 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P2Thread1of1ForFork1_#t~ite35_Out1051126137| ~x$w_buff1_used~0_In1051126137)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0))) (= |P2Thread1of1ForFork1_#t~ite35_Out1051126137| 0)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In1051126137, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In1051126137, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In1051126137, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1051126137} OutVars{P2Thread1of1ForFork1_#t~ite35=|P2Thread1of1ForFork1_#t~ite35_Out1051126137|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1051126137, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In1051126137, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In1051126137, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1051126137} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite35] because there is no mapped edge [2019-12-27 00:04:59,454 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [747] [747] L800-->L800-2: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff0_used~0_In-316102328 256))) (.cse0 (= 0 (mod ~x$r_buff0_thd3~0_In-316102328 256)))) (or (and (or .cse0 .cse1) (= ~x$r_buff0_thd3~0_In-316102328 |P2Thread1of1ForFork1_#t~ite36_Out-316102328|)) (and (= 0 |P2Thread1of1ForFork1_#t~ite36_Out-316102328|) (not .cse1) (not .cse0)))) InVars {~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-316102328, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-316102328} OutVars{P2Thread1of1ForFork1_#t~ite36=|P2Thread1of1ForFork1_#t~ite36_Out-316102328|, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-316102328, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-316102328} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite36] because there is no mapped edge [2019-12-27 00:04:59,455 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [749] [749] L801-->L801-2: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff0_thd3~0_In1962883890 256))) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In1962883890 256))) (.cse2 (= 0 (mod ~x$r_buff1_thd3~0_In1962883890 256))) (.cse3 (= 0 (mod ~x$w_buff1_used~0_In1962883890 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P2Thread1of1ForFork1_#t~ite37_Out1962883890| ~x$r_buff1_thd3~0_In1962883890)) (and (= 0 |P2Thread1of1ForFork1_#t~ite37_Out1962883890|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In1962883890, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In1962883890, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In1962883890, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1962883890} OutVars{P2Thread1of1ForFork1_#t~ite37=|P2Thread1of1ForFork1_#t~ite37_Out1962883890|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1962883890, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In1962883890, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In1962883890, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1962883890} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-27 00:04:59,455 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [782] [782] L801-2-->P2EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_85 1) v_~__unbuffered_cnt~0_84) (= 0 |v_P2Thread1of1ForFork1_#res.offset_5|) (= v_~x$r_buff1_thd3~0_72 |v_P2Thread1of1ForFork1_#t~ite37_40|) (= 0 |v_P2Thread1of1ForFork1_#res.base_5|)) InVars {P2Thread1of1ForFork1_#t~ite37=|v_P2Thread1of1ForFork1_#t~ite37_40|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_85} OutVars{P2Thread1of1ForFork1_#t~ite37=|v_P2Thread1of1ForFork1_#t~ite37_39|, P2Thread1of1ForFork1_#res.base=|v_P2Thread1of1ForFork1_#res.base_5|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_72, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_84, P2Thread1of1ForFork1_#res.offset=|v_P2Thread1of1ForFork1_#res.offset_5|} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite37, P2Thread1of1ForFork1_#res.base, ~x$r_buff1_thd3~0, ~__unbuffered_cnt~0, P2Thread1of1ForFork1_#res.offset] because there is no mapped edge [2019-12-27 00:04:59,455 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [716] [716] L824-1-->L830: Formula: (and (= 3 v_~__unbuffered_cnt~0_39) (= v_~main$tmp_guard0~0_8 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_39} OutVars{ULTIMATE.start_main_#t~nondet40=|v_ULTIMATE.start_main_#t~nondet40_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_39, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet40, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-27 00:04:59,456 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [748] [748] L830-2-->L830-4: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff1_thd0~0_In483577880 256))) (.cse0 (= (mod ~x$w_buff1_used~0_In483577880 256) 0))) (or (and (= ~x~0_In483577880 |ULTIMATE.start_main_#t~ite41_Out483577880|) (or .cse0 .cse1)) (and (not .cse1) (= |ULTIMATE.start_main_#t~ite41_Out483577880| ~x$w_buff1~0_In483577880) (not .cse0)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In483577880, ~x$w_buff1_used~0=~x$w_buff1_used~0_In483577880, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In483577880, ~x~0=~x~0_In483577880} OutVars{ULTIMATE.start_main_#t~ite41=|ULTIMATE.start_main_#t~ite41_Out483577880|, ~x$w_buff1~0=~x$w_buff1~0_In483577880, ~x$w_buff1_used~0=~x$w_buff1_used~0_In483577880, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In483577880, ~x~0=~x~0_In483577880} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41] because there is no mapped edge [2019-12-27 00:04:59,456 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [677] [677] L830-4-->L831: Formula: (= v_~x~0_17 |v_ULTIMATE.start_main_#t~ite41_10|) InVars {ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_10|} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_9|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_13|, ~x~0=v_~x~0_17} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite42, ~x~0] because there is no mapped edge [2019-12-27 00:04:59,456 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [738] [738] L831-->L831-2: Formula: (let ((.cse0 (= (mod ~x$w_buff0_used~0_In-1442024327 256) 0)) (.cse1 (= 0 (mod ~x$r_buff0_thd0~0_In-1442024327 256)))) (or (and (= |ULTIMATE.start_main_#t~ite43_Out-1442024327| 0) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= ~x$w_buff0_used~0_In-1442024327 |ULTIMATE.start_main_#t~ite43_Out-1442024327|)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1442024327, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1442024327} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1442024327, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out-1442024327|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1442024327} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43] because there is no mapped edge [2019-12-27 00:04:59,457 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [744] [744] L832-->L832-2: Formula: (let ((.cse2 (= 0 (mod ~x$w_buff0_used~0_In-1287647499 256))) (.cse3 (= (mod ~x$r_buff0_thd0~0_In-1287647499 256) 0)) (.cse0 (= 0 (mod ~x$r_buff1_thd0~0_In-1287647499 256))) (.cse1 (= 0 (mod ~x$w_buff1_used~0_In-1287647499 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite44_Out-1287647499|)) (and (= ~x$w_buff1_used~0_In-1287647499 |ULTIMATE.start_main_#t~ite44_Out-1287647499|) (or .cse2 .cse3) (or .cse0 .cse1)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1287647499, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1287647499, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1287647499, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1287647499} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1287647499, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1287647499, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1287647499, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out-1287647499|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1287647499} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-27 00:04:59,458 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [740] [740] L833-->L833-2: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff0_used~0_In465711172 256))) (.cse0 (= (mod ~x$r_buff0_thd0~0_In465711172 256) 0))) (or (and (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite45_Out465711172|) (not .cse1)) (and (or .cse1 .cse0) (= ~x$r_buff0_thd0~0_In465711172 |ULTIMATE.start_main_#t~ite45_Out465711172|)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In465711172, ~x$w_buff0_used~0=~x$w_buff0_used~0_In465711172} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In465711172, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out465711172|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In465711172} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-12-27 00:04:59,459 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [742] [742] L834-->L834-2: Formula: (let ((.cse2 (= 0 (mod ~x$w_buff1_used~0_In-1537155013 256))) (.cse3 (= 0 (mod ~x$r_buff1_thd0~0_In-1537155013 256))) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In-1537155013 256))) (.cse1 (= 0 (mod ~x$r_buff0_thd0~0_In-1537155013 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite46_Out-1537155013| 0)) (and (or .cse2 .cse3) (= |ULTIMATE.start_main_#t~ite46_Out-1537155013| ~x$r_buff1_thd0~0_In-1537155013) (or .cse0 .cse1)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1537155013, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1537155013, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1537155013, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1537155013} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1537155013, ULTIMATE.start_main_#t~ite46=|ULTIMATE.start_main_#t~ite46_Out-1537155013|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1537155013, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1537155013, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1537155013} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite46] because there is no mapped edge [2019-12-27 00:04:59,459 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [797] [797] L834-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= 1 v_~__unbuffered_p2_EAX~0_20) (= v_ULTIMATE.start___VERIFIER_assert_~expression_16 0) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_13| (mod v_~main$tmp_guard1~0_16 256)) (= v_~main$tmp_guard1~0_16 0) (= 0 v_~__unbuffered_p0_EAX~0_21) (= v_~__unbuffered_p2_EBX~0_20 0) (= v_~x$r_buff1_thd0~0_80 |v_ULTIMATE.start_main_#t~ite46_35|)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_21, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_20, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_35|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_20} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_21, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_16, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_20, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_34|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_16, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_20, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_80, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_13|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ULTIMATE.start_main_#t~ite46, ~main$tmp_guard1~0, ~x$r_buff1_thd0~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-27 00:04:59,558 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 12:04:59 BasicIcfg [2019-12-27 00:04:59,558 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 00:04:59,563 INFO L168 Benchmark]: Toolchain (without parser) took 78202.67 ms. Allocated memory was 136.8 MB in the beginning and 2.5 GB in the end (delta: 2.3 GB). Free memory was 99.4 MB in the beginning and 1.2 GB in the end (delta: -1.1 GB). Peak memory consumption was 1.2 GB. Max. memory is 7.1 GB. [2019-12-27 00:04:59,563 INFO L168 Benchmark]: CDTParser took 0.48 ms. Allocated memory is still 136.8 MB. Free memory is still 119.8 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-12-27 00:04:59,564 INFO L168 Benchmark]: CACSL2BoogieTranslator took 778.00 ms. Allocated memory was 136.8 MB in the beginning and 200.8 MB in the end (delta: 64.0 MB). Free memory was 98.9 MB in the beginning and 154.3 MB in the end (delta: -55.4 MB). Peak memory consumption was 25.7 MB. Max. memory is 7.1 GB. [2019-12-27 00:04:59,564 INFO L168 Benchmark]: Boogie Procedure Inliner took 63.59 ms. Allocated memory is still 200.8 MB. Free memory was 154.3 MB in the beginning and 151.6 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-27 00:04:59,565 INFO L168 Benchmark]: Boogie Preprocessor took 38.36 ms. Allocated memory is still 200.8 MB. Free memory was 151.6 MB in the beginning and 149.6 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2019-12-27 00:04:59,565 INFO L168 Benchmark]: RCFGBuilder took 789.49 ms. Allocated memory is still 200.8 MB. Free memory was 149.6 MB in the beginning and 102.7 MB in the end (delta: 47.0 MB). Peak memory consumption was 47.0 MB. Max. memory is 7.1 GB. [2019-12-27 00:04:59,566 INFO L168 Benchmark]: TraceAbstraction took 76527.13 ms. Allocated memory was 200.8 MB in the beginning and 2.5 GB in the end (delta: 2.3 GB). Free memory was 102.7 MB in the beginning and 1.2 GB in the end (delta: -1.1 GB). Peak memory consumption was 1.2 GB. Max. memory is 7.1 GB. [2019-12-27 00:04:59,572 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.48 ms. Allocated memory is still 136.8 MB. Free memory is still 119.8 MB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 778.00 ms. Allocated memory was 136.8 MB in the beginning and 200.8 MB in the end (delta: 64.0 MB). Free memory was 98.9 MB in the beginning and 154.3 MB in the end (delta: -55.4 MB). Peak memory consumption was 25.7 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 63.59 ms. Allocated memory is still 200.8 MB. Free memory was 154.3 MB in the beginning and 151.6 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 38.36 ms. Allocated memory is still 200.8 MB. Free memory was 151.6 MB in the beginning and 149.6 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 789.49 ms. Allocated memory is still 200.8 MB. Free memory was 149.6 MB in the beginning and 102.7 MB in the end (delta: 47.0 MB). Peak memory consumption was 47.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 76527.13 ms. Allocated memory was 200.8 MB in the beginning and 2.5 GB in the end (delta: 2.3 GB). Free memory was 102.7 MB in the beginning and 1.2 GB in the end (delta: -1.1 GB). Peak memory consumption was 1.2 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 5.8s, 164 ProgramPointsBefore, 83 ProgramPointsAfterwards, 195 TransitionsBefore, 89 TransitionsAfterwards, 16696 CoEnabledTransitionPairs, 7 FixpointIterations, 33 TrivialSequentialCompositions, 49 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 27 ConcurrentYvCompositions, 29 ChoiceCompositions, 6837 VarBasedMoverChecksPositive, 237 VarBasedMoverChecksNegative, 60 SemBasedMoverChecksPositive, 262 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 2.0s, 0 MoverChecksTotal, 66430 CheckedPairsTotal, 109 TotalNumberOfCompositions - CounterExampleResult [Line: 5]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L820] FCALL, FORK 0 pthread_create(&t2360, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L822] FCALL, FORK 0 pthread_create(&t2361, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L767] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L768] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L769] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L770] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L771] 2 x$r_buff0_thd2 = (_Bool)1 [L774] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L777] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L824] FCALL, FORK 0 pthread_create(&t2362, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L791] 3 __unbuffered_p2_EAX = y [L794] 3 __unbuffered_p2_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=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=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L797] 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=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=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L732] 1 z = 1 [L737] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L738] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L739] 1 x$flush_delayed = weak$$choice2 [L740] 1 x$mem_tmp = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L741] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) VAL [!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L777] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L778] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L779] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L741] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L742] EXPR 1 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0))=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L742] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L743] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L744] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L745] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L747] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L748] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L798] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L799] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L800] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L830] 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) VAL [\result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L831] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L832] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L833] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 155 locations, 2 error locations. Result: UNSAFE, OverallTime: 76.2s, OverallIterations: 24, TraceHistogramMax: 1, AutomataDifference: 20.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 4909 SDtfs, 6115 SDslu, 16221 SDs, 0 SdLazy, 7719 SolverSat, 290 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 7.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 286 GetRequests, 46 SyntacticMatches, 15 SemanticMatches, 225 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 765 ImplicationChecksByTransitivity, 2.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=115962occurred 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: 33.9s AutomataMinimizationTime, 23 MinimizatonAttempts, 195753 StatesRemovedByMinimization, 20 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.1s InterpolantComputationTime, 945 NumberOfCodeBlocks, 945 NumberOfCodeBlocksAsserted, 24 NumberOfCheckSat, 867 ConstructedInterpolants, 0 QuantifiedInterpolants, 159287 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 23 InterpolantComputations, 23 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...