/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-VariableLbe.epf -i ../../../trunk/examples/svcomp/pthread-wmm/safe031_power.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 08:08:18,071 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 08:08:18,074 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 08:08:18,087 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 08:08:18,087 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 08:08:18,088 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 08:08:18,090 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 08:08:18,091 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 08:08:18,093 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 08:08:18,094 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 08:08:18,095 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 08:08:18,096 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 08:08:18,096 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 08:08:18,097 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 08:08:18,098 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 08:08:18,099 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 08:08:18,099 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 08:08:18,100 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 08:08:18,102 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 08:08:18,104 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 08:08:18,105 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 08:08:18,106 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 08:08:18,107 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 08:08:18,108 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 08:08:18,110 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 08:08:18,110 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 08:08:18,110 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 08:08:18,111 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 08:08:18,111 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 08:08:18,112 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 08:08:18,112 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 08:08:18,113 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 08:08:18,114 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 08:08:18,114 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 08:08:18,115 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 08:08:18,116 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 08:08:18,116 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 08:08:18,116 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 08:08:18,117 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 08:08:18,117 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 08:08:18,118 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 08:08:18,119 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-VariableLbe.epf [2019-12-27 08:08:18,132 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 08:08:18,132 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 08:08:18,133 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 08:08:18,133 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 08:08:18,134 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 08:08:18,134 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 08:08:18,134 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 08:08:18,134 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 08:08:18,134 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 08:08:18,135 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 08:08:18,135 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 08:08:18,135 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 08:08:18,135 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 08:08:18,135 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 08:08:18,136 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 08:08:18,136 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 08:08:18,136 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 08:08:18,136 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 08:08:18,136 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 08:08:18,137 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 08:08:18,137 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 08:08:18,137 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 08:08:18,137 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 08:08:18,137 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 08:08:18,138 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 08:08:18,138 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 08:08:18,138 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 08:08:18,138 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2019-12-27 08:08:18,138 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 08:08:18,139 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 08:08:18,394 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 08:08:18,406 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 08:08:18,410 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 08:08:18,411 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 08:08:18,412 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 08:08:18,412 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe031_power.oepc.i [2019-12-27 08:08:18,497 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e448f657a/a85c406695dd44f497d42a3512fbae10/FLAG8527ef478 [2019-12-27 08:08:19,085 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 08:08:19,085 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe031_power.oepc.i [2019-12-27 08:08:19,099 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e448f657a/a85c406695dd44f497d42a3512fbae10/FLAG8527ef478 [2019-12-27 08:08:19,308 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e448f657a/a85c406695dd44f497d42a3512fbae10 [2019-12-27 08:08:19,317 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 08:08:19,320 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 08:08:19,320 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 08:08:19,321 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 08:08:19,325 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 08:08:19,326 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 08:08:19" (1/1) ... [2019-12-27 08:08:19,329 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@25e03748 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:08:19, skipping insertion in model container [2019-12-27 08:08:19,330 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 08:08:19" (1/1) ... [2019-12-27 08:08:19,339 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 08:08:19,396 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 08:08:19,920 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 08:08:19,932 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 08:08:19,999 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 08:08:20,075 INFO L208 MainTranslator]: Completed translation [2019-12-27 08:08:20,075 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:08:20 WrapperNode [2019-12-27 08:08:20,075 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 08:08:20,076 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 08:08:20,076 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 08:08:20,076 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 08:08:20,085 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:08:20" (1/1) ... [2019-12-27 08:08:20,113 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:08:20" (1/1) ... [2019-12-27 08:08:20,150 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 08:08:20,150 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 08:08:20,150 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 08:08:20,150 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 08:08:20,159 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:08:20" (1/1) ... [2019-12-27 08:08:20,159 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:08:20" (1/1) ... [2019-12-27 08:08:20,163 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:08:20" (1/1) ... [2019-12-27 08:08:20,164 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:08:20" (1/1) ... [2019-12-27 08:08:20,175 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:08:20" (1/1) ... [2019-12-27 08:08:20,180 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:08:20" (1/1) ... [2019-12-27 08:08:20,183 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:08:20" (1/1) ... [2019-12-27 08:08:20,189 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 08:08:20,189 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 08:08:20,189 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 08:08:20,189 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 08:08:20,190 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:08:20" (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 08:08:20,250 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 08:08:20,250 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 08:08:20,250 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 08:08:20,251 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 08:08:20,251 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 08:08:20,251 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 08:08:20,251 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 08:08:20,251 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 08:08:20,251 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-27 08:08:20,252 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-27 08:08:20,252 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 08:08:20,252 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 08:08:20,252 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 08:08:20,254 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 08:08:20,996 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 08:08:20,996 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 08:08:20,998 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 08:08:20 BoogieIcfgContainer [2019-12-27 08:08:20,998 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 08:08:20,999 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 08:08:20,999 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 08:08:21,004 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 08:08:21,005 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 08:08:19" (1/3) ... [2019-12-27 08:08:21,008 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e9c6859 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 08:08:21, skipping insertion in model container [2019-12-27 08:08:21,008 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:08:20" (2/3) ... [2019-12-27 08:08:21,009 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e9c6859 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 08:08:21, skipping insertion in model container [2019-12-27 08:08:21,009 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 08:08:20" (3/3) ... [2019-12-27 08:08:21,012 INFO L109 eAbstractionObserver]: Analyzing ICFG safe031_power.oepc.i [2019-12-27 08:08:21,023 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 08:08:21,023 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 08:08:21,041 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 08:08:21,042 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 08:08:21,093 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:21,094 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:21,094 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:21,095 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:21,095 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:21,095 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:21,095 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:21,095 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:21,096 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:21,096 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:21,097 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:21,097 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:21,097 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:21,097 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:21,098 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:21,098 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:21,098 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:21,099 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:21,099 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:21,099 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:21,099 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:21,100 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:21,100 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:21,101 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:21,101 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:21,101 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:21,101 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:21,102 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:21,102 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:21,102 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:21,102 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:21,103 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:21,103 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:21,103 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:21,103 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:21,104 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:21,104 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:21,104 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:21,105 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:21,105 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:21,105 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:21,105 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:21,106 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:21,106 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:21,106 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:21,106 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:21,107 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:21,107 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:21,107 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:21,107 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:21,108 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:21,108 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:21,108 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:21,108 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:21,109 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:21,109 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:21,109 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:21,110 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:21,110 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:21,110 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:21,110 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:21,111 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:21,111 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:21,111 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:21,111 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:21,111 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:21,112 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:21,112 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:21,112 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:21,112 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:21,113 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:21,113 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:21,113 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:21,113 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:21,114 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:21,114 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:21,114 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:21,114 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:21,114 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:21,115 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:21,115 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:21,115 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:21,116 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:21,116 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:21,116 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:21,116 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:21,117 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:21,117 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:21,117 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:21,117 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:21,117 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:21,118 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:21,118 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:21,118 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:21,119 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:21,119 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:21,120 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:21,120 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:21,120 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:21,120 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:21,120 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:21,121 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:21,121 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:21,121 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:21,122 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:21,122 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:21,122 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:21,122 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:21,123 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:21,123 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:21,123 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:21,123 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:21,124 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:21,124 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:21,124 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:21,124 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:21,125 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:21,125 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:21,125 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:21,125 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:21,126 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:21,126 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:21,126 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:21,126 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:21,127 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:21,127 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:21,127 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:21,143 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:21,144 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:21,144 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:21,144 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:21,144 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:21,145 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:21,145 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:21,145 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:21,145 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:21,145 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:21,146 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:21,146 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:21,146 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:21,146 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:21,146 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:21,147 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:21,147 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:21,147 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:21,147 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:21,148 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:21,148 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:21,148 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:21,148 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:21,148 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:21,149 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:21,149 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:21,149 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:21,149 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:21,149 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:21,150 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:21,150 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:21,153 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:21,153 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:21,154 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:21,154 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:21,154 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:21,154 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:21,154 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:21,155 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:21,155 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:21,155 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:21,155 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:21,155 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:21,158 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:21,158 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:21,158 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:21,158 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:21,159 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:21,159 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:21,159 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:21,159 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:21,159 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:21,160 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:21,162 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:21,162 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:21,163 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:21,163 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:21,163 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:21,163 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:21,163 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:21,164 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:21,164 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:21,164 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:21,164 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:21,164 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:21,165 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:21,165 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:21,165 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:21,165 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:21,165 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:21,165 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:21,166 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:21,166 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:21,166 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:21,166 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:21,167 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:21,167 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:21,167 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:21,167 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:21,167 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:21,182 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-27 08:08:21,201 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 08:08:21,201 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 08:08:21,201 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 08:08:21,201 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-27 08:08:21,201 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 08:08:21,202 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 08:08:21,202 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 08:08:21,202 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 08:08:21,217 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 162 places, 193 transitions [2019-12-27 08:08:21,219 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 162 places, 193 transitions [2019-12-27 08:08:21,314 INFO L132 PetriNetUnfolder]: 41/190 cut-off events. [2019-12-27 08:08:21,314 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 08:08:21,330 INFO L76 FinitePrefix]: Finished finitePrefix Result has 200 conditions, 190 events. 41/190 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 447 event pairs. 0/147 useless extension candidates. Maximal degree in co-relation 161. Up to 2 conditions per place. [2019-12-27 08:08:21,353 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 162 places, 193 transitions [2019-12-27 08:08:21,406 INFO L132 PetriNetUnfolder]: 41/190 cut-off events. [2019-12-27 08:08:21,406 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 08:08:21,415 INFO L76 FinitePrefix]: Finished finitePrefix Result has 200 conditions, 190 events. 41/190 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 447 event pairs. 0/147 useless extension candidates. Maximal degree in co-relation 161. Up to 2 conditions per place. [2019-12-27 08:08:21,436 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 16696 [2019-12-27 08:08:21,437 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-27 08:08:24,828 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 79 [2019-12-27 08:08:25,102 WARN L192 SmtUtils]: Spent 263.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 85 [2019-12-27 08:08:25,236 WARN L192 SmtUtils]: Spent 128.00 ms on a formula simplification that was a NOOP. DAG size: 83 [2019-12-27 08:08:25,271 INFO L206 etLargeBlockEncoding]: Checked pairs total: 75290 [2019-12-27 08:08:25,272 INFO L214 etLargeBlockEncoding]: Total number of compositions: 109 [2019-12-27 08:08:25,275 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 85 places, 94 transitions [2019-12-27 08:08:40,207 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 92134 states. [2019-12-27 08:08:40,209 INFO L276 IsEmpty]: Start isEmpty. Operand 92134 states. [2019-12-27 08:08:40,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-12-27 08:08:40,216 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:08:40,217 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-12-27 08:08:40,218 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 08:08:40,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:08:40,224 INFO L82 PathProgramCache]: Analyzing trace with hash 790879197, now seen corresponding path program 1 times [2019-12-27 08:08:40,233 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:08:40,233 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1944635062] [2019-12-27 08:08:40,234 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:08:40,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:08:40,443 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 08:08:40,444 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1944635062] [2019-12-27 08:08:40,445 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 08:08:40,445 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 08:08:40,446 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [435549394] [2019-12-27 08:08:40,451 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 08:08:40,451 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:08:40,471 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 08:08:40,472 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 08:08:40,474 INFO L87 Difference]: Start difference. First operand 92134 states. Second operand 3 states. [2019-12-27 08:08:43,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:08:43,925 INFO L93 Difference]: Finished difference Result 90524 states and 389631 transitions. [2019-12-27 08:08:43,926 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 08:08:43,927 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-12-27 08:08:43,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:08:44,595 INFO L225 Difference]: With dead ends: 90524 [2019-12-27 08:08:44,595 INFO L226 Difference]: Without dead ends: 84882 [2019-12-27 08:08:44,597 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 08:08:47,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84882 states. [2019-12-27 08:08:49,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84882 to 84882. [2019-12-27 08:08:49,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84882 states. [2019-12-27 08:08:50,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84882 states to 84882 states and 364809 transitions. [2019-12-27 08:08:50,360 INFO L78 Accepts]: Start accepts. Automaton has 84882 states and 364809 transitions. Word has length 5 [2019-12-27 08:08:50,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:08:50,360 INFO L462 AbstractCegarLoop]: Abstraction has 84882 states and 364809 transitions. [2019-12-27 08:08:50,360 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 08:08:50,360 INFO L276 IsEmpty]: Start isEmpty. Operand 84882 states and 364809 transitions. [2019-12-27 08:08:50,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 08:08:50,368 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:08:50,368 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 08:08:50,369 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 08:08:50,369 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:08:50,369 INFO L82 PathProgramCache]: Analyzing trace with hash 2214746, now seen corresponding path program 1 times [2019-12-27 08:08:50,370 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:08:50,370 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [855643106] [2019-12-27 08:08:50,370 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:08:50,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:08:50,496 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 08:08:50,497 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [855643106] [2019-12-27 08:08:50,497 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 08:08:50,498 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 08:08:50,498 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [626189325] [2019-12-27 08:08:50,499 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 08:08:50,500 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:08:50,500 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 08:08:50,500 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 08:08:50,500 INFO L87 Difference]: Start difference. First operand 84882 states and 364809 transitions. Second operand 4 states. [2019-12-27 08:08:54,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:08:54,640 INFO L93 Difference]: Finished difference Result 130108 states and 534106 transitions. [2019-12-27 08:08:54,640 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 08:08:54,641 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-27 08:08:54,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:08:55,117 INFO L225 Difference]: With dead ends: 130108 [2019-12-27 08:08:55,117 INFO L226 Difference]: Without dead ends: 129996 [2019-12-27 08:08:55,118 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 08:08:59,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129996 states. [2019-12-27 08:09:01,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129996 to 120798. [2019-12-27 08:09:01,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120798 states. [2019-12-27 08:09:02,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120798 states to 120798 states and 501253 transitions. [2019-12-27 08:09:02,352 INFO L78 Accepts]: Start accepts. Automaton has 120798 states and 501253 transitions. Word has length 13 [2019-12-27 08:09:02,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:09:02,353 INFO L462 AbstractCegarLoop]: Abstraction has 120798 states and 501253 transitions. [2019-12-27 08:09:02,354 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 08:09:02,354 INFO L276 IsEmpty]: Start isEmpty. Operand 120798 states and 501253 transitions. [2019-12-27 08:09:02,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 08:09:02,357 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:09:02,357 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 08:09:02,357 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 08:09:02,357 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:09:02,357 INFO L82 PathProgramCache]: Analyzing trace with hash -1319615161, now seen corresponding path program 1 times [2019-12-27 08:09:02,358 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:09:02,358 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1803318235] [2019-12-27 08:09:02,358 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:09:02,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:09:02,415 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 08:09:02,415 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1803318235] [2019-12-27 08:09:02,415 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 08:09:02,416 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 08:09:02,416 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1418023570] [2019-12-27 08:09:02,416 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 08:09:02,416 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:09:02,417 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 08:09:02,417 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 08:09:02,417 INFO L87 Difference]: Start difference. First operand 120798 states and 501253 transitions. Second operand 3 states. [2019-12-27 08:09:06,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:09:06,231 INFO L93 Difference]: Finished difference Result 29480 states and 98975 transitions. [2019-12-27 08:09:06,231 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 08:09:06,231 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-27 08:09:06,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:09:06,288 INFO L225 Difference]: With dead ends: 29480 [2019-12-27 08:09:06,288 INFO L226 Difference]: Without dead ends: 29480 [2019-12-27 08:09:06,289 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 08:09:06,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29480 states. [2019-12-27 08:09:06,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29480 to 29480. [2019-12-27 08:09:06,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29480 states. [2019-12-27 08:09:06,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29480 states to 29480 states and 98975 transitions. [2019-12-27 08:09:06,899 INFO L78 Accepts]: Start accepts. Automaton has 29480 states and 98975 transitions. Word has length 13 [2019-12-27 08:09:06,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:09:06,899 INFO L462 AbstractCegarLoop]: Abstraction has 29480 states and 98975 transitions. [2019-12-27 08:09:06,899 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 08:09:06,899 INFO L276 IsEmpty]: Start isEmpty. Operand 29480 states and 98975 transitions. [2019-12-27 08:09:06,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-27 08:09:06,901 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:09:06,901 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 08:09:06,901 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 08:09:06,901 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:09:06,901 INFO L82 PathProgramCache]: Analyzing trace with hash -856921002, now seen corresponding path program 1 times [2019-12-27 08:09:06,901 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:09:06,902 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1955740229] [2019-12-27 08:09:06,902 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:09:06,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:09:06,989 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 08:09:06,990 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1955740229] [2019-12-27 08:09:06,990 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 08:09:06,990 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 08:09:06,991 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1675266507] [2019-12-27 08:09:06,995 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 08:09:06,995 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:09:06,996 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 08:09:06,996 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 08:09:06,996 INFO L87 Difference]: Start difference. First operand 29480 states and 98975 transitions. Second operand 5 states. [2019-12-27 08:09:07,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:09:07,479 INFO L93 Difference]: Finished difference Result 42246 states and 139417 transitions. [2019-12-27 08:09:07,480 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 08:09:07,480 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2019-12-27 08:09:07,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:09:07,552 INFO L225 Difference]: With dead ends: 42246 [2019-12-27 08:09:07,552 INFO L226 Difference]: Without dead ends: 42228 [2019-12-27 08:09:07,552 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 08:09:07,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42228 states. [2019-12-27 08:09:08,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42228 to 33417. [2019-12-27 08:09:08,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33417 states. [2019-12-27 08:09:08,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33417 states to 33417 states and 111616 transitions. [2019-12-27 08:09:08,525 INFO L78 Accepts]: Start accepts. Automaton has 33417 states and 111616 transitions. Word has length 14 [2019-12-27 08:09:08,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:09:08,526 INFO L462 AbstractCegarLoop]: Abstraction has 33417 states and 111616 transitions. [2019-12-27 08:09:08,526 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 08:09:08,526 INFO L276 IsEmpty]: Start isEmpty. Operand 33417 states and 111616 transitions. [2019-12-27 08:09:08,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-27 08:09:08,536 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:09:08,536 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 08:09:08,536 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 08:09:08,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:09:08,537 INFO L82 PathProgramCache]: Analyzing trace with hash -1451441927, now seen corresponding path program 1 times [2019-12-27 08:09:08,537 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:09:08,537 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [705785560] [2019-12-27 08:09:08,538 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:09:08,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:09:08,688 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 08:09:08,688 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [705785560] [2019-12-27 08:09:08,688 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 08:09:08,688 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 08:09:08,689 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [498058206] [2019-12-27 08:09:08,689 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 08:09:08,689 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:09:08,689 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 08:09:08,689 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 08:09:08,689 INFO L87 Difference]: Start difference. First operand 33417 states and 111616 transitions. Second operand 6 states. [2019-12-27 08:09:09,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:09:09,485 INFO L93 Difference]: Finished difference Result 52783 states and 172326 transitions. [2019-12-27 08:09:09,485 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-27 08:09:09,486 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2019-12-27 08:09:09,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:09:09,572 INFO L225 Difference]: With dead ends: 52783 [2019-12-27 08:09:09,573 INFO L226 Difference]: Without dead ends: 52753 [2019-12-27 08:09:09,573 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2019-12-27 08:09:09,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52753 states. [2019-12-27 08:09:10,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52753 to 36130. [2019-12-27 08:09:10,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36130 states. [2019-12-27 08:09:10,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36130 states to 36130 states and 119897 transitions. [2019-12-27 08:09:10,263 INFO L78 Accepts]: Start accepts. Automaton has 36130 states and 119897 transitions. Word has length 22 [2019-12-27 08:09:10,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:09:10,263 INFO L462 AbstractCegarLoop]: Abstraction has 36130 states and 119897 transitions. [2019-12-27 08:09:10,263 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 08:09:10,263 INFO L276 IsEmpty]: Start isEmpty. Operand 36130 states and 119897 transitions. [2019-12-27 08:09:10,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-27 08:09:10,273 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:09:10,273 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 08:09:10,273 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 08:09:10,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:09:10,274 INFO L82 PathProgramCache]: Analyzing trace with hash -880932147, now seen corresponding path program 1 times [2019-12-27 08:09:10,274 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:09:10,274 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1304639320] [2019-12-27 08:09:10,274 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:09:10,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:09:10,363 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 08:09:10,363 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1304639320] [2019-12-27 08:09:10,363 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 08:09:10,363 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 08:09:10,364 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [51861704] [2019-12-27 08:09:10,364 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 08:09:10,364 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:09:10,364 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 08:09:10,365 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 08:09:10,365 INFO L87 Difference]: Start difference. First operand 36130 states and 119897 transitions. Second operand 6 states. [2019-12-27 08:09:11,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:09:11,385 INFO L93 Difference]: Finished difference Result 61139 states and 197009 transitions. [2019-12-27 08:09:11,385 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-27 08:09:11,385 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2019-12-27 08:09:11,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:09:11,495 INFO L225 Difference]: With dead ends: 61139 [2019-12-27 08:09:11,495 INFO L226 Difference]: Without dead ends: 61109 [2019-12-27 08:09:11,495 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2019-12-27 08:09:11,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61109 states. [2019-12-27 08:09:12,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61109 to 41888. [2019-12-27 08:09:12,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41888 states. [2019-12-27 08:09:12,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41888 states to 41888 states and 137110 transitions. [2019-12-27 08:09:12,423 INFO L78 Accepts]: Start accepts. Automaton has 41888 states and 137110 transitions. Word has length 22 [2019-12-27 08:09:12,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:09:12,424 INFO L462 AbstractCegarLoop]: Abstraction has 41888 states and 137110 transitions. [2019-12-27 08:09:12,424 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 08:09:12,424 INFO L276 IsEmpty]: Start isEmpty. Operand 41888 states and 137110 transitions. [2019-12-27 08:09:12,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-27 08:09:12,433 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:09:12,433 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 08:09:12,433 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 08:09:12,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:09:12,434 INFO L82 PathProgramCache]: Analyzing trace with hash -1606912493, now seen corresponding path program 2 times [2019-12-27 08:09:12,434 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:09:12,434 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1067023186] [2019-12-27 08:09:12,434 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:09:12,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:09:12,517 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 08:09:12,517 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1067023186] [2019-12-27 08:09:12,517 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 08:09:12,517 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 08:09:12,518 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1767957835] [2019-12-27 08:09:12,518 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 08:09:12,518 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:09:12,518 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 08:09:12,519 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 08:09:12,519 INFO L87 Difference]: Start difference. First operand 41888 states and 137110 transitions. Second operand 6 states. [2019-12-27 08:09:13,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:09:13,365 INFO L93 Difference]: Finished difference Result 59558 states and 191538 transitions. [2019-12-27 08:09:13,365 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 08:09:13,365 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2019-12-27 08:09:13,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:09:13,472 INFO L225 Difference]: With dead ends: 59558 [2019-12-27 08:09:13,472 INFO L226 Difference]: Without dead ends: 59540 [2019-12-27 08:09:13,472 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2019-12-27 08:09:13,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59540 states. [2019-12-27 08:09:14,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59540 to 39834. [2019-12-27 08:09:14,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39834 states. [2019-12-27 08:09:14,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39834 states to 39834 states and 130144 transitions. [2019-12-27 08:09:14,699 INFO L78 Accepts]: Start accepts. Automaton has 39834 states and 130144 transitions. Word has length 22 [2019-12-27 08:09:14,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:09:14,700 INFO L462 AbstractCegarLoop]: Abstraction has 39834 states and 130144 transitions. [2019-12-27 08:09:14,700 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 08:09:14,700 INFO L276 IsEmpty]: Start isEmpty. Operand 39834 states and 130144 transitions. [2019-12-27 08:09:14,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 08:09:14,713 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:09:14,714 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 08:09:14,714 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 08:09:14,714 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:09:14,714 INFO L82 PathProgramCache]: Analyzing trace with hash -1210888405, now seen corresponding path program 1 times [2019-12-27 08:09:14,714 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:09:14,714 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [433372182] [2019-12-27 08:09:14,715 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:09:14,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:09:14,762 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 08:09:14,763 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [433372182] [2019-12-27 08:09:14,763 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 08:09:14,763 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 08:09:14,763 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1500708949] [2019-12-27 08:09:14,764 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 08:09:14,764 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:09:14,764 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 08:09:14,764 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 08:09:14,764 INFO L87 Difference]: Start difference. First operand 39834 states and 130144 transitions. Second operand 4 states. [2019-12-27 08:09:14,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:09:14,837 INFO L93 Difference]: Finished difference Result 15680 states and 47607 transitions. [2019-12-27 08:09:14,837 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 08:09:14,837 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2019-12-27 08:09:14,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:09:14,858 INFO L225 Difference]: With dead ends: 15680 [2019-12-27 08:09:14,858 INFO L226 Difference]: Without dead ends: 15680 [2019-12-27 08:09:14,858 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 08:09:14,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15680 states. [2019-12-27 08:09:15,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15680 to 15474. [2019-12-27 08:09:15,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15474 states. [2019-12-27 08:09:15,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15474 states to 15474 states and 47012 transitions. [2019-12-27 08:09:15,076 INFO L78 Accepts]: Start accepts. Automaton has 15474 states and 47012 transitions. Word has length 25 [2019-12-27 08:09:15,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:09:15,076 INFO L462 AbstractCegarLoop]: Abstraction has 15474 states and 47012 transitions. [2019-12-27 08:09:15,076 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 08:09:15,076 INFO L276 IsEmpty]: Start isEmpty. Operand 15474 states and 47012 transitions. [2019-12-27 08:09:15,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-27 08:09:15,098 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:09:15,098 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 08:09:15,098 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 08:09:15,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:09:15,098 INFO L82 PathProgramCache]: Analyzing trace with hash -1136830823, now seen corresponding path program 1 times [2019-12-27 08:09:15,099 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:09:15,099 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [601521048] [2019-12-27 08:09:15,099 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:09:15,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:09:15,161 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 08:09:15,161 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [601521048] [2019-12-27 08:09:15,162 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 08:09:15,162 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 08:09:15,162 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [881629644] [2019-12-27 08:09:15,162 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 08:09:15,163 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:09:15,164 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 08:09:15,164 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 08:09:15,165 INFO L87 Difference]: Start difference. First operand 15474 states and 47012 transitions. Second operand 3 states. [2019-12-27 08:09:15,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:09:15,245 INFO L93 Difference]: Finished difference Result 28148 states and 85452 transitions. [2019-12-27 08:09:15,246 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 08:09:15,246 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2019-12-27 08:09:15,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:09:15,268 INFO L225 Difference]: With dead ends: 28148 [2019-12-27 08:09:15,268 INFO L226 Difference]: Without dead ends: 15947 [2019-12-27 08:09:15,269 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 08:09:15,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15947 states. [2019-12-27 08:09:15,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15947 to 15806. [2019-12-27 08:09:15,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15806 states. [2019-12-27 08:09:15,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15806 states to 15806 states and 47065 transitions. [2019-12-27 08:09:15,519 INFO L78 Accepts]: Start accepts. Automaton has 15806 states and 47065 transitions. Word has length 39 [2019-12-27 08:09:15,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:09:15,519 INFO L462 AbstractCegarLoop]: Abstraction has 15806 states and 47065 transitions. [2019-12-27 08:09:15,520 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 08:09:15,520 INFO L276 IsEmpty]: Start isEmpty. Operand 15806 states and 47065 transitions. [2019-12-27 08:09:15,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-27 08:09:15,540 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:09:15,540 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 08:09:15,540 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 08:09:15,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:09:15,541 INFO L82 PathProgramCache]: Analyzing trace with hash -285407363, now seen corresponding path program 1 times [2019-12-27 08:09:15,541 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:09:15,541 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1116293676] [2019-12-27 08:09:15,541 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:09:15,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:09:15,601 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 08:09:15,601 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1116293676] [2019-12-27 08:09:15,601 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 08:09:15,602 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 08:09:15,602 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [481086113] [2019-12-27 08:09:15,602 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 08:09:15,602 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:09:15,603 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 08:09:15,603 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 08:09:15,603 INFO L87 Difference]: Start difference. First operand 15806 states and 47065 transitions. Second operand 5 states. [2019-12-27 08:09:15,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:09:15,684 INFO L93 Difference]: Finished difference Result 14360 states and 43443 transitions. [2019-12-27 08:09:15,684 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 08:09:15,684 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 40 [2019-12-27 08:09:15,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:09:15,710 INFO L225 Difference]: With dead ends: 14360 [2019-12-27 08:09:15,710 INFO L226 Difference]: Without dead ends: 12352 [2019-12-27 08:09:15,710 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 08:09:15,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12352 states. [2019-12-27 08:09:15,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12352 to 11736. [2019-12-27 08:09:15,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11736 states. [2019-12-27 08:09:15,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11736 states to 11736 states and 36252 transitions. [2019-12-27 08:09:15,998 INFO L78 Accepts]: Start accepts. Automaton has 11736 states and 36252 transitions. Word has length 40 [2019-12-27 08:09:15,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:09:15,998 INFO L462 AbstractCegarLoop]: Abstraction has 11736 states and 36252 transitions. [2019-12-27 08:09:15,998 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 08:09:15,998 INFO L276 IsEmpty]: Start isEmpty. Operand 11736 states and 36252 transitions. [2019-12-27 08:09:16,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-27 08:09:16,025 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:09:16,025 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 08:09:16,025 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 08:09:16,026 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:09:16,026 INFO L82 PathProgramCache]: Analyzing trace with hash 72230609, now seen corresponding path program 1 times [2019-12-27 08:09:16,026 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:09:16,026 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1686427488] [2019-12-27 08:09:16,027 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:09:16,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:09:16,124 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 08:09:16,125 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1686427488] [2019-12-27 08:09:16,125 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 08:09:16,125 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 08:09:16,125 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [120046081] [2019-12-27 08:09:16,126 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 08:09:16,126 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:09:16,127 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 08:09:16,127 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 08:09:16,127 INFO L87 Difference]: Start difference. First operand 11736 states and 36252 transitions. Second operand 3 states. [2019-12-27 08:09:16,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:09:16,226 INFO L93 Difference]: Finished difference Result 15466 states and 47136 transitions. [2019-12-27 08:09:16,227 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 08:09:16,227 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 54 [2019-12-27 08:09:16,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:09:16,254 INFO L225 Difference]: With dead ends: 15466 [2019-12-27 08:09:16,254 INFO L226 Difference]: Without dead ends: 15466 [2019-12-27 08:09:16,255 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 08:09:16,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15466 states. [2019-12-27 08:09:16,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15466 to 12452. [2019-12-27 08:09:16,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12452 states. [2019-12-27 08:09:16,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12452 states to 12452 states and 38494 transitions. [2019-12-27 08:09:16,590 INFO L78 Accepts]: Start accepts. Automaton has 12452 states and 38494 transitions. Word has length 54 [2019-12-27 08:09:16,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:09:16,590 INFO L462 AbstractCegarLoop]: Abstraction has 12452 states and 38494 transitions. [2019-12-27 08:09:16,590 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 08:09:16,590 INFO L276 IsEmpty]: Start isEmpty. Operand 12452 states and 38494 transitions. [2019-12-27 08:09:16,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-27 08:09:16,604 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:09:16,604 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 08:09:16,604 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 08:09:16,605 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:09:16,605 INFO L82 PathProgramCache]: Analyzing trace with hash 1591694771, now seen corresponding path program 1 times [2019-12-27 08:09:16,605 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:09:16,605 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [240742806] [2019-12-27 08:09:16,605 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:09:16,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:09:16,684 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 08:09:16,684 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [240742806] [2019-12-27 08:09:16,684 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 08:09:16,685 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 08:09:16,685 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [802190618] [2019-12-27 08:09:16,685 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 08:09:16,685 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:09:16,686 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 08:09:16,686 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-27 08:09:16,686 INFO L87 Difference]: Start difference. First operand 12452 states and 38494 transitions. Second operand 6 states. [2019-12-27 08:09:17,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:09:17,026 INFO L93 Difference]: Finished difference Result 37107 states and 113202 transitions. [2019-12-27 08:09:17,026 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-27 08:09:17,027 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 54 [2019-12-27 08:09:17,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:09:17,066 INFO L225 Difference]: With dead ends: 37107 [2019-12-27 08:09:17,066 INFO L226 Difference]: Without dead ends: 26417 [2019-12-27 08:09:17,066 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2019-12-27 08:09:17,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26417 states. [2019-12-27 08:09:17,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26417 to 15311. [2019-12-27 08:09:17,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15311 states. [2019-12-27 08:09:17,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15311 states to 15311 states and 47554 transitions. [2019-12-27 08:09:17,391 INFO L78 Accepts]: Start accepts. Automaton has 15311 states and 47554 transitions. Word has length 54 [2019-12-27 08:09:17,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:09:17,391 INFO L462 AbstractCegarLoop]: Abstraction has 15311 states and 47554 transitions. [2019-12-27 08:09:17,391 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 08:09:17,391 INFO L276 IsEmpty]: Start isEmpty. Operand 15311 states and 47554 transitions. [2019-12-27 08:09:17,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-27 08:09:17,409 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:09:17,409 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 08:09:17,410 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 08:09:17,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:09:17,410 INFO L82 PathProgramCache]: Analyzing trace with hash 944548917, now seen corresponding path program 2 times [2019-12-27 08:09:17,410 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:09:17,410 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1453654155] [2019-12-27 08:09:17,411 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:09:17,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:09:17,514 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 08:09:17,514 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1453654155] [2019-12-27 08:09:17,514 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 08:09:17,515 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 08:09:17,515 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1609304804] [2019-12-27 08:09:17,515 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 08:09:17,515 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:09:17,516 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 08:09:17,516 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-27 08:09:17,516 INFO L87 Difference]: Start difference. First operand 15311 states and 47554 transitions. Second operand 7 states. [2019-12-27 08:09:17,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:09:17,969 INFO L93 Difference]: Finished difference Result 36247 states and 110845 transitions. [2019-12-27 08:09:17,969 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 08:09:17,969 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 54 [2019-12-27 08:09:17,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:09:18,027 INFO L225 Difference]: With dead ends: 36247 [2019-12-27 08:09:18,027 INFO L226 Difference]: Without dead ends: 28238 [2019-12-27 08:09:18,029 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 08:09:18,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28238 states. [2019-12-27 08:09:18,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28238 to 18156. [2019-12-27 08:09:18,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18156 states. [2019-12-27 08:09:18,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18156 states to 18156 states and 56517 transitions. [2019-12-27 08:09:18,432 INFO L78 Accepts]: Start accepts. Automaton has 18156 states and 56517 transitions. Word has length 54 [2019-12-27 08:09:18,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:09:18,433 INFO L462 AbstractCegarLoop]: Abstraction has 18156 states and 56517 transitions. [2019-12-27 08:09:18,433 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 08:09:18,433 INFO L276 IsEmpty]: Start isEmpty. Operand 18156 states and 56517 transitions. [2019-12-27 08:09:18,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-27 08:09:18,456 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:09:18,456 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 08:09:18,456 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 08:09:18,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:09:18,457 INFO L82 PathProgramCache]: Analyzing trace with hash -472146899, now seen corresponding path program 3 times [2019-12-27 08:09:18,457 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:09:18,457 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1185333200] [2019-12-27 08:09:18,457 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:09:18,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:09:18,533 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 08:09:18,533 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1185333200] [2019-12-27 08:09:18,534 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 08:09:18,534 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 08:09:18,534 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [354531572] [2019-12-27 08:09:18,534 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 08:09:18,534 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:09:18,535 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 08:09:18,535 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-27 08:09:18,535 INFO L87 Difference]: Start difference. First operand 18156 states and 56517 transitions. Second operand 7 states. [2019-12-27 08:09:18,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:09:18,924 INFO L93 Difference]: Finished difference Result 32612 states and 98652 transitions. [2019-12-27 08:09:18,924 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-27 08:09:18,924 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 54 [2019-12-27 08:09:18,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:09:18,968 INFO L225 Difference]: With dead ends: 32612 [2019-12-27 08:09:18,968 INFO L226 Difference]: Without dead ends: 30521 [2019-12-27 08:09:18,968 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2019-12-27 08:09:19,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30521 states. [2019-12-27 08:09:19,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30521 to 18238. [2019-12-27 08:09:19,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18238 states. [2019-12-27 08:09:19,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18238 states to 18238 states and 56811 transitions. [2019-12-27 08:09:19,548 INFO L78 Accepts]: Start accepts. Automaton has 18238 states and 56811 transitions. Word has length 54 [2019-12-27 08:09:19,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:09:19,548 INFO L462 AbstractCegarLoop]: Abstraction has 18238 states and 56811 transitions. [2019-12-27 08:09:19,548 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 08:09:19,549 INFO L276 IsEmpty]: Start isEmpty. Operand 18238 states and 56811 transitions. [2019-12-27 08:09:19,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-27 08:09:19,577 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:09:19,577 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 08:09:19,577 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 08:09:19,577 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:09:19,577 INFO L82 PathProgramCache]: Analyzing trace with hash 1266055375, now seen corresponding path program 1 times [2019-12-27 08:09:19,578 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:09:19,578 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1689783880] [2019-12-27 08:09:19,578 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:09:19,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:09:19,631 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 08:09:19,632 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1689783880] [2019-12-27 08:09:19,632 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 08:09:19,632 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 08:09:19,632 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [567480372] [2019-12-27 08:09:19,633 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 08:09:19,633 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:09:19,633 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 08:09:19,633 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 08:09:19,633 INFO L87 Difference]: Start difference. First operand 18238 states and 56811 transitions. Second operand 3 states. [2019-12-27 08:09:19,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:09:19,733 INFO L93 Difference]: Finished difference Result 20067 states and 60827 transitions. [2019-12-27 08:09:19,734 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 08:09:19,734 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 54 [2019-12-27 08:09:19,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:09:19,768 INFO L225 Difference]: With dead ends: 20067 [2019-12-27 08:09:19,768 INFO L226 Difference]: Without dead ends: 20067 [2019-12-27 08:09:19,771 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 08:09:19,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20067 states. [2019-12-27 08:09:20,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20067 to 16362. [2019-12-27 08:09:20,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16362 states. [2019-12-27 08:09:20,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16362 states to 16362 states and 50310 transitions. [2019-12-27 08:09:20,041 INFO L78 Accepts]: Start accepts. Automaton has 16362 states and 50310 transitions. Word has length 54 [2019-12-27 08:09:20,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:09:20,041 INFO L462 AbstractCegarLoop]: Abstraction has 16362 states and 50310 transitions. [2019-12-27 08:09:20,041 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 08:09:20,041 INFO L276 IsEmpty]: Start isEmpty. Operand 16362 states and 50310 transitions. [2019-12-27 08:09:20,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-27 08:09:20,058 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:09:20,058 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 08:09:20,059 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 08:09:20,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:09:20,059 INFO L82 PathProgramCache]: Analyzing trace with hash 1033313199, now seen corresponding path program 4 times [2019-12-27 08:09:20,059 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:09:20,059 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1373241329] [2019-12-27 08:09:20,059 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:09:20,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:09:20,136 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 08:09:20,137 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1373241329] [2019-12-27 08:09:20,137 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 08:09:20,137 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 08:09:20,137 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [78239755] [2019-12-27 08:09:20,138 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 08:09:20,138 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:09:20,138 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 08:09:20,138 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-27 08:09:20,138 INFO L87 Difference]: Start difference. First operand 16362 states and 50310 transitions. Second operand 7 states. [2019-12-27 08:09:20,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:09:20,510 INFO L93 Difference]: Finished difference Result 32735 states and 97743 transitions. [2019-12-27 08:09:20,510 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-27 08:09:20,511 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 54 [2019-12-27 08:09:20,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:09:20,549 INFO L225 Difference]: With dead ends: 32735 [2019-12-27 08:09:20,549 INFO L226 Difference]: Without dead ends: 27615 [2019-12-27 08:09:20,549 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2019-12-27 08:09:20,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27615 states. [2019-12-27 08:09:20,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27615 to 16518. [2019-12-27 08:09:20,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16518 states. [2019-12-27 08:09:20,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16518 states to 16518 states and 50740 transitions. [2019-12-27 08:09:20,877 INFO L78 Accepts]: Start accepts. Automaton has 16518 states and 50740 transitions. Word has length 54 [2019-12-27 08:09:20,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:09:20,877 INFO L462 AbstractCegarLoop]: Abstraction has 16518 states and 50740 transitions. [2019-12-27 08:09:20,877 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 08:09:20,877 INFO L276 IsEmpty]: Start isEmpty. Operand 16518 states and 50740 transitions. [2019-12-27 08:09:20,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-27 08:09:20,895 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:09:20,895 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 08:09:20,895 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 08:09:20,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:09:20,895 INFO L82 PathProgramCache]: Analyzing trace with hash -1310665995, now seen corresponding path program 5 times [2019-12-27 08:09:20,896 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:09:20,896 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1125704507] [2019-12-27 08:09:20,896 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:09:20,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:09:20,975 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 08:09:20,976 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1125704507] [2019-12-27 08:09:20,976 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 08:09:20,976 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 08:09:20,976 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [708226431] [2019-12-27 08:09:20,977 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 08:09:20,977 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:09:20,977 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 08:09:20,977 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 08:09:20,977 INFO L87 Difference]: Start difference. First operand 16518 states and 50740 transitions. Second operand 5 states. [2019-12-27 08:09:21,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:09:21,452 INFO L93 Difference]: Finished difference Result 25110 states and 74778 transitions. [2019-12-27 08:09:21,452 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 08:09:21,452 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 54 [2019-12-27 08:09:21,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:09:21,486 INFO L225 Difference]: With dead ends: 25110 [2019-12-27 08:09:21,486 INFO L226 Difference]: Without dead ends: 25026 [2019-12-27 08:09:21,487 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-27 08:09:21,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25026 states. [2019-12-27 08:09:21,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25026 to 19101. [2019-12-27 08:09:21,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19101 states. [2019-12-27 08:09:21,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19101 states to 19101 states and 58187 transitions. [2019-12-27 08:09:21,782 INFO L78 Accepts]: Start accepts. Automaton has 19101 states and 58187 transitions. Word has length 54 [2019-12-27 08:09:21,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:09:21,782 INFO L462 AbstractCegarLoop]: Abstraction has 19101 states and 58187 transitions. [2019-12-27 08:09:21,783 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 08:09:21,783 INFO L276 IsEmpty]: Start isEmpty. Operand 19101 states and 58187 transitions. [2019-12-27 08:09:21,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-27 08:09:21,803 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:09:21,803 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 08:09:21,803 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 08:09:21,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:09:21,803 INFO L82 PathProgramCache]: Analyzing trace with hash 454744557, now seen corresponding path program 6 times [2019-12-27 08:09:21,804 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:09:21,804 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [472347903] [2019-12-27 08:09:21,804 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:09:21,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:09:21,907 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 08:09:21,907 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [472347903] [2019-12-27 08:09:21,907 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 08:09:21,907 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 08:09:21,908 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1151877724] [2019-12-27 08:09:21,908 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 08:09:21,908 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:09:21,908 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 08:09:21,909 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-27 08:09:21,909 INFO L87 Difference]: Start difference. First operand 19101 states and 58187 transitions. Second operand 7 states. [2019-12-27 08:09:23,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:09:23,195 INFO L93 Difference]: Finished difference Result 25883 states and 76771 transitions. [2019-12-27 08:09:23,195 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-27 08:09:23,195 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 54 [2019-12-27 08:09:23,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:09:23,231 INFO L225 Difference]: With dead ends: 25883 [2019-12-27 08:09:23,231 INFO L226 Difference]: Without dead ends: 25883 [2019-12-27 08:09:23,231 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 11 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=200, Unknown=0, NotChecked=0, Total=272 [2019-12-27 08:09:23,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25883 states. [2019-12-27 08:09:23,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25883 to 17612. [2019-12-27 08:09:23,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17612 states. [2019-12-27 08:09:23,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17612 states to 17612 states and 53903 transitions. [2019-12-27 08:09:23,553 INFO L78 Accepts]: Start accepts. Automaton has 17612 states and 53903 transitions. Word has length 54 [2019-12-27 08:09:23,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:09:23,553 INFO L462 AbstractCegarLoop]: Abstraction has 17612 states and 53903 transitions. [2019-12-27 08:09:23,554 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 08:09:23,554 INFO L276 IsEmpty]: Start isEmpty. Operand 17612 states and 53903 transitions. [2019-12-27 08:09:23,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-27 08:09:23,572 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:09:23,572 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 08:09:23,572 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 08:09:23,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:09:23,573 INFO L82 PathProgramCache]: Analyzing trace with hash -1507078609, now seen corresponding path program 7 times [2019-12-27 08:09:23,573 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:09:23,573 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1440973930] [2019-12-27 08:09:23,573 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:09:23,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:09:23,633 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 08:09:23,634 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1440973930] [2019-12-27 08:09:23,634 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 08:09:23,634 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 08:09:23,634 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2062524547] [2019-12-27 08:09:23,635 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 08:09:23,635 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:09:23,635 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 08:09:23,635 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 08:09:23,635 INFO L87 Difference]: Start difference. First operand 17612 states and 53903 transitions. Second operand 3 states. [2019-12-27 08:09:23,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:09:23,693 INFO L93 Difference]: Finished difference Result 13270 states and 39837 transitions. [2019-12-27 08:09:23,693 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 08:09:23,694 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 54 [2019-12-27 08:09:23,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:09:23,717 INFO L225 Difference]: With dead ends: 13270 [2019-12-27 08:09:23,717 INFO L226 Difference]: Without dead ends: 13270 [2019-12-27 08:09:23,718 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 08:09:23,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13270 states. [2019-12-27 08:09:24,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13270 to 12777. [2019-12-27 08:09:24,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12777 states. [2019-12-27 08:09:24,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12777 states to 12777 states and 38320 transitions. [2019-12-27 08:09:24,101 INFO L78 Accepts]: Start accepts. Automaton has 12777 states and 38320 transitions. Word has length 54 [2019-12-27 08:09:24,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:09:24,101 INFO L462 AbstractCegarLoop]: Abstraction has 12777 states and 38320 transitions. [2019-12-27 08:09:24,101 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 08:09:24,101 INFO L276 IsEmpty]: Start isEmpty. Operand 12777 states and 38320 transitions. [2019-12-27 08:09:24,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-27 08:09:24,128 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:09:24,128 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 08:09:24,128 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 08:09:24,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:09:24,129 INFO L82 PathProgramCache]: Analyzing trace with hash 1136893718, now seen corresponding path program 1 times [2019-12-27 08:09:24,129 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:09:24,129 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [691178861] [2019-12-27 08:09:24,130 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:09:24,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:09:24,594 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 08:09:24,595 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [691178861] [2019-12-27 08:09:24,595 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 08:09:24,595 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-12-27 08:09:24,595 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1399488469] [2019-12-27 08:09:24,596 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-27 08:09:24,596 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:09:24,596 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-27 08:09:24,596 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2019-12-27 08:09:24,597 INFO L87 Difference]: Start difference. First operand 12777 states and 38320 transitions. Second operand 12 states. [2019-12-27 08:09:28,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:09:28,646 INFO L93 Difference]: Finished difference Result 32400 states and 94054 transitions. [2019-12-27 08:09:28,646 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2019-12-27 08:09:28,646 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 55 [2019-12-27 08:09:28,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:09:28,687 INFO L225 Difference]: With dead ends: 32400 [2019-12-27 08:09:28,687 INFO L226 Difference]: Without dead ends: 32290 [2019-12-27 08:09:28,688 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 660 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=449, Invalid=1807, Unknown=0, NotChecked=0, Total=2256 [2019-12-27 08:09:28,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32290 states. [2019-12-27 08:09:29,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32290 to 18094. [2019-12-27 08:09:29,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18094 states. [2019-12-27 08:09:29,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18094 states to 18094 states and 54147 transitions. [2019-12-27 08:09:29,273 INFO L78 Accepts]: Start accepts. Automaton has 18094 states and 54147 transitions. Word has length 55 [2019-12-27 08:09:29,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:09:29,274 INFO L462 AbstractCegarLoop]: Abstraction has 18094 states and 54147 transitions. [2019-12-27 08:09:29,274 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-27 08:09:29,274 INFO L276 IsEmpty]: Start isEmpty. Operand 18094 states and 54147 transitions. [2019-12-27 08:09:29,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-27 08:09:29,291 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:09:29,291 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 08:09:29,291 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 08:09:29,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:09:29,291 INFO L82 PathProgramCache]: Analyzing trace with hash -344613730, now seen corresponding path program 2 times [2019-12-27 08:09:29,291 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:09:29,292 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [178238671] [2019-12-27 08:09:29,292 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:09:29,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:09:29,352 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 08:09:29,352 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [178238671] [2019-12-27 08:09:29,352 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 08:09:29,353 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 08:09:29,353 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [170642781] [2019-12-27 08:09:29,353 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 08:09:29,353 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:09:29,353 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 08:09:29,354 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 08:09:29,354 INFO L87 Difference]: Start difference. First operand 18094 states and 54147 transitions. Second operand 3 states. [2019-12-27 08:09:29,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:09:29,428 INFO L93 Difference]: Finished difference Result 18094 states and 54145 transitions. [2019-12-27 08:09:29,428 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 08:09:29,429 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 55 [2019-12-27 08:09:29,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:09:29,460 INFO L225 Difference]: With dead ends: 18094 [2019-12-27 08:09:29,460 INFO L226 Difference]: Without dead ends: 18094 [2019-12-27 08:09:29,460 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 08:09:29,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18094 states. [2019-12-27 08:09:29,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18094 to 14138. [2019-12-27 08:09:29,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14138 states. [2019-12-27 08:09:29,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14138 states to 14138 states and 42646 transitions. [2019-12-27 08:09:29,726 INFO L78 Accepts]: Start accepts. Automaton has 14138 states and 42646 transitions. Word has length 55 [2019-12-27 08:09:29,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:09:29,727 INFO L462 AbstractCegarLoop]: Abstraction has 14138 states and 42646 transitions. [2019-12-27 08:09:29,727 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 08:09:29,727 INFO L276 IsEmpty]: Start isEmpty. Operand 14138 states and 42646 transitions. [2019-12-27 08:09:29,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-27 08:09:29,742 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:09:29,742 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] [2019-12-27 08:09:29,742 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 08:09:29,742 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:09:29,742 INFO L82 PathProgramCache]: Analyzing trace with hash -51181904, now seen corresponding path program 1 times [2019-12-27 08:09:29,743 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:09:29,743 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [696360679] [2019-12-27 08:09:29,743 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:09:29,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 08:09:29,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 08:09:29,874 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 08:09:29,874 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 08:09:29,878 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [803] [803] ULTIMATE.startENTRY-->L816: Formula: (let ((.cse0 (store |v_#valid_56| 0 0))) (and (= v_~x$r_buff1_thd1~0_43 0) (= v_~main$tmp_guard1~0_18 0) (= 0 v_~weak$$choice0~0_8) (= v_~y~0_18 0) (< |v_#StackHeapBarrier_16| |v_ULTIMATE.start_main_~#t2513~0.base_19|) (= 0 v_~x$w_buff0_used~0_106) (= |v_#valid_54| (store .cse0 |v_ULTIMATE.start_main_~#t2513~0.base_19| 1)) (= 0 v_~x$w_buff1~0_26) (= 0 v_~x$r_buff0_thd0~0_21) (= 0 |v_ULTIMATE.start_main_~#t2513~0.offset_16|) (= |v_#NULL.offset_3| 0) (= 0 v_~__unbuffered_p0_EAX~0_18) (= v_~x~0_26 0) (= 0 v_~__unbuffered_cnt~0_21) (= v_~x$flush_delayed~0_13 0) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t2513~0.base_19|)) (< 0 |v_#StackHeapBarrier_16|) (= v_~x$r_buff1_thd0~0_26 0) (= 0 v_~x$w_buff0~0_26) (= v_~x$w_buff1_used~0_67 0) (= 0 v_~x$read_delayed_var~0.base_7) (= |v_#length_25| (store |v_#length_26| |v_ULTIMATE.start_main_~#t2513~0.base_19| 4)) (= 0 v_~x$read_delayed~0_6) (= 0 v_~weak$$choice2~0_33) (= v_~x$mem_tmp~0_10 0) (= 0 v_~x$r_buff0_thd1~0_71) (= 0 v_~x$r_buff0_thd3~0_20) (= v_~x$r_buff1_thd3~0_18 0) (= 0 |v_#NULL.base_3|) (= 0 v_~x$r_buff0_thd2~0_28) (= 0 v_~x$read_delayed_var~0.offset_7) (= v_~z~0_17 0) (= v_~x$r_buff1_thd2~0_20 0) (= v_~main$tmp_guard0~0_11 0) (= (store |v_#memory_int_24| |v_ULTIMATE.start_main_~#t2513~0.base_19| (store (select |v_#memory_int_24| |v_ULTIMATE.start_main_~#t2513~0.base_19|) |v_ULTIMATE.start_main_~#t2513~0.offset_16| 0)) |v_#memory_int_23|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_16|, #valid=|v_#valid_56|, #memory_int=|v_#memory_int_24|, #length=|v_#length_26|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_26, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_71, ~x$flush_delayed~0=v_~x$flush_delayed~0_13, ULTIMATE.start_main_~#t2513~0.base=|v_ULTIMATE.start_main_~#t2513~0.base_19|, ULTIMATE.start_main_~#t2513~0.offset=|v_ULTIMATE.start_main_~#t2513~0.offset_16|, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_25|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_18, #NULL.offset=|v_#NULL.offset_3|, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_43, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_18, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_20, ~x$mem_tmp~0=v_~x$mem_tmp~0_10, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_11|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_13|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_11|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_11|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_18, ULTIMATE.start_main_~#t2515~0.base=|v_ULTIMATE.start_main_~#t2515~0.base_21|, #length=|v_#length_25|, ~y~0=v_~y~0_18, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_21, ULTIMATE.start_main_#t~nondet40=|v_ULTIMATE.start_main_#t~nondet40_9|, ULTIMATE.start_main_~#t2514~0.offset=|v_ULTIMATE.start_main_~#t2514~0.offset_17|, ~x$w_buff1~0=v_~x$w_buff1~0_26, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_67, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_20, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_11, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_26, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_28, ~x$read_delayed_var~0.base=v_~x$read_delayed_var~0.base_7, #NULL.base=|v_#NULL.base_3|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_106, ~weak$$choice0~0=v_~weak$$choice0~0_8, #StackHeapBarrier=|v_#StackHeapBarrier_16|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_13|, ~x$read_delayed_var~0.offset=v_~x$read_delayed_var~0.offset_7, ULTIMATE.start_main_~#t2515~0.offset=|v_ULTIMATE.start_main_~#t2515~0.offset_17|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_20|, #valid=|v_#valid_54|, #memory_int=|v_#memory_int_23|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_9|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_21, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_9|, ~z~0=v_~z~0_17, ~weak$$choice2~0=v_~weak$$choice2~0_33, ~x~0=v_~x~0_26, ULTIMATE.start_main_~#t2514~0.base=|v_ULTIMATE.start_main_~#t2514~0.base_21|, ~x$read_delayed~0=v_~x$read_delayed~0_6} AuxVars[] AssignedVars[~x$w_buff0~0, ~x$r_buff0_thd1~0, ~x$flush_delayed~0, ULTIMATE.start_main_~#t2513~0.base, ULTIMATE.start_main_~#t2513~0.offset, ULTIMATE.start_main_#t~ite46, ~x$r_buff1_thd3~0, #NULL.offset, ~x$r_buff1_thd1~0, ~main$tmp_guard1~0, ~x$r_buff0_thd3~0, ~x$mem_tmp~0, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_#t~ite44, ~__unbuffered_p0_EAX~0, ULTIMATE.start_main_~#t2515~0.base, #length, ~y~0, ~x$r_buff0_thd0~0, ULTIMATE.start_main_#t~nondet40, ULTIMATE.start_main_~#t2514~0.offset, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd2~0, ~main$tmp_guard0~0, ~x$r_buff1_thd0~0, ~x$r_buff0_thd2~0, ~x$read_delayed_var~0.base, #NULL.base, ~x$w_buff0_used~0, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite41, ~x$read_delayed_var~0.offset, ULTIMATE.start_main_~#t2515~0.offset, ULTIMATE.start_main_#res, #valid, #memory_int, ULTIMATE.start_main_#t~nondet38, ~__unbuffered_cnt~0, ULTIMATE.start_main_#t~nondet39, ~z~0, ~weak$$choice2~0, ~x~0, ULTIMATE.start_main_~#t2514~0.base, ~x$read_delayed~0] because there is no mapped edge [2019-12-27 08:09:29,879 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [771] [771] L816-1-->L818: Formula: (and (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t2514~0.base_13|) (= 0 |v_ULTIMATE.start_main_~#t2514~0.offset_11|) (= 0 (select |v_#valid_35| |v_ULTIMATE.start_main_~#t2514~0.base_13|)) (= |v_#valid_34| (store |v_#valid_35| |v_ULTIMATE.start_main_~#t2514~0.base_13| 1)) (not (= |v_ULTIMATE.start_main_~#t2514~0.base_13| 0)) (= |v_#memory_int_15| (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t2514~0.base_13| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t2514~0.base_13|) |v_ULTIMATE.start_main_~#t2514~0.offset_11| 1))) (= (store |v_#length_18| |v_ULTIMATE.start_main_~#t2514~0.base_13| 4) |v_#length_17|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_35|, #memory_int=|v_#memory_int_16|, #length=|v_#length_18|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_11|, ULTIMATE.start_main_~#t2514~0.offset=|v_ULTIMATE.start_main_~#t2514~0.offset_11|, #valid=|v_#valid_34|, #memory_int=|v_#memory_int_15|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_5|, #length=|v_#length_17|, ULTIMATE.start_main_~#t2514~0.base=|v_ULTIMATE.start_main_~#t2514~0.base_13|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2514~0.offset, #valid, #memory_int, ULTIMATE.start_main_#t~nondet38, #length, ULTIMATE.start_main_~#t2514~0.base] because there is no mapped edge [2019-12-27 08:09:29,880 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [672] [672] L5-->L773: Formula: (and (= v_~x$r_buff1_thd3~0_11 v_~x$r_buff0_thd3~0_15) (= 1 v_~x$r_buff0_thd2~0_17) (not (= 0 v_P1Thread1of1ForFork0___VERIFIER_assert_~expression_6)) (= v_~x$r_buff1_thd1~0_21 v_~x$r_buff0_thd1~0_35) (= 1 v_~y~0_6) (= v_~x$r_buff1_thd2~0_11 v_~x$r_buff0_thd2~0_18) (= v_~x$r_buff1_thd0~0_11 v_~x$r_buff0_thd0~0_15)) InVars {~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_15, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_35, P1Thread1of1ForFork0___VERIFIER_assert_~expression=v_P1Thread1of1ForFork0___VERIFIER_assert_~expression_6, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_15, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_18} OutVars{~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_15, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_35, P1Thread1of1ForFork0___VERIFIER_assert_~expression=v_P1Thread1of1ForFork0___VERIFIER_assert_~expression_6, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_11, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_11, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_21, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_15, ~y~0=v_~y~0_6, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_17, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_11} AuxVars[] AssignedVars[~x$r_buff1_thd3~0, ~x$r_buff1_thd2~0, ~x$r_buff1_thd1~0, ~y~0, ~x$r_buff0_thd2~0, ~x$r_buff1_thd0~0] because there is no mapped edge [2019-12-27 08:09:29,880 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [764] [764] L818-1-->L820: Formula: (and (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t2515~0.base_13| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t2515~0.base_13|) |v_ULTIMATE.start_main_~#t2515~0.offset_11| 2)) |v_#memory_int_13|) (not (= 0 |v_ULTIMATE.start_main_~#t2515~0.base_13|)) (< |v_#StackHeapBarrier_10| |v_ULTIMATE.start_main_~#t2515~0.base_13|) (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t2515~0.base_13| 4)) (= 0 (select |v_#valid_33| |v_ULTIMATE.start_main_~#t2515~0.base_13|)) (= 0 |v_ULTIMATE.start_main_~#t2515~0.offset_11|) (= |v_#valid_32| (store |v_#valid_33| |v_ULTIMATE.start_main_~#t2515~0.base_13| 1))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_33|, #memory_int=|v_#memory_int_14|, #length=|v_#length_16|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_10|, ULTIMATE.start_main_~#t2515~0.offset=|v_ULTIMATE.start_main_~#t2515~0.offset_11|, ULTIMATE.start_main_~#t2515~0.base=|v_ULTIMATE.start_main_~#t2515~0.base_13|, #valid=|v_#valid_32|, #memory_int=|v_#memory_int_13|, #length=|v_#length_15|, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2515~0.offset, ULTIMATE.start_main_~#t2515~0.base, #valid, #memory_int, #length, ULTIMATE.start_main_#t~nondet39] because there is no mapped edge [2019-12-27 08:09:29,881 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [741] [741] L793-2-->L793-4: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff1_used~0_In1403867093 256))) (.cse0 (= 0 (mod ~x$r_buff1_thd3~0_In1403867093 256)))) (or (and (not .cse0) (= ~x$w_buff1~0_In1403867093 |P2Thread1of1ForFork1_#t~ite32_Out1403867093|) (not .cse1)) (and (or .cse1 .cse0) (= ~x~0_In1403867093 |P2Thread1of1ForFork1_#t~ite32_Out1403867093|)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In1403867093, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1403867093, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In1403867093, ~x~0=~x~0_In1403867093} OutVars{P2Thread1of1ForFork1_#t~ite32=|P2Thread1of1ForFork1_#t~ite32_Out1403867093|, ~x$w_buff1~0=~x$w_buff1~0_In1403867093, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1403867093, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In1403867093, ~x~0=~x~0_In1403867093} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite32] because there is no mapped edge [2019-12-27 08:09:29,884 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [718] [718] L793-4-->L794: Formula: (= v_~x~0_19 |v_P2Thread1of1ForFork1_#t~ite32_8|) InVars {P2Thread1of1ForFork1_#t~ite32=|v_P2Thread1of1ForFork1_#t~ite32_8|} OutVars{P2Thread1of1ForFork1_#t~ite32=|v_P2Thread1of1ForFork1_#t~ite32_7|, P2Thread1of1ForFork1_#t~ite33=|v_P2Thread1of1ForFork1_#t~ite33_7|, ~x~0=v_~x~0_19} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite32, P2Thread1of1ForFork1_#t~ite33, ~x~0] because there is no mapped edge [2019-12-27 08:09:29,884 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [753] [753] L794-->L794-2: Formula: (let ((.cse0 (= 0 (mod ~x$w_buff0_used~0_In1280788763 256))) (.cse1 (= (mod ~x$r_buff0_thd3~0_In1280788763 256) 0))) (or (and (not .cse0) (not .cse1) (= 0 |P2Thread1of1ForFork1_#t~ite34_Out1280788763|)) (and (or .cse0 .cse1) (= ~x$w_buff0_used~0_In1280788763 |P2Thread1of1ForFork1_#t~ite34_Out1280788763|)))) InVars {~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In1280788763, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1280788763} OutVars{P2Thread1of1ForFork1_#t~ite34=|P2Thread1of1ForFork1_#t~ite34_Out1280788763|, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In1280788763, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1280788763} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite34] because there is no mapped edge [2019-12-27 08:09:29,884 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [740] [740] L795-->L795-2: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff1_thd3~0_In-1005939480 256))) (.cse0 (= (mod ~x$w_buff1_used~0_In-1005939480 256) 0)) (.cse2 (= 0 (mod ~x$r_buff0_thd3~0_In-1005939480 256))) (.cse3 (= 0 (mod ~x$w_buff0_used~0_In-1005939480 256)))) (or (and (= |P2Thread1of1ForFork1_#t~ite35_Out-1005939480| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse1 .cse0) (or .cse2 .cse3) (= |P2Thread1of1ForFork1_#t~ite35_Out-1005939480| ~x$w_buff1_used~0_In-1005939480)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-1005939480, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-1005939480, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-1005939480, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1005939480} OutVars{P2Thread1of1ForFork1_#t~ite35=|P2Thread1of1ForFork1_#t~ite35_Out-1005939480|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1005939480, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-1005939480, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-1005939480, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1005939480} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite35] because there is no mapped edge [2019-12-27 08:09:29,885 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [754] [754] L796-->L796-2: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff0_used~0_In-1014658524 256))) (.cse0 (= 0 (mod ~x$r_buff0_thd3~0_In-1014658524 256)))) (or (and (not .cse0) (= |P2Thread1of1ForFork1_#t~ite36_Out-1014658524| 0) (not .cse1)) (and (or .cse1 .cse0) (= |P2Thread1of1ForFork1_#t~ite36_Out-1014658524| ~x$r_buff0_thd3~0_In-1014658524)))) InVars {~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-1014658524, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1014658524} OutVars{P2Thread1of1ForFork1_#t~ite36=|P2Thread1of1ForFork1_#t~ite36_Out-1014658524|, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-1014658524, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1014658524} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite36] because there is no mapped edge [2019-12-27 08:09:29,886 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [746] [746] L797-->L797-2: Formula: (let ((.cse0 (= (mod ~x$w_buff0_used~0_In-2127492266 256) 0)) (.cse1 (= (mod ~x$r_buff0_thd3~0_In-2127492266 256) 0)) (.cse3 (= 0 (mod ~x$r_buff1_thd3~0_In-2127492266 256))) (.cse2 (= 0 (mod ~x$w_buff1_used~0_In-2127492266 256)))) (or (and (= 0 |P2Thread1of1ForFork1_#t~ite37_Out-2127492266|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse0 .cse1) (= |P2Thread1of1ForFork1_#t~ite37_Out-2127492266| ~x$r_buff1_thd3~0_In-2127492266) (or .cse3 .cse2)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-2127492266, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-2127492266, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-2127492266, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-2127492266} OutVars{P2Thread1of1ForFork1_#t~ite37=|P2Thread1of1ForFork1_#t~ite37_Out-2127492266|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-2127492266, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-2127492266, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-2127492266, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-2127492266} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-27 08:09:29,886 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [760] [760] L797-2-->P2EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_13 1) v_~__unbuffered_cnt~0_12) (= 0 |v_P2Thread1of1ForFork1_#res.offset_5|) (= v_~x$r_buff1_thd3~0_13 |v_P2Thread1of1ForFork1_#t~ite37_8|) (= 0 |v_P2Thread1of1ForFork1_#res.base_5|)) InVars {P2Thread1of1ForFork1_#t~ite37=|v_P2Thread1of1ForFork1_#t~ite37_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_13} OutVars{P2Thread1of1ForFork1_#t~ite37=|v_P2Thread1of1ForFork1_#t~ite37_7|, P2Thread1of1ForFork1_#res.base=|v_P2Thread1of1ForFork1_#res.base_5|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_13, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_12, P2Thread1of1ForFork1_#res.offset=|v_P2Thread1of1ForFork1_#res.offset_5|} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite37, P2Thread1of1ForFork1_#res.base, ~x$r_buff1_thd3~0, ~__unbuffered_cnt~0, P2Thread1of1ForFork1_#res.offset] because there is no mapped edge [2019-12-27 08:09:29,887 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [784] [784] L739-->L739-8: Formula: (let ((.cse1 (= (mod ~weak$$choice2~0_In1832296787 256) 0))) (or (and (= ~x$w_buff1~0_In1832296787 |P0Thread1of1ForFork2_#t~ite11_Out1832296787|) (let ((.cse0 (= (mod ~x$r_buff0_thd1~0_In1832296787 256) 0))) (or (and .cse0 (= (mod ~x$w_buff1_used~0_In1832296787 256) 0)) (= 0 (mod ~x$w_buff0_used~0_In1832296787 256)) (and .cse0 (= (mod ~x$r_buff1_thd1~0_In1832296787 256) 0)))) .cse1 (= |P0Thread1of1ForFork2_#t~ite12_Out1832296787| |P0Thread1of1ForFork2_#t~ite11_Out1832296787|)) (and (not .cse1) (= |P0Thread1of1ForFork2_#t~ite12_Out1832296787| ~x$w_buff1~0_In1832296787) (= |P0Thread1of1ForFork2_#t~ite11_In1832296787| |P0Thread1of1ForFork2_#t~ite11_Out1832296787|)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1832296787, ~x$w_buff1~0=~x$w_buff1~0_In1832296787, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1832296787, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In1832296787, ~weak$$choice2~0=~weak$$choice2~0_In1832296787, P0Thread1of1ForFork2_#t~ite11=|P0Thread1of1ForFork2_#t~ite11_In1832296787|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1832296787} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1832296787, ~x$w_buff1~0=~x$w_buff1~0_In1832296787, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1832296787, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In1832296787, ~weak$$choice2~0=~weak$$choice2~0_In1832296787, P0Thread1of1ForFork2_#t~ite12=|P0Thread1of1ForFork2_#t~ite12_Out1832296787|, P0Thread1of1ForFork2_#t~ite11=|P0Thread1of1ForFork2_#t~ite11_Out1832296787|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1832296787} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite12, P0Thread1of1ForFork2_#t~ite11] because there is no mapped edge [2019-12-27 08:09:29,888 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [783] [783] L740-->L740-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In402649809 256) 0))) (or (and (not .cse0) (= ~x$w_buff0_used~0_In402649809 |P0Thread1of1ForFork2_#t~ite15_Out402649809|) (= |P0Thread1of1ForFork2_#t~ite14_In402649809| |P0Thread1of1ForFork2_#t~ite14_Out402649809|)) (and (let ((.cse1 (= 0 (mod ~x$r_buff0_thd1~0_In402649809 256)))) (or (= 0 (mod ~x$w_buff0_used~0_In402649809 256)) (and .cse1 (= 0 (mod ~x$r_buff1_thd1~0_In402649809 256))) (and (= 0 (mod ~x$w_buff1_used~0_In402649809 256)) .cse1))) .cse0 (= ~x$w_buff0_used~0_In402649809 |P0Thread1of1ForFork2_#t~ite14_Out402649809|) (= |P0Thread1of1ForFork2_#t~ite15_Out402649809| |P0Thread1of1ForFork2_#t~ite14_Out402649809|)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In402649809, ~x$w_buff1_used~0=~x$w_buff1_used~0_In402649809, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In402649809, P0Thread1of1ForFork2_#t~ite14=|P0Thread1of1ForFork2_#t~ite14_In402649809|, ~weak$$choice2~0=~weak$$choice2~0_In402649809, ~x$w_buff0_used~0=~x$w_buff0_used~0_In402649809} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In402649809, ~x$w_buff1_used~0=~x$w_buff1_used~0_In402649809, P0Thread1of1ForFork2_#t~ite15=|P0Thread1of1ForFork2_#t~ite15_Out402649809|, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In402649809, P0Thread1of1ForFork2_#t~ite14=|P0Thread1of1ForFork2_#t~ite14_Out402649809|, ~weak$$choice2~0=~weak$$choice2~0_In402649809, ~x$w_buff0_used~0=~x$w_buff0_used~0_In402649809} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite15, P0Thread1of1ForFork2_#t~ite14] because there is no mapped edge [2019-12-27 08:09:29,889 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [712] [712] L742-->L743: Formula: (and (not (= (mod v_~weak$$choice2~0_21 256) 0)) (= v_~x$r_buff0_thd1~0_49 v_~x$r_buff0_thd1~0_50)) InVars {~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_50, ~weak$$choice2~0=v_~weak$$choice2~0_21} OutVars{P0Thread1of1ForFork2_#t~ite20=|v_P0Thread1of1ForFork2_#t~ite20_9|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_49, P0Thread1of1ForFork2_#t~ite19=|v_P0Thread1of1ForFork2_#t~ite19_8|, ~weak$$choice2~0=v_~weak$$choice2~0_21, P0Thread1of1ForFork2_#t~ite21=|v_P0Thread1of1ForFork2_#t~ite21_9|} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite20, ~x$r_buff0_thd1~0, P0Thread1of1ForFork2_#t~ite19, P0Thread1of1ForFork2_#t~ite21] because there is no mapped edge [2019-12-27 08:09:29,889 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [785] [785] L743-->L743-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In1629373109 256)))) (or (and (= |P0Thread1of1ForFork2_#t~ite23_In1629373109| |P0Thread1of1ForFork2_#t~ite23_Out1629373109|) (not .cse0) (= ~x$r_buff1_thd1~0_In1629373109 |P0Thread1of1ForFork2_#t~ite24_Out1629373109|)) (and (= ~x$r_buff1_thd1~0_In1629373109 |P0Thread1of1ForFork2_#t~ite23_Out1629373109|) .cse0 (= |P0Thread1of1ForFork2_#t~ite23_Out1629373109| |P0Thread1of1ForFork2_#t~ite24_Out1629373109|) (let ((.cse1 (= 0 (mod ~x$r_buff0_thd1~0_In1629373109 256)))) (or (and (= 0 (mod ~x$w_buff1_used~0_In1629373109 256)) .cse1) (= 0 (mod ~x$w_buff0_used~0_In1629373109 256)) (and (= (mod ~x$r_buff1_thd1~0_In1629373109 256) 0) .cse1)))))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1629373109, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1629373109, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In1629373109, ~weak$$choice2~0=~weak$$choice2~0_In1629373109, P0Thread1of1ForFork2_#t~ite23=|P0Thread1of1ForFork2_#t~ite23_In1629373109|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1629373109} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1629373109, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1629373109, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In1629373109, P0Thread1of1ForFork2_#t~ite24=|P0Thread1of1ForFork2_#t~ite24_Out1629373109|, ~weak$$choice2~0=~weak$$choice2~0_In1629373109, P0Thread1of1ForFork2_#t~ite23=|P0Thread1of1ForFork2_#t~ite23_Out1629373109|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1629373109} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite24, P0Thread1of1ForFork2_#t~ite23] because there is no mapped edge [2019-12-27 08:09:29,891 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [680] [680] L745-->L753: Formula: (and (= 0 v_~x$flush_delayed~0_6) (= v_~x$mem_tmp~0_5 v_~x~0_15) (= v_~__unbuffered_cnt~0_9 (+ v_~__unbuffered_cnt~0_10 1)) (not (= 0 (mod v_~x$flush_delayed~0_7 256)))) InVars {~x$flush_delayed~0=v_~x$flush_delayed~0_7, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_10, ~x$mem_tmp~0=v_~x$mem_tmp~0_5} OutVars{P0Thread1of1ForFork2_#t~ite25=|v_P0Thread1of1ForFork2_#t~ite25_7|, ~x$flush_delayed~0=v_~x$flush_delayed~0_6, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_9, ~x$mem_tmp~0=v_~x$mem_tmp~0_5, ~x~0=v_~x~0_15} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite25, ~x$flush_delayed~0, ~__unbuffered_cnt~0, ~x~0] because there is no mapped edge [2019-12-27 08:09:29,891 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [747] [747] L774-->L774-2: Formula: (let ((.cse1 (= (mod ~x$r_buff0_thd2~0_In-517751118 256) 0)) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In-517751118 256)))) (or (and (= ~x$w_buff0_used~0_In-517751118 |P1Thread1of1ForFork0_#t~ite28_Out-517751118|) (or .cse0 .cse1)) (and (= 0 |P1Thread1of1ForFork0_#t~ite28_Out-517751118|) (not .cse1) (not .cse0)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-517751118, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-517751118} OutVars{~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-517751118, P1Thread1of1ForFork0_#t~ite28=|P1Thread1of1ForFork0_#t~ite28_Out-517751118|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-517751118} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite28] because there is no mapped edge [2019-12-27 08:09:29,891 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [735] [735] L775-->L775-2: Formula: (let ((.cse2 (= 0 (mod ~x$r_buff1_thd2~0_In-464332497 256))) (.cse3 (= (mod ~x$w_buff1_used~0_In-464332497 256) 0)) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In-464332497 256))) (.cse0 (= 0 (mod ~x$r_buff0_thd2~0_In-464332497 256)))) (or (and (or .cse0 .cse1) (= |P1Thread1of1ForFork0_#t~ite29_Out-464332497| ~x$w_buff1_used~0_In-464332497) (or .cse2 .cse3)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0))) (= |P1Thread1of1ForFork0_#t~ite29_Out-464332497| 0)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-464332497, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-464332497, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-464332497, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-464332497} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In-464332497, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-464332497, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-464332497, P1Thread1of1ForFork0_#t~ite29=|P1Thread1of1ForFork0_#t~ite29_Out-464332497|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-464332497} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite29] because there is no mapped edge [2019-12-27 08:09:29,892 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [748] [748] L776-->L777: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff0_thd2~0_In1760569736 256))) (.cse0 (= (mod ~x$w_buff0_used~0_In1760569736 256) 0))) (or (and (not .cse0) (not .cse1) (= 0 ~x$r_buff0_thd2~0_Out1760569736)) (and (or .cse1 .cse0) (= ~x$r_buff0_thd2~0_In1760569736 ~x$r_buff0_thd2~0_Out1760569736)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1760569736, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1760569736} OutVars{P1Thread1of1ForFork0_#t~ite30=|P1Thread1of1ForFork0_#t~ite30_Out1760569736|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_Out1760569736, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1760569736} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite30, ~x$r_buff0_thd2~0] because there is no mapped edge [2019-12-27 08:09:29,892 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [742] [742] L777-->L777-2: Formula: (let ((.cse2 (= (mod ~x$w_buff1_used~0_In-2028361257 256) 0)) (.cse3 (= (mod ~x$r_buff1_thd2~0_In-2028361257 256) 0)) (.cse1 (= (mod ~x$r_buff0_thd2~0_In-2028361257 256) 0)) (.cse0 (= (mod ~x$w_buff0_used~0_In-2028361257 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P1Thread1of1ForFork0_#t~ite31_Out-2028361257| 0)) (and (= |P1Thread1of1ForFork0_#t~ite31_Out-2028361257| ~x$r_buff1_thd2~0_In-2028361257) (or .cse2 .cse3) (or .cse1 .cse0)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-2028361257, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-2028361257, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-2028361257, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-2028361257} OutVars{P1Thread1of1ForFork0_#t~ite31=|P1Thread1of1ForFork0_#t~ite31_Out-2028361257|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-2028361257, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-2028361257, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-2028361257, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-2028361257} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite31] because there is no mapped edge [2019-12-27 08:09:29,892 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [765] [765] L777-2-->P1EXIT: Formula: (and (= v_~__unbuffered_cnt~0_14 (+ v_~__unbuffered_cnt~0_15 1)) (= v_~x$r_buff1_thd2~0_15 |v_P1Thread1of1ForFork0_#t~ite31_8|) (= 0 |v_P1Thread1of1ForFork0_#res.base_5|) (= 0 |v_P1Thread1of1ForFork0_#res.offset_5|)) InVars {P1Thread1of1ForFork0_#t~ite31=|v_P1Thread1of1ForFork0_#t~ite31_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_15} OutVars{P1Thread1of1ForFork0_#t~ite31=|v_P1Thread1of1ForFork0_#t~ite31_7|, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_15, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_14, P1Thread1of1ForFork0_#res.offset=|v_P1Thread1of1ForFork0_#res.offset_5|, P1Thread1of1ForFork0_#res.base=|v_P1Thread1of1ForFork0_#res.base_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite31, ~x$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork0_#res.offset, P1Thread1of1ForFork0_#res.base] because there is no mapped edge [2019-12-27 08:09:29,893 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [699] [699] L820-1-->L826: Formula: (and (= v_~main$tmp_guard0~0_5 1) (= 3 v_~__unbuffered_cnt~0_11)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_11} OutVars{ULTIMATE.start_main_#t~nondet40=|v_ULTIMATE.start_main_#t~nondet40_4|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_11, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_5} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet40, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-27 08:09:29,893 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [751] [751] L826-2-->L826-5: Formula: (let ((.cse0 (= |ULTIMATE.start_main_#t~ite42_Out-1784525651| |ULTIMATE.start_main_#t~ite41_Out-1784525651|)) (.cse2 (= (mod ~x$r_buff1_thd0~0_In-1784525651 256) 0)) (.cse1 (= (mod ~x$w_buff1_used~0_In-1784525651 256) 0))) (or (and .cse0 (not .cse1) (not .cse2) (= ~x$w_buff1~0_In-1784525651 |ULTIMATE.start_main_#t~ite41_Out-1784525651|)) (and .cse0 (= |ULTIMATE.start_main_#t~ite41_Out-1784525651| ~x~0_In-1784525651) (or .cse2 .cse1)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In-1784525651, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1784525651, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1784525651, ~x~0=~x~0_In-1784525651} OutVars{ULTIMATE.start_main_#t~ite41=|ULTIMATE.start_main_#t~ite41_Out-1784525651|, ~x$w_buff1~0=~x$w_buff1~0_In-1784525651, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1784525651, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1784525651, ULTIMATE.start_main_#t~ite42=|ULTIMATE.start_main_#t~ite42_Out-1784525651|, ~x~0=~x~0_In-1784525651} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-27 08:09:29,894 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [745] [745] L827-->L827-2: Formula: (let ((.cse1 (= (mod ~x$w_buff0_used~0_In-297776403 256) 0)) (.cse0 (= 0 (mod ~x$r_buff0_thd0~0_In-297776403 256)))) (or (and (not .cse0) (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite43_Out-297776403|)) (and (or .cse1 .cse0) (= |ULTIMATE.start_main_#t~ite43_Out-297776403| ~x$w_buff0_used~0_In-297776403)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-297776403, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-297776403} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-297776403, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out-297776403|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-297776403} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43] because there is no mapped edge [2019-12-27 08:09:29,895 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [737] [737] L828-->L828-2: Formula: (let ((.cse0 (= (mod ~x$r_buff1_thd0~0_In1151098661 256) 0)) (.cse1 (= (mod ~x$w_buff1_used~0_In1151098661 256) 0)) (.cse2 (= 0 (mod ~x$r_buff0_thd0~0_In1151098661 256))) (.cse3 (= 0 (mod ~x$w_buff0_used~0_In1151098661 256)))) (or (and (= ~x$w_buff1_used~0_In1151098661 |ULTIMATE.start_main_#t~ite44_Out1151098661|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite44_Out1151098661| 0)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1151098661, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1151098661, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1151098661, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1151098661} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1151098661, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1151098661, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1151098661, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out1151098661|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1151098661} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-27 08:09:29,895 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [752] [752] L829-->L829-2: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff0_used~0_In-229395722 256))) (.cse0 (= (mod ~x$r_buff0_thd0~0_In-229395722 256) 0))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite45_Out-229395722| ~x$r_buff0_thd0~0_In-229395722)) (and (not .cse1) (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite45_Out-229395722|)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-229395722, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-229395722} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-229395722, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out-229395722|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-229395722} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-12-27 08:09:29,896 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [738] [738] L830-->L830-2: Formula: (let ((.cse0 (= (mod ~x$w_buff0_used~0_In-679445675 256) 0)) (.cse1 (= 0 (mod ~x$r_buff0_thd0~0_In-679445675 256))) (.cse2 (= 0 (mod ~x$w_buff1_used~0_In-679445675 256))) (.cse3 (= 0 (mod ~x$r_buff1_thd0~0_In-679445675 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~x$r_buff1_thd0~0_In-679445675 |ULTIMATE.start_main_#t~ite46_Out-679445675|)) (and (= 0 |ULTIMATE.start_main_#t~ite46_Out-679445675|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-679445675, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-679445675, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-679445675, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-679445675} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-679445675, ULTIMATE.start_main_#t~ite46=|ULTIMATE.start_main_#t~ite46_Out-679445675|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-679445675, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-679445675, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-679445675} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite46] because there is no mapped edge [2019-12-27 08:09:29,896 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [789] [789] L830-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_~x$r_buff1_thd0~0_19 |v_ULTIMATE.start_main_#t~ite46_13|) (= 2 v_~z~0_9) (= v_ULTIMATE.start___VERIFIER_assert_~expression_14 0) (= v_~main$tmp_guard1~0_10 0) (= v_~y~0_10 2) (= 0 v_~__unbuffered_p0_EAX~0_10) (= v_ULTIMATE.start___VERIFIER_assert_~expression_14 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_10, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_13|, ~z~0=v_~z~0_9, ~y~0=v_~y~0_10} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_10, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_14, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_12|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_10, ~z~0=v_~z~0_9, ~y~0=v_~y~0_10, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_19, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ULTIMATE.start_main_#t~ite46, ~main$tmp_guard1~0, ~x$r_buff1_thd0~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-27 08:09:29,985 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 08:09:29 BasicIcfg [2019-12-27 08:09:29,985 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 08:09:29,993 INFO L168 Benchmark]: Toolchain (without parser) took 70670.10 ms. Allocated memory was 138.4 MB in the beginning and 3.1 GB in the end (delta: 2.9 GB). Free memory was 101.2 MB in the beginning and 1.9 GB in the end (delta: -1.8 GB). Peak memory consumption was 1.2 GB. Max. memory is 7.1 GB. [2019-12-27 08:09:29,993 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 138.4 MB. Free memory was 121.6 MB in the beginning and 121.4 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-12-27 08:09:29,996 INFO L168 Benchmark]: CACSL2BoogieTranslator took 755.39 ms. Allocated memory was 138.4 MB in the beginning and 202.9 MB in the end (delta: 64.5 MB). Free memory was 100.8 MB in the beginning and 156.8 MB in the end (delta: -56.0 MB). Peak memory consumption was 25.6 MB. Max. memory is 7.1 GB. [2019-12-27 08:09:29,997 INFO L168 Benchmark]: Boogie Procedure Inliner took 73.63 ms. Allocated memory is still 202.9 MB. Free memory was 156.8 MB in the beginning and 154.1 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-27 08:09:29,998 INFO L168 Benchmark]: Boogie Preprocessor took 38.81 ms. Allocated memory is still 202.9 MB. Free memory was 154.1 MB in the beginning and 152.0 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2019-12-27 08:09:29,998 INFO L168 Benchmark]: RCFGBuilder took 809.12 ms. Allocated memory is still 202.9 MB. Free memory was 151.4 MB in the beginning and 105.5 MB in the end (delta: 45.9 MB). Peak memory consumption was 45.9 MB. Max. memory is 7.1 GB. [2019-12-27 08:09:29,999 INFO L168 Benchmark]: TraceAbstraction took 68986.01 ms. Allocated memory was 202.9 MB in the beginning and 3.1 GB in the end (delta: 2.9 GB). Free memory was 104.8 MB in the beginning and 1.9 GB in the end (delta: -1.7 GB). Peak memory consumption was 1.1 GB. Max. memory is 7.1 GB. [2019-12-27 08:09:30,005 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.18 ms. Allocated memory is still 138.4 MB. Free memory was 121.6 MB in the beginning and 121.4 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 755.39 ms. Allocated memory was 138.4 MB in the beginning and 202.9 MB in the end (delta: 64.5 MB). Free memory was 100.8 MB in the beginning and 156.8 MB in the end (delta: -56.0 MB). Peak memory consumption was 25.6 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 73.63 ms. Allocated memory is still 202.9 MB. Free memory was 156.8 MB in the beginning and 154.1 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 38.81 ms. Allocated memory is still 202.9 MB. Free memory was 154.1 MB in the beginning and 152.0 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 809.12 ms. Allocated memory is still 202.9 MB. Free memory was 151.4 MB in the beginning and 105.5 MB in the end (delta: 45.9 MB). Peak memory consumption was 45.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 68986.01 ms. Allocated memory was 202.9 MB in the beginning and 3.1 GB in the end (delta: 2.9 GB). Free memory was 104.8 MB in the beginning and 1.9 GB in the end (delta: -1.7 GB). Peak memory consumption was 1.1 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 4.0s, 162 ProgramPointsBefore, 85 ProgramPointsAfterwards, 193 TransitionsBefore, 94 TransitionsAfterwards, 16696 CoEnabledTransitionPairs, 8 FixpointIterations, 31 TrivialSequentialCompositions, 45 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 33 ConcurrentYvCompositions, 26 ChoiceCompositions, 6364 VarBasedMoverChecksPositive, 203 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 75290 CheckedPairsTotal, 109 TotalNumberOfCompositions - CounterExampleResult [Line: 5]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L816] FCALL, FORK 0 pthread_create(&t2513, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L818] FCALL, FORK 0 pthread_create(&t2514, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L758] 2 x$w_buff1 = x$w_buff0 [L759] 2 x$w_buff0 = 1 [L760] 2 x$w_buff1_used = x$w_buff0_used [L761] 2 x$w_buff0_used = (_Bool)1 [L820] FCALL, FORK 0 pthread_create(&t2515, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L787] 3 y = 2 [L790] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L793] 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L728] 1 z = 2 [L733] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L734] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L735] 1 x$flush_delayed = weak$$choice2 [L736] 1 x$mem_tmp = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x=0, y=2, z=2] [L737] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) VAL [!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x=0, y=2, z=2] [L737] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L738] EXPR 1 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0))=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x=0, y=2, z=2] [L794] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L795] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L796] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L773] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0))=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2, z=2] [L738] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L739] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L740] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L741] EXPR 1 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2, z=2] [L741] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L743] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L744] 1 __unbuffered_p0_EAX = x VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2, z=2] [L773] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L774] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L775] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L826] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) VAL [\result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=2] [L826] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L827] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L828] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L829] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 153 locations, 2 error locations. Result: UNSAFE, OverallTime: 68.6s, OverallIterations: 22, TraceHistogramMax: 1, AutomataDifference: 24.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 4079 SDtfs, 4211 SDslu, 10234 SDs, 0 SdLazy, 6404 SolverSat, 271 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 5.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 207 GetRequests, 41 SyntacticMatches, 8 SemanticMatches, 158 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 794 ImplicationChecksByTransitivity, 2.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=120798occurred in iteration=2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 22.2s AutomataMinimizationTime, 21 MinimizatonAttempts, 158650 StatesRemovedByMinimization, 19 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.6s InterpolantComputationTime, 867 NumberOfCodeBlocks, 867 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 790 ConstructedInterpolants, 0 QuantifiedInterpolants, 128560 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 21 InterpolantComputations, 21 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...