/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.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix023_power.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 01:50:42,887 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 01:50:42,890 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 01:50:42,910 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 01:50:42,910 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 01:50:42,913 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 01:50:42,915 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 01:50:42,925 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 01:50:42,929 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 01:50:42,933 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 01:50:42,935 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 01:50:42,936 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 01:50:42,937 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 01:50:42,938 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 01:50:42,941 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 01:50:42,942 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 01:50:42,943 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 01:50:42,944 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 01:50:42,946 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 01:50:42,950 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 01:50:42,955 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 01:50:42,959 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 01:50:42,960 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 01:50:42,961 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 01:50:42,963 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 01:50:42,963 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 01:50:42,963 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 01:50:42,965 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 01:50:42,967 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 01:50:42,968 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 01:50:42,968 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 01:50:42,970 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 01:50:42,971 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 01:50:42,972 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 01:50:42,973 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 01:50:42,973 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 01:50:42,974 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 01:50:42,974 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 01:50:42,974 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 01:50:42,975 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 01:50:42,976 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 01:50:42,977 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.epf [2019-12-27 01:50:42,999 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 01:50:42,999 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 01:50:43,001 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 01:50:43,001 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 01:50:43,001 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 01:50:43,001 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 01:50:43,004 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 01:50:43,004 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 01:50:43,004 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 01:50:43,004 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 01:50:43,005 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 01:50:43,005 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 01:50:43,005 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 01:50:43,005 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 01:50:43,005 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 01:50:43,005 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 01:50:43,006 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 01:50:43,006 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 01:50:43,006 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 01:50:43,006 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 01:50:43,006 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 01:50:43,008 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 01:50:43,008 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 01:50:43,009 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 01:50:43,011 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 01:50:43,011 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 01:50:43,011 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 01:50:43,011 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 01:50:43,012 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 01:50:43,292 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 01:50:43,304 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 01:50:43,308 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 01:50:43,309 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 01:50:43,310 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 01:50:43,310 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix023_power.opt.i [2019-12-27 01:50:43,379 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/443d1c38a/a6be7d871b35471f9199a9a4bcb6f9f9/FLAGffbdd4f65 [2019-12-27 01:50:43,973 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 01:50:43,976 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix023_power.opt.i [2019-12-27 01:50:43,998 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/443d1c38a/a6be7d871b35471f9199a9a4bcb6f9f9/FLAGffbdd4f65 [2019-12-27 01:50:44,288 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/443d1c38a/a6be7d871b35471f9199a9a4bcb6f9f9 [2019-12-27 01:50:44,297 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 01:50:44,298 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 01:50:44,299 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 01:50:44,299 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 01:50:44,302 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 01:50:44,302 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 01:50:44" (1/1) ... [2019-12-27 01:50:44,305 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@d47e9c9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 01:50:44, skipping insertion in model container [2019-12-27 01:50:44,306 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 01:50:44" (1/1) ... [2019-12-27 01:50:44,313 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 01:50:44,377 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 01:50:44,911 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 01:50:44,924 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 01:50:44,999 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 01:50:45,072 INFO L208 MainTranslator]: Completed translation [2019-12-27 01:50:45,073 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 01:50:45 WrapperNode [2019-12-27 01:50:45,073 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 01:50:45,074 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 01:50:45,074 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 01:50:45,074 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 01:50:45,082 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 01:50:45" (1/1) ... [2019-12-27 01:50:45,103 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 01:50:45" (1/1) ... [2019-12-27 01:50:45,136 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 01:50:45,136 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 01:50:45,136 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 01:50:45,136 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 01:50:45,146 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 01:50:45" (1/1) ... [2019-12-27 01:50:45,146 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 01:50:45" (1/1) ... [2019-12-27 01:50:45,151 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 01:50:45" (1/1) ... [2019-12-27 01:50:45,152 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 01:50:45" (1/1) ... [2019-12-27 01:50:45,163 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 01:50:45" (1/1) ... [2019-12-27 01:50:45,167 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 01:50:45" (1/1) ... [2019-12-27 01:50:45,171 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 01:50:45" (1/1) ... [2019-12-27 01:50:45,177 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 01:50:45,177 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 01:50:45,177 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 01:50:45,177 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 01:50:45,178 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 01:50:45" (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 01:50:45,242 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 01:50:45,242 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 01:50:45,242 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 01:50:45,242 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 01:50:45,243 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 01:50:45,243 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 01:50:45,243 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 01:50:45,243 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 01:50:45,243 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-27 01:50:45,243 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-27 01:50:45,244 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2019-12-27 01:50:45,244 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2019-12-27 01:50:45,244 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 01:50:45,244 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 01:50:45,244 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 01:50:45,246 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 01:50:46,015 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 01:50:46,016 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 01:50:46,017 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 01:50:46 BoogieIcfgContainer [2019-12-27 01:50:46,017 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 01:50:46,019 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 01:50:46,019 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 01:50:46,022 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 01:50:46,023 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 01:50:44" (1/3) ... [2019-12-27 01:50:46,024 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@424f911d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 01:50:46, skipping insertion in model container [2019-12-27 01:50:46,024 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 01:50:45" (2/3) ... [2019-12-27 01:50:46,024 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@424f911d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 01:50:46, skipping insertion in model container [2019-12-27 01:50:46,025 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 01:50:46" (3/3) ... [2019-12-27 01:50:46,027 INFO L109 eAbstractionObserver]: Analyzing ICFG mix023_power.opt.i [2019-12-27 01:50:46,039 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 01:50:46,039 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 01:50:46,047 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 01:50:46,048 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 01:50:46,092 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:46,092 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:46,092 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:46,093 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:46,093 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:46,094 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:46,095 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:46,095 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:46,095 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:46,095 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:46,096 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:46,096 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:46,096 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:46,096 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:46,097 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:46,097 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:46,097 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:46,098 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:46,098 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:46,098 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:46,098 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:46,099 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:46,099 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:46,099 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:46,100 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:46,100 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:46,100 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:46,100 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:46,101 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:46,101 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:46,101 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:46,101 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:46,102 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:46,102 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:46,102 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:46,102 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:46,103 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:46,103 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:46,125 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:46,126 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:46,127 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:46,128 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:46,128 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:46,128 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:46,129 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:46,129 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:46,129 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:46,129 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:46,129 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:46,129 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:46,130 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:46,130 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:46,130 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:46,130 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:46,131 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:46,131 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:46,131 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:46,131 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:46,131 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:46,132 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:46,132 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:46,132 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:46,132 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:46,132 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:46,133 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:46,136 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:46,136 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:46,136 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:46,137 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:46,138 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:46,139 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:46,139 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:46,139 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:46,139 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:46,140 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:46,140 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:46,141 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:46,141 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:46,141 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:46,142 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:46,142 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:46,143 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:46,143 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:46,143 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:46,144 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:46,144 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:46,145 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:46,145 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:46,145 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:46,145 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:46,145 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:46,145 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:46,146 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:46,146 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:46,146 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:46,146 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:46,147 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:46,147 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:46,147 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:46,147 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:46,149 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:46,153 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:46,153 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:46,154 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:46,154 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:46,156 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:46,156 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:46,158 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:46,158 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:46,158 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:46,158 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:46,159 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:46,159 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:46,159 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:46,159 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:46,159 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:46,160 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:46,160 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:46,161 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:46,161 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:46,161 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:46,161 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:46,161 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:46,163 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:46,163 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:46,163 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:46,163 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:46,164 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:46,164 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:46,164 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:46,164 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:46,164 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:46,165 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:46,165 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:46,165 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:46,165 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:46,166 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:46,166 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:46,167 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:46,167 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:46,167 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:46,167 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:46,167 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:46,168 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:46,168 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:46,168 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:46,168 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:46,168 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:46,168 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:46,169 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:46,169 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:46,172 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:46,172 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:46,172 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:46,173 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:46,173 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:46,173 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:46,173 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:46,173 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:46,174 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:46,174 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:46,174 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:46,174 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:46,174 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:46,180 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:46,180 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:46,181 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:46,182 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:46,182 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:46,183 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:46,184 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:46,184 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:46,184 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:46,184 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:46,188 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:46,188 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:46,188 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:46,188 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:46,190 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:46,190 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:46,191 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:46,191 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:46,191 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:46,191 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:46,191 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:46,191 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:46,192 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:46,192 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:46,192 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:46,192 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:46,193 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:46,193 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:46,193 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:46,193 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:46,193 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:46,193 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:46,194 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:46,194 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:46,194 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:46,194 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:46,194 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:46,194 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:46,195 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:46,195 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:46,195 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:46,197 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:46,197 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:46,198 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:46,198 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:46,198 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:46,198 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:46,199 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:46,199 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:46,199 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:46,199 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:46,200 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:46,200 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:50:46,215 INFO L249 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2019-12-27 01:50:46,234 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 01:50:46,234 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 01:50:46,234 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 01:50:46,234 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-27 01:50:46,235 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 01:50:46,235 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 01:50:46,235 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 01:50:46,235 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 01:50:46,252 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 181 places, 209 transitions [2019-12-27 01:50:46,253 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 181 places, 209 transitions [2019-12-27 01:50:46,387 INFO L132 PetriNetUnfolder]: 41/205 cut-off events. [2019-12-27 01:50:46,387 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 01:50:46,402 INFO L76 FinitePrefix]: Finished finitePrefix Result has 218 conditions, 205 events. 41/205 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 442 event pairs. 0/162 useless extension candidates. Maximal degree in co-relation 172. Up to 2 conditions per place. [2019-12-27 01:50:46,424 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 181 places, 209 transitions [2019-12-27 01:50:46,479 INFO L132 PetriNetUnfolder]: 41/205 cut-off events. [2019-12-27 01:50:46,480 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 01:50:46,488 INFO L76 FinitePrefix]: Finished finitePrefix Result has 218 conditions, 205 events. 41/205 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 442 event pairs. 0/162 useless extension candidates. Maximal degree in co-relation 172. Up to 2 conditions per place. [2019-12-27 01:50:46,509 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 18126 [2019-12-27 01:50:46,510 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-27 01:50:52,175 WARN L192 SmtUtils]: Spent 306.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 97 [2019-12-27 01:50:52,336 WARN L192 SmtUtils]: Spent 158.00 ms on a formula simplification that was a NOOP. DAG size: 95 [2019-12-27 01:50:52,460 INFO L206 etLargeBlockEncoding]: Checked pairs total: 66461 [2019-12-27 01:50:52,461 INFO L214 etLargeBlockEncoding]: Total number of compositions: 123 [2019-12-27 01:50:52,464 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 88 places, 95 transitions [2019-12-27 01:51:26,606 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 160898 states. [2019-12-27 01:51:26,608 INFO L276 IsEmpty]: Start isEmpty. Operand 160898 states. [2019-12-27 01:51:26,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-12-27 01:51:26,615 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:51:26,616 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-12-27 01:51:26,616 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:51:26,622 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:51:26,623 INFO L82 PathProgramCache]: Analyzing trace with hash 406431864, now seen corresponding path program 1 times [2019-12-27 01:51:26,633 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:51:26,634 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [809768105] [2019-12-27 01:51:26,634 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:51:26,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:51:26,888 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 01:51:26,888 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [809768105] [2019-12-27 01:51:26,889 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:51:26,889 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 01:51:26,892 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [723509187] [2019-12-27 01:51:26,898 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 01:51:26,898 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:51:26,913 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 01:51:26,914 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 01:51:26,916 INFO L87 Difference]: Start difference. First operand 160898 states. Second operand 3 states. [2019-12-27 01:51:31,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:51:31,617 INFO L93 Difference]: Finished difference Result 158998 states and 767616 transitions. [2019-12-27 01:51:31,617 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 01:51:31,618 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2019-12-27 01:51:31,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:51:32,642 INFO L225 Difference]: With dead ends: 158998 [2019-12-27 01:51:32,644 INFO L226 Difference]: Without dead ends: 149254 [2019-12-27 01:51:32,646 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 01:51:41,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149254 states. [2019-12-27 01:51:48,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149254 to 149254. [2019-12-27 01:51:48,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149254 states. [2019-12-27 01:51:49,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149254 states to 149254 states and 719596 transitions. [2019-12-27 01:51:49,672 INFO L78 Accepts]: Start accepts. Automaton has 149254 states and 719596 transitions. Word has length 7 [2019-12-27 01:51:49,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:51:49,673 INFO L462 AbstractCegarLoop]: Abstraction has 149254 states and 719596 transitions. [2019-12-27 01:51:49,673 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 01:51:49,673 INFO L276 IsEmpty]: Start isEmpty. Operand 149254 states and 719596 transitions. [2019-12-27 01:51:49,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-27 01:51:49,685 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:51:49,685 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 01:51:49,685 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:51:49,686 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:51:49,686 INFO L82 PathProgramCache]: Analyzing trace with hash 1843730986, now seen corresponding path program 1 times [2019-12-27 01:51:49,686 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:51:49,686 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2046517428] [2019-12-27 01:51:49,686 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:51:49,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:51:49,758 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 01:51:49,759 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2046517428] [2019-12-27 01:51:49,759 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:51:49,759 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 01:51:49,759 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1907675505] [2019-12-27 01:51:49,761 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 01:51:49,761 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:51:49,761 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 01:51:49,762 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 01:51:49,762 INFO L87 Difference]: Start difference. First operand 149254 states and 719596 transitions. Second operand 3 states. [2019-12-27 01:51:55,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:51:55,608 INFO L93 Difference]: Finished difference Result 94546 states and 411602 transitions. [2019-12-27 01:51:55,608 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 01:51:55,609 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2019-12-27 01:51:55,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:51:56,109 INFO L225 Difference]: With dead ends: 94546 [2019-12-27 01:51:56,109 INFO L226 Difference]: Without dead ends: 94546 [2019-12-27 01:51:56,110 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 01:51:58,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94546 states. [2019-12-27 01:52:00,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94546 to 94546. [2019-12-27 01:52:00,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94546 states. [2019-12-27 01:52:00,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94546 states to 94546 states and 411602 transitions. [2019-12-27 01:52:00,590 INFO L78 Accepts]: Start accepts. Automaton has 94546 states and 411602 transitions. Word has length 15 [2019-12-27 01:52:00,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:52:00,591 INFO L462 AbstractCegarLoop]: Abstraction has 94546 states and 411602 transitions. [2019-12-27 01:52:00,591 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 01:52:00,591 INFO L276 IsEmpty]: Start isEmpty. Operand 94546 states and 411602 transitions. [2019-12-27 01:52:00,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-27 01:52:00,595 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:52:00,595 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 01:52:00,595 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:52:00,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:52:00,595 INFO L82 PathProgramCache]: Analyzing trace with hash -425966823, now seen corresponding path program 1 times [2019-12-27 01:52:00,595 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:52:00,596 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [606489469] [2019-12-27 01:52:00,596 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:52:00,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:52:00,690 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 01:52:00,690 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [606489469] [2019-12-27 01:52:00,690 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:52:00,690 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 01:52:00,691 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [155128171] [2019-12-27 01:52:00,691 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 01:52:00,691 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:52:00,692 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 01:52:00,692 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 01:52:00,692 INFO L87 Difference]: Start difference. First operand 94546 states and 411602 transitions. Second operand 4 states. [2019-12-27 01:52:02,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:52:02,680 INFO L93 Difference]: Finished difference Result 144639 states and 604914 transitions. [2019-12-27 01:52:02,681 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 01:52:02,681 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2019-12-27 01:52:02,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:52:03,124 INFO L225 Difference]: With dead ends: 144639 [2019-12-27 01:52:03,124 INFO L226 Difference]: Without dead ends: 144527 [2019-12-27 01:52:03,125 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 01:52:07,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144527 states. [2019-12-27 01:52:10,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144527 to 133390. [2019-12-27 01:52:10,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133390 states. [2019-12-27 01:52:18,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133390 states to 133390 states and 563187 transitions. [2019-12-27 01:52:18,262 INFO L78 Accepts]: Start accepts. Automaton has 133390 states and 563187 transitions. Word has length 15 [2019-12-27 01:52:18,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:52:18,262 INFO L462 AbstractCegarLoop]: Abstraction has 133390 states and 563187 transitions. [2019-12-27 01:52:18,262 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 01:52:18,262 INFO L276 IsEmpty]: Start isEmpty. Operand 133390 states and 563187 transitions. [2019-12-27 01:52:18,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-27 01:52:18,266 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:52:18,266 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 01:52:18,266 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:52:18,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:52:18,267 INFO L82 PathProgramCache]: Analyzing trace with hash -35287386, now seen corresponding path program 1 times [2019-12-27 01:52:18,267 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:52:18,267 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1439761401] [2019-12-27 01:52:18,268 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:52:18,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:52:18,344 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 01:52:18,344 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1439761401] [2019-12-27 01:52:18,344 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:52:18,344 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 01:52:18,345 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1965181599] [2019-12-27 01:52:18,345 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 01:52:18,345 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:52:18,345 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 01:52:18,346 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 01:52:18,346 INFO L87 Difference]: Start difference. First operand 133390 states and 563187 transitions. Second operand 4 states. [2019-12-27 01:52:18,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:52:18,519 INFO L93 Difference]: Finished difference Result 37161 states and 133398 transitions. [2019-12-27 01:52:18,520 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 01:52:18,520 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-12-27 01:52:18,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:52:18,590 INFO L225 Difference]: With dead ends: 37161 [2019-12-27 01:52:18,590 INFO L226 Difference]: Without dead ends: 37161 [2019-12-27 01:52:18,591 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 01:52:18,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37161 states. [2019-12-27 01:52:19,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37161 to 37161. [2019-12-27 01:52:19,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37161 states. [2019-12-27 01:52:19,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37161 states to 37161 states and 133398 transitions. [2019-12-27 01:52:19,944 INFO L78 Accepts]: Start accepts. Automaton has 37161 states and 133398 transitions. Word has length 16 [2019-12-27 01:52:19,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:52:19,944 INFO L462 AbstractCegarLoop]: Abstraction has 37161 states and 133398 transitions. [2019-12-27 01:52:19,944 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 01:52:19,944 INFO L276 IsEmpty]: Start isEmpty. Operand 37161 states and 133398 transitions. [2019-12-27 01:52:19,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-27 01:52:19,948 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:52:19,948 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 01:52:19,948 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:52:19,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:52:19,949 INFO L82 PathProgramCache]: Analyzing trace with hash 1700714978, now seen corresponding path program 1 times [2019-12-27 01:52:19,949 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:52:19,949 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [915088163] [2019-12-27 01:52:19,949 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:52:19,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:52:20,026 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 01:52:20,026 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [915088163] [2019-12-27 01:52:20,027 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:52:20,027 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 01:52:20,027 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [34337207] [2019-12-27 01:52:20,027 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 01:52:20,027 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:52:20,028 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 01:52:20,028 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 01:52:20,028 INFO L87 Difference]: Start difference. First operand 37161 states and 133398 transitions. Second operand 5 states. [2019-12-27 01:52:20,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:52:20,584 INFO L93 Difference]: Finished difference Result 54896 states and 192989 transitions. [2019-12-27 01:52:20,589 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 01:52:20,589 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2019-12-27 01:52:20,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:52:20,702 INFO L225 Difference]: With dead ends: 54896 [2019-12-27 01:52:20,702 INFO L226 Difference]: Without dead ends: 54878 [2019-12-27 01:52:20,703 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 01:52:20,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54878 states. [2019-12-27 01:52:21,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54878 to 43369. [2019-12-27 01:52:21,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43369 states. [2019-12-27 01:52:21,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43369 states to 43369 states and 154803 transitions. [2019-12-27 01:52:21,606 INFO L78 Accepts]: Start accepts. Automaton has 43369 states and 154803 transitions. Word has length 16 [2019-12-27 01:52:21,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:52:21,606 INFO L462 AbstractCegarLoop]: Abstraction has 43369 states and 154803 transitions. [2019-12-27 01:52:21,606 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 01:52:21,606 INFO L276 IsEmpty]: Start isEmpty. Operand 43369 states and 154803 transitions. [2019-12-27 01:52:21,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-12-27 01:52:21,624 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:52:21,624 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 01:52:21,624 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:52:21,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:52:21,624 INFO L82 PathProgramCache]: Analyzing trace with hash -1135187325, now seen corresponding path program 1 times [2019-12-27 01:52:21,625 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:52:21,625 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1679268772] [2019-12-27 01:52:21,625 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:52:21,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:52:21,723 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 01:52:21,724 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1679268772] [2019-12-27 01:52:21,724 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:52:21,724 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 01:52:21,725 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1352631827] [2019-12-27 01:52:21,725 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 01:52:21,725 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:52:21,725 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 01:52:21,726 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 01:52:21,726 INFO L87 Difference]: Start difference. First operand 43369 states and 154803 transitions. Second operand 6 states. [2019-12-27 01:52:23,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:52:23,276 INFO L93 Difference]: Finished difference Result 65283 states and 226759 transitions. [2019-12-27 01:52:23,276 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 01:52:23,276 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 24 [2019-12-27 01:52:23,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:52:23,406 INFO L225 Difference]: With dead ends: 65283 [2019-12-27 01:52:23,406 INFO L226 Difference]: Without dead ends: 65253 [2019-12-27 01:52:23,407 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2019-12-27 01:52:23,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65253 states. [2019-12-27 01:52:24,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65253 to 43597. [2019-12-27 01:52:24,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43597 states. [2019-12-27 01:52:27,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43597 states to 43597 states and 154758 transitions. [2019-12-27 01:52:27,740 INFO L78 Accepts]: Start accepts. Automaton has 43597 states and 154758 transitions. Word has length 24 [2019-12-27 01:52:27,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:52:27,740 INFO L462 AbstractCegarLoop]: Abstraction has 43597 states and 154758 transitions. [2019-12-27 01:52:27,740 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 01:52:27,740 INFO L276 IsEmpty]: Start isEmpty. Operand 43597 states and 154758 transitions. [2019-12-27 01:52:27,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-27 01:52:27,763 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:52:27,763 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 01:52:27,763 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:52:27,763 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:52:27,764 INFO L82 PathProgramCache]: Analyzing trace with hash -1458605799, now seen corresponding path program 1 times [2019-12-27 01:52:27,764 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:52:27,764 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [261514339] [2019-12-27 01:52:27,764 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:52:27,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:52:27,853 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 01:52:27,853 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [261514339] [2019-12-27 01:52:27,854 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:52:27,854 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 01:52:27,855 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1621594823] [2019-12-27 01:52:27,855 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 01:52:27,855 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:52:27,855 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 01:52:27,856 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 01:52:27,856 INFO L87 Difference]: Start difference. First operand 43597 states and 154758 transitions. Second operand 5 states. [2019-12-27 01:52:28,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:52:28,027 INFO L93 Difference]: Finished difference Result 23301 states and 83755 transitions. [2019-12-27 01:52:28,027 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 01:52:28,027 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2019-12-27 01:52:28,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:52:28,097 INFO L225 Difference]: With dead ends: 23301 [2019-12-27 01:52:28,098 INFO L226 Difference]: Without dead ends: 23301 [2019-12-27 01:52:28,099 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 01:52:28,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23301 states. [2019-12-27 01:52:28,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23301 to 22997. [2019-12-27 01:52:28,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22997 states. [2019-12-27 01:52:28,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22997 states to 22997 states and 82723 transitions. [2019-12-27 01:52:28,533 INFO L78 Accepts]: Start accepts. Automaton has 22997 states and 82723 transitions. Word has length 28 [2019-12-27 01:52:28,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:52:28,534 INFO L462 AbstractCegarLoop]: Abstraction has 22997 states and 82723 transitions. [2019-12-27 01:52:28,534 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 01:52:28,534 INFO L276 IsEmpty]: Start isEmpty. Operand 22997 states and 82723 transitions. [2019-12-27 01:52:28,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-12-27 01:52:28,575 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:52:28,575 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 01:52:28,576 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:52:28,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:52:28,576 INFO L82 PathProgramCache]: Analyzing trace with hash 289915716, now seen corresponding path program 1 times [2019-12-27 01:52:28,576 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:52:28,576 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [306772348] [2019-12-27 01:52:28,576 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:52:28,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:52:28,654 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 01:52:28,654 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [306772348] [2019-12-27 01:52:28,655 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:52:28,655 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 01:52:28,655 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [362721266] [2019-12-27 01:52:28,655 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 01:52:28,656 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:52:28,656 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 01:52:28,656 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 01:52:28,656 INFO L87 Difference]: Start difference. First operand 22997 states and 82723 transitions. Second operand 3 states. [2019-12-27 01:52:28,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:52:28,799 INFO L93 Difference]: Finished difference Result 34696 states and 119073 transitions. [2019-12-27 01:52:28,800 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 01:52:28,800 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 42 [2019-12-27 01:52:28,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:52:28,841 INFO L225 Difference]: With dead ends: 34696 [2019-12-27 01:52:28,842 INFO L226 Difference]: Without dead ends: 23444 [2019-12-27 01:52:28,842 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 01:52:28,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23444 states. [2019-12-27 01:52:29,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23444 to 23042. [2019-12-27 01:52:29,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23042 states. [2019-12-27 01:52:29,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23042 states to 23042 states and 72359 transitions. [2019-12-27 01:52:29,226 INFO L78 Accepts]: Start accepts. Automaton has 23042 states and 72359 transitions. Word has length 42 [2019-12-27 01:52:29,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:52:29,227 INFO L462 AbstractCegarLoop]: Abstraction has 23042 states and 72359 transitions. [2019-12-27 01:52:29,227 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 01:52:29,227 INFO L276 IsEmpty]: Start isEmpty. Operand 23042 states and 72359 transitions. [2019-12-27 01:52:29,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-12-27 01:52:29,263 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:52:29,263 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] [2019-12-27 01:52:29,263 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:52:29,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:52:29,264 INFO L82 PathProgramCache]: Analyzing trace with hash 9371836, now seen corresponding path program 1 times [2019-12-27 01:52:29,264 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:52:29,264 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [445979959] [2019-12-27 01:52:29,264 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:52:29,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:52:29,340 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 01:52:29,341 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [445979959] [2019-12-27 01:52:29,341 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:52:29,341 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 01:52:29,341 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [130499024] [2019-12-27 01:52:29,342 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 01:52:29,342 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:52:29,342 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 01:52:29,342 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-12-27 01:52:29,343 INFO L87 Difference]: Start difference. First operand 23042 states and 72359 transitions. Second operand 6 states. [2019-12-27 01:52:29,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:52:29,605 INFO L93 Difference]: Finished difference Result 21758 states and 69087 transitions. [2019-12-27 01:52:29,606 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 01:52:29,606 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 43 [2019-12-27 01:52:29,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:52:29,624 INFO L225 Difference]: With dead ends: 21758 [2019-12-27 01:52:29,624 INFO L226 Difference]: Without dead ends: 11194 [2019-12-27 01:52:29,624 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-12-27 01:52:29,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11194 states. [2019-12-27 01:52:29,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11194 to 10798. [2019-12-27 01:52:29,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10798 states. [2019-12-27 01:52:29,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10798 states to 10798 states and 34133 transitions. [2019-12-27 01:52:29,809 INFO L78 Accepts]: Start accepts. Automaton has 10798 states and 34133 transitions. Word has length 43 [2019-12-27 01:52:29,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:52:29,809 INFO L462 AbstractCegarLoop]: Abstraction has 10798 states and 34133 transitions. [2019-12-27 01:52:29,809 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 01:52:29,810 INFO L276 IsEmpty]: Start isEmpty. Operand 10798 states and 34133 transitions. [2019-12-27 01:52:29,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-27 01:52:29,828 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:52:29,829 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] [2019-12-27 01:52:29,829 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:52:29,829 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:52:29,829 INFO L82 PathProgramCache]: Analyzing trace with hash 1454862528, now seen corresponding path program 1 times [2019-12-27 01:52:29,830 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:52:29,830 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1382202767] [2019-12-27 01:52:29,830 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:52:29,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:52:29,892 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 01:52:29,893 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1382202767] [2019-12-27 01:52:29,893 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:52:29,893 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 01:52:29,893 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [408856756] [2019-12-27 01:52:29,894 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 01:52:29,894 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:52:29,894 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 01:52:29,894 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 01:52:29,894 INFO L87 Difference]: Start difference. First operand 10798 states and 34133 transitions. Second operand 3 states. [2019-12-27 01:52:29,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:52:29,992 INFO L93 Difference]: Finished difference Result 14554 states and 45133 transitions. [2019-12-27 01:52:29,992 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 01:52:29,992 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 57 [2019-12-27 01:52:29,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:52:30,019 INFO L225 Difference]: With dead ends: 14554 [2019-12-27 01:52:30,019 INFO L226 Difference]: Without dead ends: 14554 [2019-12-27 01:52:30,019 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 01:52:30,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14554 states. [2019-12-27 01:52:30,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14554 to 11851. [2019-12-27 01:52:30,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11851 states. [2019-12-27 01:52:30,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11851 states to 11851 states and 37349 transitions. [2019-12-27 01:52:30,390 INFO L78 Accepts]: Start accepts. Automaton has 11851 states and 37349 transitions. Word has length 57 [2019-12-27 01:52:30,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:52:30,390 INFO L462 AbstractCegarLoop]: Abstraction has 11851 states and 37349 transitions. [2019-12-27 01:52:30,390 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 01:52:30,390 INFO L276 IsEmpty]: Start isEmpty. Operand 11851 states and 37349 transitions. [2019-12-27 01:52:30,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-27 01:52:30,407 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:52:30,407 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] [2019-12-27 01:52:30,408 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:52:30,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:52:30,408 INFO L82 PathProgramCache]: Analyzing trace with hash -880753033, now seen corresponding path program 1 times [2019-12-27 01:52:30,408 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:52:30,409 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1987521294] [2019-12-27 01:52:30,409 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:52:30,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:52:30,482 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 01:52:30,482 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1987521294] [2019-12-27 01:52:30,483 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:52:30,483 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 01:52:30,483 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [20115760] [2019-12-27 01:52:30,483 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 01:52:30,484 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:52:30,484 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 01:52:30,484 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 01:52:30,484 INFO L87 Difference]: Start difference. First operand 11851 states and 37349 transitions. Second operand 4 states. [2019-12-27 01:52:30,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:52:30,582 INFO L93 Difference]: Finished difference Result 21477 states and 67702 transitions. [2019-12-27 01:52:30,582 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 01:52:30,582 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 57 [2019-12-27 01:52:30,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:52:30,603 INFO L225 Difference]: With dead ends: 21477 [2019-12-27 01:52:30,603 INFO L226 Difference]: Without dead ends: 9937 [2019-12-27 01:52:30,604 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 01:52:30,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9937 states. [2019-12-27 01:52:30,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9937 to 9937. [2019-12-27 01:52:30,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9937 states. [2019-12-27 01:52:30,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9937 states to 9937 states and 31212 transitions. [2019-12-27 01:52:30,800 INFO L78 Accepts]: Start accepts. Automaton has 9937 states and 31212 transitions. Word has length 57 [2019-12-27 01:52:30,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:52:30,801 INFO L462 AbstractCegarLoop]: Abstraction has 9937 states and 31212 transitions. [2019-12-27 01:52:30,801 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 01:52:30,801 INFO L276 IsEmpty]: Start isEmpty. Operand 9937 states and 31212 transitions. [2019-12-27 01:52:30,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-27 01:52:30,812 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:52:30,812 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] [2019-12-27 01:52:30,812 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:52:30,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:52:30,813 INFO L82 PathProgramCache]: Analyzing trace with hash 1310347391, now seen corresponding path program 2 times [2019-12-27 01:52:30,813 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:52:30,813 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1569082236] [2019-12-27 01:52:30,813 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:52:30,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:52:30,930 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 01:52:30,930 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1569082236] [2019-12-27 01:52:30,930 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:52:30,931 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 01:52:30,931 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [415541944] [2019-12-27 01:52:30,931 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 01:52:30,931 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:52:30,932 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 01:52:30,932 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-27 01:52:30,932 INFO L87 Difference]: Start difference. First operand 9937 states and 31212 transitions. Second operand 7 states. [2019-12-27 01:52:31,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:52:31,306 INFO L93 Difference]: Finished difference Result 26843 states and 84141 transitions. [2019-12-27 01:52:31,307 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 01:52:31,307 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 57 [2019-12-27 01:52:31,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:52:31,338 INFO L225 Difference]: With dead ends: 26843 [2019-12-27 01:52:31,338 INFO L226 Difference]: Without dead ends: 20587 [2019-12-27 01:52:31,338 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2019-12-27 01:52:31,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20587 states. [2019-12-27 01:52:31,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20587 to 12177. [2019-12-27 01:52:31,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12177 states. [2019-12-27 01:52:31,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12177 states to 12177 states and 38516 transitions. [2019-12-27 01:52:31,605 INFO L78 Accepts]: Start accepts. Automaton has 12177 states and 38516 transitions. Word has length 57 [2019-12-27 01:52:31,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:52:31,605 INFO L462 AbstractCegarLoop]: Abstraction has 12177 states and 38516 transitions. [2019-12-27 01:52:31,605 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 01:52:31,605 INFO L276 IsEmpty]: Start isEmpty. Operand 12177 states and 38516 transitions. [2019-12-27 01:52:31,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-27 01:52:31,623 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:52:31,624 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 01:52:31,624 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:52:31,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:52:31,624 INFO L82 PathProgramCache]: Analyzing trace with hash -1030628791, now seen corresponding path program 3 times [2019-12-27 01:52:31,624 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:52:31,625 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1629970847] [2019-12-27 01:52:31,625 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:52:31,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:52:31,718 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 01:52:31,718 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1629970847] [2019-12-27 01:52:31,718 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:52:31,719 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 01:52:31,719 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1214247816] [2019-12-27 01:52:31,719 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 01:52:31,719 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:52:31,720 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 01:52:31,720 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-27 01:52:31,720 INFO L87 Difference]: Start difference. First operand 12177 states and 38516 transitions. Second operand 7 states. [2019-12-27 01:52:32,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:52:32,242 INFO L93 Difference]: Finished difference Result 33666 states and 104259 transitions. [2019-12-27 01:52:32,242 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 01:52:32,242 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 57 [2019-12-27 01:52:32,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:52:32,280 INFO L225 Difference]: With dead ends: 33666 [2019-12-27 01:52:32,280 INFO L226 Difference]: Without dead ends: 24086 [2019-12-27 01:52:32,281 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2019-12-27 01:52:32,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24086 states. [2019-12-27 01:52:32,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24086 to 15349. [2019-12-27 01:52:32,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15349 states. [2019-12-27 01:52:32,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15349 states to 15349 states and 48528 transitions. [2019-12-27 01:52:32,605 INFO L78 Accepts]: Start accepts. Automaton has 15349 states and 48528 transitions. Word has length 57 [2019-12-27 01:52:32,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:52:32,605 INFO L462 AbstractCegarLoop]: Abstraction has 15349 states and 48528 transitions. [2019-12-27 01:52:32,605 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 01:52:32,605 INFO L276 IsEmpty]: Start isEmpty. Operand 15349 states and 48528 transitions. [2019-12-27 01:52:32,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-27 01:52:32,627 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:52:32,628 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 01:52:32,628 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:52:32,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:52:32,628 INFO L82 PathProgramCache]: Analyzing trace with hash 1587000503, now seen corresponding path program 4 times [2019-12-27 01:52:32,629 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:52:32,629 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [866556438] [2019-12-27 01:52:32,629 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:52:32,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:52:32,753 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 01:52:32,753 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [866556438] [2019-12-27 01:52:32,754 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:52:32,754 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 01:52:32,754 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [143842222] [2019-12-27 01:52:32,754 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 01:52:32,755 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:52:32,755 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 01:52:32,755 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-12-27 01:52:32,755 INFO L87 Difference]: Start difference. First operand 15349 states and 48528 transitions. Second operand 8 states. [2019-12-27 01:52:33,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:52:33,726 INFO L93 Difference]: Finished difference Result 34932 states and 106981 transitions. [2019-12-27 01:52:33,726 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-12-27 01:52:33,727 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 57 [2019-12-27 01:52:33,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:52:33,774 INFO L225 Difference]: With dead ends: 34932 [2019-12-27 01:52:33,775 INFO L226 Difference]: Without dead ends: 32668 [2019-12-27 01:52:33,775 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=119, Invalid=343, Unknown=0, NotChecked=0, Total=462 [2019-12-27 01:52:33,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32668 states. [2019-12-27 01:52:34,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32668 to 15407. [2019-12-27 01:52:34,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15407 states. [2019-12-27 01:52:34,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15407 states to 15407 states and 48800 transitions. [2019-12-27 01:52:34,170 INFO L78 Accepts]: Start accepts. Automaton has 15407 states and 48800 transitions. Word has length 57 [2019-12-27 01:52:34,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:52:34,171 INFO L462 AbstractCegarLoop]: Abstraction has 15407 states and 48800 transitions. [2019-12-27 01:52:34,171 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 01:52:34,171 INFO L276 IsEmpty]: Start isEmpty. Operand 15407 states and 48800 transitions. [2019-12-27 01:52:34,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-27 01:52:34,188 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:52:34,188 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 01:52:34,188 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:52:34,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:52:34,188 INFO L82 PathProgramCache]: Analyzing trace with hash -979581959, now seen corresponding path program 5 times [2019-12-27 01:52:34,189 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:52:34,189 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1391886881] [2019-12-27 01:52:34,189 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:52:34,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:52:34,302 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 01:52:34,302 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1391886881] [2019-12-27 01:52:34,302 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:52:34,303 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 01:52:34,303 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1422358637] [2019-12-27 01:52:34,303 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 01:52:34,303 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:52:34,304 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 01:52:34,304 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-27 01:52:34,304 INFO L87 Difference]: Start difference. First operand 15407 states and 48800 transitions. Second operand 9 states. [2019-12-27 01:52:34,786 WARN L192 SmtUtils]: Spent 136.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2019-12-27 01:52:35,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:52:35,908 INFO L93 Difference]: Finished difference Result 48430 states and 148036 transitions. [2019-12-27 01:52:35,909 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-27 01:52:35,909 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 57 [2019-12-27 01:52:35,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:52:35,993 INFO L225 Difference]: With dead ends: 48430 [2019-12-27 01:52:35,993 INFO L226 Difference]: Without dead ends: 46166 [2019-12-27 01:52:35,994 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 234 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=241, Invalid=751, Unknown=0, NotChecked=0, Total=992 [2019-12-27 01:52:36,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46166 states. [2019-12-27 01:52:36,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46166 to 15428. [2019-12-27 01:52:36,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15428 states. [2019-12-27 01:52:36,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15428 states to 15428 states and 48880 transitions. [2019-12-27 01:52:36,495 INFO L78 Accepts]: Start accepts. Automaton has 15428 states and 48880 transitions. Word has length 57 [2019-12-27 01:52:36,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:52:36,495 INFO L462 AbstractCegarLoop]: Abstraction has 15428 states and 48880 transitions. [2019-12-27 01:52:36,495 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 01:52:36,495 INFO L276 IsEmpty]: Start isEmpty. Operand 15428 states and 48880 transitions. [2019-12-27 01:52:36,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-27 01:52:36,512 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:52:36,512 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] [2019-12-27 01:52:36,513 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:52:36,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:52:36,513 INFO L82 PathProgramCache]: Analyzing trace with hash -2032569873, now seen corresponding path program 6 times [2019-12-27 01:52:36,513 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:52:36,513 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [11756173] [2019-12-27 01:52:36,513 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:52:36,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:52:36,612 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 01:52:36,612 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [11756173] [2019-12-27 01:52:36,614 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:52:36,614 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 01:52:36,614 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1353040076] [2019-12-27 01:52:36,615 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 01:52:36,615 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:52:36,615 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 01:52:36,615 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-27 01:52:36,616 INFO L87 Difference]: Start difference. First operand 15428 states and 48880 transitions. Second operand 9 states. [2019-12-27 01:52:38,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:52:38,153 INFO L93 Difference]: Finished difference Result 62597 states and 191406 transitions. [2019-12-27 01:52:38,154 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-12-27 01:52:38,154 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 57 [2019-12-27 01:52:38,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:52:38,238 INFO L225 Difference]: With dead ends: 62597 [2019-12-27 01:52:38,238 INFO L226 Difference]: Without dead ends: 54167 [2019-12-27 01:52:38,239 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 350 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=347, Invalid=985, Unknown=0, NotChecked=0, Total=1332 [2019-12-27 01:52:38,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54167 states. [2019-12-27 01:52:39,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54167 to 19382. [2019-12-27 01:52:39,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19382 states. [2019-12-27 01:52:39,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19382 states to 19382 states and 61433 transitions. [2019-12-27 01:52:39,056 INFO L78 Accepts]: Start accepts. Automaton has 19382 states and 61433 transitions. Word has length 57 [2019-12-27 01:52:39,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:52:39,056 INFO L462 AbstractCegarLoop]: Abstraction has 19382 states and 61433 transitions. [2019-12-27 01:52:39,056 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 01:52:39,056 INFO L276 IsEmpty]: Start isEmpty. Operand 19382 states and 61433 transitions. [2019-12-27 01:52:39,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-27 01:52:39,076 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:52:39,076 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] [2019-12-27 01:52:39,076 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:52:39,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:52:39,076 INFO L82 PathProgramCache]: Analyzing trace with hash 1355321517, now seen corresponding path program 7 times [2019-12-27 01:52:39,077 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:52:39,077 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1395908121] [2019-12-27 01:52:39,077 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:52:39,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:52:39,174 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 01:52:39,174 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1395908121] [2019-12-27 01:52:39,174 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:52:39,174 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 01:52:39,175 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [620811757] [2019-12-27 01:52:39,175 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 01:52:39,175 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:52:39,175 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 01:52:39,175 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 01:52:39,176 INFO L87 Difference]: Start difference. First operand 19382 states and 61433 transitions. Second operand 3 states. [2019-12-27 01:52:39,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:52:39,254 INFO L93 Difference]: Finished difference Result 16496 states and 51087 transitions. [2019-12-27 01:52:39,254 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 01:52:39,254 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 57 [2019-12-27 01:52:39,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:52:39,287 INFO L225 Difference]: With dead ends: 16496 [2019-12-27 01:52:39,287 INFO L226 Difference]: Without dead ends: 16496 [2019-12-27 01:52:39,288 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 01:52:39,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16496 states. [2019-12-27 01:52:39,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16496 to 15921. [2019-12-27 01:52:39,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15921 states. [2019-12-27 01:52:39,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15921 states to 15921 states and 49194 transitions. [2019-12-27 01:52:39,696 INFO L78 Accepts]: Start accepts. Automaton has 15921 states and 49194 transitions. Word has length 57 [2019-12-27 01:52:39,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:52:39,696 INFO L462 AbstractCegarLoop]: Abstraction has 15921 states and 49194 transitions. [2019-12-27 01:52:39,696 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 01:52:39,696 INFO L276 IsEmpty]: Start isEmpty. Operand 15921 states and 49194 transitions. [2019-12-27 01:52:39,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-27 01:52:39,719 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:52:39,719 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] [2019-12-27 01:52:39,720 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:52:39,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:52:39,720 INFO L82 PathProgramCache]: Analyzing trace with hash -454137528, now seen corresponding path program 1 times [2019-12-27 01:52:39,720 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:52:39,720 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1121046854] [2019-12-27 01:52:39,720 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:52:39,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:52:39,820 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 01:52:39,823 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1121046854] [2019-12-27 01:52:39,823 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:52:39,823 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 01:52:39,825 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [634563343] [2019-12-27 01:52:39,826 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 01:52:39,826 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:52:39,826 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 01:52:39,828 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 01:52:39,828 INFO L87 Difference]: Start difference. First operand 15921 states and 49194 transitions. Second operand 3 states. [2019-12-27 01:52:39,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:52:39,903 INFO L93 Difference]: Finished difference Result 15921 states and 49192 transitions. [2019-12-27 01:52:39,903 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 01:52:39,904 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 58 [2019-12-27 01:52:39,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:52:39,935 INFO L225 Difference]: With dead ends: 15921 [2019-12-27 01:52:39,935 INFO L226 Difference]: Without dead ends: 15921 [2019-12-27 01:52:39,936 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 01:52:40,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15921 states. [2019-12-27 01:52:40,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15921 to 14444. [2019-12-27 01:52:40,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14444 states. [2019-12-27 01:52:40,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14444 states to 14444 states and 45078 transitions. [2019-12-27 01:52:40,205 INFO L78 Accepts]: Start accepts. Automaton has 14444 states and 45078 transitions. Word has length 58 [2019-12-27 01:52:40,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:52:40,205 INFO L462 AbstractCegarLoop]: Abstraction has 14444 states and 45078 transitions. [2019-12-27 01:52:40,205 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 01:52:40,205 INFO L276 IsEmpty]: Start isEmpty. Operand 14444 states and 45078 transitions. [2019-12-27 01:52:40,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-27 01:52:40,221 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:52:40,221 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] [2019-12-27 01:52:40,221 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:52:40,221 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:52:40,221 INFO L82 PathProgramCache]: Analyzing trace with hash -286713595, now seen corresponding path program 1 times [2019-12-27 01:52:40,221 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:52:40,222 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [611647300] [2019-12-27 01:52:40,222 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:52:40,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:52:40,683 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 01:52:40,684 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [611647300] [2019-12-27 01:52:40,684 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:52:40,684 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-12-27 01:52:40,684 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2004445837] [2019-12-27 01:52:40,685 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-12-27 01:52:40,685 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:52:40,685 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-12-27 01:52:40,685 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=234, Unknown=0, NotChecked=0, Total=272 [2019-12-27 01:52:40,685 INFO L87 Difference]: Start difference. First operand 14444 states and 45078 transitions. Second operand 17 states. [2019-12-27 01:52:44,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:52:44,185 INFO L93 Difference]: Finished difference Result 19819 states and 60666 transitions. [2019-12-27 01:52:44,185 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-12-27 01:52:44,185 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 59 [2019-12-27 01:52:44,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:52:44,220 INFO L225 Difference]: With dead ends: 19819 [2019-12-27 01:52:44,220 INFO L226 Difference]: Without dead ends: 18201 [2019-12-27 01:52:44,221 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 364 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=327, Invalid=1653, Unknown=0, NotChecked=0, Total=1980 [2019-12-27 01:52:44,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18201 states. [2019-12-27 01:52:44,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18201 to 14991. [2019-12-27 01:52:44,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14991 states. [2019-12-27 01:52:44,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14991 states to 14991 states and 46839 transitions. [2019-12-27 01:52:44,485 INFO L78 Accepts]: Start accepts. Automaton has 14991 states and 46839 transitions. Word has length 59 [2019-12-27 01:52:44,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:52:44,485 INFO L462 AbstractCegarLoop]: Abstraction has 14991 states and 46839 transitions. [2019-12-27 01:52:44,485 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-12-27 01:52:44,486 INFO L276 IsEmpty]: Start isEmpty. Operand 14991 states and 46839 transitions. [2019-12-27 01:52:44,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-27 01:52:44,502 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:52:44,502 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] [2019-12-27 01:52:44,502 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:52:44,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:52:44,502 INFO L82 PathProgramCache]: Analyzing trace with hash 490336035, now seen corresponding path program 2 times [2019-12-27 01:52:44,503 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:52:44,503 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2027877093] [2019-12-27 01:52:44,503 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:52:44,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:52:44,726 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 01:52:44,726 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2027877093] [2019-12-27 01:52:44,727 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:52:44,727 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-27 01:52:44,727 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1795402528] [2019-12-27 01:52:44,728 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-27 01:52:44,728 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:52:44,729 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-27 01:52:44,729 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2019-12-27 01:52:44,729 INFO L87 Difference]: Start difference. First operand 14991 states and 46839 transitions. Second operand 12 states. [2019-12-27 01:52:47,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:52:47,946 INFO L93 Difference]: Finished difference Result 30852 states and 95671 transitions. [2019-12-27 01:52:47,947 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-12-27 01:52:47,947 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 59 [2019-12-27 01:52:47,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:52:47,979 INFO L225 Difference]: With dead ends: 30852 [2019-12-27 01:52:47,979 INFO L226 Difference]: Without dead ends: 22033 [2019-12-27 01:52:47,980 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 1 SyntacticMatches, 3 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 235 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=226, Invalid=964, Unknown=0, NotChecked=0, Total=1190 [2019-12-27 01:52:48,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22033 states. [2019-12-27 01:52:48,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22033 to 15099. [2019-12-27 01:52:48,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15099 states. [2019-12-27 01:52:48,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15099 states to 15099 states and 46684 transitions. [2019-12-27 01:52:48,255 INFO L78 Accepts]: Start accepts. Automaton has 15099 states and 46684 transitions. Word has length 59 [2019-12-27 01:52:48,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:52:48,255 INFO L462 AbstractCegarLoop]: Abstraction has 15099 states and 46684 transitions. [2019-12-27 01:52:48,255 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-27 01:52:48,256 INFO L276 IsEmpty]: Start isEmpty. Operand 15099 states and 46684 transitions. [2019-12-27 01:52:48,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-27 01:52:48,272 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:52:48,272 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] [2019-12-27 01:52:48,272 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:52:48,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:52:48,273 INFO L82 PathProgramCache]: Analyzing trace with hash 235346217, now seen corresponding path program 3 times [2019-12-27 01:52:48,273 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:52:48,273 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [203655280] [2019-12-27 01:52:48,273 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:52:48,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:52:48,532 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 01:52:48,533 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [203655280] [2019-12-27 01:52:48,533 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:52:48,533 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 01:52:48,533 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [761160560] [2019-12-27 01:52:48,534 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 01:52:48,535 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:52:48,535 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 01:52:48,536 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-27 01:52:48,536 INFO L87 Difference]: Start difference. First operand 15099 states and 46684 transitions. Second operand 11 states. [2019-12-27 01:52:49,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:52:49,523 INFO L93 Difference]: Finished difference Result 27122 states and 83854 transitions. [2019-12-27 01:52:49,523 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-27 01:52:49,523 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 59 [2019-12-27 01:52:49,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:52:49,562 INFO L225 Difference]: With dead ends: 27122 [2019-12-27 01:52:49,562 INFO L226 Difference]: Without dead ends: 26556 [2019-12-27 01:52:49,562 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 192 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=172, Invalid=758, Unknown=0, NotChecked=0, Total=930 [2019-12-27 01:52:49,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26556 states. [2019-12-27 01:52:49,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26556 to 17169. [2019-12-27 01:52:49,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17169 states. [2019-12-27 01:52:49,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17169 states to 17169 states and 53213 transitions. [2019-12-27 01:52:49,905 INFO L78 Accepts]: Start accepts. Automaton has 17169 states and 53213 transitions. Word has length 59 [2019-12-27 01:52:49,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:52:49,905 INFO L462 AbstractCegarLoop]: Abstraction has 17169 states and 53213 transitions. [2019-12-27 01:52:49,905 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 01:52:49,905 INFO L276 IsEmpty]: Start isEmpty. Operand 17169 states and 53213 transitions. [2019-12-27 01:52:49,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-27 01:52:49,923 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:52:49,923 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] [2019-12-27 01:52:49,923 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:52:49,923 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:52:49,924 INFO L82 PathProgramCache]: Analyzing trace with hash -1674144661, now seen corresponding path program 4 times [2019-12-27 01:52:49,924 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:52:49,924 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [381532145] [2019-12-27 01:52:49,924 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:52:49,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:52:50,188 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 01:52:50,188 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [381532145] [2019-12-27 01:52:50,188 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:52:50,188 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 01:52:50,188 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1826600707] [2019-12-27 01:52:50,189 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 01:52:50,189 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:52:50,189 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 01:52:50,189 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-27 01:52:50,190 INFO L87 Difference]: Start difference. First operand 17169 states and 53213 transitions. Second operand 11 states. [2019-12-27 01:52:51,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:52:51,239 INFO L93 Difference]: Finished difference Result 27014 states and 82994 transitions. [2019-12-27 01:52:51,240 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-12-27 01:52:51,240 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 59 [2019-12-27 01:52:51,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:52:51,273 INFO L225 Difference]: With dead ends: 27014 [2019-12-27 01:52:51,274 INFO L226 Difference]: Without dead ends: 23114 [2019-12-27 01:52:51,274 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=122, Invalid=478, Unknown=0, NotChecked=0, Total=600 [2019-12-27 01:52:51,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23114 states. [2019-12-27 01:52:51,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23114 to 14623. [2019-12-27 01:52:51,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14623 states. [2019-12-27 01:52:51,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14623 states to 14623 states and 45176 transitions. [2019-12-27 01:52:51,554 INFO L78 Accepts]: Start accepts. Automaton has 14623 states and 45176 transitions. Word has length 59 [2019-12-27 01:52:51,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:52:51,554 INFO L462 AbstractCegarLoop]: Abstraction has 14623 states and 45176 transitions. [2019-12-27 01:52:51,554 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 01:52:51,554 INFO L276 IsEmpty]: Start isEmpty. Operand 14623 states and 45176 transitions. [2019-12-27 01:52:51,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-27 01:52:51,569 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:52:51,569 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] [2019-12-27 01:52:51,569 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:52:51,569 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:52:51,569 INFO L82 PathProgramCache]: Analyzing trace with hash 1304528589, now seen corresponding path program 5 times [2019-12-27 01:52:51,569 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:52:51,570 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1614894159] [2019-12-27 01:52:51,570 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:52:51,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:52:51,826 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 01:52:51,826 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1614894159] [2019-12-27 01:52:51,826 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:52:51,826 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-27 01:52:51,827 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1130900708] [2019-12-27 01:52:51,827 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-27 01:52:51,827 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:52:51,827 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-27 01:52:51,828 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2019-12-27 01:52:51,828 INFO L87 Difference]: Start difference. First operand 14623 states and 45176 transitions. Second operand 12 states. [2019-12-27 01:52:52,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:52:52,681 INFO L93 Difference]: Finished difference Result 23300 states and 71505 transitions. [2019-12-27 01:52:52,681 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-27 01:52:52,682 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 59 [2019-12-27 01:52:52,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:52:52,715 INFO L225 Difference]: With dead ends: 23300 [2019-12-27 01:52:52,715 INFO L226 Difference]: Without dead ends: 22950 [2019-12-27 01:52:52,715 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=133, Invalid=569, Unknown=0, NotChecked=0, Total=702 [2019-12-27 01:52:52,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22950 states. [2019-12-27 01:52:52,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22950 to 14352. [2019-12-27 01:52:52,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14352 states. [2019-12-27 01:52:53,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14352 states to 14352 states and 44393 transitions. [2019-12-27 01:52:53,003 INFO L78 Accepts]: Start accepts. Automaton has 14352 states and 44393 transitions. Word has length 59 [2019-12-27 01:52:53,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:52:53,004 INFO L462 AbstractCegarLoop]: Abstraction has 14352 states and 44393 transitions. [2019-12-27 01:52:53,004 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-27 01:52:53,004 INFO L276 IsEmpty]: Start isEmpty. Operand 14352 states and 44393 transitions. [2019-12-27 01:52:53,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-27 01:52:53,019 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:52:53,019 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] [2019-12-27 01:52:53,019 INFO L410 AbstractCegarLoop]: === Iteration 24 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:52:53,019 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:52:53,019 INFO L82 PathProgramCache]: Analyzing trace with hash -1779176519, now seen corresponding path program 6 times [2019-12-27 01:52:53,020 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:52:53,020 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [738436244] [2019-12-27 01:52:53,020 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:52:53,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 01:52:53,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 01:52:53,197 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 01:52:53,198 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 01:52:53,203 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [851] [851] ULTIMATE.startENTRY-->L846: Formula: (let ((.cse0 (store |v_#valid_74| 0 0))) (and (= v_~__unbuffered_p1_EBX~0_48 0) (= v_~x~0_72 0) (= v_~y$w_buff1_used~0_529 0) (= v_~main$tmp_guard0~0_30 0) (= v_~y$r_buff1_thd1~0_122 0) (= 0 v_~y$w_buff0~0_386) (= 0 v_~y$r_buff0_thd2~0_330) (= v_~__unbuffered_cnt~0_187 0) (= v_~main$tmp_guard1~0_42 0) (< 0 |v_#StackHeapBarrier_22|) (= v_~y~0_163 0) (= v_~y$read_delayed~0_7 0) (= 0 v_~y$r_buff1_thd3~0_189) (= 0 v_~__unbuffered_p3_EBX~0_48) (= v_~y$w_buff1~0_278 0) (= 0 v_~y$flush_delayed~0_49) (= 0 v_~y$read_delayed_var~0.base_5) (= v_~y$r_buff0_thd1~0_36 0) (= v_~y$w_buff0_used~0_832 0) (< |v_#StackHeapBarrier_22| |v_ULTIMATE.start_main_~#t605~0.base_29|) (= (store |v_#length_32| |v_ULTIMATE.start_main_~#t605~0.base_29| 4) |v_#length_31|) (= (select .cse0 |v_ULTIMATE.start_main_~#t605~0.base_29|) 0) (= 0 v_~y$read_delayed_var~0.offset_5) (= 0 v_~y$r_buff1_thd4~0_202) (= v_~a~0_49 0) (= (store |v_#memory_int_30| |v_ULTIMATE.start_main_~#t605~0.base_29| (store (select |v_#memory_int_30| |v_ULTIMATE.start_main_~#t605~0.base_29|) |v_ULTIMATE.start_main_~#t605~0.offset_21| 0)) |v_#memory_int_29|) (= 0 v_~y$r_buff1_thd2~0_315) (= v_~y$r_buff0_thd0~0_117 0) (= 0 |v_#NULL.base_4|) (= (store .cse0 |v_ULTIMATE.start_main_~#t605~0.base_29| 1) |v_#valid_72|) (= 0 v_~weak$$choice0~0_22) (= v_~y$mem_tmp~0_24 0) (= 0 v_~y$r_buff0_thd3~0_225) (= 0 v_~__unbuffered_p1_EAX~0_47) (= 0 v_~__unbuffered_p3_EAX~0_48) (= |v_#NULL.offset_4| 0) (= 0 v_~y$r_buff0_thd4~0_120) (= v_~weak$$choice2~0_186 0) (= v_~y$r_buff1_thd0~0_220 0) (= 0 |v_ULTIMATE.start_main_~#t605~0.offset_21|) (= v_~z~0_163 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_22|, #valid=|v_#valid_74|, #memory_int=|v_#memory_int_30|, #length=|v_#length_32|} OutVars{ULTIMATE.start_main_~#t607~0.base=|v_ULTIMATE.start_main_~#t607~0.base_29|, ULTIMATE.start_main_~#t605~0.offset=|v_ULTIMATE.start_main_~#t605~0.offset_21|, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_82|, #NULL.offset=|v_#NULL.offset_4|, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_75|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_37|, ~y$read_delayed~0=v_~y$read_delayed~0_7, ~a~0=v_~a~0_49, ~y$mem_tmp~0=v_~y$mem_tmp~0_24, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_189, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_47, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_36, ~y$flush_delayed~0=v_~y$flush_delayed~0_49, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_48, #length=|v_#length_31|, ULTIMATE.start_main_~#t607~0.offset=|v_ULTIMATE.start_main_~#t607~0.offset_21|, ULTIMATE.start_main_#t~nondet41=|v_ULTIMATE.start_main_#t~nondet41_29|, ~weak$$choice0~0=v_~weak$$choice0~0_22, #StackHeapBarrier=|v_#StackHeapBarrier_22|, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_202, ULTIMATE.start_main_~#t608~0.offset=|v_ULTIMATE.start_main_~#t608~0.offset_16|, ~y$w_buff1~0=v_~y$w_buff1~0_278, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_5, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_330, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_10|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_187, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_220, ~x~0=v_~x~0_72, ULTIMATE.start_main_~#t605~0.base=|v_ULTIMATE.start_main_~#t605~0.base_29|, ~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_5, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_832, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_41|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_42, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_63|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_39|, ULTIMATE.start_main_~#t606~0.offset=|v_ULTIMATE.start_main_~#t606~0.offset_21|, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_122, ~y$w_buff0~0=v_~y$w_buff0~0_386, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_225, ULTIMATE.start_main_~#t606~0.base=|v_ULTIMATE.start_main_~#t606~0.base_29|, ~y~0=v_~y~0_163, ULTIMATE.start_main_#t~nondet40=|v_ULTIMATE.start_main_#t~nondet40_9|, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_48, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_30, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_48, #NULL.base=|v_#NULL.base_4|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_315, ~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_120, ULTIMATE.start_main_~#t608~0.base=|v_ULTIMATE.start_main_~#t608~0.base_17|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_26|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_117, #valid=|v_#valid_72|, #memory_int=|v_#memory_int_29|, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_9|, ~z~0=v_~z~0_163, ~weak$$choice2~0=v_~weak$$choice2~0_186, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_529} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t607~0.base, ULTIMATE.start_main_~#t605~0.offset, ULTIMATE.start_main_#t~ite47, #NULL.offset, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite45, ~y$read_delayed~0, ~a~0, ~y$mem_tmp~0, ~y$r_buff1_thd3~0, ~__unbuffered_p1_EAX~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, ~__unbuffered_p3_EAX~0, #length, ULTIMATE.start_main_~#t607~0.offset, ULTIMATE.start_main_#t~nondet41, ~weak$$choice0~0, ~y$r_buff1_thd4~0, ULTIMATE.start_main_~#t608~0.offset, ~y$w_buff1~0, ~y$read_delayed_var~0.base, ~y$r_buff0_thd2~0, ULTIMATE.start_main_#t~nondet38, ~__unbuffered_cnt~0, ~y$r_buff1_thd0~0, ~x~0, ULTIMATE.start_main_~#t605~0.base, ~y$read_delayed_var~0.offset, ~y$w_buff0_used~0, ULTIMATE.start_main_#t~ite46, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite44, ULTIMATE.start_main_~#t606~0.offset, ~y$r_buff1_thd1~0, ~y$w_buff0~0, ~y$r_buff0_thd3~0, ULTIMATE.start_main_~#t606~0.base, ~y~0, ULTIMATE.start_main_#t~nondet40, ~__unbuffered_p1_EBX~0, ~main$tmp_guard0~0, ~__unbuffered_p3_EBX~0, #NULL.base, ~y$r_buff1_thd2~0, ~y$r_buff0_thd4~0, ULTIMATE.start_main_~#t608~0.base, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, #valid, #memory_int, ULTIMATE.start_main_#t~nondet39, ~z~0, ~weak$$choice2~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-27 01:52:53,204 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [816] [816] L846-1-->L848: Formula: (and (= 0 |v_ULTIMATE.start_main_~#t606~0.offset_10|) (= (select |v_#valid_41| |v_ULTIMATE.start_main_~#t606~0.base_12|) 0) (not (= |v_ULTIMATE.start_main_~#t606~0.base_12| 0)) (= (store |v_#length_20| |v_ULTIMATE.start_main_~#t606~0.base_12| 4) |v_#length_19|) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t606~0.base_12| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t606~0.base_12|) |v_ULTIMATE.start_main_~#t606~0.offset_10| 1)) |v_#memory_int_17|) (= |v_#valid_40| (store |v_#valid_41| |v_ULTIMATE.start_main_~#t606~0.base_12| 1)) (< |v_#StackHeapBarrier_13| |v_ULTIMATE.start_main_~#t606~0.base_12|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_13|, #valid=|v_#valid_41|, #memory_int=|v_#memory_int_18|, #length=|v_#length_20|} OutVars{ULTIMATE.start_main_~#t606~0.offset=|v_ULTIMATE.start_main_~#t606~0.offset_10|, #StackHeapBarrier=|v_#StackHeapBarrier_13|, ULTIMATE.start_main_~#t606~0.base=|v_ULTIMATE.start_main_~#t606~0.base_12|, #valid=|v_#valid_40|, #memory_int=|v_#memory_int_17|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_5|, #length=|v_#length_19|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t606~0.offset, ULTIMATE.start_main_~#t606~0.base, #valid, #memory_int, ULTIMATE.start_main_#t~nondet38, #length] because there is no mapped edge [2019-12-27 01:52:53,205 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [826] [826] L848-1-->L850: Formula: (and (= (store |v_#memory_int_22| |v_ULTIMATE.start_main_~#t607~0.base_13| (store (select |v_#memory_int_22| |v_ULTIMATE.start_main_~#t607~0.base_13|) |v_ULTIMATE.start_main_~#t607~0.offset_11| 2)) |v_#memory_int_21|) (not (= 0 |v_ULTIMATE.start_main_~#t607~0.base_13|)) (< |v_#StackHeapBarrier_15| |v_ULTIMATE.start_main_~#t607~0.base_13|) (= |v_#valid_46| (store |v_#valid_47| |v_ULTIMATE.start_main_~#t607~0.base_13| 1)) (= 0 |v_ULTIMATE.start_main_~#t607~0.offset_11|) (= 0 (select |v_#valid_47| |v_ULTIMATE.start_main_~#t607~0.base_13|)) (= (store |v_#length_24| |v_ULTIMATE.start_main_~#t607~0.base_13| 4) |v_#length_23|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_15|, #valid=|v_#valid_47|, #memory_int=|v_#memory_int_22|, #length=|v_#length_24|} OutVars{ULTIMATE.start_main_~#t607~0.base=|v_ULTIMATE.start_main_~#t607~0.base_13|, ULTIMATE.start_main_~#t607~0.offset=|v_ULTIMATE.start_main_~#t607~0.offset_11|, #StackHeapBarrier=|v_#StackHeapBarrier_15|, #valid=|v_#valid_46|, #memory_int=|v_#memory_int_21|, #length=|v_#length_23|, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t607~0.base, ULTIMATE.start_main_~#t607~0.offset, #valid, #memory_int, #length, ULTIMATE.start_main_#t~nondet39] because there is no mapped edge [2019-12-27 01:52:53,208 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [730] [730] L4-->L800: Formula: (and (= v_~y$r_buff0_thd4~0_25 v_~y$r_buff1_thd4~0_25) (= v_~y$r_buff0_thd3~0_17 1) (not (= v_P2Thread1of1ForFork3___VERIFIER_assert_~expression_24 0)) (= v_~y$r_buff0_thd3~0_18 v_~y$r_buff1_thd3~0_11) (= v_~y$r_buff1_thd1~0_4 v_~y$r_buff0_thd1~0_4) (= v_~y$r_buff0_thd2~0_68 v_~y$r_buff1_thd2~0_32) (= v_~z~0_10 1) (= v_~y$r_buff0_thd0~0_19 v_~y$r_buff1_thd0~0_17)) InVars {~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_25, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_18, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_19, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_68, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_4, P2Thread1of1ForFork3___VERIFIER_assert_~expression=v_P2Thread1of1ForFork3___VERIFIER_assert_~expression_24} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_32, ~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_25, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_4, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_25, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_11, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_17, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_19, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_68, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_4, P2Thread1of1ForFork3___VERIFIER_assert_~expression=v_P2Thread1of1ForFork3___VERIFIER_assert_~expression_24, ~z~0=v_~z~0_10, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_17} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, ~y$r_buff1_thd1~0, ~y$r_buff1_thd4~0, ~y$r_buff1_thd3~0, ~y$r_buff0_thd3~0, ~z~0, ~y$r_buff1_thd0~0] because there is no mapped edge [2019-12-27 01:52:53,209 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [815] [815] L850-1-->L852: Formula: (and (= (store |v_#length_18| |v_ULTIMATE.start_main_~#t608~0.base_10| 4) |v_#length_17|) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t608~0.base_10| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t608~0.base_10|) |v_ULTIMATE.start_main_~#t608~0.offset_10| 3)) |v_#memory_int_15|) (= 0 (select |v_#valid_39| |v_ULTIMATE.start_main_~#t608~0.base_10|)) (= |v_ULTIMATE.start_main_~#t608~0.offset_10| 0) (not (= 0 |v_ULTIMATE.start_main_~#t608~0.base_10|)) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t608~0.base_10|) (= (store |v_#valid_39| |v_ULTIMATE.start_main_~#t608~0.base_10| 1) |v_#valid_38|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_39|, #memory_int=|v_#memory_int_16|, #length=|v_#length_18|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_12|, ULTIMATE.start_main_#t~nondet40=|v_ULTIMATE.start_main_#t~nondet40_4|, ULTIMATE.start_main_~#t608~0.offset=|v_ULTIMATE.start_main_~#t608~0.offset_10|, ULTIMATE.start_main_~#t608~0.base=|v_ULTIMATE.start_main_~#t608~0.base_10|, #valid=|v_#valid_38|, #memory_int=|v_#memory_int_15|, #length=|v_#length_17|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet40, ULTIMATE.start_main_~#t608~0.offset, ULTIMATE.start_main_~#t608~0.base, #valid, #memory_int, #length] because there is no mapped edge [2019-12-27 01:52:53,212 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [810] [810] P0ENTRY-->P0EXIT: Formula: (and (= v_~a~0_23 1) (= v_~x~0_36 1) (= |v_P0Thread1of1ForFork1_#in~arg.base_19| v_P0Thread1of1ForFork1_~arg.base_19) (= v_~__unbuffered_cnt~0_101 (+ v_~__unbuffered_cnt~0_102 1)) (= 0 |v_P0Thread1of1ForFork1_#res.offset_7|) (= v_P0Thread1of1ForFork1_~arg.offset_19 |v_P0Thread1of1ForFork1_#in~arg.offset_19|) (= 0 |v_P0Thread1of1ForFork1_#res.base_7|)) InVars {P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_19|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_102, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_19|} OutVars{~a~0=v_~a~0_23, P0Thread1of1ForFork1_#res.offset=|v_P0Thread1of1ForFork1_#res.offset_7|, P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_19|, P0Thread1of1ForFork1_#res.base=|v_P0Thread1of1ForFork1_#res.base_7|, P0Thread1of1ForFork1_~arg.offset=v_P0Thread1of1ForFork1_~arg.offset_19, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_101, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_19|, ~x~0=v_~x~0_36, P0Thread1of1ForFork1_~arg.base=v_P0Thread1of1ForFork1_~arg.base_19} AuxVars[] AssignedVars[~a~0, P0Thread1of1ForFork1_#res.offset, P0Thread1of1ForFork1_#res.base, P0Thread1of1ForFork1_~arg.offset, ~__unbuffered_cnt~0, ~x~0, P0Thread1of1ForFork1_~arg.base] because there is no mapped edge [2019-12-27 01:52:53,217 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [795] [795] L823-2-->L823-4: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff1_used~0_In1501614018 256))) (.cse0 (= (mod ~y$r_buff1_thd4~0_In1501614018 256) 0))) (or (and (= ~y$w_buff1~0_In1501614018 |P3Thread1of1ForFork0_#t~ite32_Out1501614018|) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= ~y~0_In1501614018 |P3Thread1of1ForFork0_#t~ite32_Out1501614018|)))) InVars {~y$r_buff1_thd4~0=~y$r_buff1_thd4~0_In1501614018, ~y$w_buff1~0=~y$w_buff1~0_In1501614018, ~y~0=~y~0_In1501614018, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1501614018} OutVars{~y$r_buff1_thd4~0=~y$r_buff1_thd4~0_In1501614018, ~y$w_buff1~0=~y$w_buff1~0_In1501614018, ~y~0=~y~0_In1501614018, P3Thread1of1ForFork0_#t~ite32=|P3Thread1of1ForFork0_#t~ite32_Out1501614018|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1501614018} AuxVars[] AssignedVars[P3Thread1of1ForFork0_#t~ite32] because there is no mapped edge [2019-12-27 01:52:53,217 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [755] [755] L823-4-->L824: Formula: (= v_~y~0_43 |v_P3Thread1of1ForFork0_#t~ite32_14|) InVars {P3Thread1of1ForFork0_#t~ite32=|v_P3Thread1of1ForFork0_#t~ite32_14|} OutVars{~y~0=v_~y~0_43, P3Thread1of1ForFork0_#t~ite33=|v_P3Thread1of1ForFork0_#t~ite33_15|, P3Thread1of1ForFork0_#t~ite32=|v_P3Thread1of1ForFork0_#t~ite32_13|} AuxVars[] AssignedVars[~y~0, P3Thread1of1ForFork0_#t~ite33, P3Thread1of1ForFork0_#t~ite32] because there is no mapped edge [2019-12-27 01:52:53,217 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [785] [785] L824-->L824-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In1665614030 256))) (.cse0 (= 0 (mod ~y$r_buff0_thd4~0_In1665614030 256)))) (or (and (not .cse0) (= |P3Thread1of1ForFork0_#t~ite34_Out1665614030| 0) (not .cse1)) (and (or .cse1 .cse0) (= |P3Thread1of1ForFork0_#t~ite34_Out1665614030| ~y$w_buff0_used~0_In1665614030)))) InVars {~y$r_buff0_thd4~0=~y$r_buff0_thd4~0_In1665614030, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1665614030} OutVars{~y$r_buff0_thd4~0=~y$r_buff0_thd4~0_In1665614030, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1665614030, P3Thread1of1ForFork0_#t~ite34=|P3Thread1of1ForFork0_#t~ite34_Out1665614030|} AuxVars[] AssignedVars[P3Thread1of1ForFork0_#t~ite34] because there is no mapped edge [2019-12-27 01:52:53,217 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [779] [779] L801-->L801-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd3~0_In989690915 256))) (.cse1 (= (mod ~y$w_buff0_used~0_In989690915 256) 0))) (or (and (not .cse0) (= 0 |P2Thread1of1ForFork3_#t~ite28_Out989690915|) (not .cse1)) (and (or .cse0 .cse1) (= ~y$w_buff0_used~0_In989690915 |P2Thread1of1ForFork3_#t~ite28_Out989690915|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In989690915, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In989690915} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In989690915, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In989690915, P2Thread1of1ForFork3_#t~ite28=|P2Thread1of1ForFork3_#t~ite28_Out989690915|} AuxVars[] AssignedVars[P2Thread1of1ForFork3_#t~ite28] because there is no mapped edge [2019-12-27 01:52:53,218 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [784] [784] L802-->L802-2: Formula: (let ((.cse2 (= (mod ~y$w_buff1_used~0_In-1018133463 256) 0)) (.cse3 (= (mod ~y$r_buff1_thd3~0_In-1018133463 256) 0)) (.cse0 (= 0 (mod ~y$r_buff0_thd3~0_In-1018133463 256))) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In-1018133463 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P2Thread1of1ForFork3_#t~ite29_Out-1018133463| 0)) (and (= |P2Thread1of1ForFork3_#t~ite29_Out-1018133463| ~y$w_buff1_used~0_In-1018133463) (or .cse2 .cse3) (or .cse0 .cse1)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-1018133463, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1018133463, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-1018133463, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1018133463} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-1018133463, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1018133463, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-1018133463, P2Thread1of1ForFork3_#t~ite29=|P2Thread1of1ForFork3_#t~ite29_Out-1018133463|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1018133463} AuxVars[] AssignedVars[P2Thread1of1ForFork3_#t~ite29] because there is no mapped edge [2019-12-27 01:52:53,219 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [791] [791] L803-->L804: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd3~0_In405226702 256) 0)) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In405226702 256)))) (or (and (not .cse0) (= ~y$r_buff0_thd3~0_Out405226702 0) (not .cse1)) (and (= ~y$r_buff0_thd3~0_In405226702 ~y$r_buff0_thd3~0_Out405226702) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In405226702, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In405226702} OutVars{P2Thread1of1ForFork3_#t~ite30=|P2Thread1of1ForFork3_#t~ite30_Out405226702|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In405226702, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_Out405226702} AuxVars[] AssignedVars[P2Thread1of1ForFork3_#t~ite30, ~y$r_buff0_thd3~0] because there is no mapped edge [2019-12-27 01:52:53,220 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [790] [790] L804-->L804-2: Formula: (let ((.cse0 (= (mod ~y$w_buff1_used~0_In814248908 256) 0)) (.cse1 (= 0 (mod ~y$r_buff1_thd3~0_In814248908 256))) (.cse2 (= 0 (mod ~y$w_buff0_used~0_In814248908 256))) (.cse3 (= 0 (mod ~y$r_buff0_thd3~0_In814248908 256)))) (or (and (= |P2Thread1of1ForFork3_#t~ite31_Out814248908| ~y$r_buff1_thd3~0_In814248908) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= |P2Thread1of1ForFork3_#t~ite31_Out814248908| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In814248908, ~y$w_buff0_used~0=~y$w_buff0_used~0_In814248908, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In814248908, ~y$w_buff1_used~0=~y$w_buff1_used~0_In814248908} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In814248908, ~y$w_buff0_used~0=~y$w_buff0_used~0_In814248908, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In814248908, P2Thread1of1ForFork3_#t~ite31=|P2Thread1of1ForFork3_#t~ite31_Out814248908|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In814248908} AuxVars[] AssignedVars[P2Thread1of1ForFork3_#t~ite31] because there is no mapped edge [2019-12-27 01:52:53,220 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [827] [827] L804-2-->P2EXIT: Formula: (and (= |v_P2Thread1of1ForFork3_#t~ite31_40| v_~y$r_buff1_thd3~0_125) (= |v_P2Thread1of1ForFork3_#res.offset_5| 0) (= 0 |v_P2Thread1of1ForFork3_#res.base_5|) (= v_~__unbuffered_cnt~0_126 (+ v_~__unbuffered_cnt~0_127 1))) InVars {P2Thread1of1ForFork3_#t~ite31=|v_P2Thread1of1ForFork3_#t~ite31_40|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_127} OutVars{~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_125, P2Thread1of1ForFork3_#t~ite31=|v_P2Thread1of1ForFork3_#t~ite31_39|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_126, P2Thread1of1ForFork3_#res.base=|v_P2Thread1of1ForFork3_#res.base_5|, P2Thread1of1ForFork3_#res.offset=|v_P2Thread1of1ForFork3_#res.offset_5|} AuxVars[] AssignedVars[~y$r_buff1_thd3~0, P2Thread1of1ForFork3_#t~ite31, ~__unbuffered_cnt~0, P2Thread1of1ForFork3_#res.base, P2Thread1of1ForFork3_#res.offset] because there is no mapped edge [2019-12-27 01:52:53,221 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [787] [787] L825-->L825-2: Formula: (let ((.cse3 (= 0 (mod ~y$w_buff0_used~0_In-1378790285 256))) (.cse2 (= 0 (mod ~y$r_buff0_thd4~0_In-1378790285 256))) (.cse1 (= 0 (mod ~y$r_buff1_thd4~0_In-1378790285 256))) (.cse0 (= 0 (mod ~y$w_buff1_used~0_In-1378790285 256)))) (or (and (or .cse0 .cse1) (= |P3Thread1of1ForFork0_#t~ite35_Out-1378790285| ~y$w_buff1_used~0_In-1378790285) (or .cse2 .cse3)) (and (= 0 |P3Thread1of1ForFork0_#t~ite35_Out-1378790285|) (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0)))))) InVars {~y$r_buff0_thd4~0=~y$r_buff0_thd4~0_In-1378790285, ~y$r_buff1_thd4~0=~y$r_buff1_thd4~0_In-1378790285, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1378790285, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1378790285} OutVars{~y$r_buff0_thd4~0=~y$r_buff0_thd4~0_In-1378790285, ~y$r_buff1_thd4~0=~y$r_buff1_thd4~0_In-1378790285, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1378790285, P3Thread1of1ForFork0_#t~ite35=|P3Thread1of1ForFork0_#t~ite35_Out-1378790285|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1378790285} AuxVars[] AssignedVars[P3Thread1of1ForFork0_#t~ite35] because there is no mapped edge [2019-12-27 01:52:53,222 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [788] [788] L826-->L826-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd4~0_In-1956530107 256))) (.cse1 (= (mod ~y$w_buff0_used~0_In-1956530107 256) 0))) (or (and (= ~y$r_buff0_thd4~0_In-1956530107 |P3Thread1of1ForFork0_#t~ite36_Out-1956530107|) (or .cse0 .cse1)) (and (= 0 |P3Thread1of1ForFork0_#t~ite36_Out-1956530107|) (not .cse0) (not .cse1)))) InVars {~y$r_buff0_thd4~0=~y$r_buff0_thd4~0_In-1956530107, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1956530107} OutVars{~y$r_buff0_thd4~0=~y$r_buff0_thd4~0_In-1956530107, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1956530107, P3Thread1of1ForFork0_#t~ite36=|P3Thread1of1ForFork0_#t~ite36_Out-1956530107|} AuxVars[] AssignedVars[P3Thread1of1ForFork0_#t~ite36] because there is no mapped edge [2019-12-27 01:52:53,223 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [777] [777] L827-->L827-2: Formula: (let ((.cse2 (= (mod ~y$w_buff1_used~0_In-1180176838 256) 0)) (.cse3 (= (mod ~y$r_buff1_thd4~0_In-1180176838 256) 0)) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In-1180176838 256))) (.cse0 (= 0 (mod ~y$r_buff0_thd4~0_In-1180176838 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P3Thread1of1ForFork0_#t~ite37_Out-1180176838|)) (and (or .cse2 .cse3) (= |P3Thread1of1ForFork0_#t~ite37_Out-1180176838| ~y$r_buff1_thd4~0_In-1180176838) (or .cse1 .cse0)))) InVars {~y$r_buff0_thd4~0=~y$r_buff0_thd4~0_In-1180176838, ~y$r_buff1_thd4~0=~y$r_buff1_thd4~0_In-1180176838, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1180176838, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1180176838} OutVars{~y$r_buff0_thd4~0=~y$r_buff0_thd4~0_In-1180176838, ~y$r_buff1_thd4~0=~y$r_buff1_thd4~0_In-1180176838, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1180176838, P3Thread1of1ForFork0_#t~ite37=|P3Thread1of1ForFork0_#t~ite37_Out-1180176838|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1180176838} AuxVars[] AssignedVars[P3Thread1of1ForFork0_#t~ite37] because there is no mapped edge [2019-12-27 01:52:53,223 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [807] [807] L827-2-->P3EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_96 1) v_~__unbuffered_cnt~0_95) (= |v_P3Thread1of1ForFork0_#t~ite37_48| v_~y$r_buff1_thd4~0_61) (= |v_P3Thread1of1ForFork0_#res.base_5| 0) (= 0 |v_P3Thread1of1ForFork0_#res.offset_5|)) InVars {P3Thread1of1ForFork0_#t~ite37=|v_P3Thread1of1ForFork0_#t~ite37_48|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_96} OutVars{~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_61, P3Thread1of1ForFork0_#res.offset=|v_P3Thread1of1ForFork0_#res.offset_5|, P3Thread1of1ForFork0_#t~ite37=|v_P3Thread1of1ForFork0_#t~ite37_47|, P3Thread1of1ForFork0_#res.base=|v_P3Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_95} AuxVars[] AssignedVars[~y$r_buff1_thd4~0, P3Thread1of1ForFork0_#res.offset, P3Thread1of1ForFork0_#t~ite37, P3Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-27 01:52:53,224 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [831] [831] L764-->L764-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In-1457358738 256) 0))) (or (and .cse0 (= |P1Thread1of1ForFork2_#t~ite9_Out-1457358738| |P1Thread1of1ForFork2_#t~ite8_Out-1457358738|) (= ~y$w_buff0~0_In-1457358738 |P1Thread1of1ForFork2_#t~ite8_Out-1457358738|) (let ((.cse1 (= (mod ~y$r_buff0_thd2~0_In-1457358738 256) 0))) (or (= (mod ~y$w_buff0_used~0_In-1457358738 256) 0) (and (= (mod ~y$r_buff1_thd2~0_In-1457358738 256) 0) .cse1) (and (= (mod ~y$w_buff1_used~0_In-1457358738 256) 0) .cse1)))) (and (not .cse0) (= |P1Thread1of1ForFork2_#t~ite8_In-1457358738| |P1Thread1of1ForFork2_#t~ite8_Out-1457358738|) (= ~y$w_buff0~0_In-1457358738 |P1Thread1of1ForFork2_#t~ite9_Out-1457358738|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1457358738, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1457358738, P1Thread1of1ForFork2_#t~ite8=|P1Thread1of1ForFork2_#t~ite8_In-1457358738|, ~y$w_buff0~0=~y$w_buff0~0_In-1457358738, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1457358738, ~weak$$choice2~0=~weak$$choice2~0_In-1457358738, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1457358738} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1457358738, P1Thread1of1ForFork2_#t~ite9=|P1Thread1of1ForFork2_#t~ite9_Out-1457358738|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1457358738, P1Thread1of1ForFork2_#t~ite8=|P1Thread1of1ForFork2_#t~ite8_Out-1457358738|, ~y$w_buff0~0=~y$w_buff0~0_In-1457358738, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1457358738, ~weak$$choice2~0=~weak$$choice2~0_In-1457358738, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1457358738} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite9, P1Thread1of1ForFork2_#t~ite8] because there is no mapped edge [2019-12-27 01:52:53,227 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [830] [830] L766-->L766-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In1142014905 256)))) (or (and (= |P1Thread1of1ForFork2_#t~ite14_Out1142014905| |P1Thread1of1ForFork2_#t~ite15_Out1142014905|) .cse0 (= ~y$w_buff0_used~0_In1142014905 |P1Thread1of1ForFork2_#t~ite14_Out1142014905|) (let ((.cse1 (= (mod ~y$r_buff0_thd2~0_In1142014905 256) 0))) (or (= 0 (mod ~y$w_buff0_used~0_In1142014905 256)) (and (= 0 (mod ~y$w_buff1_used~0_In1142014905 256)) .cse1) (and (= 0 (mod ~y$r_buff1_thd2~0_In1142014905 256)) .cse1)))) (and (not .cse0) (= ~y$w_buff0_used~0_In1142014905 |P1Thread1of1ForFork2_#t~ite15_Out1142014905|) (= |P1Thread1of1ForFork2_#t~ite14_In1142014905| |P1Thread1of1ForFork2_#t~ite14_Out1142014905|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1142014905, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1142014905, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1142014905, ~weak$$choice2~0=~weak$$choice2~0_In1142014905, P1Thread1of1ForFork2_#t~ite14=|P1Thread1of1ForFork2_#t~ite14_In1142014905|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1142014905} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1142014905, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1142014905, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1142014905, P1Thread1of1ForFork2_#t~ite14=|P1Thread1of1ForFork2_#t~ite14_Out1142014905|, ~weak$$choice2~0=~weak$$choice2~0_In1142014905, P1Thread1of1ForFork2_#t~ite15=|P1Thread1of1ForFork2_#t~ite15_Out1142014905|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1142014905} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite14, P1Thread1of1ForFork2_#t~ite15] because there is no mapped edge [2019-12-27 01:52:53,230 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [772] [772] L768-->L769: Formula: (and (= v_~y$r_buff0_thd2~0_109 v_~y$r_buff0_thd2~0_108) (not (= (mod v_~weak$$choice2~0_39 256) 0))) InVars {~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_109, ~weak$$choice2~0=v_~weak$$choice2~0_39} OutVars{P1Thread1of1ForFork2_#t~ite19=|v_P1Thread1of1ForFork2_#t~ite19_15|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_108, P1Thread1of1ForFork2_#t~ite20=|v_P1Thread1of1ForFork2_#t~ite20_10|, P1Thread1of1ForFork2_#t~ite21=|v_P1Thread1of1ForFork2_#t~ite21_7|, ~weak$$choice2~0=v_~weak$$choice2~0_39} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite19, ~y$r_buff0_thd2~0, P1Thread1of1ForFork2_#t~ite20, P1Thread1of1ForFork2_#t~ite21] because there is no mapped edge [2019-12-27 01:52:53,230 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [829] [829] L769-->L769-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In1457273009 256)))) (or (and (not .cse0) (= |P1Thread1of1ForFork2_#t~ite23_In1457273009| |P1Thread1of1ForFork2_#t~ite23_Out1457273009|) (= |P1Thread1of1ForFork2_#t~ite24_Out1457273009| ~y$r_buff1_thd2~0_In1457273009)) (and .cse0 (let ((.cse1 (= (mod ~y$r_buff0_thd2~0_In1457273009 256) 0))) (or (and .cse1 (= 0 (mod ~y$r_buff1_thd2~0_In1457273009 256))) (= (mod ~y$w_buff0_used~0_In1457273009 256) 0) (and .cse1 (= (mod ~y$w_buff1_used~0_In1457273009 256) 0)))) (= |P1Thread1of1ForFork2_#t~ite24_Out1457273009| |P1Thread1of1ForFork2_#t~ite23_Out1457273009|) (= ~y$r_buff1_thd2~0_In1457273009 |P1Thread1of1ForFork2_#t~ite23_Out1457273009|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1457273009, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1457273009, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1457273009, P1Thread1of1ForFork2_#t~ite23=|P1Thread1of1ForFork2_#t~ite23_In1457273009|, ~weak$$choice2~0=~weak$$choice2~0_In1457273009, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1457273009} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1457273009, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1457273009, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1457273009, P1Thread1of1ForFork2_#t~ite23=|P1Thread1of1ForFork2_#t~ite23_Out1457273009|, ~weak$$choice2~0=~weak$$choice2~0_In1457273009, P1Thread1of1ForFork2_#t~ite24=|P1Thread1of1ForFork2_#t~ite24_Out1457273009|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1457273009} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite23, P1Thread1of1ForFork2_#t~ite24] because there is no mapped edge [2019-12-27 01:52:53,231 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [717] [717] L771-->L779: Formula: (and (= 0 v_~y$flush_delayed~0_8) (= (+ v_~__unbuffered_cnt~0_41 1) v_~__unbuffered_cnt~0_40) (= v_~y~0_19 v_~y$mem_tmp~0_4) (not (= 0 (mod v_~y$flush_delayed~0_9 256)))) InVars {~y$mem_tmp~0=v_~y$mem_tmp~0_4, ~y$flush_delayed~0=v_~y$flush_delayed~0_9, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_41} OutVars{~y$mem_tmp~0=v_~y$mem_tmp~0_4, ~y$flush_delayed~0=v_~y$flush_delayed~0_8, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_40, ~y~0=v_~y~0_19, P1Thread1of1ForFork2_#t~ite25=|v_P1Thread1of1ForFork2_#t~ite25_11|} AuxVars[] AssignedVars[~y$flush_delayed~0, ~__unbuffered_cnt~0, ~y~0, P1Thread1of1ForFork2_#t~ite25] because there is no mapped edge [2019-12-27 01:52:53,232 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [705] [705] L852-1-->L858: Formula: (and (= 4 v_~__unbuffered_cnt~0_15) (= v_~main$tmp_guard0~0_6 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_15} OutVars{ULTIMATE.start_main_#t~nondet41=|v_ULTIMATE.start_main_#t~nondet41_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_15, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_6} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet41, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-27 01:52:53,233 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [782] [782] L858-2-->L858-5: Formula: (let ((.cse1 (= (mod ~y$w_buff1_used~0_In-951177875 256) 0)) (.cse2 (= 0 (mod ~y$r_buff1_thd0~0_In-951177875 256))) (.cse0 (= |ULTIMATE.start_main_#t~ite42_Out-951177875| |ULTIMATE.start_main_#t~ite43_Out-951177875|))) (or (and (= |ULTIMATE.start_main_#t~ite42_Out-951177875| ~y$w_buff1~0_In-951177875) .cse0 (not .cse1) (not .cse2)) (and (or .cse1 .cse2) .cse0 (= ~y~0_In-951177875 |ULTIMATE.start_main_#t~ite42_Out-951177875|)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In-951177875, ~y~0=~y~0_In-951177875, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-951177875, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-951177875} OutVars{~y$w_buff1~0=~y$w_buff1~0_In-951177875, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out-951177875|, ~y~0=~y~0_In-951177875, ULTIMATE.start_main_#t~ite42=|ULTIMATE.start_main_#t~ite42_Out-951177875|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-951177875, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-951177875} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-27 01:52:53,234 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [797] [797] L859-->L859-2: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In-517943598 256) 0)) (.cse1 (= (mod ~y$r_buff0_thd0~0_In-517943598 256) 0))) (or (and (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite44_Out-517943598|) (not .cse1)) (and (= |ULTIMATE.start_main_#t~ite44_Out-517943598| ~y$w_buff0_used~0_In-517943598) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-517943598, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-517943598} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-517943598, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-517943598, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out-517943598|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-27 01:52:53,235 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [786] [786] L860-->L860-2: Formula: (let ((.cse3 (= (mod ~y$r_buff1_thd0~0_In-2094430980 256) 0)) (.cse2 (= 0 (mod ~y$w_buff1_used~0_In-2094430980 256))) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In-2094430980 256))) (.cse0 (= (mod ~y$r_buff0_thd0~0_In-2094430980 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite45_Out-2094430980| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse3 .cse2) (or .cse1 .cse0) (= |ULTIMATE.start_main_#t~ite45_Out-2094430980| ~y$w_buff1_used~0_In-2094430980)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-2094430980, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-2094430980, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-2094430980, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2094430980} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-2094430980, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-2094430980, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-2094430980, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out-2094430980|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2094430980} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-12-27 01:52:53,236 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [789] [789] L861-->L861-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In-444788057 256))) (.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In-444788057 256)))) (or (and (= ~y$r_buff0_thd0~0_In-444788057 |ULTIMATE.start_main_#t~ite46_Out-444788057|) (or .cse0 .cse1)) (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite46_Out-444788057| 0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-444788057, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-444788057} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-444788057, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-444788057, ULTIMATE.start_main_#t~ite46=|ULTIMATE.start_main_#t~ite46_Out-444788057|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite46] because there is no mapped edge [2019-12-27 01:52:53,237 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [796] [796] L862-->L862-2: Formula: (let ((.cse3 (= (mod ~y$w_buff1_used~0_In-1587375237 256) 0)) (.cse2 (= 0 (mod ~y$r_buff1_thd0~0_In-1587375237 256))) (.cse0 (= 0 (mod ~y$r_buff0_thd0~0_In-1587375237 256))) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In-1587375237 256)))) (or (and (= |ULTIMATE.start_main_#t~ite47_Out-1587375237| ~y$r_buff1_thd0~0_In-1587375237) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1))) (= |ULTIMATE.start_main_#t~ite47_Out-1587375237| 0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1587375237, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1587375237, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1587375237, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1587375237} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1587375237, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1587375237, ULTIMATE.start_main_#t~ite47=|ULTIMATE.start_main_#t~ite47_Out-1587375237|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1587375237, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1587375237} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite47] because there is no mapped edge [2019-12-27 01:52:53,238 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [833] [833] L862-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= 2 v_~__unbuffered_p1_EAX~0_26) (= 2 v_~__unbuffered_p3_EAX~0_24) (= v_~__unbuffered_p1_EBX~0_25 0) (= v_ULTIMATE.start___VERIFIER_assert_~expression_16 0) (= v_ULTIMATE.start___VERIFIER_assert_~expression_16 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_9|) (= v_~y$r_buff1_thd0~0_153 |v_ULTIMATE.start_main_#t~ite47_41|) (= 0 v_~__unbuffered_p3_EBX~0_24) (= v_~x~0_45 2) (= v_~main$tmp_guard1~0_19 0) (= v_~z~0_103 2)) InVars {~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_25, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_26, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_24, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_41|, ~z~0=v_~z~0_103, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_24, ~x~0=v_~x~0_45} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_16, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_25, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_26, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_24, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_40|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_19, ~z~0=v_~z~0_103, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_24, ~x~0=v_~x~0_45, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_153, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_9|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ULTIMATE.start_main_#t~ite47, ~main$tmp_guard1~0, ~y$r_buff1_thd0~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-27 01:52:53,353 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 01:52:53 BasicIcfg [2019-12-27 01:52:53,353 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 01:52:53,356 INFO L168 Benchmark]: Toolchain (without parser) took 129057.03 ms. Allocated memory was 138.9 MB in the beginning and 3.3 GB in the end (delta: 3.1 GB). Free memory was 100.5 MB in the beginning and 1.6 GB in the end (delta: -1.5 GB). Peak memory consumption was 1.6 GB. Max. memory is 7.1 GB. [2019-12-27 01:52:53,356 INFO L168 Benchmark]: CDTParser took 0.47 ms. Allocated memory is still 138.9 MB. Free memory is still 120.5 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-12-27 01:52:53,357 INFO L168 Benchmark]: CACSL2BoogieTranslator took 774.29 ms. Allocated memory was 138.9 MB in the beginning and 203.9 MB in the end (delta: 65.0 MB). Free memory was 100.5 MB in the beginning and 155.7 MB in the end (delta: -55.2 MB). Peak memory consumption was 25.1 MB. Max. memory is 7.1 GB. [2019-12-27 01:52:53,357 INFO L168 Benchmark]: Boogie Procedure Inliner took 62.07 ms. Allocated memory is still 203.9 MB. Free memory was 155.7 MB in the beginning and 153.8 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. [2019-12-27 01:52:53,358 INFO L168 Benchmark]: Boogie Preprocessor took 40.69 ms. Allocated memory is still 203.9 MB. Free memory was 153.8 MB in the beginning and 150.9 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. [2019-12-27 01:52:53,358 INFO L168 Benchmark]: RCFGBuilder took 840.51 ms. Allocated memory is still 203.9 MB. Free memory was 150.9 MB in the beginning and 102.2 MB in the end (delta: 48.7 MB). Peak memory consumption was 48.7 MB. Max. memory is 7.1 GB. [2019-12-27 01:52:53,361 INFO L168 Benchmark]: TraceAbstraction took 127334.59 ms. Allocated memory was 203.9 MB in the beginning and 3.3 GB in the end (delta: 3.1 GB). Free memory was 101.3 MB in the beginning and 1.6 GB in the end (delta: -1.5 GB). Peak memory consumption was 1.5 GB. Max. memory is 7.1 GB. [2019-12-27 01:52:53,368 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.47 ms. Allocated memory is still 138.9 MB. Free memory is still 120.5 MB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 774.29 ms. Allocated memory was 138.9 MB in the beginning and 203.9 MB in the end (delta: 65.0 MB). Free memory was 100.5 MB in the beginning and 155.7 MB in the end (delta: -55.2 MB). Peak memory consumption was 25.1 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 62.07 ms. Allocated memory is still 203.9 MB. Free memory was 155.7 MB in the beginning and 153.8 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 40.69 ms. Allocated memory is still 203.9 MB. Free memory was 153.8 MB in the beginning and 150.9 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. * RCFGBuilder took 840.51 ms. Allocated memory is still 203.9 MB. Free memory was 150.9 MB in the beginning and 102.2 MB in the end (delta: 48.7 MB). Peak memory consumption was 48.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 127334.59 ms. Allocated memory was 203.9 MB in the beginning and 3.3 GB in the end (delta: 3.1 GB). Free memory was 101.3 MB in the beginning and 1.6 GB in the end (delta: -1.5 GB). Peak memory consumption was 1.5 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 6.2s, 181 ProgramPointsBefore, 88 ProgramPointsAfterwards, 209 TransitionsBefore, 95 TransitionsAfterwards, 18126 CoEnabledTransitionPairs, 7 FixpointIterations, 37 TrivialSequentialCompositions, 49 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 37 ConcurrentYvCompositions, 26 ChoiceCompositions, 7917 VarBasedMoverChecksPositive, 267 VarBasedMoverChecksNegative, 87 SemBasedMoverChecksPositive, 235 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.7s, 0 MoverChecksTotal, 66461 CheckedPairsTotal, 123 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L846] FCALL, FORK 0 pthread_create(&t605, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L848] FCALL, FORK 0 pthread_create(&t606, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L850] FCALL, FORK 0 pthread_create(&t607, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L784] 3 y$w_buff1 = y$w_buff0 [L785] 3 y$w_buff0 = 1 [L786] 3 y$w_buff1_used = y$w_buff0_used [L787] 3 y$w_buff0_used = (_Bool)1 [L800] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L852] FCALL, FORK 0 pthread_create(&t608, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L814] 4 z = 2 [L817] 4 __unbuffered_p3_EAX = z [L820] 4 __unbuffered_p3_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L823] 4 y$w_buff0_used && y$r_buff0_thd4 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L753] 2 x = 2 [L756] 2 __unbuffered_p1_EAX = x [L759] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L760] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L761] 2 y$flush_delayed = weak$$choice2 [L762] 2 y$mem_tmp = y VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0: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=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L763] EXPR 2 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) VAL [!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1)=0, \result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0: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=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L800] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L763] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L801] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L802] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L824] 4 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$w_buff0_used [L825] 4 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$w_buff1_used [L826] 4 y$r_buff0_thd4 = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$r_buff0_thd4 [L764] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L765] EXPR 2 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0: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 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1))=0, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L765] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L766] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L767] EXPR 2 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0: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 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L767] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L769] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L770] 2 __unbuffered_p1_EBX = y VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0: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=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L858] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0: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=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L858] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L859] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L860] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L861] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 169 locations, 2 error locations. Result: UNSAFE, OverallTime: 126.9s, OverallIterations: 24, TraceHistogramMax: 1, AutomataDifference: 33.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 5208 SDtfs, 8255 SDslu, 20497 SDs, 0 SdLazy, 10743 SolverSat, 422 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 9.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 342 GetRequests, 34 SyntacticMatches, 9 SemanticMatches, 299 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1722 ImplicationChecksByTransitivity, 4.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=160898occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 49.2s AutomataMinimizationTime, 23 MinimizatonAttempts, 186710 StatesRemovedByMinimization, 19 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.5s InterpolantComputationTime, 1074 NumberOfCodeBlocks, 1074 NumberOfCodeBlocksAsserted, 24 NumberOfCheckSat, 992 ConstructedInterpolants, 0 QuantifiedInterpolants, 216014 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 23 InterpolantComputations, 23 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...