/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix049_rmo.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-fae578e [2019-12-18 13:44:23,992 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-18 13:44:23,995 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-18 13:44:24,012 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-18 13:44:24,012 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-18 13:44:24,014 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-18 13:44:24,016 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-18 13:44:24,024 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-18 13:44:24,028 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-18 13:44:24,030 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-18 13:44:24,032 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-18 13:44:24,034 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-18 13:44:24,034 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-18 13:44:24,036 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-18 13:44:24,038 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-18 13:44:24,039 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-18 13:44:24,041 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-18 13:44:24,042 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-18 13:44:24,044 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-18 13:44:24,048 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-18 13:44:24,053 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-18 13:44:24,056 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-18 13:44:24,057 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-18 13:44:24,058 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-18 13:44:24,060 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-18 13:44:24,060 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-18 13:44:24,061 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-18 13:44:24,062 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-18 13:44:24,064 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-18 13:44:24,065 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-18 13:44:24,065 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-18 13:44:24,065 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-18 13:44:24,066 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-18 13:44:24,067 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-18 13:44:24,068 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-18 13:44:24,068 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-18 13:44:24,069 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-18 13:44:24,069 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-18 13:44:24,069 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-18 13:44:24,071 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-18 13:44:24,072 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-18 13:44:24,073 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-18 13:44:24,098 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-18 13:44:24,099 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-18 13:44:24,100 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-18 13:44:24,100 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-18 13:44:24,100 INFO L138 SettingsManager]: * Use SBE=true [2019-12-18 13:44:24,100 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-18 13:44:24,101 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-18 13:44:24,101 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-18 13:44:24,101 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-18 13:44:24,101 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-18 13:44:24,101 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-18 13:44:24,102 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-18 13:44:24,102 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-18 13:44:24,102 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-18 13:44:24,102 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-18 13:44:24,102 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-18 13:44:24,102 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-18 13:44:24,103 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-18 13:44:24,103 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-18 13:44:24,103 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-18 13:44:24,103 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-18 13:44:24,103 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 13:44:24,104 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-18 13:44:24,104 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-18 13:44:24,104 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-18 13:44:24,104 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-18 13:44:24,104 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-18 13:44:24,105 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-18 13:44:24,105 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-18 13:44:24,105 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-18 13:44:24,347 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-18 13:44:24,359 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-18 13:44:24,363 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-18 13:44:24,364 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-18 13:44:24,364 INFO L275 PluginConnector]: CDTParser initialized [2019-12-18 13:44:24,365 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix049_rmo.oepc.i [2019-12-18 13:44:24,420 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ce575b252/b2dd4889b43a4a5293b91c7e54370cd5/FLAGbaf1ed707 [2019-12-18 13:44:24,990 INFO L306 CDTParser]: Found 1 translation units. [2019-12-18 13:44:24,992 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix049_rmo.oepc.i [2019-12-18 13:44:25,012 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ce575b252/b2dd4889b43a4a5293b91c7e54370cd5/FLAGbaf1ed707 [2019-12-18 13:44:25,288 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ce575b252/b2dd4889b43a4a5293b91c7e54370cd5 [2019-12-18 13:44:25,296 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-18 13:44:25,298 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-18 13:44:25,299 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-18 13:44:25,299 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-18 13:44:25,303 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-18 13:44:25,304 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 01:44:25" (1/1) ... [2019-12-18 13:44:25,307 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3854f09f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:44:25, skipping insertion in model container [2019-12-18 13:44:25,307 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 01:44:25" (1/1) ... [2019-12-18 13:44:25,315 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-18 13:44:25,372 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-18 13:44:25,921 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 13:44:25,934 INFO L203 MainTranslator]: Completed pre-run [2019-12-18 13:44:26,007 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 13:44:26,095 INFO L208 MainTranslator]: Completed translation [2019-12-18 13:44:26,096 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:44:26 WrapperNode [2019-12-18 13:44:26,097 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-18 13:44:26,098 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-18 13:44:26,098 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-18 13:44:26,098 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-18 13:44:26,107 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:44:26" (1/1) ... [2019-12-18 13:44:26,132 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:44:26" (1/1) ... [2019-12-18 13:44:26,163 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-18 13:44:26,164 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-18 13:44:26,164 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-18 13:44:26,164 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-18 13:44:26,172 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:44:26" (1/1) ... [2019-12-18 13:44:26,172 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:44:26" (1/1) ... [2019-12-18 13:44:26,177 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:44:26" (1/1) ... [2019-12-18 13:44:26,178 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:44:26" (1/1) ... [2019-12-18 13:44:26,190 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:44:26" (1/1) ... [2019-12-18 13:44:26,195 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:44:26" (1/1) ... [2019-12-18 13:44:26,199 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:44:26" (1/1) ... [2019-12-18 13:44:26,204 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-18 13:44:26,205 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-18 13:44:26,205 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-18 13:44:26,205 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-18 13:44:26,206 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:44:26" (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-18 13:44:26,279 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-18 13:44:26,279 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-18 13:44:26,279 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-18 13:44:26,279 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-18 13:44:26,280 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-18 13:44:26,280 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-18 13:44:26,280 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-18 13:44:26,280 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-18 13:44:26,280 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-18 13:44:26,281 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-18 13:44:26,281 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-18 13:44:26,281 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-18 13:44:26,281 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-18 13:44:26,283 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-18 13:44:27,057 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-18 13:44:27,057 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-18 13:44:27,059 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 01:44:27 BoogieIcfgContainer [2019-12-18 13:44:27,059 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-18 13:44:27,060 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-18 13:44:27,060 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-18 13:44:27,064 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-18 13:44:27,064 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 01:44:25" (1/3) ... [2019-12-18 13:44:27,065 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@f7fbb1c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 01:44:27, skipping insertion in model container [2019-12-18 13:44:27,065 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:44:26" (2/3) ... [2019-12-18 13:44:27,065 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@f7fbb1c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 01:44:27, skipping insertion in model container [2019-12-18 13:44:27,066 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 01:44:27" (3/3) ... [2019-12-18 13:44:27,068 INFO L109 eAbstractionObserver]: Analyzing ICFG mix049_rmo.oepc.i [2019-12-18 13:44:27,078 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-18 13:44:27,078 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-18 13:44:27,086 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-18 13:44:27,087 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-18 13:44:27,129 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:44:27,129 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:44:27,129 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:44:27,130 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:44:27,130 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:44:27,130 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:44:27,131 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:44:27,131 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:44:27,131 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:44:27,132 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:44:27,132 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:44:27,132 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:44:27,133 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:44:27,133 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:44:27,133 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:44:27,133 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:44:27,134 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:44:27,134 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:44:27,134 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:44:27,134 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:44:27,135 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:44:27,135 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:44:27,135 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:44:27,136 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:44:27,136 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:44:27,136 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:44:27,153 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:44:27,153 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:44:27,155 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:44:27,156 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:44:27,157 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:44:27,157 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:44:27,158 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:44:27,158 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:44:27,161 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:44:27,162 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:44:27,162 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:44:27,163 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:44:27,163 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:44:27,164 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:44:27,165 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:44:27,166 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:44:27,166 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:44:27,166 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:44:27,167 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:44:27,167 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:44:27,167 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:44:27,167 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:44:27,167 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:44:27,168 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:44:27,168 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:44:27,168 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:44:27,168 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:44:27,168 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:44:27,169 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:44:27,169 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:44:27,169 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:44:27,169 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:44:27,169 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:44:27,170 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:44:27,170 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:44:27,170 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:44:27,170 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:44:27,170 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:44:27,178 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:44:27,178 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:44:27,179 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:44:27,179 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:44:27,179 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:44:27,179 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:44:27,179 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:44:27,179 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:44:27,180 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:44:27,181 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:44:27,181 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:44:27,181 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:44:27,182 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:44:27,182 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:44:27,182 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:44:27,183 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:44:27,183 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:44:27,183 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:44:27,184 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:44:27,184 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:44:27,184 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:44:27,185 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:44:27,185 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:44:27,186 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:44:27,186 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:44:27,186 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:44:27,186 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:44:27,186 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:44:27,187 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:44:27,187 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:44:27,187 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:44:27,187 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:44:27,187 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:44:27,188 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:44:27,188 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:44:27,188 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:44:27,188 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:44:27,189 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:44:27,192 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:44:27,193 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:44:27,193 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:44:27,193 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:44:27,198 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:44:27,198 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:44:27,199 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:44:27,199 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:44:27,199 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:44:27,199 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:44:27,199 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:44:27,200 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:44:27,200 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:44:27,200 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:44:27,200 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:44:27,200 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:44:27,201 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:44:27,201 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:44:27,201 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:44:27,201 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:44:27,201 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:44:27,202 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:44:27,202 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:44:27,202 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:44:27,202 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:44:27,203 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:44:27,203 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:44:27,203 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:44:27,203 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:44:27,203 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:44:27,204 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:44:27,204 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:44:27,204 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:44:27,204 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:44:27,204 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:44:27,205 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:44:27,205 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:44:27,205 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:44:27,205 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:44:27,205 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:44:27,206 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:44:27,206 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:44:27,206 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:44:27,206 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:44:27,206 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:44:27,207 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:44:27,207 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:44:27,207 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:44:27,207 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:44:27,207 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:44:27,207 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:44:27,208 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:44:27,208 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:44:27,208 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:44:27,208 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:44:27,208 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:44:27,209 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:44:27,209 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:44:27,209 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:44:27,209 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:44:27,209 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:44:27,210 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:44:27,210 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:44:27,210 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:44:27,210 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:44:27,210 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:44:27,211 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:44:27,211 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:44:27,211 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:44:27,211 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:44:27,212 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:44:27,212 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:44:27,212 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:44:27,212 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:44:27,212 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:44:27,213 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:44:27,213 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:44:27,213 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:44:27,213 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:44:27,213 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:44:27,217 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:44:27,217 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:44:27,217 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:44:27,218 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:44:27,218 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:44:27,218 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:44:27,218 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:44:27,218 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:44:27,219 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:44:27,219 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:44:27,219 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:44:27,219 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:44:27,219 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:44:27,219 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:44:27,220 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:44:27,220 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:44:27,220 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:44:27,220 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:44:27,220 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:44:27,220 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:44:27,221 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:44:27,221 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:44:27,221 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:44:27,221 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:44:27,221 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:44:27,222 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:44:27,222 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:44:27,222 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:44:27,222 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:44:27,222 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:44:27,222 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:44:27,223 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:44:27,223 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:44:27,226 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:44:27,227 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:44:27,227 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:44:27,227 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:44:27,228 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:44:27,228 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:44:27,228 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:44:27,228 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:44:27,228 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:44:27,229 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:44:27,229 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:44:27,229 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:44:27,235 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:44:27,235 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:44:27,235 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:44:27,236 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:44:27,236 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:44:27,236 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:44:27,236 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:44:27,236 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:44:27,237 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:44:27,237 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:44:27,255 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-18 13:44:27,275 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-18 13:44:27,275 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-18 13:44:27,275 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-18 13:44:27,275 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-18 13:44:27,276 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-18 13:44:27,276 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-18 13:44:27,276 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-18 13:44:27,276 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-18 13:44:27,293 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 176 places, 213 transitions [2019-12-18 13:44:27,295 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 176 places, 213 transitions [2019-12-18 13:44:27,409 INFO L126 PetriNetUnfolder]: 47/210 cut-off events. [2019-12-18 13:44:27,409 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 13:44:27,434 INFO L76 FinitePrefix]: Finished finitePrefix Result has 220 conditions, 210 events. 47/210 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 427 event pairs. 9/170 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-18 13:44:27,462 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 176 places, 213 transitions [2019-12-18 13:44:27,526 INFO L126 PetriNetUnfolder]: 47/210 cut-off events. [2019-12-18 13:44:27,526 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 13:44:27,535 INFO L76 FinitePrefix]: Finished finitePrefix Result has 220 conditions, 210 events. 47/210 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 427 event pairs. 9/170 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-18 13:44:27,557 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 19004 [2019-12-18 13:44:27,558 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-18 13:44:32,827 WARN L192 SmtUtils]: Spent 249.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 89 [2019-12-18 13:44:32,953 WARN L192 SmtUtils]: Spent 124.00 ms on a formula simplification that was a NOOP. DAG size: 87 [2019-12-18 13:44:33,345 INFO L206 etLargeBlockEncoding]: Checked pairs total: 130045 [2019-12-18 13:44:33,345 INFO L214 etLargeBlockEncoding]: Total number of compositions: 121 [2019-12-18 13:44:33,349 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 95 places, 107 transitions [2019-12-18 13:44:56,876 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 126452 states. [2019-12-18 13:44:56,878 INFO L276 IsEmpty]: Start isEmpty. Operand 126452 states. [2019-12-18 13:44:56,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-18 13:44:56,884 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:44:56,884 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-18 13:44:56,885 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:44:56,889 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:44:56,889 INFO L82 PathProgramCache]: Analyzing trace with hash 913925, now seen corresponding path program 1 times [2019-12-18 13:44:56,896 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:44:56,896 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1539502348] [2019-12-18 13:44:56,897 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:44:57,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:44:57,127 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-18 13:44:57,128 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1539502348] [2019-12-18 13:44:57,129 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:44:57,129 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 13:44:57,130 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1326528942] [2019-12-18 13:44:57,134 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 13:44:57,135 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:44:57,149 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 13:44:57,150 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 13:44:57,152 INFO L87 Difference]: Start difference. First operand 126452 states. Second operand 3 states. [2019-12-18 13:44:59,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:44:59,741 INFO L93 Difference]: Finished difference Result 125570 states and 538788 transitions. [2019-12-18 13:44:59,742 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 13:44:59,743 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-18 13:44:59,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:45:00,411 INFO L225 Difference]: With dead ends: 125570 [2019-12-18 13:45:00,411 INFO L226 Difference]: Without dead ends: 111010 [2019-12-18 13:45:00,412 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-18 13:45:07,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111010 states. [2019-12-18 13:45:10,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111010 to 111010. [2019-12-18 13:45:10,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111010 states. [2019-12-18 13:45:10,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111010 states to 111010 states and 475060 transitions. [2019-12-18 13:45:10,607 INFO L78 Accepts]: Start accepts. Automaton has 111010 states and 475060 transitions. Word has length 3 [2019-12-18 13:45:10,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:45:10,608 INFO L462 AbstractCegarLoop]: Abstraction has 111010 states and 475060 transitions. [2019-12-18 13:45:10,608 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 13:45:10,608 INFO L276 IsEmpty]: Start isEmpty. Operand 111010 states and 475060 transitions. [2019-12-18 13:45:10,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-18 13:45:10,613 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:45:10,613 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:45:10,613 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:45:10,614 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:45:10,614 INFO L82 PathProgramCache]: Analyzing trace with hash -1753094800, now seen corresponding path program 1 times [2019-12-18 13:45:10,614 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:45:10,614 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1835547715] [2019-12-18 13:45:10,614 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:45:10,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:45:10,776 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-18 13:45:10,777 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1835547715] [2019-12-18 13:45:10,777 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:45:10,777 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 13:45:10,777 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1329248926] [2019-12-18 13:45:10,779 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 13:45:10,779 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:45:10,779 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 13:45:10,780 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 13:45:10,780 INFO L87 Difference]: Start difference. First operand 111010 states and 475060 transitions. Second operand 4 states. [2019-12-18 13:45:16,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:45:16,864 INFO L93 Difference]: Finished difference Result 172646 states and 710109 transitions. [2019-12-18 13:45:16,864 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 13:45:16,864 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-18 13:45:16,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:45:17,469 INFO L225 Difference]: With dead ends: 172646 [2019-12-18 13:45:17,470 INFO L226 Difference]: Without dead ends: 172548 [2019-12-18 13:45:17,471 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-18 13:45:23,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172548 states. [2019-12-18 13:45:27,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172548 to 158936. [2019-12-18 13:45:27,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158936 states. [2019-12-18 13:45:33,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158936 states to 158936 states and 661803 transitions. [2019-12-18 13:45:33,892 INFO L78 Accepts]: Start accepts. Automaton has 158936 states and 661803 transitions. Word has length 11 [2019-12-18 13:45:33,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:45:33,892 INFO L462 AbstractCegarLoop]: Abstraction has 158936 states and 661803 transitions. [2019-12-18 13:45:33,892 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 13:45:33,892 INFO L276 IsEmpty]: Start isEmpty. Operand 158936 states and 661803 transitions. [2019-12-18 13:45:33,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-18 13:45:33,901 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:45:33,901 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:45:33,901 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:45:33,901 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:45:33,902 INFO L82 PathProgramCache]: Analyzing trace with hash 216434073, now seen corresponding path program 1 times [2019-12-18 13:45:33,902 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:45:33,903 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1501150819] [2019-12-18 13:45:33,903 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:45:33,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:45:33,981 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-18 13:45:33,982 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1501150819] [2019-12-18 13:45:33,982 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:45:33,982 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 13:45:33,982 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1104219861] [2019-12-18 13:45:33,983 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 13:45:33,983 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:45:33,984 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 13:45:33,984 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 13:45:33,984 INFO L87 Difference]: Start difference. First operand 158936 states and 661803 transitions. Second operand 3 states. [2019-12-18 13:45:34,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:45:34,251 INFO L93 Difference]: Finished difference Result 34208 states and 111904 transitions. [2019-12-18 13:45:34,251 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 13:45:34,252 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-18 13:45:34,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:45:34,311 INFO L225 Difference]: With dead ends: 34208 [2019-12-18 13:45:34,311 INFO L226 Difference]: Without dead ends: 34208 [2019-12-18 13:45:34,311 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-18 13:45:34,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34208 states. [2019-12-18 13:45:34,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34208 to 34208. [2019-12-18 13:45:34,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34208 states. [2019-12-18 13:45:34,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34208 states to 34208 states and 111904 transitions. [2019-12-18 13:45:34,970 INFO L78 Accepts]: Start accepts. Automaton has 34208 states and 111904 transitions. Word has length 13 [2019-12-18 13:45:34,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:45:34,970 INFO L462 AbstractCegarLoop]: Abstraction has 34208 states and 111904 transitions. [2019-12-18 13:45:34,970 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 13:45:34,970 INFO L276 IsEmpty]: Start isEmpty. Operand 34208 states and 111904 transitions. [2019-12-18 13:45:34,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-18 13:45:34,973 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:45:34,973 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:45:34,973 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:45:34,973 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:45:34,973 INFO L82 PathProgramCache]: Analyzing trace with hash -1948590504, now seen corresponding path program 1 times [2019-12-18 13:45:34,974 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:45:34,974 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1601834990] [2019-12-18 13:45:34,974 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:45:34,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:45:35,024 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:45:35,025 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1601834990] [2019-12-18 13:45:35,025 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:45:35,025 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 13:45:35,025 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [258937956] [2019-12-18 13:45:35,026 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 13:45:35,026 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:45:35,026 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 13:45:35,026 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 13:45:35,026 INFO L87 Difference]: Start difference. First operand 34208 states and 111904 transitions. Second operand 3 states. [2019-12-18 13:45:36,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:45:36,470 INFO L93 Difference]: Finished difference Result 51809 states and 168645 transitions. [2019-12-18 13:45:36,470 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 13:45:36,471 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-12-18 13:45:36,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:45:36,557 INFO L225 Difference]: With dead ends: 51809 [2019-12-18 13:45:36,557 INFO L226 Difference]: Without dead ends: 51809 [2019-12-18 13:45:36,557 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-18 13:45:36,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51809 states. [2019-12-18 13:45:37,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51809 to 38969. [2019-12-18 13:45:37,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38969 states. [2019-12-18 13:45:37,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38969 states to 38969 states and 128499 transitions. [2019-12-18 13:45:37,325 INFO L78 Accepts]: Start accepts. Automaton has 38969 states and 128499 transitions. Word has length 16 [2019-12-18 13:45:37,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:45:37,326 INFO L462 AbstractCegarLoop]: Abstraction has 38969 states and 128499 transitions. [2019-12-18 13:45:37,326 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 13:45:37,326 INFO L276 IsEmpty]: Start isEmpty. Operand 38969 states and 128499 transitions. [2019-12-18 13:45:37,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-18 13:45:37,330 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:45:37,330 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:45:37,330 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:45:37,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:45:37,330 INFO L82 PathProgramCache]: Analyzing trace with hash -1821591471, now seen corresponding path program 1 times [2019-12-18 13:45:37,330 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:45:37,330 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1944803180] [2019-12-18 13:45:37,331 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:45:37,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:45:37,413 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-18 13:45:37,413 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1944803180] [2019-12-18 13:45:37,413 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:45:37,414 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 13:45:37,414 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1773114517] [2019-12-18 13:45:37,414 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 13:45:37,414 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:45:37,415 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 13:45:37,415 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-18 13:45:37,415 INFO L87 Difference]: Start difference. First operand 38969 states and 128499 transitions. Second operand 5 states. [2019-12-18 13:45:37,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:45:37,994 INFO L93 Difference]: Finished difference Result 53507 states and 173644 transitions. [2019-12-18 13:45:37,994 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 13:45:37,994 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2019-12-18 13:45:37,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:45:38,080 INFO L225 Difference]: With dead ends: 53507 [2019-12-18 13:45:38,080 INFO L226 Difference]: Without dead ends: 53507 [2019-12-18 13:45:38,080 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-18 13:45:38,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53507 states. [2019-12-18 13:45:39,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53507 to 44557. [2019-12-18 13:45:39,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44557 states. [2019-12-18 13:45:39,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44557 states to 44557 states and 146077 transitions. [2019-12-18 13:45:39,726 INFO L78 Accepts]: Start accepts. Automaton has 44557 states and 146077 transitions. Word has length 16 [2019-12-18 13:45:39,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:45:39,726 INFO L462 AbstractCegarLoop]: Abstraction has 44557 states and 146077 transitions. [2019-12-18 13:45:39,726 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 13:45:39,726 INFO L276 IsEmpty]: Start isEmpty. Operand 44557 states and 146077 transitions. [2019-12-18 13:45:39,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-18 13:45:39,740 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:45:39,740 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-18 13:45:39,740 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:45:39,740 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:45:39,741 INFO L82 PathProgramCache]: Analyzing trace with hash -187432510, now seen corresponding path program 1 times [2019-12-18 13:45:39,741 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:45:39,741 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [622975053] [2019-12-18 13:45:39,741 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:45:39,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:45:39,855 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-18 13:45:39,855 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [622975053] [2019-12-18 13:45:39,855 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:45:39,855 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 13:45:39,856 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1145973049] [2019-12-18 13:45:39,857 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 13:45:39,857 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:45:39,857 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 13:45:39,857 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-18 13:45:39,857 INFO L87 Difference]: Start difference. First operand 44557 states and 146077 transitions. Second operand 6 states. [2019-12-18 13:45:40,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:45:40,924 INFO L93 Difference]: Finished difference Result 66834 states and 212729 transitions. [2019-12-18 13:45:40,925 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 13:45:40,925 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2019-12-18 13:45:40,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:45:41,089 INFO L225 Difference]: With dead ends: 66834 [2019-12-18 13:45:41,089 INFO L226 Difference]: Without dead ends: 66820 [2019-12-18 13:45:41,090 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2019-12-18 13:45:41,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66820 states. [2019-12-18 13:45:44,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66820 to 44208. [2019-12-18 13:45:44,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44208 states. [2019-12-18 13:45:44,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44208 states to 44208 states and 144750 transitions. [2019-12-18 13:45:44,510 INFO L78 Accepts]: Start accepts. Automaton has 44208 states and 144750 transitions. Word has length 22 [2019-12-18 13:45:44,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:45:44,511 INFO L462 AbstractCegarLoop]: Abstraction has 44208 states and 144750 transitions. [2019-12-18 13:45:44,511 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 13:45:44,511 INFO L276 IsEmpty]: Start isEmpty. Operand 44208 states and 144750 transitions. [2019-12-18 13:45:44,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 13:45:44,529 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:45:44,529 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-18 13:45:44,529 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:45:44,529 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:45:44,529 INFO L82 PathProgramCache]: Analyzing trace with hash -200714255, now seen corresponding path program 1 times [2019-12-18 13:45:44,530 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:45:44,530 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [6847066] [2019-12-18 13:45:44,530 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:45:44,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:45:44,581 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-18 13:45:44,581 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [6847066] [2019-12-18 13:45:44,582 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:45:44,582 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 13:45:44,582 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [701478855] [2019-12-18 13:45:44,582 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 13:45:44,583 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:45:44,583 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 13:45:44,583 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 13:45:44,583 INFO L87 Difference]: Start difference. First operand 44208 states and 144750 transitions. Second operand 4 states. [2019-12-18 13:45:44,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:45:44,662 INFO L93 Difference]: Finished difference Result 18127 states and 56319 transitions. [2019-12-18 13:45:44,662 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 13:45:44,663 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2019-12-18 13:45:44,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:45:44,687 INFO L225 Difference]: With dead ends: 18127 [2019-12-18 13:45:44,687 INFO L226 Difference]: Without dead ends: 18127 [2019-12-18 13:45:44,688 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-18 13:45:44,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18127 states. [2019-12-18 13:45:44,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18127 to 17799. [2019-12-18 13:45:44,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17799 states. [2019-12-18 13:45:44,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17799 states to 17799 states and 55383 transitions. [2019-12-18 13:45:44,980 INFO L78 Accepts]: Start accepts. Automaton has 17799 states and 55383 transitions. Word has length 25 [2019-12-18 13:45:44,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:45:44,980 INFO L462 AbstractCegarLoop]: Abstraction has 17799 states and 55383 transitions. [2019-12-18 13:45:44,980 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 13:45:44,980 INFO L276 IsEmpty]: Start isEmpty. Operand 17799 states and 55383 transitions. [2019-12-18 13:45:44,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-18 13:45:44,994 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:45:44,994 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:45:44,994 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:45:44,994 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:45:44,994 INFO L82 PathProgramCache]: Analyzing trace with hash 611460705, now seen corresponding path program 1 times [2019-12-18 13:45:44,995 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:45:44,995 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1408070185] [2019-12-18 13:45:44,995 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:45:45,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:45:45,105 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-18 13:45:45,105 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1408070185] [2019-12-18 13:45:45,106 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:45:45,106 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 13:45:45,106 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [263908857] [2019-12-18 13:45:45,106 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 13:45:45,107 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:45:45,107 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 13:45:45,107 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-18 13:45:45,107 INFO L87 Difference]: Start difference. First operand 17799 states and 55383 transitions. Second operand 6 states. [2019-12-18 13:45:45,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:45:45,788 INFO L93 Difference]: Finished difference Result 25206 states and 75658 transitions. [2019-12-18 13:45:45,789 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-18 13:45:45,789 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2019-12-18 13:45:45,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:45:45,840 INFO L225 Difference]: With dead ends: 25206 [2019-12-18 13:45:45,840 INFO L226 Difference]: Without dead ends: 25206 [2019-12-18 13:45:45,840 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-12-18 13:45:46,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25206 states. [2019-12-18 13:45:46,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25206 to 20596. [2019-12-18 13:45:46,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20596 states. [2019-12-18 13:45:46,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20596 states to 20596 states and 63178 transitions. [2019-12-18 13:45:46,608 INFO L78 Accepts]: Start accepts. Automaton has 20596 states and 63178 transitions. Word has length 27 [2019-12-18 13:45:46,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:45:46,608 INFO L462 AbstractCegarLoop]: Abstraction has 20596 states and 63178 transitions. [2019-12-18 13:45:46,608 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 13:45:46,608 INFO L276 IsEmpty]: Start isEmpty. Operand 20596 states and 63178 transitions. [2019-12-18 13:45:46,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-18 13:45:46,629 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:45:46,630 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:45:46,630 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:45:46,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:45:46,630 INFO L82 PathProgramCache]: Analyzing trace with hash -1170391984, now seen corresponding path program 1 times [2019-12-18 13:45:46,630 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:45:46,630 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [388402884] [2019-12-18 13:45:46,630 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:45:46,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:45:46,744 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-18 13:45:46,745 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [388402884] [2019-12-18 13:45:46,745 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:45:46,745 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 13:45:46,746 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1671147179] [2019-12-18 13:45:46,746 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 13:45:46,746 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:45:46,746 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 13:45:46,747 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-18 13:45:46,747 INFO L87 Difference]: Start difference. First operand 20596 states and 63178 transitions. Second operand 7 states. [2019-12-18 13:45:47,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:45:47,972 INFO L93 Difference]: Finished difference Result 28185 states and 83945 transitions. [2019-12-18 13:45:47,972 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-18 13:45:47,973 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 33 [2019-12-18 13:45:47,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:45:48,011 INFO L225 Difference]: With dead ends: 28185 [2019-12-18 13:45:48,011 INFO L226 Difference]: Without dead ends: 28185 [2019-12-18 13:45:48,012 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=90, Invalid=252, Unknown=0, NotChecked=0, Total=342 [2019-12-18 13:45:48,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28185 states. [2019-12-18 13:45:48,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28185 to 19533. [2019-12-18 13:45:48,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19533 states. [2019-12-18 13:45:48,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19533 states to 19533 states and 59996 transitions. [2019-12-18 13:45:48,376 INFO L78 Accepts]: Start accepts. Automaton has 19533 states and 59996 transitions. Word has length 33 [2019-12-18 13:45:48,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:45:48,377 INFO L462 AbstractCegarLoop]: Abstraction has 19533 states and 59996 transitions. [2019-12-18 13:45:48,377 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 13:45:48,377 INFO L276 IsEmpty]: Start isEmpty. Operand 19533 states and 59996 transitions. [2019-12-18 13:45:48,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-18 13:45:48,402 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:45:48,402 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-18 13:45:48,403 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:45:48,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:45:48,403 INFO L82 PathProgramCache]: Analyzing trace with hash -471967596, now seen corresponding path program 1 times [2019-12-18 13:45:48,403 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:45:48,403 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1486491139] [2019-12-18 13:45:48,404 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:45:48,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:45:48,467 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-18 13:45:48,467 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1486491139] [2019-12-18 13:45:48,468 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:45:48,468 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 13:45:48,468 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [895349289] [2019-12-18 13:45:48,468 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 13:45:48,469 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:45:48,469 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 13:45:48,469 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-18 13:45:48,469 INFO L87 Difference]: Start difference. First operand 19533 states and 59996 transitions. Second operand 5 states. [2019-12-18 13:45:48,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:45:48,569 INFO L93 Difference]: Finished difference Result 18279 states and 57074 transitions. [2019-12-18 13:45:48,569 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 13:45:48,570 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 39 [2019-12-18 13:45:48,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:45:48,607 INFO L225 Difference]: With dead ends: 18279 [2019-12-18 13:45:48,607 INFO L226 Difference]: Without dead ends: 18279 [2019-12-18 13:45:48,608 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-18 13:45:48,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18279 states. [2019-12-18 13:45:48,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18279 to 17698. [2019-12-18 13:45:48,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17698 states. [2019-12-18 13:45:49,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17698 states to 17698 states and 55505 transitions. [2019-12-18 13:45:49,021 INFO L78 Accepts]: Start accepts. Automaton has 17698 states and 55505 transitions. Word has length 39 [2019-12-18 13:45:49,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:45:49,022 INFO L462 AbstractCegarLoop]: Abstraction has 17698 states and 55505 transitions. [2019-12-18 13:45:49,022 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 13:45:49,022 INFO L276 IsEmpty]: Start isEmpty. Operand 17698 states and 55505 transitions. [2019-12-18 13:45:49,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-18 13:45:49,045 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:45:49,045 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:45:49,045 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:45:49,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:45:49,046 INFO L82 PathProgramCache]: Analyzing trace with hash -2116688157, now seen corresponding path program 1 times [2019-12-18 13:45:49,046 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:45:49,046 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1720697877] [2019-12-18 13:45:49,046 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:45:49,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:45:49,156 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-18 13:45:49,157 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1720697877] [2019-12-18 13:45:49,157 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:45:49,157 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 13:45:49,157 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [638061853] [2019-12-18 13:45:49,158 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 13:45:49,158 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:45:49,158 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 13:45:49,158 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-18 13:45:49,158 INFO L87 Difference]: Start difference. First operand 17698 states and 55505 transitions. Second operand 7 states. [2019-12-18 13:45:49,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:45:49,951 INFO L93 Difference]: Finished difference Result 48537 states and 151835 transitions. [2019-12-18 13:45:49,952 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 13:45:49,952 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 64 [2019-12-18 13:45:49,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:45:50,005 INFO L225 Difference]: With dead ends: 48537 [2019-12-18 13:45:50,005 INFO L226 Difference]: Without dead ends: 38006 [2019-12-18 13:45:50,007 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2019-12-18 13:45:50,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38006 states. [2019-12-18 13:45:50,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38006 to 21047. [2019-12-18 13:45:50,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21047 states. [2019-12-18 13:45:50,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21047 states to 21047 states and 66538 transitions. [2019-12-18 13:45:50,504 INFO L78 Accepts]: Start accepts. Automaton has 21047 states and 66538 transitions. Word has length 64 [2019-12-18 13:45:50,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:45:50,504 INFO L462 AbstractCegarLoop]: Abstraction has 21047 states and 66538 transitions. [2019-12-18 13:45:50,504 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 13:45:50,504 INFO L276 IsEmpty]: Start isEmpty. Operand 21047 states and 66538 transitions. [2019-12-18 13:45:50,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-18 13:45:50,528 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:45:50,528 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:45:50,529 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:45:50,529 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:45:50,529 INFO L82 PathProgramCache]: Analyzing trace with hash -978914267, now seen corresponding path program 2 times [2019-12-18 13:45:50,529 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:45:50,529 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1431603815] [2019-12-18 13:45:50,530 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:45:50,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:45:50,647 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-18 13:45:50,648 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1431603815] [2019-12-18 13:45:50,648 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:45:50,648 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 13:45:50,648 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [5363586] [2019-12-18 13:45:50,649 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 13:45:50,649 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:45:50,649 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 13:45:50,649 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-18 13:45:50,649 INFO L87 Difference]: Start difference. First operand 21047 states and 66538 transitions. Second operand 7 states. [2019-12-18 13:45:51,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:45:51,122 INFO L93 Difference]: Finished difference Result 57554 states and 178145 transitions. [2019-12-18 13:45:51,122 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 13:45:51,122 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 64 [2019-12-18 13:45:51,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:45:51,182 INFO L225 Difference]: With dead ends: 57554 [2019-12-18 13:45:51,183 INFO L226 Difference]: Without dead ends: 41745 [2019-12-18 13:45:51,183 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-18 13:45:51,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41745 states. [2019-12-18 13:45:52,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41745 to 24743. [2019-12-18 13:45:52,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24743 states. [2019-12-18 13:45:52,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24743 states to 24743 states and 78318 transitions. [2019-12-18 13:45:52,134 INFO L78 Accepts]: Start accepts. Automaton has 24743 states and 78318 transitions. Word has length 64 [2019-12-18 13:45:52,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:45:52,134 INFO L462 AbstractCegarLoop]: Abstraction has 24743 states and 78318 transitions. [2019-12-18 13:45:52,134 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 13:45:52,134 INFO L276 IsEmpty]: Start isEmpty. Operand 24743 states and 78318 transitions. [2019-12-18 13:45:52,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-18 13:45:52,169 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:45:52,169 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:45:52,169 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:45:52,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:45:52,169 INFO L82 PathProgramCache]: Analyzing trace with hash -423923923, now seen corresponding path program 3 times [2019-12-18 13:45:52,170 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:45:52,170 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [778686665] [2019-12-18 13:45:52,170 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:45:52,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:45:52,265 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-18 13:45:52,265 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [778686665] [2019-12-18 13:45:52,266 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:45:52,266 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 13:45:52,266 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1413109851] [2019-12-18 13:45:52,266 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 13:45:52,267 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:45:52,267 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 13:45:52,267 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-18 13:45:52,268 INFO L87 Difference]: Start difference. First operand 24743 states and 78318 transitions. Second operand 7 states. [2019-12-18 13:45:52,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:45:52,778 INFO L93 Difference]: Finished difference Result 51247 states and 161421 transitions. [2019-12-18 13:45:52,778 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-18 13:45:52,778 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 64 [2019-12-18 13:45:52,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:45:52,849 INFO L225 Difference]: With dead ends: 51247 [2019-12-18 13:45:52,849 INFO L226 Difference]: Without dead ends: 47407 [2019-12-18 13:45:52,850 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-18 13:45:53,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47407 states. [2019-12-18 13:45:53,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47407 to 24923. [2019-12-18 13:45:53,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24923 states. [2019-12-18 13:45:53,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24923 states to 24923 states and 79050 transitions. [2019-12-18 13:45:53,461 INFO L78 Accepts]: Start accepts. Automaton has 24923 states and 79050 transitions. Word has length 64 [2019-12-18 13:45:53,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:45:53,461 INFO L462 AbstractCegarLoop]: Abstraction has 24923 states and 79050 transitions. [2019-12-18 13:45:53,461 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 13:45:53,461 INFO L276 IsEmpty]: Start isEmpty. Operand 24923 states and 79050 transitions. [2019-12-18 13:45:53,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-18 13:45:53,505 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:45:53,505 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:45:53,505 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:45:53,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:45:53,506 INFO L82 PathProgramCache]: Analyzing trace with hash -314768521, now seen corresponding path program 4 times [2019-12-18 13:45:53,506 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:45:53,506 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1306288417] [2019-12-18 13:45:53,506 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:45:53,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:45:53,585 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-18 13:45:53,586 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1306288417] [2019-12-18 13:45:53,586 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:45:53,586 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 13:45:53,586 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [661788253] [2019-12-18 13:45:53,587 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 13:45:53,587 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:45:53,587 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 13:45:53,587 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 13:45:53,587 INFO L87 Difference]: Start difference. First operand 24923 states and 79050 transitions. Second operand 3 states. [2019-12-18 13:45:53,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:45:53,669 INFO L93 Difference]: Finished difference Result 20919 states and 64986 transitions. [2019-12-18 13:45:53,669 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 13:45:53,669 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 64 [2019-12-18 13:45:53,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:45:53,698 INFO L225 Difference]: With dead ends: 20919 [2019-12-18 13:45:53,698 INFO L226 Difference]: Without dead ends: 20919 [2019-12-18 13:45:53,698 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-18 13:45:53,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20919 states. [2019-12-18 13:45:54,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20919 to 19827. [2019-12-18 13:45:54,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19827 states. [2019-12-18 13:45:54,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19827 states to 19827 states and 61272 transitions. [2019-12-18 13:45:54,369 INFO L78 Accepts]: Start accepts. Automaton has 19827 states and 61272 transitions. Word has length 64 [2019-12-18 13:45:54,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:45:54,369 INFO L462 AbstractCegarLoop]: Abstraction has 19827 states and 61272 transitions. [2019-12-18 13:45:54,369 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 13:45:54,370 INFO L276 IsEmpty]: Start isEmpty. Operand 19827 states and 61272 transitions. [2019-12-18 13:45:54,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 13:45:54,391 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:45:54,391 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:45:54,391 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:45:54,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:45:54,392 INFO L82 PathProgramCache]: Analyzing trace with hash 231413698, now seen corresponding path program 1 times [2019-12-18 13:45:54,392 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:45:54,392 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1816549225] [2019-12-18 13:45:54,392 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:45:54,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:45:54,484 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-18 13:45:54,484 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1816549225] [2019-12-18 13:45:54,484 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:45:54,484 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 13:45:54,485 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [701437842] [2019-12-18 13:45:54,485 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 13:45:54,485 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:45:54,485 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 13:45:54,486 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 13:45:54,486 INFO L87 Difference]: Start difference. First operand 19827 states and 61272 transitions. Second operand 3 states. [2019-12-18 13:45:54,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:45:54,634 INFO L93 Difference]: Finished difference Result 24197 states and 74265 transitions. [2019-12-18 13:45:54,635 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 13:45:54,635 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-18 13:45:54,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:45:54,681 INFO L225 Difference]: With dead ends: 24197 [2019-12-18 13:45:54,682 INFO L226 Difference]: Without dead ends: 24197 [2019-12-18 13:45:54,682 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 13:45:54,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24197 states. [2019-12-18 13:45:55,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24197 to 21036. [2019-12-18 13:45:55,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21036 states. [2019-12-18 13:45:55,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21036 states to 21036 states and 65069 transitions. [2019-12-18 13:45:55,093 INFO L78 Accepts]: Start accepts. Automaton has 21036 states and 65069 transitions. Word has length 65 [2019-12-18 13:45:55,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:45:55,094 INFO L462 AbstractCegarLoop]: Abstraction has 21036 states and 65069 transitions. [2019-12-18 13:45:55,094 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 13:45:55,094 INFO L276 IsEmpty]: Start isEmpty. Operand 21036 states and 65069 transitions. [2019-12-18 13:45:55,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 13:45:55,117 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:45:55,118 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:45:55,118 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:45:55,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:45:55,118 INFO L82 PathProgramCache]: Analyzing trace with hash 198410648, now seen corresponding path program 1 times [2019-12-18 13:45:55,118 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:45:55,118 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [477388265] [2019-12-18 13:45:55,118 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:45:55,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:45:55,181 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-18 13:45:55,181 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [477388265] [2019-12-18 13:45:55,181 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:45:55,182 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 13:45:55,182 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [351020321] [2019-12-18 13:45:55,182 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 13:45:55,182 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:45:55,183 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 13:45:55,183 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 13:45:55,183 INFO L87 Difference]: Start difference. First operand 21036 states and 65069 transitions. Second operand 4 states. [2019-12-18 13:45:55,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:45:55,329 INFO L93 Difference]: Finished difference Result 24621 states and 75632 transitions. [2019-12-18 13:45:55,330 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 13:45:55,330 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 66 [2019-12-18 13:45:55,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:45:55,362 INFO L225 Difference]: With dead ends: 24621 [2019-12-18 13:45:55,363 INFO L226 Difference]: Without dead ends: 24621 [2019-12-18 13:45:55,363 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 13:45:55,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24621 states. [2019-12-18 13:45:55,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24621 to 21144. [2019-12-18 13:45:55,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21144 states. [2019-12-18 13:45:55,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21144 states to 21144 states and 65300 transitions. [2019-12-18 13:45:55,714 INFO L78 Accepts]: Start accepts. Automaton has 21144 states and 65300 transitions. Word has length 66 [2019-12-18 13:45:55,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:45:55,715 INFO L462 AbstractCegarLoop]: Abstraction has 21144 states and 65300 transitions. [2019-12-18 13:45:55,715 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 13:45:55,715 INFO L276 IsEmpty]: Start isEmpty. Operand 21144 states and 65300 transitions. [2019-12-18 13:45:55,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 13:45:55,738 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:45:55,738 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:45:55,738 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:45:55,738 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:45:55,738 INFO L82 PathProgramCache]: Analyzing trace with hash 745619748, now seen corresponding path program 1 times [2019-12-18 13:45:55,738 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:45:55,739 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [932923692] [2019-12-18 13:45:55,739 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:45:55,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:45:56,022 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-18 13:45:56,022 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [932923692] [2019-12-18 13:45:56,022 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:45:56,022 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-12-18 13:45:56,023 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1690655299] [2019-12-18 13:45:56,023 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-18 13:45:56,023 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:45:56,023 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-18 13:45:56,024 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2019-12-18 13:45:56,024 INFO L87 Difference]: Start difference. First operand 21144 states and 65300 transitions. Second operand 13 states. [2019-12-18 13:45:59,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:45:59,979 INFO L93 Difference]: Finished difference Result 41689 states and 125014 transitions. [2019-12-18 13:45:59,980 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-12-18 13:45:59,980 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 66 [2019-12-18 13:45:59,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:46:00,034 INFO L225 Difference]: With dead ends: 41689 [2019-12-18 13:46:00,034 INFO L226 Difference]: Without dead ends: 41393 [2019-12-18 13:46:00,035 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 535 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=386, Invalid=1776, Unknown=0, NotChecked=0, Total=2162 [2019-12-18 13:46:00,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41393 states. [2019-12-18 13:46:00,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41393 to 29462. [2019-12-18 13:46:00,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29462 states. [2019-12-18 13:46:00,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29462 states to 29462 states and 90411 transitions. [2019-12-18 13:46:00,617 INFO L78 Accepts]: Start accepts. Automaton has 29462 states and 90411 transitions. Word has length 66 [2019-12-18 13:46:00,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:46:00,617 INFO L462 AbstractCegarLoop]: Abstraction has 29462 states and 90411 transitions. [2019-12-18 13:46:00,617 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-18 13:46:00,618 INFO L276 IsEmpty]: Start isEmpty. Operand 29462 states and 90411 transitions. [2019-12-18 13:46:00,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 13:46:00,646 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:46:00,646 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:46:00,646 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:46:00,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:46:00,647 INFO L82 PathProgramCache]: Analyzing trace with hash 1045060168, now seen corresponding path program 2 times [2019-12-18 13:46:00,647 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:46:00,647 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [686631394] [2019-12-18 13:46:00,647 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:46:00,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:46:00,749 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-18 13:46:00,749 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [686631394] [2019-12-18 13:46:00,750 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:46:00,750 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 13:46:00,750 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [322492141] [2019-12-18 13:46:00,750 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 13:46:00,751 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:46:00,751 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 13:46:00,751 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-18 13:46:00,751 INFO L87 Difference]: Start difference. First operand 29462 states and 90411 transitions. Second operand 6 states. [2019-12-18 13:46:01,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:46:01,870 INFO L93 Difference]: Finished difference Result 42278 states and 127610 transitions. [2019-12-18 13:46:01,870 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-18 13:46:01,870 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 66 [2019-12-18 13:46:01,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:46:01,930 INFO L225 Difference]: With dead ends: 42278 [2019-12-18 13:46:01,930 INFO L226 Difference]: Without dead ends: 42278 [2019-12-18 13:46:01,930 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2019-12-18 13:46:02,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42278 states. [2019-12-18 13:46:02,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42278 to 33818. [2019-12-18 13:46:02,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33818 states. [2019-12-18 13:46:02,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33818 states to 33818 states and 103224 transitions. [2019-12-18 13:46:02,894 INFO L78 Accepts]: Start accepts. Automaton has 33818 states and 103224 transitions. Word has length 66 [2019-12-18 13:46:02,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:46:02,895 INFO L462 AbstractCegarLoop]: Abstraction has 33818 states and 103224 transitions. [2019-12-18 13:46:02,895 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 13:46:02,895 INFO L276 IsEmpty]: Start isEmpty. Operand 33818 states and 103224 transitions. [2019-12-18 13:46:02,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 13:46:02,947 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:46:02,947 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-18 13:46:02,947 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:46:02,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:46:02,948 INFO L82 PathProgramCache]: Analyzing trace with hash 1265900300, now seen corresponding path program 3 times [2019-12-18 13:46:02,948 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:46:02,948 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [594568808] [2019-12-18 13:46:02,948 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:46:02,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:46:03,077 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-18 13:46:03,078 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [594568808] [2019-12-18 13:46:03,078 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:46:03,078 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-18 13:46:03,078 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1874807376] [2019-12-18 13:46:03,079 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 13:46:03,079 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:46:03,079 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 13:46:03,079 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-12-18 13:46:03,079 INFO L87 Difference]: Start difference. First operand 33818 states and 103224 transitions. Second operand 9 states. [2019-12-18 13:46:05,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:46:05,164 INFO L93 Difference]: Finished difference Result 41252 states and 124345 transitions. [2019-12-18 13:46:05,164 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-18 13:46:05,164 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 66 [2019-12-18 13:46:05,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:46:05,223 INFO L225 Difference]: With dead ends: 41252 [2019-12-18 13:46:05,224 INFO L226 Difference]: Without dead ends: 41252 [2019-12-18 13:46:05,224 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 10 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 192 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=168, Invalid=702, Unknown=0, NotChecked=0, Total=870 [2019-12-18 13:46:05,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41252 states. [2019-12-18 13:46:05,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41252 to 30631. [2019-12-18 13:46:05,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30631 states. [2019-12-18 13:46:05,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30631 states to 30631 states and 93699 transitions. [2019-12-18 13:46:05,793 INFO L78 Accepts]: Start accepts. Automaton has 30631 states and 93699 transitions. Word has length 66 [2019-12-18 13:46:05,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:46:05,794 INFO L462 AbstractCegarLoop]: Abstraction has 30631 states and 93699 transitions. [2019-12-18 13:46:05,794 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 13:46:05,794 INFO L276 IsEmpty]: Start isEmpty. Operand 30631 states and 93699 transitions. [2019-12-18 13:46:05,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 13:46:05,825 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:46:05,825 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:46:05,825 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:46:05,825 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:46:05,825 INFO L82 PathProgramCache]: Analyzing trace with hash 1293570610, now seen corresponding path program 4 times [2019-12-18 13:46:05,825 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:46:05,826 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [42506737] [2019-12-18 13:46:05,826 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:46:05,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:46:06,035 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-18 13:46:06,036 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [42506737] [2019-12-18 13:46:06,036 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:46:06,036 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-18 13:46:06,036 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [885478230] [2019-12-18 13:46:06,037 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-18 13:46:06,037 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:46:06,037 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-18 13:46:06,037 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2019-12-18 13:46:06,037 INFO L87 Difference]: Start difference. First operand 30631 states and 93699 transitions. Second operand 11 states. [2019-12-18 13:46:09,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:46:09,494 INFO L93 Difference]: Finished difference Result 40422 states and 121559 transitions. [2019-12-18 13:46:09,494 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2019-12-18 13:46:09,495 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 66 [2019-12-18 13:46:09,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:46:09,549 INFO L225 Difference]: With dead ends: 40422 [2019-12-18 13:46:09,549 INFO L226 Difference]: Without dead ends: 40422 [2019-12-18 13:46:09,550 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 4 SyntacticMatches, 4 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 614 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=368, Invalid=1794, Unknown=0, NotChecked=0, Total=2162 [2019-12-18 13:46:09,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40422 states. [2019-12-18 13:46:10,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40422 to 30007. [2019-12-18 13:46:10,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30007 states. [2019-12-18 13:46:10,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30007 states to 30007 states and 91949 transitions. [2019-12-18 13:46:10,156 INFO L78 Accepts]: Start accepts. Automaton has 30007 states and 91949 transitions. Word has length 66 [2019-12-18 13:46:10,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:46:10,156 INFO L462 AbstractCegarLoop]: Abstraction has 30007 states and 91949 transitions. [2019-12-18 13:46:10,156 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-18 13:46:10,156 INFO L276 IsEmpty]: Start isEmpty. Operand 30007 states and 91949 transitions. [2019-12-18 13:46:10,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 13:46:10,190 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:46:10,190 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:46:10,190 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:46:10,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:46:10,190 INFO L82 PathProgramCache]: Analyzing trace with hash -643939670, now seen corresponding path program 5 times [2019-12-18 13:46:10,191 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:46:10,191 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1218870082] [2019-12-18 13:46:10,191 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:46:10,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:46:10,248 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-18 13:46:10,248 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1218870082] [2019-12-18 13:46:10,248 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:46:10,248 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 13:46:10,248 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1200080446] [2019-12-18 13:46:10,249 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 13:46:10,249 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:46:10,249 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 13:46:10,249 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 13:46:10,250 INFO L87 Difference]: Start difference. First operand 30007 states and 91949 transitions. Second operand 3 states. [2019-12-18 13:46:10,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:46:10,368 INFO L93 Difference]: Finished difference Result 30007 states and 91948 transitions. [2019-12-18 13:46:10,368 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 13:46:10,368 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-12-18 13:46:10,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:46:10,421 INFO L225 Difference]: With dead ends: 30007 [2019-12-18 13:46:10,421 INFO L226 Difference]: Without dead ends: 30007 [2019-12-18 13:46:10,422 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-18 13:46:10,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30007 states. [2019-12-18 13:46:11,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30007 to 21352. [2019-12-18 13:46:11,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21352 states. [2019-12-18 13:46:11,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21352 states to 21352 states and 66560 transitions. [2019-12-18 13:46:11,245 INFO L78 Accepts]: Start accepts. Automaton has 21352 states and 66560 transitions. Word has length 66 [2019-12-18 13:46:11,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:46:11,245 INFO L462 AbstractCegarLoop]: Abstraction has 21352 states and 66560 transitions. [2019-12-18 13:46:11,245 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 13:46:11,246 INFO L276 IsEmpty]: Start isEmpty. Operand 21352 states and 66560 transitions. [2019-12-18 13:46:11,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 13:46:11,266 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:46:11,266 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:46:11,266 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:46:11,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:46:11,267 INFO L82 PathProgramCache]: Analyzing trace with hash 384042528, now seen corresponding path program 1 times [2019-12-18 13:46:11,267 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:46:11,267 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [31878259] [2019-12-18 13:46:11,267 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:46:11,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:46:11,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-18 13:46:11,515 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [31878259] [2019-12-18 13:46:11,515 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:46:11,515 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 13:46:11,515 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1601922771] [2019-12-18 13:46:11,516 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-18 13:46:11,516 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:46:11,516 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-18 13:46:11,518 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2019-12-18 13:46:11,520 INFO L87 Difference]: Start difference. First operand 21352 states and 66560 transitions. Second operand 10 states. [2019-12-18 13:46:13,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:46:13,695 INFO L93 Difference]: Finished difference Result 38993 states and 121029 transitions. [2019-12-18 13:46:13,695 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-18 13:46:13,696 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 67 [2019-12-18 13:46:13,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:46:13,741 INFO L225 Difference]: With dead ends: 38993 [2019-12-18 13:46:13,741 INFO L226 Difference]: Without dead ends: 30739 [2019-12-18 13:46:13,741 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=94, Invalid=368, Unknown=0, NotChecked=0, Total=462 [2019-12-18 13:46:13,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30739 states. [2019-12-18 13:46:14,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30739 to 22044. [2019-12-18 13:46:14,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22044 states. [2019-12-18 13:46:14,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22044 states to 22044 states and 68451 transitions. [2019-12-18 13:46:14,162 INFO L78 Accepts]: Start accepts. Automaton has 22044 states and 68451 transitions. Word has length 67 [2019-12-18 13:46:14,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:46:14,163 INFO L462 AbstractCegarLoop]: Abstraction has 22044 states and 68451 transitions. [2019-12-18 13:46:14,163 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-18 13:46:14,163 INFO L276 IsEmpty]: Start isEmpty. Operand 22044 states and 68451 transitions. [2019-12-18 13:46:14,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 13:46:14,186 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:46:14,186 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:46:14,186 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:46:14,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:46:14,187 INFO L82 PathProgramCache]: Analyzing trace with hash 1908292690, now seen corresponding path program 2 times [2019-12-18 13:46:14,187 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:46:14,187 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [622626396] [2019-12-18 13:46:14,187 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:46:14,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:46:14,452 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-18 13:46:14,452 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [622626396] [2019-12-18 13:46:14,452 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:46:14,453 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-18 13:46:14,453 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2147284900] [2019-12-18 13:46:14,453 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-18 13:46:14,453 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:46:14,454 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-18 13:46:14,454 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2019-12-18 13:46:14,454 INFO L87 Difference]: Start difference. First operand 22044 states and 68451 transitions. Second operand 11 states. [2019-12-18 13:46:16,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:46:16,347 INFO L93 Difference]: Finished difference Result 37784 states and 116147 transitions. [2019-12-18 13:46:16,347 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-18 13:46:16,347 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 67 [2019-12-18 13:46:16,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:46:16,393 INFO L225 Difference]: With dead ends: 37784 [2019-12-18 13:46:16,393 INFO L226 Difference]: Without dead ends: 32398 [2019-12-18 13:46:16,393 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=72, Invalid=270, Unknown=0, NotChecked=0, Total=342 [2019-12-18 13:46:16,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32398 states. [2019-12-18 13:46:17,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32398 to 22713. [2019-12-18 13:46:17,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22713 states. [2019-12-18 13:46:17,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22713 states to 22713 states and 70175 transitions. [2019-12-18 13:46:17,182 INFO L78 Accepts]: Start accepts. Automaton has 22713 states and 70175 transitions. Word has length 67 [2019-12-18 13:46:17,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:46:17,183 INFO L462 AbstractCegarLoop]: Abstraction has 22713 states and 70175 transitions. [2019-12-18 13:46:17,183 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-18 13:46:17,183 INFO L276 IsEmpty]: Start isEmpty. Operand 22713 states and 70175 transitions. [2019-12-18 13:46:17,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 13:46:17,208 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:46:17,208 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:46:17,208 INFO L410 AbstractCegarLoop]: === Iteration 24 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:46:17,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:46:17,208 INFO L82 PathProgramCache]: Analyzing trace with hash 993635084, now seen corresponding path program 3 times [2019-12-18 13:46:17,208 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:46:17,209 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1591214663] [2019-12-18 13:46:17,209 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:46:17,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:46:17,384 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:46:17,385 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1591214663] [2019-12-18 13:46:17,385 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:46:17,385 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 13:46:17,385 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1902106671] [2019-12-18 13:46:17,386 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-18 13:46:17,386 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:46:17,386 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-18 13:46:17,386 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2019-12-18 13:46:17,386 INFO L87 Difference]: Start difference. First operand 22713 states and 70175 transitions. Second operand 10 states. [2019-12-18 13:46:19,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:46:19,138 INFO L93 Difference]: Finished difference Result 36056 states and 110800 transitions. [2019-12-18 13:46:19,138 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-18 13:46:19,139 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 67 [2019-12-18 13:46:19,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:46:19,184 INFO L225 Difference]: With dead ends: 36056 [2019-12-18 13:46:19,184 INFO L226 Difference]: Without dead ends: 31156 [2019-12-18 13:46:19,184 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=73, Invalid=307, Unknown=0, NotChecked=0, Total=380 [2019-12-18 13:46:19,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31156 states. [2019-12-18 13:46:19,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31156 to 22089. [2019-12-18 13:46:19,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22089 states. [2019-12-18 13:46:19,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22089 states to 22089 states and 68331 transitions. [2019-12-18 13:46:19,611 INFO L78 Accepts]: Start accepts. Automaton has 22089 states and 68331 transitions. Word has length 67 [2019-12-18 13:46:19,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:46:19,611 INFO L462 AbstractCegarLoop]: Abstraction has 22089 states and 68331 transitions. [2019-12-18 13:46:19,611 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-18 13:46:19,611 INFO L276 IsEmpty]: Start isEmpty. Operand 22089 states and 68331 transitions. [2019-12-18 13:46:19,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 13:46:19,633 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:46:19,633 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:46:19,633 INFO L410 AbstractCegarLoop]: === Iteration 25 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:46:19,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:46:19,634 INFO L82 PathProgramCache]: Analyzing trace with hash 397917466, now seen corresponding path program 4 times [2019-12-18 13:46:19,634 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:46:19,634 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [444400000] [2019-12-18 13:46:19,634 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:46:19,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:46:20,868 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-18 13:46:20,869 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [444400000] [2019-12-18 13:46:20,869 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:46:20,869 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2019-12-18 13:46:20,869 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [718956400] [2019-12-18 13:46:20,870 INFO L442 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-12-18 13:46:20,870 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:46:20,870 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-12-18 13:46:20,870 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=480, Unknown=0, NotChecked=0, Total=552 [2019-12-18 13:46:20,871 INFO L87 Difference]: Start difference. First operand 22089 states and 68331 transitions. Second operand 24 states. [2019-12-18 13:46:30,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:46:30,365 INFO L93 Difference]: Finished difference Result 33488 states and 102260 transitions. [2019-12-18 13:46:30,365 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2019-12-18 13:46:30,365 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 67 [2019-12-18 13:46:30,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:46:30,410 INFO L225 Difference]: With dead ends: 33488 [2019-12-18 13:46:30,410 INFO L226 Difference]: Without dead ends: 31576 [2019-12-18 13:46:30,412 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 937 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=592, Invalid=3698, Unknown=0, NotChecked=0, Total=4290 [2019-12-18 13:46:30,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31576 states. [2019-12-18 13:46:30,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31576 to 22293. [2019-12-18 13:46:30,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22293 states. [2019-12-18 13:46:30,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22293 states to 22293 states and 68909 transitions. [2019-12-18 13:46:30,841 INFO L78 Accepts]: Start accepts. Automaton has 22293 states and 68909 transitions. Word has length 67 [2019-12-18 13:46:30,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:46:30,841 INFO L462 AbstractCegarLoop]: Abstraction has 22293 states and 68909 transitions. [2019-12-18 13:46:30,842 INFO L463 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-12-18 13:46:30,842 INFO L276 IsEmpty]: Start isEmpty. Operand 22293 states and 68909 transitions. [2019-12-18 13:46:30,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 13:46:30,863 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:46:30,863 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:46:30,863 INFO L410 AbstractCegarLoop]: === Iteration 26 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:46:30,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:46:30,863 INFO L82 PathProgramCache]: Analyzing trace with hash 68355254, now seen corresponding path program 5 times [2019-12-18 13:46:30,863 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:46:30,863 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [240207589] [2019-12-18 13:46:30,864 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:46:30,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:46:31,917 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-18 13:46:31,918 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [240207589] [2019-12-18 13:46:31,918 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:46:31,918 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2019-12-18 13:46:31,918 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1299454446] [2019-12-18 13:46:31,918 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-12-18 13:46:31,920 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:46:31,921 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-12-18 13:46:31,921 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=369, Unknown=0, NotChecked=0, Total=420 [2019-12-18 13:46:31,921 INFO L87 Difference]: Start difference. First operand 22293 states and 68909 transitions. Second operand 21 states. [2019-12-18 13:46:40,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:46:40,069 INFO L93 Difference]: Finished difference Result 32327 states and 99006 transitions. [2019-12-18 13:46:40,069 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-12-18 13:46:40,069 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 67 [2019-12-18 13:46:40,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:46:40,114 INFO L225 Difference]: With dead ends: 32327 [2019-12-18 13:46:40,115 INFO L226 Difference]: Without dead ends: 31792 [2019-12-18 13:46:40,116 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 2 SyntacticMatches, 5 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 534 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=353, Invalid=2299, Unknown=0, NotChecked=0, Total=2652 [2019-12-18 13:46:40,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31792 states. [2019-12-18 13:46:40,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31792 to 22257. [2019-12-18 13:46:40,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22257 states. [2019-12-18 13:46:40,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22257 states to 22257 states and 68819 transitions. [2019-12-18 13:46:40,541 INFO L78 Accepts]: Start accepts. Automaton has 22257 states and 68819 transitions. Word has length 67 [2019-12-18 13:46:40,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:46:40,542 INFO L462 AbstractCegarLoop]: Abstraction has 22257 states and 68819 transitions. [2019-12-18 13:46:40,542 INFO L463 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-12-18 13:46:40,542 INFO L276 IsEmpty]: Start isEmpty. Operand 22257 states and 68819 transitions. [2019-12-18 13:46:40,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 13:46:40,563 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:46:40,563 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:46:40,563 INFO L410 AbstractCegarLoop]: === Iteration 27 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:46:40,563 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:46:40,564 INFO L82 PathProgramCache]: Analyzing trace with hash 1803113718, now seen corresponding path program 6 times [2019-12-18 13:46:40,564 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:46:40,564 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1345900158] [2019-12-18 13:46:40,564 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:46:40,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:46:40,793 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-18 13:46:40,794 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1345900158] [2019-12-18 13:46:40,794 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:46:40,794 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-18 13:46:40,794 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1534138121] [2019-12-18 13:46:40,795 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-18 13:46:40,795 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:46:40,795 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-18 13:46:40,795 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2019-12-18 13:46:40,795 INFO L87 Difference]: Start difference. First operand 22257 states and 68819 transitions. Second operand 13 states. [2019-12-18 13:46:43,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:46:43,645 INFO L93 Difference]: Finished difference Result 35826 states and 110580 transitions. [2019-12-18 13:46:43,645 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-12-18 13:46:43,645 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 67 [2019-12-18 13:46:43,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:46:43,691 INFO L225 Difference]: With dead ends: 35826 [2019-12-18 13:46:43,692 INFO L226 Difference]: Without dead ends: 32310 [2019-12-18 13:46:43,692 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=116, Invalid=534, Unknown=0, NotChecked=0, Total=650 [2019-12-18 13:46:43,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32310 states. [2019-12-18 13:46:44,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32310 to 22233. [2019-12-18 13:46:44,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22233 states. [2019-12-18 13:46:44,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22233 states to 22233 states and 68724 transitions. [2019-12-18 13:46:44,132 INFO L78 Accepts]: Start accepts. Automaton has 22233 states and 68724 transitions. Word has length 67 [2019-12-18 13:46:44,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:46:44,132 INFO L462 AbstractCegarLoop]: Abstraction has 22233 states and 68724 transitions. [2019-12-18 13:46:44,132 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-18 13:46:44,132 INFO L276 IsEmpty]: Start isEmpty. Operand 22233 states and 68724 transitions. [2019-12-18 13:46:44,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 13:46:44,156 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:46:44,156 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:46:44,157 INFO L410 AbstractCegarLoop]: === Iteration 28 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:46:44,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:46:44,157 INFO L82 PathProgramCache]: Analyzing trace with hash 1857250972, now seen corresponding path program 7 times [2019-12-18 13:46:44,157 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:46:44,157 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [414557412] [2019-12-18 13:46:44,157 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:46:44,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:46:44,731 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-18 13:46:44,731 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [414557412] [2019-12-18 13:46:44,731 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:46:44,732 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-12-18 13:46:44,732 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1439308983] [2019-12-18 13:46:44,732 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-12-18 13:46:44,732 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:46:44,732 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-12-18 13:46:44,733 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=292, Unknown=0, NotChecked=0, Total=342 [2019-12-18 13:46:44,733 INFO L87 Difference]: Start difference. First operand 22233 states and 68724 transitions. Second operand 19 states. [2019-12-18 13:46:54,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:46:54,719 INFO L93 Difference]: Finished difference Result 38065 states and 117368 transitions. [2019-12-18 13:46:54,720 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2019-12-18 13:46:54,720 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 67 [2019-12-18 13:46:54,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:46:54,772 INFO L225 Difference]: With dead ends: 38065 [2019-12-18 13:46:54,772 INFO L226 Difference]: Without dead ends: 37061 [2019-12-18 13:46:54,773 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1059 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=574, Invalid=3848, Unknown=0, NotChecked=0, Total=4422 [2019-12-18 13:46:54,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37061 states. [2019-12-18 13:46:55,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37061 to 24675. [2019-12-18 13:46:55,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24675 states. [2019-12-18 13:46:55,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24675 states to 24675 states and 76045 transitions. [2019-12-18 13:46:55,274 INFO L78 Accepts]: Start accepts. Automaton has 24675 states and 76045 transitions. Word has length 67 [2019-12-18 13:46:55,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:46:55,274 INFO L462 AbstractCegarLoop]: Abstraction has 24675 states and 76045 transitions. [2019-12-18 13:46:55,274 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-12-18 13:46:55,274 INFO L276 IsEmpty]: Start isEmpty. Operand 24675 states and 76045 transitions. [2019-12-18 13:46:55,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 13:46:55,304 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:46:55,304 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:46:55,304 INFO L410 AbstractCegarLoop]: === Iteration 29 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:46:55,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:46:55,304 INFO L82 PathProgramCache]: Analyzing trace with hash 2040469818, now seen corresponding path program 8 times [2019-12-18 13:46:55,304 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:46:55,304 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1768480181] [2019-12-18 13:46:55,305 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:46:55,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:46:55,954 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-18 13:46:55,955 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1768480181] [2019-12-18 13:46:55,955 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:46:55,955 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2019-12-18 13:46:55,955 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [162993558] [2019-12-18 13:46:55,955 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-12-18 13:46:55,955 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:46:55,956 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-12-18 13:46:55,956 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=315, Unknown=0, NotChecked=0, Total=380 [2019-12-18 13:46:55,956 INFO L87 Difference]: Start difference. First operand 24675 states and 76045 transitions. Second operand 20 states. [2019-12-18 13:47:06,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:47:06,266 INFO L93 Difference]: Finished difference Result 38221 states and 116532 transitions. [2019-12-18 13:47:06,266 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2019-12-18 13:47:06,266 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 67 [2019-12-18 13:47:06,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:47:06,316 INFO L225 Difference]: With dead ends: 38221 [2019-12-18 13:47:06,316 INFO L226 Difference]: Without dead ends: 34998 [2019-12-18 13:47:06,318 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 762 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=581, Invalid=3079, Unknown=0, NotChecked=0, Total=3660 [2019-12-18 13:47:06,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34998 states. [2019-12-18 13:47:06,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34998 to 23292. [2019-12-18 13:47:06,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23292 states. [2019-12-18 13:47:06,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23292 states to 23292 states and 71623 transitions. [2019-12-18 13:47:06,779 INFO L78 Accepts]: Start accepts. Automaton has 23292 states and 71623 transitions. Word has length 67 [2019-12-18 13:47:06,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:47:06,779 INFO L462 AbstractCegarLoop]: Abstraction has 23292 states and 71623 transitions. [2019-12-18 13:47:06,779 INFO L463 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-12-18 13:47:06,779 INFO L276 IsEmpty]: Start isEmpty. Operand 23292 states and 71623 transitions. [2019-12-18 13:47:06,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 13:47:06,804 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:47:06,804 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:47:06,804 INFO L410 AbstractCegarLoop]: === Iteration 30 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:47:06,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:47:06,804 INFO L82 PathProgramCache]: Analyzing trace with hash 1575321640, now seen corresponding path program 9 times [2019-12-18 13:47:06,805 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:47:06,805 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1464410299] [2019-12-18 13:47:06,805 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:47:06,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:47:07,406 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-18 13:47:07,406 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1464410299] [2019-12-18 13:47:07,406 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:47:07,407 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2019-12-18 13:47:07,407 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [735040625] [2019-12-18 13:47:07,407 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-12-18 13:47:07,407 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:47:07,408 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-12-18 13:47:07,408 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=324, Unknown=0, NotChecked=0, Total=380 [2019-12-18 13:47:07,408 INFO L87 Difference]: Start difference. First operand 23292 states and 71623 transitions. Second operand 20 states. [2019-12-18 13:47:17,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:47:17,629 INFO L93 Difference]: Finished difference Result 36235 states and 109639 transitions. [2019-12-18 13:47:17,630 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2019-12-18 13:47:17,630 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 67 [2019-12-18 13:47:17,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:47:17,680 INFO L225 Difference]: With dead ends: 36235 [2019-12-18 13:47:17,680 INFO L226 Difference]: Without dead ends: 34886 [2019-12-18 13:47:17,682 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 837 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=566, Invalid=3340, Unknown=0, NotChecked=0, Total=3906 [2019-12-18 13:47:17,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34886 states. [2019-12-18 13:47:18,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34886 to 23187. [2019-12-18 13:47:18,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23187 states. [2019-12-18 13:47:18,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23187 states to 23187 states and 71158 transitions. [2019-12-18 13:47:18,141 INFO L78 Accepts]: Start accepts. Automaton has 23187 states and 71158 transitions. Word has length 67 [2019-12-18 13:47:18,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:47:18,141 INFO L462 AbstractCegarLoop]: Abstraction has 23187 states and 71158 transitions. [2019-12-18 13:47:18,141 INFO L463 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-12-18 13:47:18,141 INFO L276 IsEmpty]: Start isEmpty. Operand 23187 states and 71158 transitions. [2019-12-18 13:47:18,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 13:47:18,165 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:47:18,165 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:47:18,165 INFO L410 AbstractCegarLoop]: === Iteration 31 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:47:18,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:47:18,165 INFO L82 PathProgramCache]: Analyzing trace with hash -190162996, now seen corresponding path program 10 times [2019-12-18 13:47:18,166 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:47:18,166 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1505009858] [2019-12-18 13:47:18,166 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:47:18,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:47:18,416 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-18 13:47:18,417 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1505009858] [2019-12-18 13:47:18,417 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:47:18,417 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-18 13:47:18,758 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [701583037] [2019-12-18 13:47:18,758 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-18 13:47:18,758 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:47:18,759 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-18 13:47:18,760 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2019-12-18 13:47:18,760 INFO L87 Difference]: Start difference. First operand 23187 states and 71158 transitions. Second operand 12 states. [2019-12-18 13:47:21,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:47:21,689 INFO L93 Difference]: Finished difference Result 40151 states and 121702 transitions. [2019-12-18 13:47:21,689 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-18 13:47:21,689 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 67 [2019-12-18 13:47:21,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:47:21,740 INFO L225 Difference]: With dead ends: 40151 [2019-12-18 13:47:21,741 INFO L226 Difference]: Without dead ends: 35246 [2019-12-18 13:47:21,741 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 142 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=163, Invalid=707, Unknown=0, NotChecked=0, Total=870 [2019-12-18 13:47:21,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35246 states. [2019-12-18 13:47:22,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35246 to 22578. [2019-12-18 13:47:22,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22578 states. [2019-12-18 13:47:22,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22578 states to 22578 states and 69471 transitions. [2019-12-18 13:47:22,216 INFO L78 Accepts]: Start accepts. Automaton has 22578 states and 69471 transitions. Word has length 67 [2019-12-18 13:47:22,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:47:22,216 INFO L462 AbstractCegarLoop]: Abstraction has 22578 states and 69471 transitions. [2019-12-18 13:47:22,216 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-18 13:47:22,216 INFO L276 IsEmpty]: Start isEmpty. Operand 22578 states and 69471 transitions. [2019-12-18 13:47:22,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 13:47:22,241 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:47:22,241 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:47:22,241 INFO L410 AbstractCegarLoop]: === Iteration 32 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:47:22,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:47:22,242 INFO L82 PathProgramCache]: Analyzing trace with hash 993470682, now seen corresponding path program 11 times [2019-12-18 13:47:22,242 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:47:22,242 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [104635973] [2019-12-18 13:47:22,242 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:47:22,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:47:23,000 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-18 13:47:23,001 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [104635973] [2019-12-18 13:47:23,001 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:47:23,001 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2019-12-18 13:47:23,001 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1999188773] [2019-12-18 13:47:23,002 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-12-18 13:47:23,002 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:47:23,002 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-12-18 13:47:23,002 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=353, Unknown=0, NotChecked=0, Total=420 [2019-12-18 13:47:23,002 INFO L87 Difference]: Start difference. First operand 22578 states and 69471 transitions. Second operand 21 states. [2019-12-18 13:47:29,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:47:29,929 INFO L93 Difference]: Finished difference Result 34640 states and 105386 transitions. [2019-12-18 13:47:29,930 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2019-12-18 13:47:29,930 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 67 [2019-12-18 13:47:29,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:47:29,977 INFO L225 Difference]: With dead ends: 34640 [2019-12-18 13:47:29,978 INFO L226 Difference]: Without dead ends: 34443 [2019-12-18 13:47:29,978 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 644 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=457, Invalid=2735, Unknown=0, NotChecked=0, Total=3192 [2019-12-18 13:47:30,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34443 states. [2019-12-18 13:47:30,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34443 to 22569. [2019-12-18 13:47:30,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22569 states. [2019-12-18 13:47:30,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22569 states to 22569 states and 69438 transitions. [2019-12-18 13:47:30,426 INFO L78 Accepts]: Start accepts. Automaton has 22569 states and 69438 transitions. Word has length 67 [2019-12-18 13:47:30,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:47:30,426 INFO L462 AbstractCegarLoop]: Abstraction has 22569 states and 69438 transitions. [2019-12-18 13:47:30,426 INFO L463 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-12-18 13:47:30,426 INFO L276 IsEmpty]: Start isEmpty. Operand 22569 states and 69438 transitions. [2019-12-18 13:47:30,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 13:47:30,449 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:47:30,449 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:47:30,449 INFO L410 AbstractCegarLoop]: === Iteration 33 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:47:30,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:47:30,450 INFO L82 PathProgramCache]: Analyzing trace with hash 1616492466, now seen corresponding path program 12 times [2019-12-18 13:47:30,450 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:47:30,450 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [704708257] [2019-12-18 13:47:30,450 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:47:30,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:47:30,699 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-18 13:47:30,699 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [704708257] [2019-12-18 13:47:30,699 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:47:30,699 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-18 13:47:30,700 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [477716020] [2019-12-18 13:47:30,700 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-18 13:47:30,700 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:47:30,700 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-18 13:47:30,701 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2019-12-18 13:47:30,701 INFO L87 Difference]: Start difference. First operand 22569 states and 69438 transitions. Second operand 13 states. [2019-12-18 13:47:33,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:47:33,791 INFO L93 Difference]: Finished difference Result 37092 states and 113094 transitions. [2019-12-18 13:47:33,791 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-12-18 13:47:33,792 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 67 [2019-12-18 13:47:33,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:47:33,842 INFO L225 Difference]: With dead ends: 37092 [2019-12-18 13:47:33,842 INFO L226 Difference]: Without dead ends: 34315 [2019-12-18 13:47:33,843 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 155 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=181, Invalid=811, Unknown=0, NotChecked=0, Total=992 [2019-12-18 13:47:33,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34315 states. [2019-12-18 13:47:34,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34315 to 21858. [2019-12-18 13:47:34,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21858 states. [2019-12-18 13:47:34,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21858 states to 21858 states and 67431 transitions. [2019-12-18 13:47:34,288 INFO L78 Accepts]: Start accepts. Automaton has 21858 states and 67431 transitions. Word has length 67 [2019-12-18 13:47:34,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:47:34,288 INFO L462 AbstractCegarLoop]: Abstraction has 21858 states and 67431 transitions. [2019-12-18 13:47:34,288 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-18 13:47:34,289 INFO L276 IsEmpty]: Start isEmpty. Operand 21858 states and 67431 transitions. [2019-12-18 13:47:34,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 13:47:34,309 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:47:34,309 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:47:34,309 INFO L410 AbstractCegarLoop]: === Iteration 34 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:47:34,309 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:47:34,310 INFO L82 PathProgramCache]: Analyzing trace with hash 1823504856, now seen corresponding path program 13 times [2019-12-18 13:47:34,310 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:47:34,310 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1114413311] [2019-12-18 13:47:34,310 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:47:34,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:47:34,987 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-18 13:47:34,987 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1114413311] [2019-12-18 13:47:34,987 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:47:34,987 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-12-18 13:47:34,987 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [466770517] [2019-12-18 13:47:34,988 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-12-18 13:47:34,988 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:47:34,988 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-12-18 13:47:34,988 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=227, Unknown=0, NotChecked=0, Total=272 [2019-12-18 13:47:34,989 INFO L87 Difference]: Start difference. First operand 21858 states and 67431 transitions. Second operand 17 states. [2019-12-18 13:47:39,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:47:39,568 INFO L93 Difference]: Finished difference Result 33364 states and 101965 transitions. [2019-12-18 13:47:39,569 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-12-18 13:47:39,569 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 67 [2019-12-18 13:47:39,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:47:39,615 INFO L225 Difference]: With dead ends: 33364 [2019-12-18 13:47:39,615 INFO L226 Difference]: Without dead ends: 32633 [2019-12-18 13:47:39,616 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 0 SyntacticMatches, 3 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 259 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=248, Invalid=1312, Unknown=0, NotChecked=0, Total=1560 [2019-12-18 13:47:39,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32633 states. [2019-12-18 13:47:40,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32633 to 21933. [2019-12-18 13:47:40,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21933 states. [2019-12-18 13:47:40,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21933 states to 21933 states and 67626 transitions. [2019-12-18 13:47:40,044 INFO L78 Accepts]: Start accepts. Automaton has 21933 states and 67626 transitions. Word has length 67 [2019-12-18 13:47:40,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:47:40,045 INFO L462 AbstractCegarLoop]: Abstraction has 21933 states and 67626 transitions. [2019-12-18 13:47:40,045 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-12-18 13:47:40,045 INFO L276 IsEmpty]: Start isEmpty. Operand 21933 states and 67626 transitions. [2019-12-18 13:47:40,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 13:47:40,066 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:47:40,066 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:47:40,067 INFO L410 AbstractCegarLoop]: === Iteration 35 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:47:40,067 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:47:40,067 INFO L82 PathProgramCache]: Analyzing trace with hash 1076834582, now seen corresponding path program 14 times [2019-12-18 13:47:40,067 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:47:40,067 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1584246697] [2019-12-18 13:47:40,068 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:47:40,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:47:40,281 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-18 13:47:40,281 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1584246697] [2019-12-18 13:47:40,281 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:47:40,281 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-18 13:47:40,282 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [830114644] [2019-12-18 13:47:40,282 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-18 13:47:40,282 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:47:40,283 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-18 13:47:40,283 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-18 13:47:40,283 INFO L87 Difference]: Start difference. First operand 21933 states and 67626 transitions. Second operand 11 states. [2019-12-18 13:47:42,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:47:42,683 INFO L93 Difference]: Finished difference Result 33650 states and 103039 transitions. [2019-12-18 13:47:42,683 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-12-18 13:47:42,684 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 67 [2019-12-18 13:47:42,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:47:42,731 INFO L225 Difference]: With dead ends: 33650 [2019-12-18 13:47:42,731 INFO L226 Difference]: Without dead ends: 33263 [2019-12-18 13:47:42,731 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=127, Invalid=523, Unknown=0, NotChecked=0, Total=650 [2019-12-18 13:47:42,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33263 states. [2019-12-18 13:47:43,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33263 to 21762. [2019-12-18 13:47:43,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21762 states. [2019-12-18 13:47:43,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21762 states to 21762 states and 67171 transitions. [2019-12-18 13:47:43,406 INFO L78 Accepts]: Start accepts. Automaton has 21762 states and 67171 transitions. Word has length 67 [2019-12-18 13:47:43,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:47:43,406 INFO L462 AbstractCegarLoop]: Abstraction has 21762 states and 67171 transitions. [2019-12-18 13:47:43,406 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-18 13:47:43,406 INFO L276 IsEmpty]: Start isEmpty. Operand 21762 states and 67171 transitions. [2019-12-18 13:47:43,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 13:47:43,430 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:47:43,430 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:47:43,430 INFO L410 AbstractCegarLoop]: === Iteration 36 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:47:43,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:47:43,430 INFO L82 PathProgramCache]: Analyzing trace with hash -1154306208, now seen corresponding path program 15 times [2019-12-18 13:47:43,430 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:47:43,430 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [627017579] [2019-12-18 13:47:43,430 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:47:43,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 13:47:43,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 13:47:43,560 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-18 13:47:43,561 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-18 13:47:43,564 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [895] [895] ULTIMATE.startENTRY-->L822: Formula: (let ((.cse0 (store |v_#valid_62| 0 0))) (and (= 0 v_~z$flush_delayed~0_27) (= 0 v_~x~0_129) (= 0 v_~__unbuffered_p1_EAX~0_44) (= v_~weak$$choice2~0_125 0) (= v_~z$read_delayed_var~0.offset_6 0) (= v_~z$r_buff0_thd1~0_274 0) (= |v_#NULL.offset_7| 0) (= v_~z$mem_tmp~0_16 0) (= v_~z$r_buff1_thd0~0_203 0) (= v_~main$tmp_guard1~0_48 0) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1309~0.base_23| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1309~0.base_23|) |v_ULTIMATE.start_main_~#t1309~0.offset_17| 0)) |v_#memory_int_17|) (= 0 v_~z$r_buff0_thd3~0_416) (= (store .cse0 |v_ULTIMATE.start_main_~#t1309~0.base_23| 1) |v_#valid_60|) (= |v_ULTIMATE.start_main_~#t1309~0.offset_17| 0) (= v_~z$w_buff1_used~0_618 0) (< 0 |v_#StackHeapBarrier_17|) (= 0 v_~__unbuffered_p2_EAX~0_39) (= v_~z$r_buff0_thd0~0_208 0) (= v_~z$read_delayed_var~0.base_6 0) (= v_~z$w_buff1~0_350 0) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t1309~0.base_23|)) (= v_~z$w_buff0_used~0_900 0) (< |v_#StackHeapBarrier_17| |v_ULTIMATE.start_main_~#t1309~0.base_23|) (= 0 v_~__unbuffered_p0_EAX~0_137) (= (store |v_#length_22| |v_ULTIMATE.start_main_~#t1309~0.base_23| 4) |v_#length_21|) (= v_~z$read_delayed~0_7 0) (= v_~z$r_buff1_thd2~0_170 0) (= 0 |v_#NULL.base_7|) (= 0 v_~z$r_buff1_thd3~0_300) (= v_~z$r_buff1_thd1~0_166 0) (= v_~z$w_buff0~0_454 0) (= 0 v_~weak$$choice0~0_13) (= v_~z~0_160 0) (= v_~main$tmp_guard0~0_24 0) (= 0 v_~__unbuffered_cnt~0_97) (= v_~z$r_buff0_thd2~0_191 0) (= v_~y~0_31 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_17|, #valid=|v_#valid_62|, #memory_int=|v_#memory_int_18|, #length=|v_#length_22|} OutVars{~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_170, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_29|, #NULL.offset=|v_#NULL.offset_7|, ULTIMATE.start_main_#t~ite49=|v_ULTIMATE.start_main_#t~ite49_69|, ULTIMATE.start_main_~#t1311~0.offset=|v_ULTIMATE.start_main_~#t1311~0.offset_14|, ULTIMATE.start_main_#t~ite50=|v_ULTIMATE.start_main_#t~ite50_175|, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_81|, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_208, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_137, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_44, #length=|v_#length_21|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_39, ULTIMATE.start_main_~#t1311~0.base=|v_ULTIMATE.start_main_~#t1311~0.base_17|, ~z$mem_tmp~0=v_~z$mem_tmp~0_16, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_7|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_618, ~z$flush_delayed~0=v_~z$flush_delayed~0_27, ~weak$$choice0~0=v_~weak$$choice0~0_13, #StackHeapBarrier=|v_#StackHeapBarrier_17|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_166, ~z$read_delayed_var~0.base=v_~z$read_delayed_var~0.base_6, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_416, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_97, ~x~0=v_~x~0_129, ~z$read_delayed~0=v_~z$read_delayed~0_7, ~z$w_buff1~0=v_~z$w_buff1~0_350, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_48, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_37|, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_6, ULTIMATE.start_main_#t~ite51=|v_ULTIMATE.start_main_#t~ite51_52|, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_203, ~y~0=v_~y~0_31, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_191, ULTIMATE.start_main_~#t1310~0.offset=|v_ULTIMATE.start_main_~#t1310~0.offset_12|, ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_21|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_900, ~z$w_buff0~0=v_~z$w_buff0~0_454, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_8|, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_300, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_24, ULTIMATE.start_main_~#t1309~0.offset=|v_ULTIMATE.start_main_~#t1309~0.offset_17|, #NULL.base=|v_#NULL.base_7|, ULTIMATE.start_main_~#t1310~0.base=|v_ULTIMATE.start_main_~#t1310~0.base_19|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_22|, #valid=|v_#valid_60|, #memory_int=|v_#memory_int_17|, ~z~0=v_~z~0_160, ~weak$$choice2~0=v_~weak$$choice2~0_125, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_274, ULTIMATE.start_main_~#t1309~0.base=|v_ULTIMATE.start_main_~#t1309~0.base_23|} AuxVars[] AssignedVars[~z$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite47, #NULL.offset, ULTIMATE.start_main_#t~ite49, ULTIMATE.start_main_~#t1311~0.offset, ULTIMATE.start_main_#t~ite50, ULTIMATE.start_main_#t~ite52, ~z$r_buff0_thd0~0, ~__unbuffered_p0_EAX~0, ~__unbuffered_p1_EAX~0, #length, ~__unbuffered_p2_EAX~0, ULTIMATE.start_main_~#t1311~0.base, ~z$mem_tmp~0, ULTIMATE.start_main_#t~nondet45, ~z$w_buff1_used~0, ~z$flush_delayed~0, ~weak$$choice0~0, ~z$r_buff1_thd1~0, ~z$read_delayed_var~0.base, ~z$r_buff0_thd3~0, ~__unbuffered_cnt~0, ~x~0, ~z$read_delayed~0, ~z$w_buff1~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite48, ~z$read_delayed_var~0.offset, ULTIMATE.start_main_#t~ite51, ~z$r_buff1_thd0~0, ~y~0, ~z$r_buff0_thd2~0, ULTIMATE.start_main_~#t1310~0.offset, ULTIMATE.start_main_#t~nondet46, ~z$w_buff0_used~0, ~z$w_buff0~0, ULTIMATE.start_main_#t~nondet44, ~z$r_buff1_thd3~0, ~main$tmp_guard0~0, ULTIMATE.start_main_~#t1309~0.offset, #NULL.base, ULTIMATE.start_main_~#t1310~0.base, ULTIMATE.start_main_#res, #valid, #memory_int, ~z~0, ~weak$$choice2~0, ~z$r_buff0_thd1~0, ULTIMATE.start_main_~#t1309~0.base] because there is no mapped edge [2019-12-18 13:47:43,565 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [874] [874] L822-1-->L824: Formula: (and (= |v_#valid_38| (store |v_#valid_39| |v_ULTIMATE.start_main_~#t1310~0.base_11| 1)) (not (= |v_ULTIMATE.start_main_~#t1310~0.base_11| 0)) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t1310~0.base_11| 4)) (= 0 (select |v_#valid_39| |v_ULTIMATE.start_main_~#t1310~0.base_11|)) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t1310~0.base_11|) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t1310~0.base_11| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t1310~0.base_11|) |v_ULTIMATE.start_main_~#t1310~0.offset_9| 1)) |v_#memory_int_13|) (= 0 |v_ULTIMATE.start_main_~#t1310~0.offset_9|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_39|, #memory_int=|v_#memory_int_14|, #length=|v_#length_18|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_12|, ULTIMATE.start_main_~#t1310~0.base=|v_ULTIMATE.start_main_~#t1310~0.base_11|, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_6|, #valid=|v_#valid_38|, #memory_int=|v_#memory_int_13|, #length=|v_#length_17|, ULTIMATE.start_main_~#t1310~0.offset=|v_ULTIMATE.start_main_~#t1310~0.offset_9|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1310~0.base, ULTIMATE.start_main_#t~nondet44, #valid, #memory_int, #length, ULTIMATE.start_main_~#t1310~0.offset] because there is no mapped edge [2019-12-18 13:47:43,565 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [781] [781] L4-->L746: Formula: (and (= v_~z$r_buff0_thd2~0_29 v_~z$r_buff1_thd2~0_21) (= v_~__unbuffered_p0_EAX~0_8 v_~x~0_8) (= v_~z$r_buff0_thd0~0_28 v_~z$r_buff1_thd0~0_16) (= v_~z$r_buff0_thd1~0_26 1) (= v_~z$r_buff0_thd1~0_27 v_~z$r_buff1_thd1~0_15) (not (= v_P0Thread1of1ForFork1___VERIFIER_assert_~expression_20 0)) (= v_~z$r_buff0_thd3~0_67 v_~z$r_buff1_thd3~0_43)) InVars {~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_28, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_67, P0Thread1of1ForFork1___VERIFIER_assert_~expression=v_P0Thread1of1ForFork1___VERIFIER_assert_~expression_20, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_27, ~x~0=v_~x~0_8, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_29} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_8, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_28, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_43, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_16, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_21, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_15, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_67, P0Thread1of1ForFork1___VERIFIER_assert_~expression=v_P0Thread1of1ForFork1___VERIFIER_assert_~expression_20, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_26, ~x~0=v_~x~0_8, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_29} AuxVars[] AssignedVars[~__unbuffered_p0_EAX~0, ~z$r_buff1_thd3~0, ~z$r_buff1_thd0~0, ~z$r_buff1_thd2~0, ~z$r_buff1_thd1~0, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-18 13:47:43,568 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [833] [833] L766-2-->L766-4: Formula: (let ((.cse0 (= (mod ~z$w_buff1_used~0_In167197775 256) 0)) (.cse1 (= 0 (mod ~z$r_buff1_thd2~0_In167197775 256)))) (or (and (= |P1Thread1of1ForFork2_#t~ite9_Out167197775| ~z~0_In167197775) (or .cse0 .cse1)) (and (not .cse0) (not .cse1) (= |P1Thread1of1ForFork2_#t~ite9_Out167197775| ~z$w_buff1~0_In167197775)))) InVars {~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In167197775, ~z$w_buff1_used~0=~z$w_buff1_used~0_In167197775, ~z$w_buff1~0=~z$w_buff1~0_In167197775, ~z~0=~z~0_In167197775} OutVars{P1Thread1of1ForFork2_#t~ite9=|P1Thread1of1ForFork2_#t~ite9_Out167197775|, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In167197775, ~z$w_buff1_used~0=~z$w_buff1_used~0_In167197775, ~z$w_buff1~0=~z$w_buff1~0_In167197775, ~z~0=~z~0_In167197775} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite9] because there is no mapped edge [2019-12-18 13:47:43,568 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [752] [752] L766-4-->L767: Formula: (= v_~z~0_16 |v_P1Thread1of1ForFork2_#t~ite9_8|) InVars {P1Thread1of1ForFork2_#t~ite9=|v_P1Thread1of1ForFork2_#t~ite9_8|} OutVars{P1Thread1of1ForFork2_#t~ite9=|v_P1Thread1of1ForFork2_#t~ite9_7|, P1Thread1of1ForFork2_#t~ite10=|v_P1Thread1of1ForFork2_#t~ite10_7|, ~z~0=v_~z~0_16} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite9, P1Thread1of1ForFork2_#t~ite10, ~z~0] because there is no mapped edge [2019-12-18 13:47:43,568 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [871] [871] L824-1-->L826: Formula: (and (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t1311~0.base_13|) (not (= 0 |v_ULTIMATE.start_main_~#t1311~0.base_13|)) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1311~0.base_13| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1311~0.base_13|) |v_ULTIMATE.start_main_~#t1311~0.offset_11| 2)) |v_#memory_int_11|) (= 0 (select |v_#valid_37| |v_ULTIMATE.start_main_~#t1311~0.base_13|)) (= |v_#valid_36| (store |v_#valid_37| |v_ULTIMATE.start_main_~#t1311~0.base_13| 1)) (= |v_ULTIMATE.start_main_~#t1311~0.offset_11| 0) (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t1311~0.base_13| 4))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_37|, #memory_int=|v_#memory_int_12|, #length=|v_#length_16|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_36|, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_5|, #memory_int=|v_#memory_int_11|, #length=|v_#length_15|, ULTIMATE.start_main_~#t1311~0.base=|v_ULTIMATE.start_main_~#t1311~0.base_13|, ULTIMATE.start_main_~#t1311~0.offset=|v_ULTIMATE.start_main_~#t1311~0.offset_11|} AuxVars[] AssignedVars[#valid, ULTIMATE.start_main_#t~nondet45, #memory_int, #length, ULTIMATE.start_main_~#t1311~0.base, ULTIMATE.start_main_~#t1311~0.offset] because there is no mapped edge [2019-12-18 13:47:43,568 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [841] [841] L767-->L767-2: Formula: (let ((.cse0 (= (mod ~z$r_buff0_thd2~0_In-2139486165 256) 0)) (.cse1 (= (mod ~z$w_buff0_used~0_In-2139486165 256) 0))) (or (and (= |P1Thread1of1ForFork2_#t~ite11_Out-2139486165| ~z$w_buff0_used~0_In-2139486165) (or .cse0 .cse1)) (and (= |P1Thread1of1ForFork2_#t~ite11_Out-2139486165| 0) (not .cse0) (not .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-2139486165, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-2139486165} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-2139486165, P1Thread1of1ForFork2_#t~ite11=|P1Thread1of1ForFork2_#t~ite11_Out-2139486165|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-2139486165} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite11] because there is no mapped edge [2019-12-18 13:47:43,569 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [823] [823] L768-->L768-2: Formula: (let ((.cse0 (= (mod ~z$r_buff1_thd2~0_In-1699415435 256) 0)) (.cse1 (= (mod ~z$w_buff1_used~0_In-1699415435 256) 0)) (.cse3 (= 0 (mod ~z$w_buff0_used~0_In-1699415435 256))) (.cse2 (= 0 (mod ~z$r_buff0_thd2~0_In-1699415435 256)))) (or (and (= |P1Thread1of1ForFork2_#t~ite12_Out-1699415435| ~z$w_buff1_used~0_In-1699415435) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2))) (= |P1Thread1of1ForFork2_#t~ite12_Out-1699415435| 0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1699415435, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-1699415435, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1699415435, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1699415435} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1699415435, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-1699415435, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1699415435, P1Thread1of1ForFork2_#t~ite12=|P1Thread1of1ForFork2_#t~ite12_Out-1699415435|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1699415435} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite12] because there is no mapped edge [2019-12-18 13:47:43,571 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [842] [842] L769-->L769-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In1982127559 256))) (.cse0 (= 0 (mod ~z$r_buff0_thd2~0_In1982127559 256)))) (or (and (not .cse0) (not .cse1) (= |P1Thread1of1ForFork2_#t~ite13_Out1982127559| 0)) (and (= |P1Thread1of1ForFork2_#t~ite13_Out1982127559| ~z$r_buff0_thd2~0_In1982127559) (or .cse1 .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1982127559, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1982127559} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1982127559, P1Thread1of1ForFork2_#t~ite13=|P1Thread1of1ForFork2_#t~ite13_Out1982127559|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1982127559} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite13] because there is no mapped edge [2019-12-18 13:47:43,573 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [875] [875] L790-->L790-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In-230356408 256) 0))) (or (and (= |P2Thread1of1ForFork0_#t~ite27_Out-230356408| |P2Thread1of1ForFork0_#t~ite26_Out-230356408|) (= ~z$w_buff0_used~0_In-230356408 |P2Thread1of1ForFork0_#t~ite26_Out-230356408|) .cse0 (let ((.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In-230356408 256)))) (or (and .cse1 (= (mod ~z$w_buff1_used~0_In-230356408 256) 0)) (and .cse1 (= (mod ~z$r_buff1_thd3~0_In-230356408 256) 0)) (= 0 (mod ~z$w_buff0_used~0_In-230356408 256))))) (and (not .cse0) (= |P2Thread1of1ForFork0_#t~ite27_Out-230356408| ~z$w_buff0_used~0_In-230356408) (= |P2Thread1of1ForFork0_#t~ite26_In-230356408| |P2Thread1of1ForFork0_#t~ite26_Out-230356408|)))) InVars {P2Thread1of1ForFork0_#t~ite26=|P2Thread1of1ForFork0_#t~ite26_In-230356408|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-230356408, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-230356408, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-230356408, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-230356408, ~weak$$choice2~0=~weak$$choice2~0_In-230356408} OutVars{P2Thread1of1ForFork0_#t~ite26=|P2Thread1of1ForFork0_#t~ite26_Out-230356408|, P2Thread1of1ForFork0_#t~ite27=|P2Thread1of1ForFork0_#t~ite27_Out-230356408|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-230356408, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-230356408, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-230356408, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-230356408, ~weak$$choice2~0=~weak$$choice2~0_In-230356408} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite26, P2Thread1of1ForFork0_#t~ite27] because there is no mapped edge [2019-12-18 13:47:43,575 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [810] [810] L792-->L793: Formula: (and (= v_~z$r_buff0_thd3~0_99 v_~z$r_buff0_thd3~0_100) (not (= 0 (mod v_~weak$$choice2~0_30 256)))) InVars {~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_100, ~weak$$choice2~0=v_~weak$$choice2~0_30} OutVars{P2Thread1of1ForFork0_#t~ite33=|v_P2Thread1of1ForFork0_#t~ite33_9|, P2Thread1of1ForFork0_#t~ite32=|v_P2Thread1of1ForFork0_#t~ite32_11|, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_99, P2Thread1of1ForFork0_#t~ite31=|v_P2Thread1of1ForFork0_#t~ite31_8|, ~weak$$choice2~0=v_~weak$$choice2~0_30} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite33, P2Thread1of1ForFork0_#t~ite32, ~z$r_buff0_thd3~0, P2Thread1of1ForFork0_#t~ite31] because there is no mapped edge [2019-12-18 13:47:43,576 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [828] [828] L747-->L747-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff0_thd1~0_In-1756037711 256))) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In-1756037711 256)))) (or (and (or .cse0 .cse1) (= ~z$w_buff0_used~0_In-1756037711 |P0Thread1of1ForFork1_#t~ite5_Out-1756037711|)) (and (= 0 |P0Thread1of1ForFork1_#t~ite5_Out-1756037711|) (not .cse0) (not .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1756037711, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-1756037711} OutVars{P0Thread1of1ForFork1_#t~ite5=|P0Thread1of1ForFork1_#t~ite5_Out-1756037711|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1756037711, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-1756037711} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite5] because there is no mapped edge [2019-12-18 13:47:43,577 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [814] [814] L795-->L799: Formula: (and (not (= (mod v_~z$flush_delayed~0_8 256) 0)) (= 0 v_~z$flush_delayed~0_7) (= v_~z~0_50 v_~z$mem_tmp~0_5)) InVars {~z$mem_tmp~0=v_~z$mem_tmp~0_5, ~z$flush_delayed~0=v_~z$flush_delayed~0_8} OutVars{P2Thread1of1ForFork0_#t~ite37=|v_P2Thread1of1ForFork0_#t~ite37_7|, ~z$mem_tmp~0=v_~z$mem_tmp~0_5, ~z$flush_delayed~0=v_~z$flush_delayed~0_7, ~z~0=v_~z~0_50} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite37, ~z$flush_delayed~0, ~z~0] because there is no mapped edge [2019-12-18 13:47:43,578 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [827] [827] L799-2-->L799-5: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff1_thd3~0_In-879170489 256))) (.cse2 (= |P2Thread1of1ForFork0_#t~ite38_Out-879170489| |P2Thread1of1ForFork0_#t~ite39_Out-879170489|)) (.cse0 (= 0 (mod ~z$w_buff1_used~0_In-879170489 256)))) (or (and (= |P2Thread1of1ForFork0_#t~ite38_Out-879170489| ~z~0_In-879170489) (or .cse0 .cse1) .cse2) (and (not .cse1) .cse2 (not .cse0) (= |P2Thread1of1ForFork0_#t~ite38_Out-879170489| ~z$w_buff1~0_In-879170489)))) InVars {~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-879170489, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-879170489, ~z$w_buff1~0=~z$w_buff1~0_In-879170489, ~z~0=~z~0_In-879170489} OutVars{P2Thread1of1ForFork0_#t~ite39=|P2Thread1of1ForFork0_#t~ite39_Out-879170489|, P2Thread1of1ForFork0_#t~ite38=|P2Thread1of1ForFork0_#t~ite38_Out-879170489|, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-879170489, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-879170489, ~z$w_buff1~0=~z$w_buff1~0_In-879170489, ~z~0=~z~0_In-879170489} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite39, P2Thread1of1ForFork0_#t~ite38] because there is no mapped edge [2019-12-18 13:47:43,579 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [843] [843] L800-->L800-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In-1949514368 256))) (.cse0 (= (mod ~z$w_buff0_used~0_In-1949514368 256) 0))) (or (and (or .cse0 .cse1) (= |P2Thread1of1ForFork0_#t~ite40_Out-1949514368| ~z$w_buff0_used~0_In-1949514368)) (and (not .cse1) (not .cse0) (= |P2Thread1of1ForFork0_#t~ite40_Out-1949514368| 0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1949514368, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1949514368} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1949514368, P2Thread1of1ForFork0_#t~ite40=|P2Thread1of1ForFork0_#t~ite40_Out-1949514368|, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1949514368} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite40] because there is no mapped edge [2019-12-18 13:47:43,579 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [836] [836] L801-->L801-2: Formula: (let ((.cse2 (= (mod ~z$r_buff0_thd3~0_In-104751722 256) 0)) (.cse3 (= 0 (mod ~z$w_buff0_used~0_In-104751722 256))) (.cse0 (= (mod ~z$w_buff1_used~0_In-104751722 256) 0)) (.cse1 (= (mod ~z$r_buff1_thd3~0_In-104751722 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~z$w_buff1_used~0_In-104751722 |P2Thread1of1ForFork0_#t~ite41_Out-104751722|)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1))) (= 0 |P2Thread1of1ForFork0_#t~ite41_Out-104751722|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-104751722, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-104751722, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-104751722, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-104751722} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-104751722, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-104751722, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-104751722, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-104751722, P2Thread1of1ForFork0_#t~ite41=|P2Thread1of1ForFork0_#t~ite41_Out-104751722|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite41] because there is no mapped edge [2019-12-18 13:47:43,579 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [824] [824] L802-->L802-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In883184240 256))) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In883184240 256)))) (or (and (= |P2Thread1of1ForFork0_#t~ite42_Out883184240| 0) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= |P2Thread1of1ForFork0_#t~ite42_Out883184240| ~z$r_buff0_thd3~0_In883184240)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In883184240, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In883184240} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In883184240, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In883184240, P2Thread1of1ForFork0_#t~ite42=|P2Thread1of1ForFork0_#t~ite42_Out883184240|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite42] because there is no mapped edge [2019-12-18 13:47:43,580 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [846] [846] L803-->L803-2: Formula: (let ((.cse3 (= (mod ~z$w_buff0_used~0_In666798078 256) 0)) (.cse2 (= (mod ~z$r_buff0_thd3~0_In666798078 256) 0)) (.cse1 (= (mod ~z$w_buff1_used~0_In666798078 256) 0)) (.cse0 (= 0 (mod ~z$r_buff1_thd3~0_In666798078 256)))) (or (and (= |P2Thread1of1ForFork0_#t~ite43_Out666798078| ~z$r_buff1_thd3~0_In666798078) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0))) (= 0 |P2Thread1of1ForFork0_#t~ite43_Out666798078|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In666798078, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In666798078, ~z$w_buff1_used~0=~z$w_buff1_used~0_In666798078, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In666798078} OutVars{P2Thread1of1ForFork0_#t~ite43=|P2Thread1of1ForFork0_#t~ite43_Out666798078|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In666798078, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In666798078, ~z$w_buff1_used~0=~z$w_buff1_used~0_In666798078, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In666798078} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite43] because there is no mapped edge [2019-12-18 13:47:43,580 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [859] [859] L803-2-->P2EXIT: Formula: (and (= |v_P2Thread1of1ForFork0_#res.offset_5| 0) (= v_~z$r_buff1_thd3~0_143 |v_P2Thread1of1ForFork0_#t~ite43_30|) (= (+ v_~__unbuffered_cnt~0_49 1) v_~__unbuffered_cnt~0_48) (= |v_P2Thread1of1ForFork0_#res.base_5| 0)) InVars {P2Thread1of1ForFork0_#t~ite43=|v_P2Thread1of1ForFork0_#t~ite43_30|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_49} OutVars{P2Thread1of1ForFork0_#res.base=|v_P2Thread1of1ForFork0_#res.base_5|, P2Thread1of1ForFork0_#t~ite43=|v_P2Thread1of1ForFork0_#t~ite43_29|, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_143, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_48, P2Thread1of1ForFork0_#res.offset=|v_P2Thread1of1ForFork0_#res.offset_5|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#res.base, P2Thread1of1ForFork0_#t~ite43, ~z$r_buff1_thd3~0, ~__unbuffered_cnt~0, P2Thread1of1ForFork0_#res.offset] because there is no mapped edge [2019-12-18 13:47:43,580 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [847] [847] L748-->L748-2: Formula: (let ((.cse3 (= (mod ~z$r_buff0_thd1~0_In1286743504 256) 0)) (.cse2 (= (mod ~z$w_buff0_used~0_In1286743504 256) 0)) (.cse0 (= (mod ~z$w_buff1_used~0_In1286743504 256) 0)) (.cse1 (= 0 (mod ~z$r_buff1_thd1~0_In1286743504 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P0Thread1of1ForFork1_#t~ite6_Out1286743504|)) (and (or .cse3 .cse2) (= ~z$w_buff1_used~0_In1286743504 |P0Thread1of1ForFork1_#t~ite6_Out1286743504|) (or .cse0 .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1286743504, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In1286743504, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1286743504, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In1286743504} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1286743504, P0Thread1of1ForFork1_#t~ite6=|P0Thread1of1ForFork1_#t~ite6_Out1286743504|, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In1286743504, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1286743504, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In1286743504} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite6] because there is no mapped edge [2019-12-18 13:47:43,580 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [845] [845] L749-->L750: Formula: (let ((.cse1 (= (mod ~z$r_buff0_thd1~0_In28949092 256) 0)) (.cse0 (= (mod ~z$w_buff0_used~0_In28949092 256) 0))) (or (and (not .cse0) (not .cse1) (= ~z$r_buff0_thd1~0_Out28949092 0)) (and (or .cse1 .cse0) (= ~z$r_buff0_thd1~0_Out28949092 ~z$r_buff0_thd1~0_In28949092)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In28949092, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In28949092} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In28949092, P0Thread1of1ForFork1_#t~ite7=|P0Thread1of1ForFork1_#t~ite7_Out28949092|, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_Out28949092} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite7, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-18 13:47:43,581 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [840] [840] L750-->L750-2: Formula: (let ((.cse3 (= 0 (mod ~z$r_buff0_thd1~0_In49421210 256))) (.cse2 (= 0 (mod ~z$w_buff0_used~0_In49421210 256))) (.cse0 (= 0 (mod ~z$r_buff1_thd1~0_In49421210 256))) (.cse1 (= 0 (mod ~z$w_buff1_used~0_In49421210 256)))) (or (and (= |P0Thread1of1ForFork1_#t~ite8_Out49421210| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= |P0Thread1of1ForFork1_#t~ite8_Out49421210| ~z$r_buff1_thd1~0_In49421210) (or .cse3 .cse2) (or .cse0 .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In49421210, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In49421210, ~z$w_buff1_used~0=~z$w_buff1_used~0_In49421210, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In49421210} OutVars{P0Thread1of1ForFork1_#t~ite8=|P0Thread1of1ForFork1_#t~ite8_Out49421210|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In49421210, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In49421210, ~z$w_buff1_used~0=~z$w_buff1_used~0_In49421210, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In49421210} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite8] because there is no mapped edge [2019-12-18 13:47:43,581 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [866] [866] L750-2-->P0EXIT: Formula: (and (= v_~z$r_buff1_thd1~0_100 |v_P0Thread1of1ForFork1_#t~ite8_44|) (= 0 |v_P0Thread1of1ForFork1_#res.offset_5|) (= (+ v_~__unbuffered_cnt~0_67 1) v_~__unbuffered_cnt~0_66) (= 0 |v_P0Thread1of1ForFork1_#res.base_5|)) InVars {P0Thread1of1ForFork1_#t~ite8=|v_P0Thread1of1ForFork1_#t~ite8_44|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_67} OutVars{P0Thread1of1ForFork1_#t~ite8=|v_P0Thread1of1ForFork1_#t~ite8_43|, P0Thread1of1ForFork1_#res.offset=|v_P0Thread1of1ForFork1_#res.offset_5|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_100, P0Thread1of1ForFork1_#res.base=|v_P0Thread1of1ForFork1_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_66} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite8, P0Thread1of1ForFork1_#res.offset, ~z$r_buff1_thd1~0, P0Thread1of1ForFork1_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-18 13:47:43,581 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [837] [837] L770-->L770-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff1_used~0_In-169833401 256))) (.cse0 (= 0 (mod ~z$r_buff1_thd2~0_In-169833401 256))) (.cse2 (= 0 (mod ~z$w_buff0_used~0_In-169833401 256))) (.cse3 (= 0 (mod ~z$r_buff0_thd2~0_In-169833401 256)))) (or (and (or .cse0 .cse1) (= ~z$r_buff1_thd2~0_In-169833401 |P1Thread1of1ForFork2_#t~ite14_Out-169833401|) (or .cse2 .cse3)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3))) (= 0 |P1Thread1of1ForFork2_#t~ite14_Out-169833401|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-169833401, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-169833401, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-169833401, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-169833401} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-169833401, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-169833401, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-169833401, P1Thread1of1ForFork2_#t~ite14=|P1Thread1of1ForFork2_#t~ite14_Out-169833401|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-169833401} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite14] because there is no mapped edge [2019-12-18 13:47:43,581 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [872] [872] L770-2-->P1EXIT: Formula: (and (= v_~z$r_buff1_thd2~0_120 |v_P1Thread1of1ForFork2_#t~ite14_34|) (= 0 |v_P1Thread1of1ForFork2_#res.offset_5|) (= v_~__unbuffered_cnt~0_76 (+ v_~__unbuffered_cnt~0_77 1)) (= 0 |v_P1Thread1of1ForFork2_#res.base_5|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_77, P1Thread1of1ForFork2_#t~ite14=|v_P1Thread1of1ForFork2_#t~ite14_34|} OutVars{P1Thread1of1ForFork2_#res.offset=|v_P1Thread1of1ForFork2_#res.offset_5|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_120, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_76, P1Thread1of1ForFork2_#t~ite14=|v_P1Thread1of1ForFork2_#t~ite14_33|, P1Thread1of1ForFork2_#res.base=|v_P1Thread1of1ForFork2_#res.base_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#res.offset, ~z$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork2_#t~ite14, P1Thread1of1ForFork2_#res.base] because there is no mapped edge [2019-12-18 13:47:43,581 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [799] [799] L826-1-->L832: Formula: (and (= 3 v_~__unbuffered_cnt~0_14) (= v_~main$tmp_guard0~0_7 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_14} OutVars{ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_6|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_14, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet46, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-18 13:47:43,582 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [825] [825] L832-2-->L832-5: Formula: (let ((.cse0 (= |ULTIMATE.start_main_#t~ite48_Out-1105456187| |ULTIMATE.start_main_#t~ite47_Out-1105456187|)) (.cse2 (= (mod ~z$r_buff1_thd0~0_In-1105456187 256) 0)) (.cse1 (= (mod ~z$w_buff1_used~0_In-1105456187 256) 0))) (or (and .cse0 (= |ULTIMATE.start_main_#t~ite47_Out-1105456187| ~z~0_In-1105456187) (or .cse1 .cse2)) (and .cse0 (not .cse2) (not .cse1) (= |ULTIMATE.start_main_#t~ite47_Out-1105456187| ~z$w_buff1~0_In-1105456187)))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1105456187, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1105456187, ~z$w_buff1~0=~z$w_buff1~0_In-1105456187, ~z~0=~z~0_In-1105456187} OutVars{~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1105456187, ULTIMATE.start_main_#t~ite47=|ULTIMATE.start_main_#t~ite47_Out-1105456187|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1105456187, ~z$w_buff1~0=~z$w_buff1~0_In-1105456187, ULTIMATE.start_main_#t~ite48=|ULTIMATE.start_main_#t~ite48_Out-1105456187|, ~z~0=~z~0_In-1105456187} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite47, ULTIMATE.start_main_#t~ite48] because there is no mapped edge [2019-12-18 13:47:43,582 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [839] [839] L833-->L833-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd0~0_In-120371946 256))) (.cse0 (= (mod ~z$w_buff0_used~0_In-120371946 256) 0))) (or (and (= 0 |ULTIMATE.start_main_#t~ite49_Out-120371946|) (not .cse0) (not .cse1)) (and (= ~z$w_buff0_used~0_In-120371946 |ULTIMATE.start_main_#t~ite49_Out-120371946|) (or .cse1 .cse0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-120371946, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-120371946} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-120371946, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-120371946, ULTIMATE.start_main_#t~ite49=|ULTIMATE.start_main_#t~ite49_Out-120371946|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite49] because there is no mapped edge [2019-12-18 13:47:43,583 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [830] [830] L834-->L834-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff1_used~0_In808529736 256))) (.cse0 (= (mod ~z$r_buff1_thd0~0_In808529736 256) 0)) (.cse2 (= (mod ~z$w_buff0_used~0_In808529736 256) 0)) (.cse3 (= (mod ~z$r_buff0_thd0~0_In808529736 256) 0))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite50_Out808529736| ~z$w_buff1_used~0_In808529736) (or .cse2 .cse3)) (and (= |ULTIMATE.start_main_#t~ite50_Out808529736| 0) (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3)))))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In808529736, ~z$w_buff0_used~0=~z$w_buff0_used~0_In808529736, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In808529736, ~z$w_buff1_used~0=~z$w_buff1_used~0_In808529736} OutVars{ULTIMATE.start_main_#t~ite50=|ULTIMATE.start_main_#t~ite50_Out808529736|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In808529736, ~z$w_buff0_used~0=~z$w_buff0_used~0_In808529736, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In808529736, ~z$w_buff1_used~0=~z$w_buff1_used~0_In808529736} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite50] because there is no mapped edge [2019-12-18 13:47:43,583 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [821] [821] L835-->L835-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In1513016791 256))) (.cse0 (= 0 (mod ~z$r_buff0_thd0~0_In1513016791 256)))) (or (and (= ~z$r_buff0_thd0~0_In1513016791 |ULTIMATE.start_main_#t~ite51_Out1513016791|) (or .cse0 .cse1)) (and (not .cse1) (not .cse0) (= |ULTIMATE.start_main_#t~ite51_Out1513016791| 0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1513016791, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1513016791} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1513016791, ULTIMATE.start_main_#t~ite51=|ULTIMATE.start_main_#t~ite51_Out1513016791|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1513016791} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite51] because there is no mapped edge [2019-12-18 13:47:43,584 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [834] [834] L836-->L836-2: Formula: (let ((.cse2 (= (mod ~z$w_buff0_used~0_In2053054137 256) 0)) (.cse3 (= 0 (mod ~z$r_buff0_thd0~0_In2053054137 256))) (.cse0 (= (mod ~z$w_buff1_used~0_In2053054137 256) 0)) (.cse1 (= 0 (mod ~z$r_buff1_thd0~0_In2053054137 256)))) (or (and (= |ULTIMATE.start_main_#t~ite52_Out2053054137| ~z$r_buff1_thd0~0_In2053054137) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= |ULTIMATE.start_main_#t~ite52_Out2053054137| 0) (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1)))))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In2053054137, ~z$w_buff0_used~0=~z$w_buff0_used~0_In2053054137, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In2053054137, ~z$w_buff1_used~0=~z$w_buff1_used~0_In2053054137} OutVars{ULTIMATE.start_main_#t~ite52=|ULTIMATE.start_main_#t~ite52_Out2053054137|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In2053054137, ~z$w_buff0_used~0=~z$w_buff0_used~0_In2053054137, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In2053054137, ~z$w_buff1_used~0=~z$w_buff1_used~0_In2053054137} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52] because there is no mapped edge [2019-12-18 13:47:43,584 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [879] [879] L836-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= 0 v_~__unbuffered_p1_EAX~0_25) (= v_~main$tmp_guard1~0_20 0) (= 0 v_~__unbuffered_p0_EAX~0_99) (= 0 v_~__unbuffered_p2_EAX~0_26) (= v_ULTIMATE.start___VERIFIER_assert_~expression_19 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_13|) (= v_~z$r_buff1_thd0~0_143 |v_ULTIMATE.start_main_#t~ite52_43|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_19 0)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_99, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_43|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_25, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_26} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_99, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_42|, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_19, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_25, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_143, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_20, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_26, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_13|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52, ULTIMATE.start___VERIFIER_assert_~expression, ~z$r_buff1_thd0~0, ~main$tmp_guard1~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-18 13:47:43,696 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.12 01:47:43 BasicIcfg [2019-12-18 13:47:43,696 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-18 13:47:43,698 INFO L168 Benchmark]: Toolchain (without parser) took 198400.37 ms. Allocated memory was 146.3 MB in the beginning and 3.2 GB in the end (delta: 3.0 GB). Free memory was 102.8 MB in the beginning and 2.2 GB in the end (delta: -2.1 GB). Peak memory consumption was 906.1 MB. Max. memory is 7.1 GB. [2019-12-18 13:47:43,698 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 146.3 MB. Free memory is still 122.2 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-12-18 13:47:43,699 INFO L168 Benchmark]: CACSL2BoogieTranslator took 798.13 ms. Allocated memory was 146.3 MB in the beginning and 203.9 MB in the end (delta: 57.7 MB). Free memory was 102.4 MB in the beginning and 156.9 MB in the end (delta: -54.5 MB). Peak memory consumption was 21.3 MB. Max. memory is 7.1 GB. [2019-12-18 13:47:43,699 INFO L168 Benchmark]: Boogie Procedure Inliner took 65.70 ms. Allocated memory is still 203.9 MB. Free memory was 156.9 MB in the beginning and 154.9 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2019-12-18 13:47:43,699 INFO L168 Benchmark]: Boogie Preprocessor took 40.75 ms. Allocated memory is still 203.9 MB. Free memory was 154.9 MB in the beginning and 152.0 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 7.1 GB. [2019-12-18 13:47:43,700 INFO L168 Benchmark]: RCFGBuilder took 854.32 ms. Allocated memory is still 203.9 MB. Free memory was 152.0 MB in the beginning and 101.6 MB in the end (delta: 50.3 MB). Peak memory consumption was 50.3 MB. Max. memory is 7.1 GB. [2019-12-18 13:47:43,700 INFO L168 Benchmark]: TraceAbstraction took 196635.88 ms. Allocated memory was 203.9 MB in the beginning and 3.2 GB in the end (delta: 3.0 GB). Free memory was 101.6 MB in the beginning and 2.2 GB in the end (delta: -2.1 GB). Peak memory consumption was 847.2 MB. Max. memory is 7.1 GB. [2019-12-18 13:47:43,702 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.22 ms. Allocated memory is still 146.3 MB. Free memory is still 122.2 MB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 798.13 ms. Allocated memory was 146.3 MB in the beginning and 203.9 MB in the end (delta: 57.7 MB). Free memory was 102.4 MB in the beginning and 156.9 MB in the end (delta: -54.5 MB). Peak memory consumption was 21.3 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 65.70 ms. Allocated memory is still 203.9 MB. Free memory was 156.9 MB in the beginning and 154.9 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 40.75 ms. Allocated memory is still 203.9 MB. Free memory was 154.9 MB in the beginning and 152.0 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 854.32 ms. Allocated memory is still 203.9 MB. Free memory was 152.0 MB in the beginning and 101.6 MB in the end (delta: 50.3 MB). Peak memory consumption was 50.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 196635.88 ms. Allocated memory was 203.9 MB in the beginning and 3.2 GB in the end (delta: 3.0 GB). Free memory was 101.6 MB in the beginning and 2.2 GB in the end (delta: -2.1 GB). Peak memory consumption was 847.2 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 6.0s, 176 ProgramPointsBefore, 95 ProgramPointsAfterwards, 213 TransitionsBefore, 107 TransitionsAfterwards, 19004 CoEnabledTransitionPairs, 12 FixpointIterations, 33 TrivialSequentialCompositions, 55 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 33 ConcurrentYvCompositions, 29 ChoiceCompositions, 7276 VarBasedMoverChecksPositive, 432 VarBasedMoverChecksNegative, 272 SemBasedMoverChecksPositive, 254 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 2.0s, 0 MoverChecksTotal, 130045 CheckedPairsTotal, 121 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L822] FCALL, FORK 0 pthread_create(&t1309, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L731] 1 z$w_buff1 = z$w_buff0 [L732] 1 z$w_buff0 = 1 [L733] 1 z$w_buff1_used = z$w_buff0_used [L734] 1 z$w_buff0_used = (_Bool)1 [L746] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L824] FCALL, FORK 0 pthread_create(&t1310, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L760] 2 x = 1 [L763] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L766] 2 z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L767] 2 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L826] FCALL, FORK 0 pthread_create(&t1311, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_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=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used=0, z$w_buff1=0, z$w_buff1_used=0] [L780] 3 y = 1 [L783] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L784] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L785] 3 z$flush_delayed = weak$$choice2 [L786] 3 z$mem_tmp = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=7, x=1, y=1, z=0, z$flush_delayed=7, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used=0, z$w_buff1=0, z$w_buff1_used=0] [L787] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) VAL [!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=7, x=1, y=1, z=0, z$flush_delayed=7, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used=0, z$w_buff1=0, z$w_buff1_used=0] [L787] 3 z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L788] EXPR 3 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=7, weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0))=1, x=1, y=1, z=0, z$flush_delayed=7, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used=0, z$w_buff1=0, z$w_buff1_used=0] [L768] 2 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L788] 3 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L789] EXPR 3 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=7, weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1))=0, x=1, y=1, z=0, z$flush_delayed=7, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2=0, z$w_buff1=0, z$w_buff1_used=0] [L789] 3 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L790] 3 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L791] EXPR 3 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=7, weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))=0, x=1, y=1, z=0, z$flush_delayed=7, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2=0, z$w_buff1=0, z$w_buff1_used=0] [L791] 3 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L793] EXPR 3 weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=7, weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))=0, x=1, y=1, z=0, z$flush_delayed=7, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2=0, z$w_buff1=0, z$w_buff1_used=0] [L793] 3 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L794] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=7, x=1, y=1, z=0, z$flush_delayed=7, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2=0, z$w_buff1=0, z$w_buff1_used=0] [L746] 1 z = z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L747] 1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L799] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=7, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2=0, z$w_buff1=0, z$w_buff1_used=0] [L799] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L800] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L801] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L802] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L748] 1 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L769] 2 z$r_buff0_thd2 = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L832] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=7, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L832] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L833] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L834] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L835] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 167 locations, 2 error locations. Result: UNSAFE, OverallTime: 196.2s, OverallIterations: 36, TraceHistogramMax: 1, AutomataDifference: 106.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 11143 SDtfs, 15153 SDslu, 54581 SDs, 0 SdLazy, 76540 SolverSat, 989 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 63.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 882 GetRequests, 75 SyntacticMatches, 32 SemanticMatches, 775 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7132 ImplicationChecksByTransitivity, 19.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=158936occurred 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: 48.7s AutomataMinimizationTime, 35 MinimizatonAttempts, 337775 StatesRemovedByMinimization, 33 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 8.4s InterpolantComputationTime, 1927 NumberOfCodeBlocks, 1927 NumberOfCodeBlocksAsserted, 36 NumberOfCheckSat, 1825 ConstructedInterpolants, 0 QuantifiedInterpolants, 702219 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 35 InterpolantComputations, 35 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...