/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe-MCR.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix016_rmo.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 16:02:50,929 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 16:02:50,932 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 16:02:50,949 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 16:02:50,950 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 16:02:50,952 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 16:02:50,954 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 16:02:50,963 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 16:02:50,967 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 16:02:50,969 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 16:02:50,971 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 16:02:50,973 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 16:02:50,973 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 16:02:50,975 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 16:02:50,977 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 16:02:50,979 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 16:02:50,980 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 16:02:50,981 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 16:02:50,982 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 16:02:50,987 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 16:02:50,991 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 16:02:50,995 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 16:02:50,996 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 16:02:50,997 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 16:02:50,999 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 16:02:50,999 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 16:02:50,999 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 16:02:51,001 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 16:02:51,002 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 16:02:51,003 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 16:02:51,003 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 16:02:51,005 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 16:02:51,005 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 16:02:51,006 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 16:02:51,008 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 16:02:51,008 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 16:02:51,008 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 16:02:51,009 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 16:02:51,009 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 16:02:51,010 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 16:02:51,011 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 16:02:51,012 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe-MCR.epf [2019-12-27 16:02:51,040 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 16:02:51,040 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 16:02:51,041 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 16:02:51,041 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 16:02:51,041 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 16:02:51,042 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 16:02:51,042 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 16:02:51,042 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 16:02:51,042 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 16:02:51,042 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 16:02:51,043 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 16:02:51,043 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 16:02:51,043 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 16:02:51,043 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 16:02:51,043 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 16:02:51,044 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 16:02:51,044 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 16:02:51,044 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 16:02:51,044 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 16:02:51,044 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 16:02:51,045 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 16:02:51,045 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 16:02:51,045 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 16:02:51,045 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 16:02:51,045 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 16:02:51,046 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 16:02:51,046 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 16:02:51,046 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2019-12-27 16:02:51,046 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 16:02:51,046 INFO L138 SettingsManager]: * Interpolant automaton=MCR [2019-12-27 16:02:51,046 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 16:02:51,326 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 16:02:51,339 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 16:02:51,344 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 16:02:51,346 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 16:02:51,346 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 16:02:51,347 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix016_rmo.oepc.i [2019-12-27 16:02:51,416 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b453cd202/9d44d7e446544be2a57ee459c6bfed37/FLAG1dd3c5d75 [2019-12-27 16:02:51,976 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 16:02:51,976 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix016_rmo.oepc.i [2019-12-27 16:02:52,004 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b453cd202/9d44d7e446544be2a57ee459c6bfed37/FLAG1dd3c5d75 [2019-12-27 16:02:52,313 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b453cd202/9d44d7e446544be2a57ee459c6bfed37 [2019-12-27 16:02:52,324 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 16:02:52,326 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 16:02:52,327 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 16:02:52,327 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 16:02:52,331 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 16:02:52,332 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 04:02:52" (1/1) ... [2019-12-27 16:02:52,334 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6d0b60a2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:02:52, skipping insertion in model container [2019-12-27 16:02:52,335 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 04:02:52" (1/1) ... [2019-12-27 16:02:52,342 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 16:02:52,412 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 16:02:52,916 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 16:02:52,931 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 16:02:53,024 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 16:02:53,098 INFO L208 MainTranslator]: Completed translation [2019-12-27 16:02:53,099 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:02:53 WrapperNode [2019-12-27 16:02:53,099 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 16:02:53,100 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 16:02:53,100 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 16:02:53,100 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 16:02:53,109 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:02:53" (1/1) ... [2019-12-27 16:02:53,140 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:02:53" (1/1) ... [2019-12-27 16:02:53,171 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 16:02:53,172 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 16:02:53,172 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 16:02:53,172 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 16:02:53,182 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:02:53" (1/1) ... [2019-12-27 16:02:53,182 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:02:53" (1/1) ... [2019-12-27 16:02:53,187 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:02:53" (1/1) ... [2019-12-27 16:02:53,187 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:02:53" (1/1) ... [2019-12-27 16:02:53,203 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:02:53" (1/1) ... [2019-12-27 16:02:53,208 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:02:53" (1/1) ... [2019-12-27 16:02:53,212 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:02:53" (1/1) ... [2019-12-27 16:02:53,217 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 16:02:53,217 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 16:02:53,218 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 16:02:53,218 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 16:02:53,219 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:02:53" (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 16:02:53,287 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 16:02:53,287 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 16:02:53,287 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 16:02:53,287 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 16:02:53,288 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 16:02:53,288 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 16:02:53,288 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 16:02:53,288 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 16:02:53,288 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-27 16:02:53,288 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-27 16:02:53,289 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 16:02:53,289 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 16:02:53,289 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 16:02:53,293 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 16:02:54,067 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 16:02:54,067 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 16:02:54,068 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 04:02:54 BoogieIcfgContainer [2019-12-27 16:02:54,069 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 16:02:54,070 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 16:02:54,070 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 16:02:54,073 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 16:02:54,074 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 04:02:52" (1/3) ... [2019-12-27 16:02:54,075 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@202bdebc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 04:02:54, skipping insertion in model container [2019-12-27 16:02:54,075 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:02:53" (2/3) ... [2019-12-27 16:02:54,075 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@202bdebc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 04:02:54, skipping insertion in model container [2019-12-27 16:02:54,075 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 04:02:54" (3/3) ... [2019-12-27 16:02:54,079 INFO L109 eAbstractionObserver]: Analyzing ICFG mix016_rmo.oepc.i [2019-12-27 16:02:54,089 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 16:02:54,090 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 16:02:54,097 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 16:02:54,098 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 16:02:54,137 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:54,137 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:54,138 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:54,138 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:54,138 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:54,138 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:54,139 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:54,139 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:54,139 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:54,139 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:54,140 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:54,140 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:54,140 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:54,141 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:54,141 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:54,141 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:54,141 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:54,142 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:54,142 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:54,142 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:54,142 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:54,143 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:54,143 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:54,143 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:54,144 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:54,144 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:54,144 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:54,144 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:54,145 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:54,145 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:54,145 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:54,145 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:54,146 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:54,146 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:54,146 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:54,147 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:54,147 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:54,147 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:54,147 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:54,148 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:54,148 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:54,148 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:54,148 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:54,149 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:54,149 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:54,149 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:54,149 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:54,150 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:54,150 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:54,150 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:54,150 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:54,151 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:54,151 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:54,151 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:54,151 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:54,152 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:54,152 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:54,152 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:54,152 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:54,153 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:54,153 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:54,153 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:54,153 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:54,154 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:54,155 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:54,155 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:54,155 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:54,155 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:54,156 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:54,156 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:54,156 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:54,156 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:54,157 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:54,157 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:54,157 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:54,157 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:54,158 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:54,158 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:54,158 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:54,158 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:54,159 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:54,159 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:54,159 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:54,159 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:54,160 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:54,160 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:54,160 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:54,160 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:54,161 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:54,161 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:54,161 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:54,161 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:54,162 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:54,162 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:54,162 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:54,162 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:54,163 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:54,163 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:54,163 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:54,163 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:54,164 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:54,164 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:54,182 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:54,182 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:54,182 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:54,182 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:54,183 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:54,183 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:54,183 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:54,183 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:54,184 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:54,184 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:54,184 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:54,184 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:54,184 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:54,185 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:54,185 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:54,185 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:54,185 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:54,185 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:54,186 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:54,186 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:54,186 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:54,186 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:54,186 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:54,187 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:54,187 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:54,187 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:54,187 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:54,187 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:54,188 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:54,188 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:54,188 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:54,188 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:54,189 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:54,189 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:54,189 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:54,189 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:54,189 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:54,190 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:54,190 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:54,190 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:54,190 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:54,190 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:54,191 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:54,191 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:54,191 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:54,191 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:54,191 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:54,192 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:54,192 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:54,192 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:54,192 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:54,192 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:54,193 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:54,193 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:54,193 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:54,193 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:54,193 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:54,194 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:54,194 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:54,194 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:54,194 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:54,194 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:54,195 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:54,195 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:54,195 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:54,195 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:54,195 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:54,196 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:54,196 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:54,196 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:54,196 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:54,196 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:54,197 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:54,197 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:54,197 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:54,197 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:54,198 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:54,198 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:54,198 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:54,198 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:54,202 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:54,202 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:54,202 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:54,202 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:54,203 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:54,203 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:54,203 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:54,203 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:54,203 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:54,204 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:54,204 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:54,204 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:54,204 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:54,204 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:54,205 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:54,205 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:54,205 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:54,205 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:54,205 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:54,206 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:54,206 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:54,206 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:54,206 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:54,206 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:54,206 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:54,207 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:54,207 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:54,207 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:54,207 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:54,207 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:54,208 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:54,208 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:54,208 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:54,211 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:54,211 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:54,212 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:54,212 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:54,212 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:54,212 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:54,212 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:54,213 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:54,213 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:54,213 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:54,213 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:54,213 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:54,219 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:54,219 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:54,219 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:54,220 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:54,220 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:54,220 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:54,220 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:54,220 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:54,221 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:54,221 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:54,237 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-27 16:02:54,258 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 16:02:54,258 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 16:02:54,258 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 16:02:54,258 INFO L376 AbstractCegarLoop]: Backedges is MCR [2019-12-27 16:02:54,258 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 16:02:54,259 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 16:02:54,259 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 16:02:54,259 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 16:02:54,275 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 177 places, 214 transitions [2019-12-27 16:02:54,277 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 177 places, 214 transitions [2019-12-27 16:02:54,393 INFO L132 PetriNetUnfolder]: 47/211 cut-off events. [2019-12-27 16:02:54,394 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 16:02:54,410 INFO L76 FinitePrefix]: Finished finitePrefix Result has 221 conditions, 211 events. 47/211 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 436 event pairs. 0/162 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-27 16:02:54,434 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 177 places, 214 transitions [2019-12-27 16:02:54,489 INFO L132 PetriNetUnfolder]: 47/211 cut-off events. [2019-12-27 16:02:54,489 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 16:02:54,497 INFO L76 FinitePrefix]: Finished finitePrefix Result has 221 conditions, 211 events. 47/211 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 436 event pairs. 0/162 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-27 16:02:54,518 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 19004 [2019-12-27 16:02:54,519 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-27 16:02:59,701 WARN L192 SmtUtils]: Spent 219.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 84 [2019-12-27 16:02:59,825 WARN L192 SmtUtils]: Spent 122.00 ms on a formula simplification that was a NOOP. DAG size: 84 [2019-12-27 16:03:00,112 WARN L192 SmtUtils]: Spent 131.00 ms on a formula simplification that was a NOOP. DAG size: 91 [2019-12-27 16:03:00,261 WARN L192 SmtUtils]: Spent 147.00 ms on a formula simplification that was a NOOP. DAG size: 89 [2019-12-27 16:03:00,291 INFO L206 etLargeBlockEncoding]: Checked pairs total: 89688 [2019-12-27 16:03:00,293 INFO L214 etLargeBlockEncoding]: Total number of compositions: 119 [2019-12-27 16:03:00,296 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 92 places, 101 transitions [2019-12-27 16:03:15,827 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 106864 states. [2019-12-27 16:03:15,829 INFO L276 IsEmpty]: Start isEmpty. Operand 106864 states. [2019-12-27 16:03:15,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-27 16:03:15,834 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:03:15,835 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-27 16:03:15,835 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:03:15,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:03:15,840 INFO L82 PathProgramCache]: Analyzing trace with hash 921701, now seen corresponding path program 1 times [2019-12-27 16:03:15,848 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:03:15,849 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1716984900] [2019-12-27 16:03:15,849 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:03:15,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:03:16,090 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 16:03:16,091 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1716984900] [2019-12-27 16:03:16,092 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:03:16,092 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 16:03:16,093 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1055818223] [2019-12-27 16:03:16,093 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:03:16,097 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:03:16,109 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 4 states and 3 transitions. [2019-12-27 16:03:16,109 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:03:16,112 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 16:03:16,113 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 16:03:16,113 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:03:16,124 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 16:03:16,125 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 16:03:16,127 INFO L87 Difference]: Start difference. First operand 106864 states. Second operand 3 states. [2019-12-27 16:03:19,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:03:19,185 INFO L93 Difference]: Finished difference Result 106034 states and 453004 transitions. [2019-12-27 16:03:19,186 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 16:03:19,188 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-27 16:03:19,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:03:19,834 INFO L225 Difference]: With dead ends: 106034 [2019-12-27 16:03:19,835 INFO L226 Difference]: Without dead ends: 99950 [2019-12-27 16:03:19,839 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 16:03:27,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99950 states. [2019-12-27 16:03:29,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99950 to 99950. [2019-12-27 16:03:29,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99950 states. [2019-12-27 16:03:30,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99950 states to 99950 states and 426445 transitions. [2019-12-27 16:03:30,520 INFO L78 Accepts]: Start accepts. Automaton has 99950 states and 426445 transitions. Word has length 3 [2019-12-27 16:03:30,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:03:30,520 INFO L462 AbstractCegarLoop]: Abstraction has 99950 states and 426445 transitions. [2019-12-27 16:03:30,520 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 16:03:30,520 INFO L276 IsEmpty]: Start isEmpty. Operand 99950 states and 426445 transitions. [2019-12-27 16:03:30,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-27 16:03:30,524 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:03:30,525 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:03:30,525 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:03:30,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:03:30,525 INFO L82 PathProgramCache]: Analyzing trace with hash 1680645281, now seen corresponding path program 1 times [2019-12-27 16:03:30,526 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:03:30,526 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [113866487] [2019-12-27 16:03:30,526 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:03:30,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:03:30,632 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 16:03:30,633 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [113866487] [2019-12-27 16:03:30,633 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:03:30,633 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 16:03:30,633 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1276804066] [2019-12-27 16:03:30,633 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:03:30,635 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:03:30,638 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 12 states and 11 transitions. [2019-12-27 16:03:30,638 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:03:30,639 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 16:03:30,640 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 16:03:30,640 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:03:30,641 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 16:03:30,641 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 16:03:30,641 INFO L87 Difference]: Start difference. First operand 99950 states and 426445 transitions. Second operand 4 states. [2019-12-27 16:03:36,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:03:36,438 INFO L93 Difference]: Finished difference Result 159384 states and 652094 transitions. [2019-12-27 16:03:36,439 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 16:03:36,439 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-27 16:03:36,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:03:37,133 INFO L225 Difference]: With dead ends: 159384 [2019-12-27 16:03:37,133 INFO L226 Difference]: Without dead ends: 159335 [2019-12-27 16:03:37,134 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 16:03:41,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159335 states. [2019-12-27 16:03:45,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159335 to 143879. [2019-12-27 16:03:45,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143879 states. [2019-12-27 16:03:45,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143879 states to 143879 states and 597281 transitions. [2019-12-27 16:03:45,449 INFO L78 Accepts]: Start accepts. Automaton has 143879 states and 597281 transitions. Word has length 11 [2019-12-27 16:03:45,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:03:45,449 INFO L462 AbstractCegarLoop]: Abstraction has 143879 states and 597281 transitions. [2019-12-27 16:03:45,449 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 16:03:45,450 INFO L276 IsEmpty]: Start isEmpty. Operand 143879 states and 597281 transitions. [2019-12-27 16:03:45,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 16:03:45,455 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:03:45,455 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:03:45,455 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:03:45,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:03:45,456 INFO L82 PathProgramCache]: Analyzing trace with hash -1535099311, now seen corresponding path program 1 times [2019-12-27 16:03:45,456 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:03:45,456 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [196825863] [2019-12-27 16:03:45,456 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:03:45,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:03:45,530 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 16:03:45,531 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [196825863] [2019-12-27 16:03:45,531 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:03:45,532 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 16:03:45,532 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [697093374] [2019-12-27 16:03:45,532 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:03:45,533 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:03:45,535 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 14 states and 13 transitions. [2019-12-27 16:03:45,535 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:03:45,535 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 16:03:45,536 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 16:03:45,536 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:03:45,536 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 16:03:45,536 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 16:03:45,536 INFO L87 Difference]: Start difference. First operand 143879 states and 597281 transitions. Second operand 4 states. [2019-12-27 16:03:51,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:03:51,363 INFO L93 Difference]: Finished difference Result 202801 states and 822791 transitions. [2019-12-27 16:03:51,363 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 16:03:51,364 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-27 16:03:51,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:03:52,716 INFO L225 Difference]: With dead ends: 202801 [2019-12-27 16:03:52,716 INFO L226 Difference]: Without dead ends: 202745 [2019-12-27 16:03:52,717 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 16:03:57,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202745 states. [2019-12-27 16:04:01,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202745 to 170256. [2019-12-27 16:04:01,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 170256 states. [2019-12-27 16:04:01,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170256 states to 170256 states and 703222 transitions. [2019-12-27 16:04:01,811 INFO L78 Accepts]: Start accepts. Automaton has 170256 states and 703222 transitions. Word has length 13 [2019-12-27 16:04:01,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:04:01,812 INFO L462 AbstractCegarLoop]: Abstraction has 170256 states and 703222 transitions. [2019-12-27 16:04:01,812 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 16:04:01,812 INFO L276 IsEmpty]: Start isEmpty. Operand 170256 states and 703222 transitions. [2019-12-27 16:04:01,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-27 16:04:01,821 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:04:01,821 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:04:01,821 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:04:01,821 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:04:01,821 INFO L82 PathProgramCache]: Analyzing trace with hash 1228744872, now seen corresponding path program 1 times [2019-12-27 16:04:01,822 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:04:01,822 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1699972994] [2019-12-27 16:04:01,822 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:04:01,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:04:01,958 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 16:04:01,959 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1699972994] [2019-12-27 16:04:01,959 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:04:01,959 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 16:04:01,959 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [174536098] [2019-12-27 16:04:01,959 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:04:01,965 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:04:01,967 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 17 states and 16 transitions. [2019-12-27 16:04:01,968 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:04:01,968 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 16:04:01,968 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 16:04:01,969 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:04:01,969 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 16:04:01,969 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 16:04:01,970 INFO L87 Difference]: Start difference. First operand 170256 states and 703222 transitions. Second operand 4 states. [2019-12-27 16:04:08,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:04:08,658 INFO L93 Difference]: Finished difference Result 214467 states and 881100 transitions. [2019-12-27 16:04:08,658 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 16:04:08,659 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-12-27 16:04:08,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:04:09,294 INFO L225 Difference]: With dead ends: 214467 [2019-12-27 16:04:09,294 INFO L226 Difference]: Without dead ends: 214467 [2019-12-27 16:04:09,295 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 16:04:14,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214467 states. [2019-12-27 16:04:21,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214467 to 183252. [2019-12-27 16:04:21,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 183252 states. [2019-12-27 16:04:23,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183252 states to 183252 states and 757164 transitions. [2019-12-27 16:04:23,382 INFO L78 Accepts]: Start accepts. Automaton has 183252 states and 757164 transitions. Word has length 16 [2019-12-27 16:04:23,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:04:23,383 INFO L462 AbstractCegarLoop]: Abstraction has 183252 states and 757164 transitions. [2019-12-27 16:04:23,383 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 16:04:23,383 INFO L276 IsEmpty]: Start isEmpty. Operand 183252 states and 757164 transitions. [2019-12-27 16:04:23,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-27 16:04:23,394 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:04:23,394 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:04:23,395 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:04:23,395 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:04:23,395 INFO L82 PathProgramCache]: Analyzing trace with hash 1228651655, now seen corresponding path program 1 times [2019-12-27 16:04:23,396 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:04:23,396 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [464524776] [2019-12-27 16:04:23,396 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:04:23,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:04:23,460 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 16:04:23,461 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [464524776] [2019-12-27 16:04:23,461 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:04:23,461 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 16:04:23,461 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [260061990] [2019-12-27 16:04:23,462 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:04:23,464 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:04:23,467 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 17 states and 16 transitions. [2019-12-27 16:04:23,467 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:04:23,467 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 16:04:23,468 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 16:04:23,468 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:04:23,468 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 16:04:23,468 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 16:04:23,468 INFO L87 Difference]: Start difference. First operand 183252 states and 757164 transitions. Second operand 4 states. [2019-12-27 16:04:31,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:04:31,129 INFO L93 Difference]: Finished difference Result 223450 states and 919042 transitions. [2019-12-27 16:04:31,129 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 16:04:31,129 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-12-27 16:04:31,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:04:31,809 INFO L225 Difference]: With dead ends: 223450 [2019-12-27 16:04:31,810 INFO L226 Difference]: Without dead ends: 223450 [2019-12-27 16:04:31,810 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 16:04:37,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223450 states. [2019-12-27 16:04:40,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223450 to 182620. [2019-12-27 16:04:40,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 182620 states. [2019-12-27 16:04:42,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182620 states to 182620 states and 754482 transitions. [2019-12-27 16:04:42,287 INFO L78 Accepts]: Start accepts. Automaton has 182620 states and 754482 transitions. Word has length 16 [2019-12-27 16:04:42,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:04:42,287 INFO L462 AbstractCegarLoop]: Abstraction has 182620 states and 754482 transitions. [2019-12-27 16:04:42,287 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 16:04:42,287 INFO L276 IsEmpty]: Start isEmpty. Operand 182620 states and 754482 transitions. [2019-12-27 16:04:42,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-27 16:04:42,302 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:04:42,302 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:04:42,302 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:04:42,303 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:04:42,303 INFO L82 PathProgramCache]: Analyzing trace with hash -1477868963, now seen corresponding path program 1 times [2019-12-27 16:04:42,303 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:04:42,304 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1195545110] [2019-12-27 16:04:42,304 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:04:42,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:04:42,356 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 16:04:42,357 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1195545110] [2019-12-27 16:04:42,357 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:04:42,357 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 16:04:42,357 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1916154567] [2019-12-27 16:04:42,358 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:04:42,360 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:04:42,363 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 24 states and 28 transitions. [2019-12-27 16:04:42,364 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:04:42,365 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 16:04:42,365 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 16:04:42,365 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:04:42,366 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 16:04:42,366 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 16:04:42,366 INFO L87 Difference]: Start difference. First operand 182620 states and 754482 transitions. Second operand 3 states. [2019-12-27 16:04:43,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:04:43,281 INFO L93 Difference]: Finished difference Result 182256 states and 753055 transitions. [2019-12-27 16:04:43,282 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 16:04:43,282 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-12-27 16:04:43,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:04:50,915 INFO L225 Difference]: With dead ends: 182256 [2019-12-27 16:04:50,915 INFO L226 Difference]: Without dead ends: 182256 [2019-12-27 16:04:50,915 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 16:04:54,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182256 states. [2019-12-27 16:04:57,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182256 to 182256. [2019-12-27 16:04:57,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 182256 states. [2019-12-27 16:04:59,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182256 states to 182256 states and 753055 transitions. [2019-12-27 16:04:59,397 INFO L78 Accepts]: Start accepts. Automaton has 182256 states and 753055 transitions. Word has length 18 [2019-12-27 16:04:59,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:04:59,397 INFO L462 AbstractCegarLoop]: Abstraction has 182256 states and 753055 transitions. [2019-12-27 16:04:59,397 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 16:04:59,398 INFO L276 IsEmpty]: Start isEmpty. Operand 182256 states and 753055 transitions. [2019-12-27 16:04:59,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-27 16:04:59,414 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:04:59,414 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:04:59,414 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:04:59,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:04:59,415 INFO L82 PathProgramCache]: Analyzing trace with hash 1719186322, now seen corresponding path program 1 times [2019-12-27 16:04:59,415 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:04:59,415 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2126951379] [2019-12-27 16:04:59,415 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:04:59,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:04:59,512 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 16:04:59,512 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2126951379] [2019-12-27 16:04:59,513 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:04:59,513 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 16:04:59,513 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1553359130] [2019-12-27 16:04:59,513 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:04:59,517 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:04:59,521 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 29 states and 38 transitions. [2019-12-27 16:04:59,521 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:04:59,524 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 16:04:59,524 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 16:04:59,525 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:04:59,525 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 16:04:59,525 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 16:04:59,525 INFO L87 Difference]: Start difference. First operand 182256 states and 753055 transitions. Second operand 3 states. [2019-12-27 16:05:06,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:05:06,966 INFO L93 Difference]: Finished difference Result 171684 states and 701366 transitions. [2019-12-27 16:05:06,967 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 16:05:06,967 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-12-27 16:05:06,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:05:07,471 INFO L225 Difference]: With dead ends: 171684 [2019-12-27 16:05:07,471 INFO L226 Difference]: Without dead ends: 171684 [2019-12-27 16:05:07,472 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 16:05:11,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171684 states. [2019-12-27 16:05:13,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171684 to 168552. [2019-12-27 16:05:13,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168552 states. [2019-12-27 16:05:15,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168552 states to 168552 states and 689782 transitions. [2019-12-27 16:05:15,429 INFO L78 Accepts]: Start accepts. Automaton has 168552 states and 689782 transitions. Word has length 19 [2019-12-27 16:05:15,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:05:15,430 INFO L462 AbstractCegarLoop]: Abstraction has 168552 states and 689782 transitions. [2019-12-27 16:05:15,430 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 16:05:15,430 INFO L276 IsEmpty]: Start isEmpty. Operand 168552 states and 689782 transitions. [2019-12-27 16:05:15,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-27 16:05:15,443 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:05:15,443 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:05:15,443 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:05:15,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:05:15,444 INFO L82 PathProgramCache]: Analyzing trace with hash 2011667091, now seen corresponding path program 1 times [2019-12-27 16:05:15,444 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:05:15,444 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [605143959] [2019-12-27 16:05:15,444 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:05:15,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:05:15,504 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 16:05:15,504 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [605143959] [2019-12-27 16:05:15,505 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:05:15,505 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 16:05:15,505 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1820034756] [2019-12-27 16:05:15,505 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:05:15,507 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:05:15,512 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 38 states and 55 transitions. [2019-12-27 16:05:15,512 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:05:15,513 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 16:05:15,513 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 16:05:15,513 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:05:15,513 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 16:05:15,514 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 16:05:15,514 INFO L87 Difference]: Start difference. First operand 168552 states and 689782 transitions. Second operand 5 states. [2019-12-27 16:05:24,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:05:24,015 INFO L93 Difference]: Finished difference Result 249455 states and 1001464 transitions. [2019-12-27 16:05:24,016 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 16:05:24,016 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2019-12-27 16:05:24,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:05:24,713 INFO L225 Difference]: With dead ends: 249455 [2019-12-27 16:05:24,713 INFO L226 Difference]: Without dead ends: 249364 [2019-12-27 16:05:24,713 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-27 16:05:29,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249364 states. [2019-12-27 16:05:32,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249364 to 180285. [2019-12-27 16:05:32,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180285 states. [2019-12-27 16:05:33,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180285 states to 180285 states and 737390 transitions. [2019-12-27 16:05:33,468 INFO L78 Accepts]: Start accepts. Automaton has 180285 states and 737390 transitions. Word has length 19 [2019-12-27 16:05:33,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:05:33,468 INFO L462 AbstractCegarLoop]: Abstraction has 180285 states and 737390 transitions. [2019-12-27 16:05:33,469 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 16:05:33,469 INFO L276 IsEmpty]: Start isEmpty. Operand 180285 states and 737390 transitions. [2019-12-27 16:05:33,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-27 16:05:33,481 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:05:33,482 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:05:33,482 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:05:33,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:05:33,482 INFO L82 PathProgramCache]: Analyzing trace with hash -397421843, now seen corresponding path program 1 times [2019-12-27 16:05:33,482 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:05:33,483 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [234519597] [2019-12-27 16:05:33,483 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:05:33,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:05:33,541 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 16:05:33,542 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [234519597] [2019-12-27 16:05:33,542 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:05:33,542 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 16:05:33,543 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [177121836] [2019-12-27 16:05:33,543 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:05:33,545 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:05:33,547 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 23 states and 25 transitions. [2019-12-27 16:05:33,548 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:05:33,550 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 16:05:33,550 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 16:05:33,551 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:05:33,551 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 16:05:33,551 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 16:05:33,551 INFO L87 Difference]: Start difference. First operand 180285 states and 737390 transitions. Second operand 4 states. [2019-12-27 16:05:35,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:05:35,076 INFO L93 Difference]: Finished difference Result 49433 states and 168883 transitions. [2019-12-27 16:05:35,076 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 16:05:35,076 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 19 [2019-12-27 16:05:35,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:05:35,152 INFO L225 Difference]: With dead ends: 49433 [2019-12-27 16:05:35,153 INFO L226 Difference]: Without dead ends: 37972 [2019-12-27 16:05:35,153 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 16:05:35,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37972 states. [2019-12-27 16:05:35,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37972 to 37867. [2019-12-27 16:05:35,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37867 states. [2019-12-27 16:05:35,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37867 states to 37867 states and 122078 transitions. [2019-12-27 16:05:35,785 INFO L78 Accepts]: Start accepts. Automaton has 37867 states and 122078 transitions. Word has length 19 [2019-12-27 16:05:35,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:05:35,785 INFO L462 AbstractCegarLoop]: Abstraction has 37867 states and 122078 transitions. [2019-12-27 16:05:35,785 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 16:05:35,786 INFO L276 IsEmpty]: Start isEmpty. Operand 37867 states and 122078 transitions. [2019-12-27 16:05:35,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-27 16:05:35,791 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:05:35,791 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:05:35,791 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:05:35,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:05:35,792 INFO L82 PathProgramCache]: Analyzing trace with hash -1838789338, now seen corresponding path program 1 times [2019-12-27 16:05:35,792 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:05:35,792 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1749761995] [2019-12-27 16:05:35,793 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:05:35,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:05:35,870 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 16:05:35,871 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1749761995] [2019-12-27 16:05:35,871 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:05:35,871 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 16:05:35,871 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2120746728] [2019-12-27 16:05:35,871 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:05:35,875 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:05:35,882 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 37 states and 50 transitions. [2019-12-27 16:05:35,882 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:05:35,883 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 16:05:35,883 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 16:05:35,883 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:05:35,883 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 16:05:35,884 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 16:05:35,884 INFO L87 Difference]: Start difference. First operand 37867 states and 122078 transitions. Second operand 5 states. [2019-12-27 16:05:36,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:05:36,518 INFO L93 Difference]: Finished difference Result 56067 states and 178279 transitions. [2019-12-27 16:05:36,518 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 16:05:36,518 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-12-27 16:05:36,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:05:36,610 INFO L225 Difference]: With dead ends: 56067 [2019-12-27 16:05:36,610 INFO L226 Difference]: Without dead ends: 56011 [2019-12-27 16:05:36,611 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-27 16:05:36,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56011 states. [2019-12-27 16:05:38,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56011 to 41085. [2019-12-27 16:05:38,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41085 states. [2019-12-27 16:05:38,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41085 states to 41085 states and 132295 transitions. [2019-12-27 16:05:38,723 INFO L78 Accepts]: Start accepts. Automaton has 41085 states and 132295 transitions. Word has length 22 [2019-12-27 16:05:38,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:05:38,723 INFO L462 AbstractCegarLoop]: Abstraction has 41085 states and 132295 transitions. [2019-12-27 16:05:38,723 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 16:05:38,723 INFO L276 IsEmpty]: Start isEmpty. Operand 41085 states and 132295 transitions. [2019-12-27 16:05:38,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-27 16:05:38,729 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:05:38,729 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 16:05:38,730 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:05:38,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:05:38,730 INFO L82 PathProgramCache]: Analyzing trace with hash -1838882555, now seen corresponding path program 1 times [2019-12-27 16:05:38,730 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:05:38,730 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [665309637] [2019-12-27 16:05:38,731 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:05:38,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:05:38,797 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 16:05:38,797 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [665309637] [2019-12-27 16:05:38,798 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:05:38,798 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 16:05:38,798 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1536101102] [2019-12-27 16:05:38,799 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:05:38,801 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:05:38,808 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 37 states and 50 transitions. [2019-12-27 16:05:38,808 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:05:38,809 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 16:05:38,809 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 16:05:38,810 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:05:38,810 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 16:05:38,811 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 16:05:38,811 INFO L87 Difference]: Start difference. First operand 41085 states and 132295 transitions. Second operand 5 states. [2019-12-27 16:05:39,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:05:39,494 INFO L93 Difference]: Finished difference Result 56578 states and 179826 transitions. [2019-12-27 16:05:39,494 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 16:05:39,494 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-12-27 16:05:39,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:05:39,610 INFO L225 Difference]: With dead ends: 56578 [2019-12-27 16:05:39,610 INFO L226 Difference]: Without dead ends: 56522 [2019-12-27 16:05:39,611 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-27 16:05:39,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56522 states. [2019-12-27 16:05:42,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56522 to 38683. [2019-12-27 16:05:42,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38683 states. [2019-12-27 16:05:42,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38683 states to 38683 states and 124370 transitions. [2019-12-27 16:05:42,824 INFO L78 Accepts]: Start accepts. Automaton has 38683 states and 124370 transitions. Word has length 22 [2019-12-27 16:05:42,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:05:42,824 INFO L462 AbstractCegarLoop]: Abstraction has 38683 states and 124370 transitions. [2019-12-27 16:05:42,824 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 16:05:42,824 INFO L276 IsEmpty]: Start isEmpty. Operand 38683 states and 124370 transitions. [2019-12-27 16:05:42,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-27 16:05:42,837 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:05:42,837 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:05:42,837 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:05:42,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:05:42,837 INFO L82 PathProgramCache]: Analyzing trace with hash 270212897, now seen corresponding path program 1 times [2019-12-27 16:05:42,838 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:05:42,838 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1144412104] [2019-12-27 16:05:42,838 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:05:42,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:05:42,879 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 16:05:42,879 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1144412104] [2019-12-27 16:05:42,880 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:05:42,880 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 16:05:42,880 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [750349429] [2019-12-27 16:05:42,880 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:05:42,884 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:05:42,891 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 28 states and 27 transitions. [2019-12-27 16:05:42,891 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:05:42,891 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 16:05:42,892 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 16:05:42,892 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:05:42,892 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 16:05:42,892 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 16:05:42,892 INFO L87 Difference]: Start difference. First operand 38683 states and 124370 transitions. Second operand 3 states. [2019-12-27 16:05:43,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:05:43,126 INFO L93 Difference]: Finished difference Result 59121 states and 189037 transitions. [2019-12-27 16:05:43,126 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 16:05:43,126 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-12-27 16:05:43,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:05:43,225 INFO L225 Difference]: With dead ends: 59121 [2019-12-27 16:05:43,225 INFO L226 Difference]: Without dead ends: 59121 [2019-12-27 16:05:43,226 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 16:05:43,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59121 states. [2019-12-27 16:05:44,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59121 to 45711. [2019-12-27 16:05:44,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45711 states. [2019-12-27 16:05:44,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45711 states to 45711 states and 147221 transitions. [2019-12-27 16:05:44,534 INFO L78 Accepts]: Start accepts. Automaton has 45711 states and 147221 transitions. Word has length 27 [2019-12-27 16:05:44,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:05:44,534 INFO L462 AbstractCegarLoop]: Abstraction has 45711 states and 147221 transitions. [2019-12-27 16:05:44,534 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 16:05:44,534 INFO L276 IsEmpty]: Start isEmpty. Operand 45711 states and 147221 transitions. [2019-12-27 16:05:44,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-27 16:05:44,548 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:05:44,548 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:05:44,549 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:05:44,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:05:44,549 INFO L82 PathProgramCache]: Analyzing trace with hash 2064759266, now seen corresponding path program 1 times [2019-12-27 16:05:44,549 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:05:44,550 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [779164384] [2019-12-27 16:05:44,550 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:05:44,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:05:44,588 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 16:05:44,588 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [779164384] [2019-12-27 16:05:44,590 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:05:44,590 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 16:05:44,590 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2020590663] [2019-12-27 16:05:44,590 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:05:44,595 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:05:44,601 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 28 states and 27 transitions. [2019-12-27 16:05:44,601 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:05:44,602 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 16:05:44,602 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 16:05:44,602 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:05:44,602 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 16:05:44,606 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 16:05:44,606 INFO L87 Difference]: Start difference. First operand 45711 states and 147221 transitions. Second operand 3 states. [2019-12-27 16:05:44,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:05:44,900 INFO L93 Difference]: Finished difference Result 59121 states and 184317 transitions. [2019-12-27 16:05:44,900 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 16:05:44,901 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-12-27 16:05:44,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:05:45,000 INFO L225 Difference]: With dead ends: 59121 [2019-12-27 16:05:45,000 INFO L226 Difference]: Without dead ends: 59121 [2019-12-27 16:05:45,000 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 16:05:45,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59121 states. [2019-12-27 16:05:45,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59121 to 45711. [2019-12-27 16:05:45,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45711 states. [2019-12-27 16:05:45,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45711 states to 45711 states and 142501 transitions. [2019-12-27 16:05:45,869 INFO L78 Accepts]: Start accepts. Automaton has 45711 states and 142501 transitions. Word has length 27 [2019-12-27 16:05:45,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:05:45,869 INFO L462 AbstractCegarLoop]: Abstraction has 45711 states and 142501 transitions. [2019-12-27 16:05:45,869 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 16:05:45,869 INFO L276 IsEmpty]: Start isEmpty. Operand 45711 states and 142501 transitions. [2019-12-27 16:05:45,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-27 16:05:45,884 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:05:45,884 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:05:45,884 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:05:45,885 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:05:45,885 INFO L82 PathProgramCache]: Analyzing trace with hash 2010439622, now seen corresponding path program 1 times [2019-12-27 16:05:45,885 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:05:45,885 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1711399624] [2019-12-27 16:05:45,885 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:05:45,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:05:45,946 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 16:05:45,947 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1711399624] [2019-12-27 16:05:45,947 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:05:45,947 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 16:05:45,947 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1428271527] [2019-12-27 16:05:45,947 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:05:45,952 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:05:45,957 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 28 states and 27 transitions. [2019-12-27 16:05:45,958 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:05:45,958 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 16:05:45,958 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 16:05:45,958 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:05:45,959 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 16:05:45,959 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 16:05:45,959 INFO L87 Difference]: Start difference. First operand 45711 states and 142501 transitions. Second operand 5 states. [2019-12-27 16:05:46,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:05:46,757 INFO L93 Difference]: Finished difference Result 56372 states and 173835 transitions. [2019-12-27 16:05:46,758 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 16:05:46,758 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2019-12-27 16:05:46,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:05:46,851 INFO L225 Difference]: With dead ends: 56372 [2019-12-27 16:05:46,851 INFO L226 Difference]: Without dead ends: 56196 [2019-12-27 16:05:46,851 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-27 16:05:47,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56196 states. [2019-12-27 16:05:47,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56196 to 47904. [2019-12-27 16:05:47,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47904 states. [2019-12-27 16:05:47,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47904 states to 47904 states and 149182 transitions. [2019-12-27 16:05:47,686 INFO L78 Accepts]: Start accepts. Automaton has 47904 states and 149182 transitions. Word has length 27 [2019-12-27 16:05:47,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:05:47,687 INFO L462 AbstractCegarLoop]: Abstraction has 47904 states and 149182 transitions. [2019-12-27 16:05:47,687 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 16:05:47,687 INFO L276 IsEmpty]: Start isEmpty. Operand 47904 states and 149182 transitions. [2019-12-27 16:05:47,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-27 16:05:47,704 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:05:47,704 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:05:47,704 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:05:47,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:05:47,704 INFO L82 PathProgramCache]: Analyzing trace with hash 773295241, now seen corresponding path program 1 times [2019-12-27 16:05:47,705 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:05:47,705 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1671571607] [2019-12-27 16:05:47,705 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:05:47,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:05:47,785 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 16:05:47,786 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1671571607] [2019-12-27 16:05:47,786 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:05:47,786 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 16:05:47,786 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2098487621] [2019-12-27 16:05:47,786 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:05:47,791 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:05:47,797 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 29 states and 28 transitions. [2019-12-27 16:05:47,797 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:05:47,798 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 16:05:47,798 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 16:05:47,798 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:05:47,798 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 16:05:47,798 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 16:05:47,799 INFO L87 Difference]: Start difference. First operand 47904 states and 149182 transitions. Second operand 5 states. [2019-12-27 16:05:48,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:05:48,533 INFO L93 Difference]: Finished difference Result 58142 states and 179062 transitions. [2019-12-27 16:05:48,533 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 16:05:48,533 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2019-12-27 16:05:48,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:05:48,625 INFO L225 Difference]: With dead ends: 58142 [2019-12-27 16:05:48,626 INFO L226 Difference]: Without dead ends: 57958 [2019-12-27 16:05:48,626 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-27 16:05:48,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57958 states. [2019-12-27 16:05:49,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57958 to 47592. [2019-12-27 16:05:49,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47592 states. [2019-12-27 16:05:49,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47592 states to 47592 states and 148093 transitions. [2019-12-27 16:05:49,442 INFO L78 Accepts]: Start accepts. Automaton has 47592 states and 148093 transitions. Word has length 28 [2019-12-27 16:05:49,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:05:49,442 INFO L462 AbstractCegarLoop]: Abstraction has 47592 states and 148093 transitions. [2019-12-27 16:05:49,442 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 16:05:49,442 INFO L276 IsEmpty]: Start isEmpty. Operand 47592 states and 148093 transitions. [2019-12-27 16:05:49,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-12-27 16:05:49,458 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:05:49,458 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] [2019-12-27 16:05:49,458 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:05:49,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:05:49,458 INFO L82 PathProgramCache]: Analyzing trace with hash 1820575072, now seen corresponding path program 1 times [2019-12-27 16:05:49,459 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:05:49,459 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2109872389] [2019-12-27 16:05:49,459 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:05:49,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:05:49,535 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 16:05:49,535 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2109872389] [2019-12-27 16:05:49,535 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:05:49,535 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 16:05:49,536 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [207094467] [2019-12-27 16:05:49,536 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:05:49,541 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:05:49,551 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 46 states and 60 transitions. [2019-12-27 16:05:49,551 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:05:49,552 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 16:05:49,552 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 16:05:49,552 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:05:49,552 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 16:05:49,553 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 16:05:49,553 INFO L87 Difference]: Start difference. First operand 47592 states and 148093 transitions. Second operand 5 states. [2019-12-27 16:05:49,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:05:49,693 INFO L93 Difference]: Finished difference Result 21069 states and 62976 transitions. [2019-12-27 16:05:49,693 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 16:05:49,694 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 30 [2019-12-27 16:05:49,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:05:49,729 INFO L225 Difference]: With dead ends: 21069 [2019-12-27 16:05:49,730 INFO L226 Difference]: Without dead ends: 18454 [2019-12-27 16:05:49,730 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 16:05:49,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18454 states. [2019-12-27 16:05:50,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18454 to 17375. [2019-12-27 16:05:50,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17375 states. [2019-12-27 16:05:50,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17375 states to 17375 states and 51733 transitions. [2019-12-27 16:05:50,485 INFO L78 Accepts]: Start accepts. Automaton has 17375 states and 51733 transitions. Word has length 30 [2019-12-27 16:05:50,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:05:50,485 INFO L462 AbstractCegarLoop]: Abstraction has 17375 states and 51733 transitions. [2019-12-27 16:05:50,486 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 16:05:50,486 INFO L276 IsEmpty]: Start isEmpty. Operand 17375 states and 51733 transitions. [2019-12-27 16:05:50,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-27 16:05:50,504 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:05:50,504 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:05:50,504 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:05:50,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:05:50,505 INFO L82 PathProgramCache]: Analyzing trace with hash -809721720, now seen corresponding path program 1 times [2019-12-27 16:05:50,505 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:05:50,505 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [914731060] [2019-12-27 16:05:50,506 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:05:50,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:05:50,598 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 16:05:50,598 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [914731060] [2019-12-27 16:05:50,599 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:05:50,599 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 16:05:50,599 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1043643204] [2019-12-27 16:05:50,599 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:05:50,605 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:05:50,616 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 48 states and 61 transitions. [2019-12-27 16:05:50,616 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:05:50,617 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 16:05:50,618 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 16:05:50,618 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:05:50,618 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 16:05:50,619 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-27 16:05:50,619 INFO L87 Difference]: Start difference. First operand 17375 states and 51733 transitions. Second operand 6 states. [2019-12-27 16:05:51,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:05:51,302 INFO L93 Difference]: Finished difference Result 22016 states and 64715 transitions. [2019-12-27 16:05:51,303 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 16:05:51,303 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 33 [2019-12-27 16:05:51,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:05:51,342 INFO L225 Difference]: With dead ends: 22016 [2019-12-27 16:05:51,342 INFO L226 Difference]: Without dead ends: 21702 [2019-12-27 16:05:51,343 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2019-12-27 16:05:51,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21702 states. [2019-12-27 16:05:51,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21702 to 17450. [2019-12-27 16:05:51,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17450 states. [2019-12-27 16:05:51,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17450 states to 17450 states and 51962 transitions. [2019-12-27 16:05:51,618 INFO L78 Accepts]: Start accepts. Automaton has 17450 states and 51962 transitions. Word has length 33 [2019-12-27 16:05:51,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:05:51,618 INFO L462 AbstractCegarLoop]: Abstraction has 17450 states and 51962 transitions. [2019-12-27 16:05:51,618 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 16:05:51,619 INFO L276 IsEmpty]: Start isEmpty. Operand 17450 states and 51962 transitions. [2019-12-27 16:05:51,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-12-27 16:05:51,634 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:05:51,634 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:05:51,635 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:05:51,635 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:05:51,635 INFO L82 PathProgramCache]: Analyzing trace with hash -752360441, now seen corresponding path program 1 times [2019-12-27 16:05:51,636 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:05:51,636 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [398978700] [2019-12-27 16:05:51,636 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:05:51,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:05:51,743 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 16:05:51,744 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [398978700] [2019-12-27 16:05:51,744 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:05:51,744 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 16:05:51,744 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1723844031] [2019-12-27 16:05:51,744 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:05:51,753 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:05:51,768 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 49 states and 62 transitions. [2019-12-27 16:05:51,769 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:05:51,769 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 16:05:51,769 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 16:05:51,769 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:05:51,770 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 16:05:51,771 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-27 16:05:51,771 INFO L87 Difference]: Start difference. First operand 17450 states and 51962 transitions. Second operand 6 states. [2019-12-27 16:05:52,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:05:52,480 INFO L93 Difference]: Finished difference Result 21180 states and 62232 transitions. [2019-12-27 16:05:52,481 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 16:05:52,481 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 34 [2019-12-27 16:05:52,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:05:52,510 INFO L225 Difference]: With dead ends: 21180 [2019-12-27 16:05:52,511 INFO L226 Difference]: Without dead ends: 20805 [2019-12-27 16:05:52,511 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 3 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2019-12-27 16:05:52,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20805 states. [2019-12-27 16:05:52,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20805 to 16323. [2019-12-27 16:05:52,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16323 states. [2019-12-27 16:05:52,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16323 states to 16323 states and 48617 transitions. [2019-12-27 16:05:52,777 INFO L78 Accepts]: Start accepts. Automaton has 16323 states and 48617 transitions. Word has length 34 [2019-12-27 16:05:52,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:05:52,778 INFO L462 AbstractCegarLoop]: Abstraction has 16323 states and 48617 transitions. [2019-12-27 16:05:52,778 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 16:05:52,778 INFO L276 IsEmpty]: Start isEmpty. Operand 16323 states and 48617 transitions. [2019-12-27 16:05:52,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-12-27 16:05:52,797 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:05:52,797 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] [2019-12-27 16:05:52,797 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:05:52,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:05:52,798 INFO L82 PathProgramCache]: Analyzing trace with hash 1200265194, now seen corresponding path program 1 times [2019-12-27 16:05:52,798 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:05:52,799 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [821325685] [2019-12-27 16:05:52,799 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:05:52,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:05:52,880 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 16:05:52,880 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [821325685] [2019-12-27 16:05:52,880 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:05:52,880 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 16:05:52,881 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1267656545] [2019-12-27 16:05:52,881 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:05:52,890 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:05:52,939 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 110 states and 189 transitions. [2019-12-27 16:05:52,939 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:05:53,001 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 8 times. [2019-12-27 16:05:53,002 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 16:05:53,002 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:05:53,002 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 16:05:53,002 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-27 16:05:53,002 INFO L87 Difference]: Start difference. First operand 16323 states and 48617 transitions. Second operand 6 states. [2019-12-27 16:05:53,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:05:53,868 INFO L93 Difference]: Finished difference Result 24319 states and 71696 transitions. [2019-12-27 16:05:53,869 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 16:05:53,869 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 41 [2019-12-27 16:05:53,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:05:53,901 INFO L225 Difference]: With dead ends: 24319 [2019-12-27 16:05:53,902 INFO L226 Difference]: Without dead ends: 24319 [2019-12-27 16:05:53,902 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 8 SyntacticMatches, 5 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-12-27 16:05:53,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24319 states. [2019-12-27 16:05:54,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24319 to 19422. [2019-12-27 16:05:54,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19422 states. [2019-12-27 16:05:54,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19422 states to 19422 states and 57992 transitions. [2019-12-27 16:05:54,211 INFO L78 Accepts]: Start accepts. Automaton has 19422 states and 57992 transitions. Word has length 41 [2019-12-27 16:05:54,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:05:54,211 INFO L462 AbstractCegarLoop]: Abstraction has 19422 states and 57992 transitions. [2019-12-27 16:05:54,211 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 16:05:54,211 INFO L276 IsEmpty]: Start isEmpty. Operand 19422 states and 57992 transitions. [2019-12-27 16:05:54,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-12-27 16:05:54,230 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:05:54,230 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] [2019-12-27 16:05:54,230 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:05:54,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:05:54,231 INFO L82 PathProgramCache]: Analyzing trace with hash 1472692188, now seen corresponding path program 2 times [2019-12-27 16:05:54,231 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:05:54,231 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [638383782] [2019-12-27 16:05:54,231 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:05:54,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:05:54,292 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 16:05:54,292 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [638383782] [2019-12-27 16:05:54,292 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:05:54,292 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 16:05:54,293 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2104241991] [2019-12-27 16:05:54,293 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:05:54,303 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:05:54,350 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 108 states and 187 transitions. [2019-12-27 16:05:54,350 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:05:54,350 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 16:05:54,351 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 16:05:54,351 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:05:54,351 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 16:05:54,352 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 16:05:54,352 INFO L87 Difference]: Start difference. First operand 19422 states and 57992 transitions. Second operand 3 states. [2019-12-27 16:05:54,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:05:54,407 INFO L93 Difference]: Finished difference Result 16323 states and 47993 transitions. [2019-12-27 16:05:54,408 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 16:05:54,408 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 41 [2019-12-27 16:05:54,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:05:54,430 INFO L225 Difference]: With dead ends: 16323 [2019-12-27 16:05:54,431 INFO L226 Difference]: Without dead ends: 16323 [2019-12-27 16:05:54,431 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 16:05:54,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16323 states. [2019-12-27 16:05:54,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16323 to 16073. [2019-12-27 16:05:54,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16073 states. [2019-12-27 16:05:54,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16073 states to 16073 states and 47295 transitions. [2019-12-27 16:05:54,667 INFO L78 Accepts]: Start accepts. Automaton has 16073 states and 47295 transitions. Word has length 41 [2019-12-27 16:05:54,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:05:54,667 INFO L462 AbstractCegarLoop]: Abstraction has 16073 states and 47295 transitions. [2019-12-27 16:05:54,667 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 16:05:54,668 INFO L276 IsEmpty]: Start isEmpty. Operand 16073 states and 47295 transitions. [2019-12-27 16:05:54,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-12-27 16:05:54,684 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:05:54,684 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] [2019-12-27 16:05:54,684 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:05:54,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:05:54,684 INFO L82 PathProgramCache]: Analyzing trace with hash -1875088873, now seen corresponding path program 1 times [2019-12-27 16:05:54,685 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:05:54,685 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [607568673] [2019-12-27 16:05:54,685 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:05:54,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:05:54,781 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 16:05:54,782 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [607568673] [2019-12-27 16:05:54,782 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:05:54,782 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 16:05:54,782 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1521807469] [2019-12-27 16:05:54,782 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:05:54,792 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:05:54,846 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 113 states and 194 transitions. [2019-12-27 16:05:54,846 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:05:54,849 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 16:05:54,849 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 16:05:54,849 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:05:54,850 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 16:05:54,850 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-27 16:05:54,850 INFO L87 Difference]: Start difference. First operand 16073 states and 47295 transitions. Second operand 6 states. [2019-12-27 16:05:54,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:05:54,958 INFO L93 Difference]: Finished difference Result 14802 states and 44567 transitions. [2019-12-27 16:05:54,959 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 16:05:54,959 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 42 [2019-12-27 16:05:54,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:05:54,978 INFO L225 Difference]: With dead ends: 14802 [2019-12-27 16:05:54,979 INFO L226 Difference]: Without dead ends: 14673 [2019-12-27 16:05:54,979 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2019-12-27 16:05:55,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14673 states. [2019-12-27 16:05:55,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14673 to 13253. [2019-12-27 16:05:55,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13253 states. [2019-12-27 16:05:55,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13253 states to 13253 states and 40241 transitions. [2019-12-27 16:05:55,191 INFO L78 Accepts]: Start accepts. Automaton has 13253 states and 40241 transitions. Word has length 42 [2019-12-27 16:05:55,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:05:55,191 INFO L462 AbstractCegarLoop]: Abstraction has 13253 states and 40241 transitions. [2019-12-27 16:05:55,191 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 16:05:55,191 INFO L276 IsEmpty]: Start isEmpty. Operand 13253 states and 40241 transitions. [2019-12-27 16:05:55,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 16:05:55,265 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:05:55,266 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:05:55,266 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:05:55,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:05:55,267 INFO L82 PathProgramCache]: Analyzing trace with hash 208708978, now seen corresponding path program 1 times [2019-12-27 16:05:55,267 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:05:55,267 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1468900327] [2019-12-27 16:05:55,267 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:05:55,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:05:55,330 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 16:05:55,331 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1468900327] [2019-12-27 16:05:55,331 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:05:55,331 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 16:05:55,331 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [602237199] [2019-12-27 16:05:55,331 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:05:55,354 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:05:55,570 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 232 states and 430 transitions. [2019-12-27 16:05:55,571 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:05:55,571 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 16:05:55,572 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 16:05:55,572 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:05:55,572 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 16:05:55,572 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 16:05:55,573 INFO L87 Difference]: Start difference. First operand 13253 states and 40241 transitions. Second operand 3 states. [2019-12-27 16:05:55,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:05:55,650 INFO L93 Difference]: Finished difference Result 15934 states and 48414 transitions. [2019-12-27 16:05:55,650 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 16:05:55,650 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-12-27 16:05:55,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:05:55,671 INFO L225 Difference]: With dead ends: 15934 [2019-12-27 16:05:55,671 INFO L226 Difference]: Without dead ends: 15934 [2019-12-27 16:05:55,671 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 16:05:55,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15934 states. [2019-12-27 16:05:55,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15934 to 12716. [2019-12-27 16:05:55,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12716 states. [2019-12-27 16:05:55,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12716 states to 12716 states and 38916 transitions. [2019-12-27 16:05:55,878 INFO L78 Accepts]: Start accepts. Automaton has 12716 states and 38916 transitions. Word has length 66 [2019-12-27 16:05:55,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:05:55,878 INFO L462 AbstractCegarLoop]: Abstraction has 12716 states and 38916 transitions. [2019-12-27 16:05:55,878 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 16:05:55,878 INFO L276 IsEmpty]: Start isEmpty. Operand 12716 states and 38916 transitions. [2019-12-27 16:05:55,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 16:05:55,892 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:05:55,892 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:05:55,892 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:05:55,893 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:05:55,893 INFO L82 PathProgramCache]: Analyzing trace with hash -1405178173, now seen corresponding path program 1 times [2019-12-27 16:05:55,893 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:05:55,894 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1346540087] [2019-12-27 16:05:55,894 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:05:55,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:05:56,003 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 16:05:56,004 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1346540087] [2019-12-27 16:05:56,004 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:05:56,004 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 16:05:56,004 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [212503784] [2019-12-27 16:05:56,005 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:05:56,030 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:05:56,390 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 177 states and 306 transitions. [2019-12-27 16:05:56,390 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:05:56,423 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 10 times. [2019-12-27 16:05:56,424 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 16:05:56,424 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:05:56,424 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 16:05:56,424 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-12-27 16:05:56,424 INFO L87 Difference]: Start difference. First operand 12716 states and 38916 transitions. Second operand 8 states. [2019-12-27 16:05:57,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:05:57,421 INFO L93 Difference]: Finished difference Result 52854 states and 158370 transitions. [2019-12-27 16:05:57,422 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-27 16:05:57,422 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 67 [2019-12-27 16:05:57,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:05:57,474 INFO L225 Difference]: With dead ends: 52854 [2019-12-27 16:05:57,474 INFO L226 Difference]: Without dead ends: 38614 [2019-12-27 16:05:57,474 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 10 SyntacticMatches, 4 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 129 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=145, Invalid=455, Unknown=0, NotChecked=0, Total=600 [2019-12-27 16:05:57,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38614 states. [2019-12-27 16:05:57,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38614 to 15312. [2019-12-27 16:05:57,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15312 states. [2019-12-27 16:05:57,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15312 states to 15312 states and 46947 transitions. [2019-12-27 16:05:57,845 INFO L78 Accepts]: Start accepts. Automaton has 15312 states and 46947 transitions. Word has length 67 [2019-12-27 16:05:57,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:05:57,845 INFO L462 AbstractCegarLoop]: Abstraction has 15312 states and 46947 transitions. [2019-12-27 16:05:57,845 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 16:05:57,845 INFO L276 IsEmpty]: Start isEmpty. Operand 15312 states and 46947 transitions. [2019-12-27 16:05:57,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 16:05:57,862 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:05:57,862 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:05:57,862 INFO L410 AbstractCegarLoop]: === Iteration 24 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:05:57,862 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:05:57,862 INFO L82 PathProgramCache]: Analyzing trace with hash 1914727739, now seen corresponding path program 2 times [2019-12-27 16:05:57,863 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:05:57,863 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1437664870] [2019-12-27 16:05:57,863 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:05:57,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:05:57,943 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 16:05:57,943 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1437664870] [2019-12-27 16:05:57,943 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:05:57,943 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 16:05:57,944 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1422752616] [2019-12-27 16:05:57,944 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:05:57,966 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:05:58,332 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 227 states and 432 transitions. [2019-12-27 16:05:58,332 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:05:58,400 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 11 times. [2019-12-27 16:05:58,400 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 16:05:58,400 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:05:58,401 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 16:05:58,401 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-27 16:05:58,401 INFO L87 Difference]: Start difference. First operand 15312 states and 46947 transitions. Second operand 6 states. [2019-12-27 16:05:58,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:05:58,999 INFO L93 Difference]: Finished difference Result 21309 states and 64222 transitions. [2019-12-27 16:05:58,999 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 16:05:59,000 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 67 [2019-12-27 16:05:59,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:05:59,052 INFO L225 Difference]: With dead ends: 21309 [2019-12-27 16:05:59,052 INFO L226 Difference]: Without dead ends: 21309 [2019-12-27 16:05:59,053 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 7 SyntacticMatches, 6 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2019-12-27 16:05:59,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21309 states. [2019-12-27 16:05:59,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21309 to 14042. [2019-12-27 16:05:59,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14042 states. [2019-12-27 16:05:59,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14042 states to 14042 states and 42871 transitions. [2019-12-27 16:05:59,544 INFO L78 Accepts]: Start accepts. Automaton has 14042 states and 42871 transitions. Word has length 67 [2019-12-27 16:05:59,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:05:59,545 INFO L462 AbstractCegarLoop]: Abstraction has 14042 states and 42871 transitions. [2019-12-27 16:05:59,545 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 16:05:59,546 INFO L276 IsEmpty]: Start isEmpty. Operand 14042 states and 42871 transitions. [2019-12-27 16:05:59,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 16:05:59,567 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:05:59,567 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:05:59,567 INFO L410 AbstractCegarLoop]: === Iteration 25 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:05:59,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:05:59,568 INFO L82 PathProgramCache]: Analyzing trace with hash 817808390, now seen corresponding path program 1 times [2019-12-27 16:05:59,569 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:05:59,569 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1089257375] [2019-12-27 16:05:59,569 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:05:59,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 16:05:59,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 16:05:59,725 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 16:05:59,726 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 16:05:59,730 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [903] [903] ULTIMATE.startENTRY-->L827: Formula: (let ((.cse0 (store |v_#valid_73| 0 0))) (and (= 0 v_~z$flush_delayed~0_27) (= |v_#length_23| (store |v_#length_24| |v_ULTIMATE.start_main_~#t421~0.base_44| 4)) (= v_~z$r_buff1_thd1~0_114 0) (= v_~main$tmp_guard1~0_44 0) (= v_~z$read_delayed_var~0.offset_6 0) (= 0 v_~z$r_buff0_thd3~0_325) (= v_~z$mem_tmp~0_16 0) (= 0 v_~z$r_buff1_thd3~0_218) (= |v_#NULL.offset_3| 0) (= v_~z$read_delayed~0_8 0) (= 0 v_~weak$$choice0~0_15) (= v_~z$w_buff1~0_167 0) (= v_~z$r_buff0_thd0~0_136 0) (= v_~x~0_84 0) (< |v_#StackHeapBarrier_18| |v_ULTIMATE.start_main_~#t421~0.base_44|) (= v_~z$r_buff0_thd1~0_185 0) (< 0 |v_#StackHeapBarrier_18|) (= v_~z$read_delayed_var~0.base_6 0) (= 0 v_~__unbuffered_p2_EAX~0_46) (= 0 v_~weak$$choice2~0_93) (= 0 v_~__unbuffered_p1_EAX~0_60) (= v_~z$w_buff0~0_229 0) (= 0 v_~__unbuffered_p0_EAX~0_95) (= 0 v_~__unbuffered_cnt~0_63) (= v_~z$r_buff0_thd2~0_132 0) (= v_~z~0_167 0) (= (select .cse0 |v_ULTIMATE.start_main_~#t421~0.base_44|) 0) (= v_~main$tmp_guard0~0_44 0) (= v_~y~0_39 0) (= v_~z$w_buff1_used~0_386 0) (= v_~__unbuffered_p2_EBX~0_54 0) (= |v_ULTIMATE.start_main_~#t421~0.offset_30| 0) (= |v_#valid_71| (store .cse0 |v_ULTIMATE.start_main_~#t421~0.base_44| 1)) (= v_~z$r_buff1_thd0~0_148 0) (= 0 |v_#NULL.base_3|) (= v_~z$w_buff0_used~0_680 0) (= v_~z$r_buff1_thd2~0_108 0) (= (store |v_#memory_int_22| |v_ULTIMATE.start_main_~#t421~0.base_44| (store (select |v_#memory_int_22| |v_ULTIMATE.start_main_~#t421~0.base_44|) |v_ULTIMATE.start_main_~#t421~0.offset_30| 0)) |v_#memory_int_21|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_18|, #valid=|v_#valid_73|, #memory_int=|v_#memory_int_22|, #length=|v_#length_24|} OutVars{~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_108, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_86|, #NULL.offset=|v_#NULL.offset_3|, ULTIMATE.start_main_#t~ite49=|v_ULTIMATE.start_main_#t~ite49_44|, ULTIMATE.start_main_~#t422~0.offset=|v_ULTIMATE.start_main_~#t422~0.offset_30|, ULTIMATE.start_main_#t~ite50=|v_ULTIMATE.start_main_#t~ite50_140|, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_82|, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_136, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_95, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_60, ULTIMATE.start_main_~#t423~0.base=|v_ULTIMATE.start_main_~#t423~0.base_24|, #length=|v_#length_23|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_46, ~z$mem_tmp~0=v_~z$mem_tmp~0_16, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_54, ULTIMATE.start_main_~#t421~0.base=|v_ULTIMATE.start_main_~#t421~0.base_44|, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_11|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_386, ~z$flush_delayed~0=v_~z$flush_delayed~0_27, ~weak$$choice0~0=v_~weak$$choice0~0_15, #StackHeapBarrier=|v_#StackHeapBarrier_18|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_114, ~z$read_delayed_var~0.base=v_~z$read_delayed_var~0.base_6, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_325, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_63, ~x~0=v_~x~0_84, ~z$read_delayed~0=v_~z$read_delayed~0_8, ~z$w_buff1~0=v_~z$w_buff1~0_167, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_44, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_103|, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_6, ULTIMATE.start_main_~#t422~0.base=|v_ULTIMATE.start_main_~#t422~0.base_44|, ULTIMATE.start_main_#t~ite51=|v_ULTIMATE.start_main_#t~ite51_42|, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_148, ULTIMATE.start_main_~#t421~0.offset=|v_ULTIMATE.start_main_~#t421~0.offset_30|, ~y~0=v_~y~0_39, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_132, ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_27|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_680, ~z$w_buff0~0=v_~z$w_buff0~0_229, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_10|, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_218, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_44, #NULL.base=|v_#NULL.base_3|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_27|, #valid=|v_#valid_71|, #memory_int=|v_#memory_int_21|, ~z~0=v_~z~0_167, ~weak$$choice2~0=v_~weak$$choice2~0_93, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_185, ULTIMATE.start_main_~#t423~0.offset=|v_ULTIMATE.start_main_~#t423~0.offset_19|} AuxVars[] AssignedVars[~z$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite47, #NULL.offset, ULTIMATE.start_main_#t~ite49, ULTIMATE.start_main_~#t422~0.offset, ULTIMATE.start_main_#t~ite50, ULTIMATE.start_main_#t~ite52, ~z$r_buff0_thd0~0, ~__unbuffered_p0_EAX~0, ~__unbuffered_p1_EAX~0, ULTIMATE.start_main_~#t423~0.base, #length, ~__unbuffered_p2_EAX~0, ~z$mem_tmp~0, ~__unbuffered_p2_EBX~0, ULTIMATE.start_main_~#t421~0.base, ULTIMATE.start_main_#t~nondet45, ~z$w_buff1_used~0, ~z$flush_delayed~0, ~weak$$choice0~0, ~z$r_buff1_thd1~0, ~z$read_delayed_var~0.base, ~z$r_buff0_thd3~0, ~__unbuffered_cnt~0, ~x~0, ~z$read_delayed~0, ~z$w_buff1~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite48, ~z$read_delayed_var~0.offset, ULTIMATE.start_main_~#t422~0.base, ULTIMATE.start_main_#t~ite51, ~z$r_buff1_thd0~0, ULTIMATE.start_main_~#t421~0.offset, ~y~0, ~z$r_buff0_thd2~0, ULTIMATE.start_main_#t~nondet46, ~z$w_buff0_used~0, ~z$w_buff0~0, ULTIMATE.start_main_#t~nondet44, ~z$r_buff1_thd3~0, ~main$tmp_guard0~0, #NULL.base, ULTIMATE.start_main_#res, #valid, #memory_int, ~z~0, ~weak$$choice2~0, ~z$r_buff0_thd1~0, ULTIMATE.start_main_~#t423~0.offset] because there is no mapped edge [2019-12-27 16:05:59,732 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [881] [881] L4-->L748: Formula: (and (not (= P0Thread1of1ForFork1___VERIFIER_assert_~expression_In2110532794 0)) (= ~z$r_buff1_thd2~0_Out2110532794 ~z$r_buff0_thd2~0_In2110532794) (= ~z$r_buff0_thd0~0_In2110532794 ~z$r_buff1_thd0~0_Out2110532794) (= ~x~0_In2110532794 ~__unbuffered_p0_EAX~0_Out2110532794) (= ~z$r_buff0_thd1~0_In2110532794 ~z$r_buff1_thd1~0_Out2110532794) (= ~z$r_buff1_thd3~0_Out2110532794 ~z$r_buff0_thd3~0_In2110532794) (= 1 ~z$r_buff0_thd1~0_Out2110532794)) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In2110532794, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In2110532794, P0Thread1of1ForFork1___VERIFIER_assert_~expression=P0Thread1of1ForFork1___VERIFIER_assert_~expression_In2110532794, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In2110532794, ~x~0=~x~0_In2110532794, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In2110532794} OutVars{~__unbuffered_p0_EAX~0=~__unbuffered_p0_EAX~0_Out2110532794, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In2110532794, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_Out2110532794, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_Out2110532794, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_Out2110532794, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_Out2110532794, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In2110532794, P0Thread1of1ForFork1___VERIFIER_assert_~expression=P0Thread1of1ForFork1___VERIFIER_assert_~expression_In2110532794, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_Out2110532794, ~x~0=~x~0_In2110532794, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In2110532794} AuxVars[] AssignedVars[~__unbuffered_p0_EAX~0, ~z$r_buff1_thd3~0, ~z$r_buff1_thd0~0, ~z$r_buff1_thd2~0, ~z$r_buff1_thd1~0, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-27 16:05:59,732 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [874] [874] L827-1-->L829: Formula: (and (< |v_#StackHeapBarrier_10| |v_ULTIMATE.start_main_~#t422~0.base_13|) (= 0 |v_ULTIMATE.start_main_~#t422~0.offset_11|) (= 0 (select |v_#valid_37| |v_ULTIMATE.start_main_~#t422~0.base_13|)) (= (store |v_#length_16| |v_ULTIMATE.start_main_~#t422~0.base_13| 4) |v_#length_15|) (= |v_#valid_36| (store |v_#valid_37| |v_ULTIMATE.start_main_~#t422~0.base_13| 1)) (= |v_#memory_int_13| (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t422~0.base_13| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t422~0.base_13|) |v_ULTIMATE.start_main_~#t422~0.offset_11| 1))) (not (= |v_ULTIMATE.start_main_~#t422~0.base_13| 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_37|, #memory_int=|v_#memory_int_14|, #length=|v_#length_16|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_10|, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_5|, #valid=|v_#valid_36|, #memory_int=|v_#memory_int_13|, #length=|v_#length_15|, ULTIMATE.start_main_~#t422~0.offset=|v_ULTIMATE.start_main_~#t422~0.offset_11|, ULTIMATE.start_main_~#t422~0.base=|v_ULTIMATE.start_main_~#t422~0.base_13|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet44, #valid, #memory_int, #length, ULTIMATE.start_main_~#t422~0.offset, ULTIMATE.start_main_~#t422~0.base] because there is no mapped edge [2019-12-27 16:05:59,736 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [836] [836] L768-2-->L768-5: Formula: (let ((.cse0 (= (mod ~z$w_buff1_used~0_In-2035653268 256) 0)) (.cse2 (= (mod ~z$r_buff1_thd2~0_In-2035653268 256) 0)) (.cse1 (= |P1Thread1of1ForFork2_#t~ite9_Out-2035653268| |P1Thread1of1ForFork2_#t~ite10_Out-2035653268|))) (or (and (not .cse0) (= |P1Thread1of1ForFork2_#t~ite9_Out-2035653268| ~z$w_buff1~0_In-2035653268) .cse1 (not .cse2)) (and (or .cse0 .cse2) (= |P1Thread1of1ForFork2_#t~ite9_Out-2035653268| ~z~0_In-2035653268) .cse1))) InVars {~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-2035653268, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-2035653268, ~z$w_buff1~0=~z$w_buff1~0_In-2035653268, ~z~0=~z~0_In-2035653268} OutVars{P1Thread1of1ForFork2_#t~ite9=|P1Thread1of1ForFork2_#t~ite9_Out-2035653268|, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-2035653268, P1Thread1of1ForFork2_#t~ite10=|P1Thread1of1ForFork2_#t~ite10_Out-2035653268|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-2035653268, ~z$w_buff1~0=~z$w_buff1~0_In-2035653268, ~z~0=~z~0_In-2035653268} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite9, P1Thread1of1ForFork2_#t~ite10] because there is no mapped edge [2019-12-27 16:05:59,737 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [848] [848] L769-->L769-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff0_thd2~0_In-167754557 256))) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In-167754557 256)))) (or (and (or .cse0 .cse1) (= |P1Thread1of1ForFork2_#t~ite11_Out-167754557| ~z$w_buff0_used~0_In-167754557)) (and (not .cse0) (not .cse1) (= |P1Thread1of1ForFork2_#t~ite11_Out-167754557| 0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-167754557, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-167754557} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-167754557, P1Thread1of1ForFork2_#t~ite11=|P1Thread1of1ForFork2_#t~ite11_Out-167754557|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-167754557} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite11] because there is no mapped edge [2019-12-27 16:05:59,738 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [834] [834] L770-->L770-2: Formula: (let ((.cse1 (= (mod ~z$r_buff0_thd2~0_In-1504220102 256) 0)) (.cse0 (= (mod ~z$w_buff0_used~0_In-1504220102 256) 0)) (.cse2 (= 0 (mod ~z$r_buff1_thd2~0_In-1504220102 256))) (.cse3 (= (mod ~z$w_buff1_used~0_In-1504220102 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P1Thread1of1ForFork2_#t~ite12_Out-1504220102| 0)) (and (or .cse1 .cse0) (= |P1Thread1of1ForFork2_#t~ite12_Out-1504220102| ~z$w_buff1_used~0_In-1504220102) (or .cse2 .cse3)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1504220102, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-1504220102, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1504220102, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1504220102} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1504220102, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-1504220102, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1504220102, P1Thread1of1ForFork2_#t~ite12=|P1Thread1of1ForFork2_#t~ite12_Out-1504220102|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1504220102} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite12] because there is no mapped edge [2019-12-27 16:05:59,738 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [860] [860] L829-1-->L831: Formula: (and (not (= 0 |v_ULTIMATE.start_main_~#t423~0.base_10|)) (= |v_#valid_32| (store |v_#valid_33| |v_ULTIMATE.start_main_~#t423~0.base_10| 1)) (= (select |v_#valid_33| |v_ULTIMATE.start_main_~#t423~0.base_10|) 0) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t423~0.base_10| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t423~0.base_10|) |v_ULTIMATE.start_main_~#t423~0.offset_9| 2)) |v_#memory_int_11|) (= (store |v_#length_14| |v_ULTIMATE.start_main_~#t423~0.base_10| 4) |v_#length_13|) (< |v_#StackHeapBarrier_9| |v_ULTIMATE.start_main_~#t423~0.base_10|) (= 0 |v_ULTIMATE.start_main_~#t423~0.offset_9|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_33|, #memory_int=|v_#memory_int_12|, #length=|v_#length_14|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_32|, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_5|, #memory_int=|v_#memory_int_11|, ULTIMATE.start_main_~#t423~0.base=|v_ULTIMATE.start_main_~#t423~0.base_10|, #length=|v_#length_13|, ULTIMATE.start_main_~#t423~0.offset=|v_ULTIMATE.start_main_~#t423~0.offset_9|} AuxVars[] AssignedVars[#valid, ULTIMATE.start_main_#t~nondet45, #memory_int, ULTIMATE.start_main_~#t423~0.base, #length, ULTIMATE.start_main_~#t423~0.offset] because there is no mapped edge [2019-12-27 16:05:59,742 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [882] [882] L793-->L793-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In-46152458 256) 0))) (or (and (= |P2Thread1of1ForFork0_#t~ite20_In-46152458| |P2Thread1of1ForFork0_#t~ite20_Out-46152458|) (= |P2Thread1of1ForFork0_#t~ite21_Out-46152458| ~z$w_buff0~0_In-46152458) (not .cse0)) (and (let ((.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In-46152458 256)))) (or (and (= (mod ~z$w_buff1_used~0_In-46152458 256) 0) .cse1) (and (= 0 (mod ~z$r_buff1_thd3~0_In-46152458 256)) .cse1) (= (mod ~z$w_buff0_used~0_In-46152458 256) 0))) (= |P2Thread1of1ForFork0_#t~ite21_Out-46152458| |P2Thread1of1ForFork0_#t~ite20_Out-46152458|) .cse0 (= |P2Thread1of1ForFork0_#t~ite20_Out-46152458| ~z$w_buff0~0_In-46152458)))) InVars {~z$w_buff0~0=~z$w_buff0~0_In-46152458, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-46152458, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-46152458, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-46152458, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-46152458, P2Thread1of1ForFork0_#t~ite20=|P2Thread1of1ForFork0_#t~ite20_In-46152458|, ~weak$$choice2~0=~weak$$choice2~0_In-46152458} OutVars{P2Thread1of1ForFork0_#t~ite21=|P2Thread1of1ForFork0_#t~ite21_Out-46152458|, ~z$w_buff0~0=~z$w_buff0~0_In-46152458, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-46152458, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-46152458, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-46152458, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-46152458, P2Thread1of1ForFork0_#t~ite20=|P2Thread1of1ForFork0_#t~ite20_Out-46152458|, ~weak$$choice2~0=~weak$$choice2~0_In-46152458} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite21, P2Thread1of1ForFork0_#t~ite20] because there is no mapped edge [2019-12-27 16:05:59,744 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [880] [880] L794-->L794-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In-773194282 256) 0))) (or (and (= |P2Thread1of1ForFork0_#t~ite24_Out-773194282| ~z$w_buff1~0_In-773194282) (= |P2Thread1of1ForFork0_#t~ite23_In-773194282| |P2Thread1of1ForFork0_#t~ite23_Out-773194282|) (not .cse0)) (and (= |P2Thread1of1ForFork0_#t~ite24_Out-773194282| |P2Thread1of1ForFork0_#t~ite23_Out-773194282|) (= ~z$w_buff1~0_In-773194282 |P2Thread1of1ForFork0_#t~ite23_Out-773194282|) .cse0 (let ((.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In-773194282 256)))) (or (and .cse1 (= (mod ~z$r_buff1_thd3~0_In-773194282 256) 0)) (and .cse1 (= 0 (mod ~z$w_buff1_used~0_In-773194282 256))) (= 0 (mod ~z$w_buff0_used~0_In-773194282 256))))))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-773194282, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-773194282, P2Thread1of1ForFork0_#t~ite23=|P2Thread1of1ForFork0_#t~ite23_In-773194282|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-773194282, ~z$w_buff1~0=~z$w_buff1~0_In-773194282, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-773194282, ~weak$$choice2~0=~weak$$choice2~0_In-773194282} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-773194282, P2Thread1of1ForFork0_#t~ite23=|P2Thread1of1ForFork0_#t~ite23_Out-773194282|, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-773194282, P2Thread1of1ForFork0_#t~ite24=|P2Thread1of1ForFork0_#t~ite24_Out-773194282|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-773194282, ~z$w_buff1~0=~z$w_buff1~0_In-773194282, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-773194282, ~weak$$choice2~0=~weak$$choice2~0_In-773194282} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite23, P2Thread1of1ForFork0_#t~ite24] because there is no mapped edge [2019-12-27 16:05:59,749 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [824] [824] L797-->L798: Formula: (and (not (= (mod v_~weak$$choice2~0_37 256) 0)) (= v_~z$r_buff0_thd3~0_160 v_~z$r_buff0_thd3~0_161)) InVars {~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_161, ~weak$$choice2~0=v_~weak$$choice2~0_37} OutVars{P2Thread1of1ForFork0_#t~ite33=|v_P2Thread1of1ForFork0_#t~ite33_8|, P2Thread1of1ForFork0_#t~ite32=|v_P2Thread1of1ForFork0_#t~ite32_9|, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_160, P2Thread1of1ForFork0_#t~ite31=|v_P2Thread1of1ForFork0_#t~ite31_12|, ~weak$$choice2~0=v_~weak$$choice2~0_37} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite33, P2Thread1of1ForFork0_#t~ite32, ~z$r_buff0_thd3~0, P2Thread1of1ForFork0_#t~ite31] because there is no mapped edge [2019-12-27 16:05:59,751 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [821] [821] L800-->L804: Formula: (and (= v_~z~0_54 v_~z$mem_tmp~0_7) (not (= 0 (mod v_~z$flush_delayed~0_10 256))) (= 0 v_~z$flush_delayed~0_9)) InVars {~z$mem_tmp~0=v_~z$mem_tmp~0_7, ~z$flush_delayed~0=v_~z$flush_delayed~0_10} OutVars{P2Thread1of1ForFork0_#t~ite37=|v_P2Thread1of1ForFork0_#t~ite37_7|, ~z$mem_tmp~0=v_~z$mem_tmp~0_7, ~z$flush_delayed~0=v_~z$flush_delayed~0_9, ~z~0=v_~z~0_54} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite37, ~z$flush_delayed~0, ~z~0] because there is no mapped edge [2019-12-27 16:05:59,753 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [829] [829] L804-2-->L804-4: Formula: (let ((.cse0 (= (mod ~z$w_buff1_used~0_In1762619022 256) 0)) (.cse1 (= 0 (mod ~z$r_buff1_thd3~0_In1762619022 256)))) (or (and (not .cse0) (= ~z$w_buff1~0_In1762619022 |P2Thread1of1ForFork0_#t~ite38_Out1762619022|) (not .cse1)) (and (= ~z~0_In1762619022 |P2Thread1of1ForFork0_#t~ite38_Out1762619022|) (or .cse0 .cse1)))) InVars {~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1762619022, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1762619022, ~z$w_buff1~0=~z$w_buff1~0_In1762619022, ~z~0=~z~0_In1762619022} OutVars{P2Thread1of1ForFork0_#t~ite38=|P2Thread1of1ForFork0_#t~ite38_Out1762619022|, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1762619022, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1762619022, ~z$w_buff1~0=~z$w_buff1~0_In1762619022, ~z~0=~z~0_In1762619022} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite38] because there is no mapped edge [2019-12-27 16:05:59,753 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [771] [771] L804-4-->L805: Formula: (= v_~z~0_30 |v_P2Thread1of1ForFork0_#t~ite38_10|) InVars {P2Thread1of1ForFork0_#t~ite38=|v_P2Thread1of1ForFork0_#t~ite38_10|} OutVars{P2Thread1of1ForFork0_#t~ite39=|v_P2Thread1of1ForFork0_#t~ite39_13|, P2Thread1of1ForFork0_#t~ite38=|v_P2Thread1of1ForFork0_#t~ite38_9|, ~z~0=v_~z~0_30} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite39, P2Thread1of1ForFork0_#t~ite38, ~z~0] because there is no mapped edge [2019-12-27 16:05:59,753 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [851] [851] L805-->L805-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff0_thd3~0_In971447835 256))) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In971447835 256)))) (or (and (not .cse0) (not .cse1) (= |P2Thread1of1ForFork0_#t~ite40_Out971447835| 0)) (and (= |P2Thread1of1ForFork0_#t~ite40_Out971447835| ~z$w_buff0_used~0_In971447835) (or .cse0 .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In971447835, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In971447835} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In971447835, P2Thread1of1ForFork0_#t~ite40=|P2Thread1of1ForFork0_#t~ite40_Out971447835|, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In971447835} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite40] because there is no mapped edge [2019-12-27 16:05:59,755 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [840] [840] L771-->L771-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In985517917 256))) (.cse0 (= 0 (mod ~z$r_buff0_thd2~0_In985517917 256)))) (or (and (or .cse0 .cse1) (= ~z$r_buff0_thd2~0_In985517917 |P1Thread1of1ForFork2_#t~ite13_Out985517917|)) (and (not .cse1) (= |P1Thread1of1ForFork2_#t~ite13_Out985517917| 0) (not .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In985517917, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In985517917} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In985517917, P1Thread1of1ForFork2_#t~ite13=|P1Thread1of1ForFork2_#t~ite13_Out985517917|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In985517917} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite13] because there is no mapped edge [2019-12-27 16:05:59,758 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [839] [839] L749-->L749-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff0_thd1~0_In602505607 256))) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In602505607 256)))) (or (and (= ~z$w_buff0_used~0_In602505607 |P0Thread1of1ForFork1_#t~ite5_Out602505607|) (or .cse0 .cse1)) (and (not .cse0) (not .cse1) (= |P0Thread1of1ForFork1_#t~ite5_Out602505607| 0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In602505607, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In602505607} OutVars{P0Thread1of1ForFork1_#t~ite5=|P0Thread1of1ForFork1_#t~ite5_Out602505607|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In602505607, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In602505607} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite5] because there is no mapped edge [2019-12-27 16:05:59,759 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [825] [825] L750-->L750-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In-545055444 256))) (.cse0 (= 0 (mod ~z$r_buff0_thd1~0_In-545055444 256))) (.cse3 (= 0 (mod ~z$r_buff1_thd1~0_In-545055444 256))) (.cse2 (= (mod ~z$w_buff1_used~0_In-545055444 256) 0))) (or (and (= 0 |P0Thread1of1ForFork1_#t~ite6_Out-545055444|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= ~z$w_buff1_used~0_In-545055444 |P0Thread1of1ForFork1_#t~ite6_Out-545055444|) (or .cse1 .cse0) (or .cse3 .cse2)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-545055444, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In-545055444, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-545055444, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-545055444} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-545055444, P0Thread1of1ForFork1_#t~ite6=|P0Thread1of1ForFork1_#t~ite6_Out-545055444|, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In-545055444, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-545055444, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-545055444} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite6] because there is no mapped edge [2019-12-27 16:05:59,760 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [832] [832] L751-->L752: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd1~0_In1424622380 256))) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In1424622380 256)))) (or (and (or .cse0 .cse1) (= ~z$r_buff0_thd1~0_In1424622380 ~z$r_buff0_thd1~0_Out1424622380)) (and (not .cse1) (not .cse0) (= 0 ~z$r_buff0_thd1~0_Out1424622380)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1424622380, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In1424622380} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1424622380, P0Thread1of1ForFork1_#t~ite7=|P0Thread1of1ForFork1_#t~ite7_Out1424622380|, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_Out1424622380} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite7, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-27 16:05:59,761 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [833] [833] L752-->L752-2: Formula: (let ((.cse2 (= (mod ~z$r_buff1_thd1~0_In335969312 256) 0)) (.cse3 (= (mod ~z$w_buff1_used~0_In335969312 256) 0)) (.cse0 (= (mod ~z$r_buff0_thd1~0_In335969312 256) 0)) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In335969312 256)))) (or (and (= |P0Thread1of1ForFork1_#t~ite8_Out335969312| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= |P0Thread1of1ForFork1_#t~ite8_Out335969312| ~z$r_buff1_thd1~0_In335969312) (or .cse2 .cse3) (or .cse0 .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In335969312, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In335969312, ~z$w_buff1_used~0=~z$w_buff1_used~0_In335969312, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In335969312} OutVars{P0Thread1of1ForFork1_#t~ite8=|P0Thread1of1ForFork1_#t~ite8_Out335969312|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In335969312, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In335969312, ~z$w_buff1_used~0=~z$w_buff1_used~0_In335969312, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In335969312} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite8] because there is no mapped edge [2019-12-27 16:05:59,761 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [878] [878] L752-2-->P0EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_46 1) v_~__unbuffered_cnt~0_45) (= 0 |v_P0Thread1of1ForFork1_#res.offset_5|) (= v_~z$r_buff1_thd1~0_77 |v_P0Thread1of1ForFork1_#t~ite8_24|) (= 0 |v_P0Thread1of1ForFork1_#res.base_5|)) InVars {P0Thread1of1ForFork1_#t~ite8=|v_P0Thread1of1ForFork1_#t~ite8_24|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_46} OutVars{P0Thread1of1ForFork1_#t~ite8=|v_P0Thread1of1ForFork1_#t~ite8_23|, P0Thread1of1ForFork1_#res.offset=|v_P0Thread1of1ForFork1_#res.offset_5|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_77, P0Thread1of1ForFork1_#res.base=|v_P0Thread1of1ForFork1_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_45} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite8, P0Thread1of1ForFork1_#res.offset, ~z$r_buff1_thd1~0, P0Thread1of1ForFork1_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-27 16:05:59,762 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [843] [843] L806-->L806-2: Formula: (let ((.cse0 (= (mod ~z$w_buff0_used~0_In1075332814 256) 0)) (.cse1 (= (mod ~z$r_buff0_thd3~0_In1075332814 256) 0)) (.cse2 (= 0 (mod ~z$r_buff1_thd3~0_In1075332814 256))) (.cse3 (= (mod ~z$w_buff1_used~0_In1075332814 256) 0))) (or (and (= |P2Thread1of1ForFork0_#t~ite41_Out1075332814| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P2Thread1of1ForFork0_#t~ite41_Out1075332814| ~z$w_buff1_used~0_In1075332814)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1075332814, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1075332814, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1075332814, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1075332814} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1075332814, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1075332814, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1075332814, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1075332814, P2Thread1of1ForFork0_#t~ite41=|P2Thread1of1ForFork0_#t~ite41_Out1075332814|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite41] because there is no mapped edge [2019-12-27 16:05:59,763 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [847] [847] L807-->L807-2: Formula: (let ((.cse0 (= (mod ~z$r_buff0_thd3~0_In-611402943 256) 0)) (.cse1 (= (mod ~z$w_buff0_used~0_In-611402943 256) 0))) (or (and (or .cse0 .cse1) (= ~z$r_buff0_thd3~0_In-611402943 |P2Thread1of1ForFork0_#t~ite42_Out-611402943|)) (and (not .cse0) (= 0 |P2Thread1of1ForFork0_#t~ite42_Out-611402943|) (not .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-611402943, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-611402943} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-611402943, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-611402943, P2Thread1of1ForFork0_#t~ite42=|P2Thread1of1ForFork0_#t~ite42_Out-611402943|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite42] because there is no mapped edge [2019-12-27 16:05:59,764 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [841] [841] L808-->L808-2: Formula: (let ((.cse3 (= (mod ~z$w_buff0_used~0_In1164682312 256) 0)) (.cse2 (= 0 (mod ~z$r_buff0_thd3~0_In1164682312 256))) (.cse0 (= 0 (mod ~z$w_buff1_used~0_In1164682312 256))) (.cse1 (= 0 (mod ~z$r_buff1_thd3~0_In1164682312 256)))) (or (and (= 0 |P2Thread1of1ForFork0_#t~ite43_Out1164682312|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse3 .cse2) (= ~z$r_buff1_thd3~0_In1164682312 |P2Thread1of1ForFork0_#t~ite43_Out1164682312|) (or .cse0 .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1164682312, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1164682312, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1164682312, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1164682312} OutVars{P2Thread1of1ForFork0_#t~ite43=|P2Thread1of1ForFork0_#t~ite43_Out1164682312|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1164682312, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1164682312, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1164682312, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1164682312} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite43] because there is no mapped edge [2019-12-27 16:05:59,764 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [873] [873] L808-2-->P2EXIT: Formula: (and (= |v_P2Thread1of1ForFork0_#res.offset_5| 0) (= (+ v_~__unbuffered_cnt~0_39 1) v_~__unbuffered_cnt~0_38) (= v_~z$r_buff1_thd3~0_131 |v_P2Thread1of1ForFork0_#t~ite43_26|) (= |v_P2Thread1of1ForFork0_#res.base_5| 0)) InVars {P2Thread1of1ForFork0_#t~ite43=|v_P2Thread1of1ForFork0_#t~ite43_26|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_39} OutVars{P2Thread1of1ForFork0_#res.base=|v_P2Thread1of1ForFork0_#res.base_5|, P2Thread1of1ForFork0_#t~ite43=|v_P2Thread1of1ForFork0_#t~ite43_25|, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_131, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_38, P2Thread1of1ForFork0_#res.offset=|v_P2Thread1of1ForFork0_#res.offset_5|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#res.base, P2Thread1of1ForFork0_#t~ite43, ~z$r_buff1_thd3~0, ~__unbuffered_cnt~0, P2Thread1of1ForFork0_#res.offset] because there is no mapped edge [2019-12-27 16:05:59,764 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [831] [831] L772-->L772-2: Formula: (let ((.cse1 (= (mod ~z$w_buff1_used~0_In859736490 256) 0)) (.cse0 (= (mod ~z$r_buff1_thd2~0_In859736490 256) 0)) (.cse2 (= 0 (mod ~z$w_buff0_used~0_In859736490 256))) (.cse3 (= 0 (mod ~z$r_buff0_thd2~0_In859736490 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P1Thread1of1ForFork2_#t~ite14_Out859736490| ~z$r_buff1_thd2~0_In859736490)) (and (= |P1Thread1of1ForFork2_#t~ite14_Out859736490| 0) (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3)))))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In859736490, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In859736490, ~z$w_buff1_used~0=~z$w_buff1_used~0_In859736490, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In859736490} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In859736490, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In859736490, ~z$w_buff1_used~0=~z$w_buff1_used~0_In859736490, P1Thread1of1ForFork2_#t~ite14=|P1Thread1of1ForFork2_#t~ite14_Out859736490|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In859736490} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite14] because there is no mapped edge [2019-12-27 16:05:59,765 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [867] [867] L772-2-->P1EXIT: Formula: (and (= v_~__unbuffered_cnt~0_32 (+ v_~__unbuffered_cnt~0_33 1)) (= |v_P1Thread1of1ForFork2_#t~ite14_26| v_~z$r_buff1_thd2~0_56) (= 0 |v_P1Thread1of1ForFork2_#res.offset_5|) (= 0 |v_P1Thread1of1ForFork2_#res.base_5|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_33, P1Thread1of1ForFork2_#t~ite14=|v_P1Thread1of1ForFork2_#t~ite14_26|} OutVars{P1Thread1of1ForFork2_#res.offset=|v_P1Thread1of1ForFork2_#res.offset_5|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_56, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_32, P1Thread1of1ForFork2_#t~ite14=|v_P1Thread1of1ForFork2_#t~ite14_25|, P1Thread1of1ForFork2_#res.base=|v_P1Thread1of1ForFork2_#res.base_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#res.offset, ~z$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork2_#t~ite14, P1Thread1of1ForFork2_#res.base] because there is no mapped edge [2019-12-27 16:05:59,766 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [800] [800] L835-->L837-2: Formula: (and (or (= 0 (mod v_~z$r_buff0_thd0~0_51 256)) (= 0 (mod v_~z$w_buff0_used~0_293 256))) (not (= (mod v_~main$tmp_guard0~0_8 256) 0))) InVars {~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_51, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_293, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_8} OutVars{~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_51, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_293, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_8} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-27 16:05:59,766 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [828] [828] L837-2-->L837-4: Formula: (let ((.cse1 (= (mod ~z$w_buff1_used~0_In50835319 256) 0)) (.cse0 (= 0 (mod ~z$r_buff1_thd0~0_In50835319 256)))) (or (and (not .cse0) (= |ULTIMATE.start_main_#t~ite47_Out50835319| ~z$w_buff1~0_In50835319) (not .cse1)) (and (= |ULTIMATE.start_main_#t~ite47_Out50835319| ~z~0_In50835319) (or .cse1 .cse0)))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In50835319, ~z$w_buff1_used~0=~z$w_buff1_used~0_In50835319, ~z$w_buff1~0=~z$w_buff1~0_In50835319, ~z~0=~z~0_In50835319} OutVars{~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In50835319, ULTIMATE.start_main_#t~ite47=|ULTIMATE.start_main_#t~ite47_Out50835319|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In50835319, ~z$w_buff1~0=~z$w_buff1~0_In50835319, ~z~0=~z~0_In50835319} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite47] because there is no mapped edge [2019-12-27 16:05:59,767 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [762] [762] L837-4-->L838: Formula: (= v_~z~0_20 |v_ULTIMATE.start_main_#t~ite47_11|) InVars {ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_11|} OutVars{ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_10|, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_14|, ~z~0=v_~z~0_20} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite47, ULTIMATE.start_main_#t~ite48, ~z~0] because there is no mapped edge [2019-12-27 16:05:59,767 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [842] [842] L838-->L838-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In1787626736 256))) (.cse1 (= (mod ~z$r_buff0_thd0~0_In1787626736 256) 0))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite49_Out1787626736| ~z$w_buff0_used~0_In1787626736)) (and (not .cse0) (= |ULTIMATE.start_main_#t~ite49_Out1787626736| 0) (not .cse1)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1787626736, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1787626736} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1787626736, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1787626736, ULTIMATE.start_main_#t~ite49=|ULTIMATE.start_main_#t~ite49_Out1787626736|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite49] because there is no mapped edge [2019-12-27 16:05:59,768 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [835] [835] L839-->L839-2: Formula: (let ((.cse3 (= (mod ~z$w_buff0_used~0_In899938650 256) 0)) (.cse2 (= 0 (mod ~z$r_buff0_thd0~0_In899938650 256))) (.cse1 (= 0 (mod ~z$w_buff1_used~0_In899938650 256))) (.cse0 (= 0 (mod ~z$r_buff1_thd0~0_In899938650 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |ULTIMATE.start_main_#t~ite50_Out899938650| ~z$w_buff1_used~0_In899938650)) (and (= |ULTIMATE.start_main_#t~ite50_Out899938650| 0) (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0)))))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In899938650, ~z$w_buff0_used~0=~z$w_buff0_used~0_In899938650, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In899938650, ~z$w_buff1_used~0=~z$w_buff1_used~0_In899938650} OutVars{ULTIMATE.start_main_#t~ite50=|ULTIMATE.start_main_#t~ite50_Out899938650|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In899938650, ~z$w_buff0_used~0=~z$w_buff0_used~0_In899938650, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In899938650, ~z$w_buff1_used~0=~z$w_buff1_used~0_In899938650} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite50] because there is no mapped edge [2019-12-27 16:05:59,770 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [846] [846] L840-->L840-2: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In-1050655637 256) 0)) (.cse0 (= 0 (mod ~z$r_buff0_thd0~0_In-1050655637 256)))) (or (and (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite51_Out-1050655637|) (not .cse1)) (and (= ~z$r_buff0_thd0~0_In-1050655637 |ULTIMATE.start_main_#t~ite51_Out-1050655637|) (or .cse1 .cse0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1050655637, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1050655637} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1050655637, ULTIMATE.start_main_#t~ite51=|ULTIMATE.start_main_#t~ite51_Out-1050655637|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1050655637} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite51] because there is no mapped edge [2019-12-27 16:05:59,771 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [837] [837] L841-->L841-2: Formula: (let ((.cse2 (= 0 (mod ~z$r_buff1_thd0~0_In811789828 256))) (.cse3 (= 0 (mod ~z$w_buff1_used~0_In811789828 256))) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In811789828 256))) (.cse1 (= (mod ~z$r_buff0_thd0~0_In811789828 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite52_Out811789828|)) (and (or .cse2 .cse3) (or .cse0 .cse1) (= ~z$r_buff1_thd0~0_In811789828 |ULTIMATE.start_main_#t~ite52_Out811789828|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In811789828, ~z$w_buff0_used~0=~z$w_buff0_used~0_In811789828, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In811789828, ~z$w_buff1_used~0=~z$w_buff1_used~0_In811789828} OutVars{ULTIMATE.start_main_#t~ite52=|ULTIMATE.start_main_#t~ite52_Out811789828|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In811789828, ~z$w_buff0_used~0=~z$w_buff0_used~0_In811789828, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In811789828, ~z$w_buff1_used~0=~z$w_buff1_used~0_In811789828} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52] because there is no mapped edge [2019-12-27 16:05:59,771 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [896] [896] L841-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= 0 v_~__unbuffered_p0_EAX~0_72) (= v_~z$r_buff1_thd0~0_123 |v_ULTIMATE.start_main_#t~ite52_43|) (= v_~__unbuffered_p2_EBX~0_32 0) (= v_ULTIMATE.start___VERIFIER_assert_~expression_19 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_13|) (= 0 v_~__unbuffered_p1_EAX~0_34) (= v_~main$tmp_guard1~0_23 0) (= v_ULTIMATE.start___VERIFIER_assert_~expression_19 0) (= 1 v_~__unbuffered_p2_EAX~0_25)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_72, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_43|, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_32, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_34, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_25} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_72, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_42|, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_19, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_32, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_34, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_123, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_23, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_25, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_13|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52, ULTIMATE.start___VERIFIER_assert_~expression, ~z$r_buff1_thd0~0, ~main$tmp_guard1~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-27 16:05:59,892 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 04:05:59 BasicIcfg [2019-12-27 16:05:59,892 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 16:05:59,895 INFO L168 Benchmark]: Toolchain (without parser) took 187569.10 ms. Allocated memory was 136.3 MB in the beginning and 3.4 GB in the end (delta: 3.3 GB). Free memory was 98.3 MB in the beginning and 2.5 GB in the end (delta: -2.4 GB). Peak memory consumption was 898.6 MB. Max. memory is 7.1 GB. [2019-12-27 16:05:59,895 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 136.3 MB. Free memory was 118.2 MB in the beginning and 118.0 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-12-27 16:05:59,896 INFO L168 Benchmark]: CACSL2BoogieTranslator took 772.24 ms. Allocated memory was 136.3 MB in the beginning and 199.8 MB in the end (delta: 63.4 MB). Free memory was 97.9 MB in the beginning and 153.0 MB in the end (delta: -55.1 MB). Peak memory consumption was 24.8 MB. Max. memory is 7.1 GB. [2019-12-27 16:05:59,896 INFO L168 Benchmark]: Boogie Procedure Inliner took 71.94 ms. Allocated memory is still 199.8 MB. Free memory was 153.0 MB in the beginning and 150.2 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. [2019-12-27 16:05:59,899 INFO L168 Benchmark]: Boogie Preprocessor took 45.13 ms. Allocated memory is still 199.8 MB. Free memory was 150.2 MB in the beginning and 148.1 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. [2019-12-27 16:05:59,900 INFO L168 Benchmark]: RCFGBuilder took 851.40 ms. Allocated memory is still 199.8 MB. Free memory was 148.1 MB in the beginning and 97.6 MB in the end (delta: 50.5 MB). Peak memory consumption was 50.5 MB. Max. memory is 7.1 GB. [2019-12-27 16:05:59,900 INFO L168 Benchmark]: TraceAbstraction took 185822.21 ms. Allocated memory was 199.8 MB in the beginning and 3.4 GB in the end (delta: 3.2 GB). Free memory was 96.9 MB in the beginning and 2.5 GB in the end (delta: -2.4 GB). Peak memory consumption was 833.7 MB. Max. memory is 7.1 GB. [2019-12-27 16:05:59,910 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.19 ms. Allocated memory is still 136.3 MB. Free memory was 118.2 MB in the beginning and 118.0 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 772.24 ms. Allocated memory was 136.3 MB in the beginning and 199.8 MB in the end (delta: 63.4 MB). Free memory was 97.9 MB in the beginning and 153.0 MB in the end (delta: -55.1 MB). Peak memory consumption was 24.8 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 71.94 ms. Allocated memory is still 199.8 MB. Free memory was 153.0 MB in the beginning and 150.2 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 45.13 ms. Allocated memory is still 199.8 MB. Free memory was 150.2 MB in the beginning and 148.1 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 851.40 ms. Allocated memory is still 199.8 MB. Free memory was 148.1 MB in the beginning and 97.6 MB in the end (delta: 50.5 MB). Peak memory consumption was 50.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 185822.21 ms. Allocated memory was 199.8 MB in the beginning and 3.4 GB in the end (delta: 3.2 GB). Free memory was 96.9 MB in the beginning and 2.5 GB in the end (delta: -2.4 GB). Peak memory consumption was 833.7 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 6.0s, 177 ProgramPointsBefore, 92 ProgramPointsAfterwards, 214 TransitionsBefore, 101 TransitionsAfterwards, 19004 CoEnabledTransitionPairs, 8 FixpointIterations, 34 TrivialSequentialCompositions, 51 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 34 ConcurrentYvCompositions, 32 ChoiceCompositions, 7082 VarBasedMoverChecksPositive, 219 VarBasedMoverChecksNegative, 19 SemBasedMoverChecksPositive, 262 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.6s, 0 MoverChecksTotal, 89688 CheckedPairsTotal, 119 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L827] FCALL, FORK 0 pthread_create(&t421, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L733] 1 z$w_buff1 = z$w_buff0 [L734] 1 z$w_buff0 = 1 [L735] 1 z$w_buff1_used = z$w_buff0_used [L736] 1 z$w_buff0_used = (_Bool)1 [L829] FCALL, FORK 0 pthread_create(&t422, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_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, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L762] 2 x = 1 [L765] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_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=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L768] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_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=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L768] 2 z = z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L769] 2 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L831] FCALL, FORK 0 pthread_create(&t423, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __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=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used=0, z$w_buff1=0, z$w_buff1_used=0] [L782] 3 y = 1 [L785] 3 __unbuffered_p2_EAX = y [L788] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L789] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L790] 3 z$flush_delayed = weak$$choice2 [L791] 3 z$mem_tmp = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_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=9, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used=0, z$w_buff1=0, z$w_buff1_used=0] [L792] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) VAL [!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_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=9, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used=0, z$w_buff1=0, z$w_buff1_used=0] [L792] 3 z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L793] 3 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L794] 3 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L795] EXPR 3 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_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=9, weak$$choice2=1, weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used))=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used=0, z$w_buff1=0, z$w_buff1_used=0] [L795] 3 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L796] EXPR 3 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_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=9, weak$$choice2=1, weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))=0, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used=0, z$w_buff1=0, z$w_buff1_used=0] [L796] 3 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L798] EXPR 3 weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_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=9, weak$$choice2=1, weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))=0, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used=0, z$w_buff1=0, z$w_buff1_used=0] [L798] 3 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L799] 3 __unbuffered_p2_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_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=9, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used=0, z$w_buff1=0, z$w_buff1_used=0] [L804] 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_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=9, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used=0, z$w_buff1=0, z$w_buff1_used=0] [L770] 2 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L771] 2 z$r_buff0_thd2 = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L748] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_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=9, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L748] 1 z = z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L749] 1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L750] 1 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L805] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L806] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L807] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L833] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_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=9, weak$$choice2=1, x=1, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L838] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L839] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L840] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 168 locations, 2 error locations. Result: UNSAFE, OverallTime: 185.4s, OverallIterations: 25, TraceHistogramMax: 1, AutomataDifference: 68.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 4354 SDtfs, 4769 SDslu, 8164 SDs, 0 SdLazy, 4504 SolverSat, 184 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 203 GetRequests, 54 SyntacticMatches, 26 SemanticMatches, 123 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 190 ImplicationChecksByTransitivity, 1.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=183252occurred in iteration=4, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 90.7s AutomataMinimizationTime, 24 MinimizatonAttempts, 320716 StatesRemovedByMinimization, 22 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.4s InterpolantComputationTime, 775 NumberOfCodeBlocks, 775 NumberOfCodeBlocksAsserted, 25 NumberOfCheckSat, 684 ConstructedInterpolants, 0 QuantifiedInterpolants, 66698 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 24 InterpolantComputations, 24 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...