/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/mix024_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-fae578e [2019-12-18 12:54:34,865 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-18 12:54:34,867 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-18 12:54:34,885 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-18 12:54:34,885 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-18 12:54:34,887 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-18 12:54:34,889 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-18 12:54:34,897 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-18 12:54:34,898 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-18 12:54:34,902 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-18 12:54:34,904 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-18 12:54:34,905 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-18 12:54:34,906 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-18 12:54:34,907 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-18 12:54:34,910 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-18 12:54:34,912 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-18 12:54:34,913 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-18 12:54:34,914 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-18 12:54:34,915 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-18 12:54:34,920 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-18 12:54:34,923 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-18 12:54:34,927 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-18 12:54:34,928 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-18 12:54:34,928 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-18 12:54:34,931 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-18 12:54:34,931 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-18 12:54:34,931 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-18 12:54:34,933 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-18 12:54:34,934 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-18 12:54:34,934 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-18 12:54:34,935 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-18 12:54:34,936 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-18 12:54:34,937 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-18 12:54:34,938 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-18 12:54:34,939 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-18 12:54:34,939 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-18 12:54:34,939 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-18 12:54:34,940 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-18 12:54:34,940 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-18 12:54:34,941 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-18 12:54:34,942 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-18 12:54:34,943 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 12:54:34,975 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-18 12:54:34,975 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-18 12:54:34,979 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-18 12:54:34,980 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-18 12:54:34,980 INFO L138 SettingsManager]: * Use SBE=true [2019-12-18 12:54:34,980 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-18 12:54:34,980 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-18 12:54:34,980 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-18 12:54:34,981 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-18 12:54:34,981 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-18 12:54:34,981 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-18 12:54:34,981 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-18 12:54:34,981 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-18 12:54:34,982 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-18 12:54:34,982 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-18 12:54:34,983 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-18 12:54:34,983 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-18 12:54:34,983 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-18 12:54:34,983 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-18 12:54:34,983 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-18 12:54:34,983 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-18 12:54:34,984 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 12:54:34,984 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-18 12:54:34,984 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-18 12:54:34,984 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-18 12:54:34,984 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-18 12:54:34,985 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-18 12:54:34,985 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-18 12:54:34,985 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-18 12:54:34,985 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-18 12:54:35,280 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-18 12:54:35,301 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-18 12:54:35,305 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-18 12:54:35,306 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-18 12:54:35,307 INFO L275 PluginConnector]: CDTParser initialized [2019-12-18 12:54:35,308 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix024_rmo.opt.i [2019-12-18 12:54:35,384 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8af88a049/8fb642910f0e49aa9f6e3c5c47e69460/FLAGab584540d [2019-12-18 12:54:35,951 INFO L306 CDTParser]: Found 1 translation units. [2019-12-18 12:54:35,951 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix024_rmo.opt.i [2019-12-18 12:54:35,968 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8af88a049/8fb642910f0e49aa9f6e3c5c47e69460/FLAGab584540d [2019-12-18 12:54:36,199 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8af88a049/8fb642910f0e49aa9f6e3c5c47e69460 [2019-12-18 12:54:36,207 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-18 12:54:36,209 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-18 12:54:36,210 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-18 12:54:36,210 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-18 12:54:36,213 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-18 12:54:36,214 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 12:54:36" (1/1) ... [2019-12-18 12:54:36,217 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3899c684 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:54:36, skipping insertion in model container [2019-12-18 12:54:36,217 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 12:54:36" (1/1) ... [2019-12-18 12:54:36,225 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-18 12:54:36,280 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-18 12:54:36,777 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 12:54:36,792 INFO L203 MainTranslator]: Completed pre-run [2019-12-18 12:54:36,878 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 12:54:36,951 INFO L208 MainTranslator]: Completed translation [2019-12-18 12:54:36,951 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:54:36 WrapperNode [2019-12-18 12:54:36,952 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-18 12:54:36,952 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-18 12:54:36,953 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-18 12:54:36,953 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-18 12:54:36,962 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:54:36" (1/1) ... [2019-12-18 12:54:36,983 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:54:36" (1/1) ... [2019-12-18 12:54:37,026 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-18 12:54:37,028 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-18 12:54:37,028 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-18 12:54:37,028 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-18 12:54:37,038 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:54:36" (1/1) ... [2019-12-18 12:54:37,039 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:54:36" (1/1) ... [2019-12-18 12:54:37,048 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:54:36" (1/1) ... [2019-12-18 12:54:37,048 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:54:36" (1/1) ... [2019-12-18 12:54:37,058 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:54:36" (1/1) ... [2019-12-18 12:54:37,063 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:54:36" (1/1) ... [2019-12-18 12:54:37,066 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:54:36" (1/1) ... [2019-12-18 12:54:37,072 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-18 12:54:37,072 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-18 12:54:37,072 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-18 12:54:37,072 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-18 12:54:37,073 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:54:36" (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 12:54:37,137 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-18 12:54:37,138 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-18 12:54:37,138 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-18 12:54:37,138 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-18 12:54:37,138 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-18 12:54:37,139 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-18 12:54:37,139 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-18 12:54:37,139 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-18 12:54:37,139 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-18 12:54:37,139 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-18 12:54:37,139 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-18 12:54:37,140 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-18 12:54:37,140 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-18 12:54:37,142 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 12:54:37,856 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-18 12:54:37,856 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-18 12:54:37,858 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 12:54:37 BoogieIcfgContainer [2019-12-18 12:54:37,858 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-18 12:54:37,859 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-18 12:54:37,859 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-18 12:54:37,862 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-18 12:54:37,862 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 12:54:36" (1/3) ... [2019-12-18 12:54:37,863 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e97d0be and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 12:54:37, skipping insertion in model container [2019-12-18 12:54:37,863 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:54:36" (2/3) ... [2019-12-18 12:54:37,864 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e97d0be and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 12:54:37, skipping insertion in model container [2019-12-18 12:54:37,864 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 12:54:37" (3/3) ... [2019-12-18 12:54:37,866 INFO L109 eAbstractionObserver]: Analyzing ICFG mix024_rmo.opt.i [2019-12-18 12:54:37,875 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-18 12:54:37,875 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-18 12:54:37,883 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-18 12:54:37,884 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-18 12:54:37,923 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:37,923 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:37,924 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:37,924 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:37,924 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:37,925 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:37,925 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:37,925 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:37,926 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:37,926 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:37,926 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:37,926 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:37,927 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:37,927 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:37,927 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:37,927 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:37,928 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:37,928 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:37,928 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:37,928 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:37,929 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:37,929 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:37,929 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:37,930 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:37,930 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:37,930 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:37,930 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:37,931 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:37,931 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:37,931 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:37,947 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:37,948 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:37,948 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:37,948 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:37,949 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:37,949 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:37,949 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:37,949 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:37,950 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:37,950 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:37,950 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:37,950 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:37,950 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:37,951 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:37,951 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:37,951 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:37,951 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:37,952 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:37,952 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:37,952 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:37,952 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:37,953 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:37,953 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:37,953 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:37,953 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:37,953 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:37,954 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:37,954 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:37,954 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:37,954 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:37,954 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:37,955 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:37,955 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:37,955 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:37,955 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:37,955 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:37,956 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:37,956 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:37,956 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:37,956 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:37,956 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:37,957 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:37,957 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:37,957 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:37,957 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:37,957 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:37,958 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:37,958 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:37,958 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:37,958 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:37,958 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:37,959 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:37,959 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:37,959 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:37,959 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:37,960 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:37,960 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:37,960 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:37,960 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:37,960 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:37,961 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:37,961 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:37,961 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:37,961 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:37,962 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:37,962 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:37,962 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:37,963 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:37,963 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:37,963 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:37,963 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:37,963 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:37,964 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:37,964 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:37,964 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:37,964 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:37,965 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:37,965 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:37,965 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:37,965 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:37,966 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:37,966 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:37,966 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:37,966 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:37,966 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:37,967 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:37,967 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:37,967 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:37,967 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:37,967 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:37,968 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:37,968 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:37,968 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:37,968 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:37,968 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:37,969 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:37,969 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:37,969 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:37,969 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:37,970 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:37,970 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:37,970 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:37,970 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:37,970 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:37,971 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:37,971 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:37,971 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:37,971 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:37,971 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:37,972 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:37,972 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:37,972 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:37,972 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:37,972 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:37,972 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:37,973 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:37,973 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:37,973 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:37,973 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:37,973 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:37,974 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:37,974 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:37,974 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:37,974 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:37,974 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:37,975 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:37,975 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:37,975 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:37,978 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:37,979 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:37,979 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:37,979 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:37,979 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:37,979 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:37,980 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:37,980 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:37,980 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:37,980 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:37,980 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:37,981 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:37,981 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:37,981 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:37,981 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:37,981 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:37,982 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:37,982 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:37,982 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:37,982 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:37,982 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:37,983 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:37,983 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:37,983 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:37,983 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:37,983 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:37,984 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:37,986 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:37,987 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:37,987 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:37,987 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:37,987 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:37,987 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:37,988 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:37,988 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:37,988 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:37,988 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:37,988 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:37,989 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:37,992 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:37,992 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:37,992 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:37,992 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:37,993 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:37,993 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:37,993 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:37,993 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:37,993 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:37,993 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:38,008 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-18 12:54:38,023 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-18 12:54:38,024 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-18 12:54:38,024 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-18 12:54:38,024 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-18 12:54:38,024 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-18 12:54:38,024 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-18 12:54:38,024 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-18 12:54:38,024 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-18 12:54:38,041 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 166 places, 197 transitions [2019-12-18 12:54:38,043 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 166 places, 197 transitions [2019-12-18 12:54:38,124 INFO L126 PetriNetUnfolder]: 41/194 cut-off events. [2019-12-18 12:54:38,125 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 12:54:38,144 INFO L76 FinitePrefix]: Finished finitePrefix Result has 204 conditions, 194 events. 41/194 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 446 event pairs. 9/160 useless extension candidates. Maximal degree in co-relation 161. Up to 2 conditions per place. [2019-12-18 12:54:38,170 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 166 places, 197 transitions [2019-12-18 12:54:38,217 INFO L126 PetriNetUnfolder]: 41/194 cut-off events. [2019-12-18 12:54:38,218 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 12:54:38,232 INFO L76 FinitePrefix]: Finished finitePrefix Result has 204 conditions, 194 events. 41/194 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 446 event pairs. 9/160 useless extension candidates. Maximal degree in co-relation 161. Up to 2 conditions per place. [2019-12-18 12:54:38,255 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 16696 [2019-12-18 12:54:38,256 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-18 12:54:38,681 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 27 [2019-12-18 12:54:43,940 WARN L192 SmtUtils]: Spent 283.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 93 [2019-12-18 12:54:44,079 WARN L192 SmtUtils]: Spent 134.00 ms on a formula simplification that was a NOOP. DAG size: 91 [2019-12-18 12:54:44,101 INFO L206 etLargeBlockEncoding]: Checked pairs total: 74173 [2019-12-18 12:54:44,101 INFO L214 etLargeBlockEncoding]: Total number of compositions: 113 [2019-12-18 12:54:44,105 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 83 places, 90 transitions [2019-12-18 12:54:54,321 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 82802 states. [2019-12-18 12:54:54,323 INFO L276 IsEmpty]: Start isEmpty. Operand 82802 states. [2019-12-18 12:54:54,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-12-18 12:54:54,330 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:54:54,331 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-12-18 12:54:54,332 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:54:54,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:54:54,339 INFO L82 PathProgramCache]: Analyzing trace with hash 803939489, now seen corresponding path program 1 times [2019-12-18 12:54:54,348 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:54:54,348 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [20146836] [2019-12-18 12:54:54,349 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:54:54,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:54:54,587 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 12:54:54,588 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [20146836] [2019-12-18 12:54:54,588 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:54:54,589 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 12:54:54,590 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1198054279] [2019-12-18 12:54:54,594 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 12:54:54,595 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:54:54,605 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 12:54:54,606 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 12:54:54,608 INFO L87 Difference]: Start difference. First operand 82802 states. Second operand 3 states. [2019-12-18 12:54:55,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:54:55,889 INFO L93 Difference]: Finished difference Result 81762 states and 350164 transitions. [2019-12-18 12:54:55,890 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 12:54:55,891 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-12-18 12:54:55,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:54:58,753 INFO L225 Difference]: With dead ends: 81762 [2019-12-18 12:54:58,753 INFO L226 Difference]: Without dead ends: 77082 [2019-12-18 12:54:58,754 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 12:55:01,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77082 states. [2019-12-18 12:55:03,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77082 to 77082. [2019-12-18 12:55:03,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77082 states. [2019-12-18 12:55:04,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77082 states to 77082 states and 329650 transitions. [2019-12-18 12:55:04,017 INFO L78 Accepts]: Start accepts. Automaton has 77082 states and 329650 transitions. Word has length 5 [2019-12-18 12:55:04,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:55:04,018 INFO L462 AbstractCegarLoop]: Abstraction has 77082 states and 329650 transitions. [2019-12-18 12:55:04,018 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 12:55:04,018 INFO L276 IsEmpty]: Start isEmpty. Operand 77082 states and 329650 transitions. [2019-12-18 12:55:06,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-18 12:55:06,514 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:55:06,514 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:55:06,514 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:55:06,515 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:55:06,515 INFO L82 PathProgramCache]: Analyzing trace with hash -1596901179, now seen corresponding path program 1 times [2019-12-18 12:55:06,515 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:55:06,515 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1671853411] [2019-12-18 12:55:06,515 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:55:06,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:55:06,582 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 12:55:06,582 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1671853411] [2019-12-18 12:55:06,583 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:55:06,583 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 12:55:06,584 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [265374408] [2019-12-18 12:55:06,585 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 12:55:06,585 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:55:06,586 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 12:55:06,586 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 12:55:06,586 INFO L87 Difference]: Start difference. First operand 77082 states and 329650 transitions. Second operand 3 states. [2019-12-18 12:55:06,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:55:06,894 INFO L93 Difference]: Finished difference Result 20478 states and 70372 transitions. [2019-12-18 12:55:06,895 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 12:55:06,895 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-18 12:55:06,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:55:06,961 INFO L225 Difference]: With dead ends: 20478 [2019-12-18 12:55:06,961 INFO L226 Difference]: Without dead ends: 20478 [2019-12-18 12:55:06,962 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 12:55:07,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20478 states. [2019-12-18 12:55:07,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20478 to 20478. [2019-12-18 12:55:07,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20478 states. [2019-12-18 12:55:07,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20478 states to 20478 states and 70372 transitions. [2019-12-18 12:55:07,653 INFO L78 Accepts]: Start accepts. Automaton has 20478 states and 70372 transitions. Word has length 13 [2019-12-18 12:55:07,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:55:07,653 INFO L462 AbstractCegarLoop]: Abstraction has 20478 states and 70372 transitions. [2019-12-18 12:55:07,653 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 12:55:07,653 INFO L276 IsEmpty]: Start isEmpty. Operand 20478 states and 70372 transitions. [2019-12-18 12:55:07,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-18 12:55:07,655 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:55:07,655 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:55:07,656 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:55:07,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:55:07,656 INFO L82 PathProgramCache]: Analyzing trace with hash -1662041210, now seen corresponding path program 1 times [2019-12-18 12:55:07,656 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:55:07,656 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [933601737] [2019-12-18 12:55:07,657 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:55:07,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:55:07,780 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 12:55:07,780 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [933601737] [2019-12-18 12:55:07,781 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:55:07,781 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 12:55:07,782 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1986969682] [2019-12-18 12:55:07,782 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 12:55:07,782 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:55:07,782 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 12:55:07,783 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 12:55:07,783 INFO L87 Difference]: Start difference. First operand 20478 states and 70372 transitions. Second operand 4 states. [2019-12-18 12:55:08,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:55:08,124 INFO L93 Difference]: Finished difference Result 30802 states and 102312 transitions. [2019-12-18 12:55:08,124 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 12:55:08,125 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-18 12:55:08,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:55:08,252 INFO L225 Difference]: With dead ends: 30802 [2019-12-18 12:55:08,252 INFO L226 Difference]: Without dead ends: 30788 [2019-12-18 12:55:08,253 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 12:55:08,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30788 states. [2019-12-18 12:55:09,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30788 to 27348. [2019-12-18 12:55:09,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27348 states. [2019-12-18 12:55:09,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27348 states to 27348 states and 91824 transitions. [2019-12-18 12:55:09,310 INFO L78 Accepts]: Start accepts. Automaton has 27348 states and 91824 transitions. Word has length 13 [2019-12-18 12:55:09,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:55:09,310 INFO L462 AbstractCegarLoop]: Abstraction has 27348 states and 91824 transitions. [2019-12-18 12:55:09,310 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 12:55:09,310 INFO L276 IsEmpty]: Start isEmpty. Operand 27348 states and 91824 transitions. [2019-12-18 12:55:09,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-18 12:55:09,313 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:55:09,313 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:55:09,313 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:55:09,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:55:09,313 INFO L82 PathProgramCache]: Analyzing trace with hash -1480512145, now seen corresponding path program 1 times [2019-12-18 12:55:09,314 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:55:09,314 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1015378418] [2019-12-18 12:55:09,314 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:55:09,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:55:09,421 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 12:55:09,421 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1015378418] [2019-12-18 12:55:09,421 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:55:09,425 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 12:55:09,425 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1977138981] [2019-12-18 12:55:09,426 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 12:55:09,426 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:55:09,426 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 12:55:09,427 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 12:55:09,430 INFO L87 Difference]: Start difference. First operand 27348 states and 91824 transitions. Second operand 4 states. [2019-12-18 12:55:09,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:55:09,739 INFO L93 Difference]: Finished difference Result 35523 states and 117963 transitions. [2019-12-18 12:55:09,739 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 12:55:09,740 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-12-18 12:55:09,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:55:09,819 INFO L225 Difference]: With dead ends: 35523 [2019-12-18 12:55:09,819 INFO L226 Difference]: Without dead ends: 35512 [2019-12-18 12:55:09,820 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 12:55:10,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35512 states. [2019-12-18 12:55:10,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35512 to 30900. [2019-12-18 12:55:10,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30900 states. [2019-12-18 12:55:10,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30900 states to 30900 states and 103384 transitions. [2019-12-18 12:55:10,801 INFO L78 Accepts]: Start accepts. Automaton has 30900 states and 103384 transitions. Word has length 14 [2019-12-18 12:55:10,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:55:10,802 INFO L462 AbstractCegarLoop]: Abstraction has 30900 states and 103384 transitions. [2019-12-18 12:55:10,803 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 12:55:10,803 INFO L276 IsEmpty]: Start isEmpty. Operand 30900 states and 103384 transitions. [2019-12-18 12:55:10,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-18 12:55:10,805 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:55:10,805 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:55:10,805 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:55:10,806 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:55:10,806 INFO L82 PathProgramCache]: Analyzing trace with hash -1480362260, now seen corresponding path program 1 times [2019-12-18 12:55:10,806 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:55:10,806 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [975597999] [2019-12-18 12:55:10,806 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:55:10,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:55:10,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 12:55:10,856 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [975597999] [2019-12-18 12:55:10,856 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:55:10,856 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 12:55:10,857 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1202686924] [2019-12-18 12:55:10,857 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 12:55:10,857 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:55:10,857 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 12:55:10,858 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 12:55:10,858 INFO L87 Difference]: Start difference. First operand 30900 states and 103384 transitions. Second operand 4 states. [2019-12-18 12:55:11,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:55:11,179 INFO L93 Difference]: Finished difference Result 38443 states and 127475 transitions. [2019-12-18 12:55:11,179 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 12:55:11,180 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-12-18 12:55:11,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:55:11,276 INFO L225 Difference]: With dead ends: 38443 [2019-12-18 12:55:11,276 INFO L226 Difference]: Without dead ends: 38432 [2019-12-18 12:55:11,277 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 12:55:11,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38432 states. [2019-12-18 12:55:12,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38432 to 30923. [2019-12-18 12:55:12,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30923 states. [2019-12-18 12:55:12,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30923 states to 30923 states and 103333 transitions. [2019-12-18 12:55:12,215 INFO L78 Accepts]: Start accepts. Automaton has 30923 states and 103333 transitions. Word has length 14 [2019-12-18 12:55:12,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:55:12,215 INFO L462 AbstractCegarLoop]: Abstraction has 30923 states and 103333 transitions. [2019-12-18 12:55:12,215 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 12:55:12,215 INFO L276 IsEmpty]: Start isEmpty. Operand 30923 states and 103333 transitions. [2019-12-18 12:55:12,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-18 12:55:12,225 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:55:12,226 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 12:55:12,226 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:55:12,226 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:55:12,226 INFO L82 PathProgramCache]: Analyzing trace with hash 2067973460, now seen corresponding path program 1 times [2019-12-18 12:55:12,226 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:55:12,227 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1547202828] [2019-12-18 12:55:12,227 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:55:12,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:55:12,326 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 12:55:12,327 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1547202828] [2019-12-18 12:55:12,327 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:55:12,327 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 12:55:12,327 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [74849053] [2019-12-18 12:55:12,328 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 12:55:12,328 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:55:12,328 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 12:55:12,328 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 12:55:12,328 INFO L87 Difference]: Start difference. First operand 30923 states and 103333 transitions. Second operand 5 states. [2019-12-18 12:55:12,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:55:12,855 INFO L93 Difference]: Finished difference Result 45281 states and 149378 transitions. [2019-12-18 12:55:12,855 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-18 12:55:12,856 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-12-18 12:55:12,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:55:12,930 INFO L225 Difference]: With dead ends: 45281 [2019-12-18 12:55:12,930 INFO L226 Difference]: Without dead ends: 45258 [2019-12-18 12:55:12,931 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-18 12:55:13,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45258 states. [2019-12-18 12:55:13,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45258 to 32469. [2019-12-18 12:55:13,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32469 states. [2019-12-18 12:55:13,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32469 states to 32469 states and 108463 transitions. [2019-12-18 12:55:13,973 INFO L78 Accepts]: Start accepts. Automaton has 32469 states and 108463 transitions. Word has length 22 [2019-12-18 12:55:13,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:55:13,973 INFO L462 AbstractCegarLoop]: Abstraction has 32469 states and 108463 transitions. [2019-12-18 12:55:13,973 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 12:55:13,973 INFO L276 IsEmpty]: Start isEmpty. Operand 32469 states and 108463 transitions. [2019-12-18 12:55:13,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-18 12:55:13,983 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:55:13,983 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 12:55:13,983 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:55:13,983 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:55:13,984 INFO L82 PathProgramCache]: Analyzing trace with hash 2068123345, now seen corresponding path program 1 times [2019-12-18 12:55:13,984 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:55:13,984 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [815215107] [2019-12-18 12:55:13,984 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:55:14,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:55:14,115 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 12:55:14,116 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [815215107] [2019-12-18 12:55:14,116 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:55:14,116 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 12:55:14,117 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [960677124] [2019-12-18 12:55:14,117 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 12:55:14,117 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:55:14,118 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 12:55:14,118 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 12:55:14,118 INFO L87 Difference]: Start difference. First operand 32469 states and 108463 transitions. Second operand 5 states. [2019-12-18 12:55:14,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:55:14,674 INFO L93 Difference]: Finished difference Result 46044 states and 151821 transitions. [2019-12-18 12:55:14,674 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-18 12:55:14,674 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-12-18 12:55:14,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:55:14,754 INFO L225 Difference]: With dead ends: 46044 [2019-12-18 12:55:14,754 INFO L226 Difference]: Without dead ends: 46021 [2019-12-18 12:55:14,754 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-18 12:55:14,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46021 states. [2019-12-18 12:55:15,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46021 to 30490. [2019-12-18 12:55:15,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30490 states. [2019-12-18 12:55:15,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30490 states to 30490 states and 101754 transitions. [2019-12-18 12:55:15,374 INFO L78 Accepts]: Start accepts. Automaton has 30490 states and 101754 transitions. Word has length 22 [2019-12-18 12:55:15,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:55:15,375 INFO L462 AbstractCegarLoop]: Abstraction has 30490 states and 101754 transitions. [2019-12-18 12:55:15,375 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 12:55:15,375 INFO L276 IsEmpty]: Start isEmpty. Operand 30490 states and 101754 transitions. [2019-12-18 12:55:15,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 12:55:15,385 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:55:15,385 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 12:55:15,386 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:55:15,386 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:55:15,386 INFO L82 PathProgramCache]: Analyzing trace with hash 668919418, now seen corresponding path program 1 times [2019-12-18 12:55:15,386 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:55:15,386 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1884312399] [2019-12-18 12:55:15,386 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:55:15,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:55:15,437 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 12:55:15,437 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1884312399] [2019-12-18 12:55:15,438 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:55:15,438 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 12:55:15,438 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2130924844] [2019-12-18 12:55:15,438 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 12:55:15,439 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:55:15,439 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 12:55:15,439 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 12:55:15,439 INFO L87 Difference]: Start difference. First operand 30490 states and 101754 transitions. Second operand 4 states. [2019-12-18 12:55:15,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:55:15,499 INFO L93 Difference]: Finished difference Result 11657 states and 35881 transitions. [2019-12-18 12:55:15,499 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 12:55:15,499 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2019-12-18 12:55:15,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:55:15,515 INFO L225 Difference]: With dead ends: 11657 [2019-12-18 12:55:15,515 INFO L226 Difference]: Without dead ends: 11657 [2019-12-18 12:55:15,516 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 12:55:15,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11657 states. [2019-12-18 12:55:15,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11657 to 11489. [2019-12-18 12:55:15,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11489 states. [2019-12-18 12:55:15,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11489 states to 11489 states and 35393 transitions. [2019-12-18 12:55:15,881 INFO L78 Accepts]: Start accepts. Automaton has 11489 states and 35393 transitions. Word has length 25 [2019-12-18 12:55:15,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:55:15,881 INFO L462 AbstractCegarLoop]: Abstraction has 11489 states and 35393 transitions. [2019-12-18 12:55:15,881 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 12:55:15,881 INFO L276 IsEmpty]: Start isEmpty. Operand 11489 states and 35393 transitions. [2019-12-18 12:55:15,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-18 12:55:15,896 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:55:15,896 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 12:55:15,897 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:55:15,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:55:15,897 INFO L82 PathProgramCache]: Analyzing trace with hash 954456655, now seen corresponding path program 1 times [2019-12-18 12:55:15,897 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:55:15,897 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1044566051] [2019-12-18 12:55:15,897 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:55:15,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:55:15,962 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 12:55:15,962 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1044566051] [2019-12-18 12:55:15,962 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:55:15,963 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 12:55:15,964 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [146257303] [2019-12-18 12:55:15,965 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 12:55:15,965 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:55:15,965 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 12:55:15,965 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 12:55:15,965 INFO L87 Difference]: Start difference. First operand 11489 states and 35393 transitions. Second operand 3 states. [2019-12-18 12:55:16,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:55:16,045 INFO L93 Difference]: Finished difference Result 15100 states and 45684 transitions. [2019-12-18 12:55:16,045 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 12:55:16,045 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2019-12-18 12:55:16,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:55:16,066 INFO L225 Difference]: With dead ends: 15100 [2019-12-18 12:55:16,067 INFO L226 Difference]: Without dead ends: 15100 [2019-12-18 12:55:16,067 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 12:55:16,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15100 states. [2019-12-18 12:55:16,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15100 to 12271. [2019-12-18 12:55:16,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12271 states. [2019-12-18 12:55:16,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12271 states to 12271 states and 37679 transitions. [2019-12-18 12:55:16,247 INFO L78 Accepts]: Start accepts. Automaton has 12271 states and 37679 transitions. Word has length 39 [2019-12-18 12:55:16,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:55:16,247 INFO L462 AbstractCegarLoop]: Abstraction has 12271 states and 37679 transitions. [2019-12-18 12:55:16,247 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 12:55:16,248 INFO L276 IsEmpty]: Start isEmpty. Operand 12271 states and 37679 transitions. [2019-12-18 12:55:16,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-18 12:55:16,264 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:55:16,264 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 12:55:16,264 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:55:16,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:55:16,265 INFO L82 PathProgramCache]: Analyzing trace with hash 515851026, now seen corresponding path program 1 times [2019-12-18 12:55:16,265 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:55:16,265 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1015417971] [2019-12-18 12:55:16,266 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:55:16,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:55:16,328 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 12:55:16,328 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1015417971] [2019-12-18 12:55:16,328 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:55:16,328 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 12:55:16,329 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [641535092] [2019-12-18 12:55:16,329 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 12:55:16,329 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:55:16,329 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 12:55:16,330 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-18 12:55:16,330 INFO L87 Difference]: Start difference. First operand 12271 states and 37679 transitions. Second operand 5 states. [2019-12-18 12:55:16,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:55:16,404 INFO L93 Difference]: Finished difference Result 11017 states and 34440 transitions. [2019-12-18 12:55:16,405 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 12:55:16,405 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 39 [2019-12-18 12:55:16,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:55:16,426 INFO L225 Difference]: With dead ends: 11017 [2019-12-18 12:55:16,426 INFO L226 Difference]: Without dead ends: 11017 [2019-12-18 12:55:16,427 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 12:55:16,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11017 states. [2019-12-18 12:55:16,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11017 to 10393. [2019-12-18 12:55:16,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10393 states. [2019-12-18 12:55:16,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10393 states to 10393 states and 32688 transitions. [2019-12-18 12:55:16,594 INFO L78 Accepts]: Start accepts. Automaton has 10393 states and 32688 transitions. Word has length 39 [2019-12-18 12:55:16,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:55:16,594 INFO L462 AbstractCegarLoop]: Abstraction has 10393 states and 32688 transitions. [2019-12-18 12:55:16,594 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 12:55:16,594 INFO L276 IsEmpty]: Start isEmpty. Operand 10393 states and 32688 transitions. [2019-12-18 12:55:16,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-18 12:55:16,610 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:55:16,610 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:55:16,610 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:55:16,611 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:55:16,611 INFO L82 PathProgramCache]: Analyzing trace with hash 165786421, now seen corresponding path program 1 times [2019-12-18 12:55:16,611 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:55:16,611 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [670386807] [2019-12-18 12:55:16,611 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:55:16,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:55:16,693 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 12:55:16,693 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [670386807] [2019-12-18 12:55:16,693 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:55:16,693 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 12:55:16,694 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [780240554] [2019-12-18 12:55:16,694 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 12:55:16,694 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:55:16,695 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 12:55:16,695 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 12:55:16,695 INFO L87 Difference]: Start difference. First operand 10393 states and 32688 transitions. Second operand 4 states. [2019-12-18 12:55:16,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:55:16,754 INFO L93 Difference]: Finished difference Result 18723 states and 58888 transitions. [2019-12-18 12:55:16,754 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 12:55:16,754 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 53 [2019-12-18 12:55:16,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:55:16,766 INFO L225 Difference]: With dead ends: 18723 [2019-12-18 12:55:16,766 INFO L226 Difference]: Without dead ends: 8627 [2019-12-18 12:55:16,766 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 12:55:16,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8627 states. [2019-12-18 12:55:16,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8627 to 8627. [2019-12-18 12:55:16,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8627 states. [2019-12-18 12:55:16,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8627 states to 8627 states and 27021 transitions. [2019-12-18 12:55:16,892 INFO L78 Accepts]: Start accepts. Automaton has 8627 states and 27021 transitions. Word has length 53 [2019-12-18 12:55:16,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:55:16,893 INFO L462 AbstractCegarLoop]: Abstraction has 8627 states and 27021 transitions. [2019-12-18 12:55:16,893 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 12:55:16,893 INFO L276 IsEmpty]: Start isEmpty. Operand 8627 states and 27021 transitions. [2019-12-18 12:55:16,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-18 12:55:16,905 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:55:16,906 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:55:16,906 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:55:16,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:55:16,907 INFO L82 PathProgramCache]: Analyzing trace with hash 1891813083, now seen corresponding path program 2 times [2019-12-18 12:55:16,907 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:55:16,907 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [485694562] [2019-12-18 12:55:16,907 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:55:16,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:55:17,005 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 12:55:17,005 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [485694562] [2019-12-18 12:55:17,005 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:55:17,005 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 12:55:17,006 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [395938753] [2019-12-18 12:55:17,006 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 12:55:17,006 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:55:17,006 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 12:55:17,007 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-18 12:55:17,007 INFO L87 Difference]: Start difference. First operand 8627 states and 27021 transitions. Second operand 7 states. [2019-12-18 12:55:17,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:55:17,451 INFO L93 Difference]: Finished difference Result 24029 states and 75191 transitions. [2019-12-18 12:55:17,451 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 12:55:17,451 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 53 [2019-12-18 12:55:17,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:55:17,488 INFO L225 Difference]: With dead ends: 24029 [2019-12-18 12:55:17,488 INFO L226 Difference]: Without dead ends: 18333 [2019-12-18 12:55:17,489 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2019-12-18 12:55:17,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18333 states. [2019-12-18 12:55:17,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18333 to 10739. [2019-12-18 12:55:17,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10739 states. [2019-12-18 12:55:17,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10739 states to 10739 states and 33937 transitions. [2019-12-18 12:55:17,834 INFO L78 Accepts]: Start accepts. Automaton has 10739 states and 33937 transitions. Word has length 53 [2019-12-18 12:55:17,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:55:17,835 INFO L462 AbstractCegarLoop]: Abstraction has 10739 states and 33937 transitions. [2019-12-18 12:55:17,835 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 12:55:17,835 INFO L276 IsEmpty]: Start isEmpty. Operand 10739 states and 33937 transitions. [2019-12-18 12:55:17,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-18 12:55:17,851 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:55:17,851 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:55:17,852 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:55:17,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:55:17,852 INFO L82 PathProgramCache]: Analyzing trace with hash 1878615555, now seen corresponding path program 3 times [2019-12-18 12:55:17,852 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:55:17,852 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1392282518] [2019-12-18 12:55:17,852 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:55:17,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:55:17,945 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 12:55:17,946 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1392282518] [2019-12-18 12:55:17,946 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:55:17,946 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 12:55:17,946 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1348414922] [2019-12-18 12:55:17,947 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 12:55:17,947 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:55:17,948 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 12:55:17,949 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-18 12:55:17,950 INFO L87 Difference]: Start difference. First operand 10739 states and 33937 transitions. Second operand 7 states. [2019-12-18 12:55:18,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:55:18,400 INFO L93 Difference]: Finished difference Result 29619 states and 91701 transitions. [2019-12-18 12:55:18,400 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 12:55:18,401 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 53 [2019-12-18 12:55:18,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:55:18,442 INFO L225 Difference]: With dead ends: 29619 [2019-12-18 12:55:18,443 INFO L226 Difference]: Without dead ends: 21040 [2019-12-18 12:55:18,443 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2019-12-18 12:55:18,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21040 states. [2019-12-18 12:55:18,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21040 to 13259. [2019-12-18 12:55:18,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13259 states. [2019-12-18 12:55:18,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13259 states to 13259 states and 41902 transitions. [2019-12-18 12:55:18,732 INFO L78 Accepts]: Start accepts. Automaton has 13259 states and 41902 transitions. Word has length 53 [2019-12-18 12:55:18,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:55:18,732 INFO L462 AbstractCegarLoop]: Abstraction has 13259 states and 41902 transitions. [2019-12-18 12:55:18,732 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 12:55:18,732 INFO L276 IsEmpty]: Start isEmpty. Operand 13259 states and 41902 transitions. [2019-12-18 12:55:18,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-18 12:55:18,748 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:55:18,748 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:55:18,749 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:55:18,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:55:18,749 INFO L82 PathProgramCache]: Analyzing trace with hash 193726155, now seen corresponding path program 4 times [2019-12-18 12:55:18,749 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:55:18,750 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [611955100] [2019-12-18 12:55:18,750 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:55:18,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:55:18,811 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 12:55:18,812 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [611955100] [2019-12-18 12:55:18,812 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:55:18,812 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 12:55:18,812 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [3684122] [2019-12-18 12:55:18,813 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 12:55:18,813 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:55:18,813 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 12:55:18,813 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 12:55:18,814 INFO L87 Difference]: Start difference. First operand 13259 states and 41902 transitions. Second operand 3 states. [2019-12-18 12:55:18,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:55:18,899 INFO L93 Difference]: Finished difference Result 19683 states and 62661 transitions. [2019-12-18 12:55:18,899 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 12:55:18,899 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 53 [2019-12-18 12:55:18,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:55:18,913 INFO L225 Difference]: With dead ends: 19683 [2019-12-18 12:55:18,914 INFO L226 Difference]: Without dead ends: 6496 [2019-12-18 12:55:18,914 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 12:55:18,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6496 states. [2019-12-18 12:55:19,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6496 to 6496. [2019-12-18 12:55:19,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6496 states. [2019-12-18 12:55:19,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6496 states to 6496 states and 20893 transitions. [2019-12-18 12:55:19,102 INFO L78 Accepts]: Start accepts. Automaton has 6496 states and 20893 transitions. Word has length 53 [2019-12-18 12:55:19,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:55:19,102 INFO L462 AbstractCegarLoop]: Abstraction has 6496 states and 20893 transitions. [2019-12-18 12:55:19,102 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 12:55:19,103 INFO L276 IsEmpty]: Start isEmpty. Operand 6496 states and 20893 transitions. [2019-12-18 12:55:19,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-18 12:55:19,118 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:55:19,119 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:55:19,119 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:55:19,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:55:19,119 INFO L82 PathProgramCache]: Analyzing trace with hash 819014287, now seen corresponding path program 5 times [2019-12-18 12:55:19,120 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:55:19,120 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1050733732] [2019-12-18 12:55:19,120 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:55:19,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:55:19,237 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 12:55:19,237 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1050733732] [2019-12-18 12:55:19,237 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:55:19,238 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 12:55:19,238 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [187377081] [2019-12-18 12:55:19,238 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 12:55:19,238 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:55:19,239 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 12:55:19,239 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-18 12:55:19,239 INFO L87 Difference]: Start difference. First operand 6496 states and 20893 transitions. Second operand 9 states. [2019-12-18 12:55:20,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:55:20,645 INFO L93 Difference]: Finished difference Result 34361 states and 106385 transitions. [2019-12-18 12:55:20,645 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-12-18 12:55:20,645 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 53 [2019-12-18 12:55:20,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:55:20,685 INFO L225 Difference]: With dead ends: 34361 [2019-12-18 12:55:20,685 INFO L226 Difference]: Without dead ends: 27058 [2019-12-18 12:55:20,686 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 416 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=339, Invalid=1143, Unknown=0, NotChecked=0, Total=1482 [2019-12-18 12:55:20,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27058 states. [2019-12-18 12:55:21,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27058 to 8895. [2019-12-18 12:55:21,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8895 states. [2019-12-18 12:55:21,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8895 states to 8895 states and 28920 transitions. [2019-12-18 12:55:21,047 INFO L78 Accepts]: Start accepts. Automaton has 8895 states and 28920 transitions. Word has length 53 [2019-12-18 12:55:21,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:55:21,047 INFO L462 AbstractCegarLoop]: Abstraction has 8895 states and 28920 transitions. [2019-12-18 12:55:21,047 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 12:55:21,048 INFO L276 IsEmpty]: Start isEmpty. Operand 8895 states and 28920 transitions. [2019-12-18 12:55:21,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-18 12:55:21,058 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:55:21,059 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:55:21,059 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:55:21,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:55:21,059 INFO L82 PathProgramCache]: Analyzing trace with hash 743806145, now seen corresponding path program 6 times [2019-12-18 12:55:21,059 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:55:21,059 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1357972660] [2019-12-18 12:55:21,059 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:55:21,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:55:21,169 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 12:55:21,169 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1357972660] [2019-12-18 12:55:21,170 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:55:21,170 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 12:55:21,170 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1323339995] [2019-12-18 12:55:21,170 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 12:55:21,170 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:55:21,171 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 12:55:21,171 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-18 12:55:21,171 INFO L87 Difference]: Start difference. First operand 8895 states and 28920 transitions. Second operand 9 states. [2019-12-18 12:55:22,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:55:22,385 INFO L93 Difference]: Finished difference Result 25540 states and 79803 transitions. [2019-12-18 12:55:22,386 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-12-18 12:55:22,386 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 53 [2019-12-18 12:55:22,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:55:22,421 INFO L225 Difference]: With dead ends: 25540 [2019-12-18 12:55:22,421 INFO L226 Difference]: Without dead ends: 23475 [2019-12-18 12:55:22,422 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 266 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=236, Invalid=820, Unknown=0, NotChecked=0, Total=1056 [2019-12-18 12:55:22,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23475 states. [2019-12-18 12:55:22,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23475 to 8823. [2019-12-18 12:55:22,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8823 states. [2019-12-18 12:55:22,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8823 states to 8823 states and 28692 transitions. [2019-12-18 12:55:22,676 INFO L78 Accepts]: Start accepts. Automaton has 8823 states and 28692 transitions. Word has length 53 [2019-12-18 12:55:22,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:55:22,676 INFO L462 AbstractCegarLoop]: Abstraction has 8823 states and 28692 transitions. [2019-12-18 12:55:22,676 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 12:55:22,676 INFO L276 IsEmpty]: Start isEmpty. Operand 8823 states and 28692 transitions. [2019-12-18 12:55:22,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-18 12:55:22,689 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:55:22,689 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:55:22,689 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:55:22,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:55:22,689 INFO L82 PathProgramCache]: Analyzing trace with hash -249470771, now seen corresponding path program 7 times [2019-12-18 12:55:22,690 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:55:22,690 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1201965949] [2019-12-18 12:55:22,690 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:55:22,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:55:22,768 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 12:55:22,768 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1201965949] [2019-12-18 12:55:22,769 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:55:22,769 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 12:55:22,769 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [440303415] [2019-12-18 12:55:22,769 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 12:55:22,769 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:55:22,770 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 12:55:22,770 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 12:55:22,770 INFO L87 Difference]: Start difference. First operand 8823 states and 28692 transitions. Second operand 3 states. [2019-12-18 12:55:22,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:55:22,813 INFO L93 Difference]: Finished difference Result 7806 states and 24655 transitions. [2019-12-18 12:55:22,814 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 12:55:22,814 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 53 [2019-12-18 12:55:22,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:55:22,828 INFO L225 Difference]: With dead ends: 7806 [2019-12-18 12:55:22,829 INFO L226 Difference]: Without dead ends: 7806 [2019-12-18 12:55:22,830 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 12:55:22,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7806 states. [2019-12-18 12:55:22,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7806 to 7630. [2019-12-18 12:55:22,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7630 states. [2019-12-18 12:55:23,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7630 states to 7630 states and 24077 transitions. [2019-12-18 12:55:23,002 INFO L78 Accepts]: Start accepts. Automaton has 7630 states and 24077 transitions. Word has length 53 [2019-12-18 12:55:23,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:55:23,002 INFO L462 AbstractCegarLoop]: Abstraction has 7630 states and 24077 transitions. [2019-12-18 12:55:23,002 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 12:55:23,003 INFO L276 IsEmpty]: Start isEmpty. Operand 7630 states and 24077 transitions. [2019-12-18 12:55:23,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-18 12:55:23,015 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:55:23,015 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:55:23,015 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:55:23,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:55:23,016 INFO L82 PathProgramCache]: Analyzing trace with hash 537172061, now seen corresponding path program 1 times [2019-12-18 12:55:23,016 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:55:23,016 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2143238753] [2019-12-18 12:55:23,016 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:55:23,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:55:23,122 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 12:55:23,122 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2143238753] [2019-12-18 12:55:23,122 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:55:23,122 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 12:55:23,123 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [165732573] [2019-12-18 12:55:23,123 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 12:55:23,123 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:55:23,123 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 12:55:23,124 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-12-18 12:55:23,126 INFO L87 Difference]: Start difference. First operand 7630 states and 24077 transitions. Second operand 9 states. [2019-12-18 12:55:24,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:55:24,089 INFO L93 Difference]: Finished difference Result 13524 states and 42092 transitions. [2019-12-18 12:55:24,089 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-12-18 12:55:24,090 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 54 [2019-12-18 12:55:24,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:55:24,104 INFO L225 Difference]: With dead ends: 13524 [2019-12-18 12:55:24,104 INFO L226 Difference]: Without dead ends: 9340 [2019-12-18 12:55:24,105 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=93, Invalid=327, Unknown=0, NotChecked=0, Total=420 [2019-12-18 12:55:24,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9340 states. [2019-12-18 12:55:24,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9340 to 7948. [2019-12-18 12:55:24,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7948 states. [2019-12-18 12:55:24,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7948 states to 7948 states and 24811 transitions. [2019-12-18 12:55:24,345 INFO L78 Accepts]: Start accepts. Automaton has 7948 states and 24811 transitions. Word has length 54 [2019-12-18 12:55:24,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:55:24,345 INFO L462 AbstractCegarLoop]: Abstraction has 7948 states and 24811 transitions. [2019-12-18 12:55:24,345 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 12:55:24,345 INFO L276 IsEmpty]: Start isEmpty. Operand 7948 states and 24811 transitions. [2019-12-18 12:55:24,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-18 12:55:24,353 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:55:24,353 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:55:24,353 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:55:24,354 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:55:24,354 INFO L82 PathProgramCache]: Analyzing trace with hash -1663404977, now seen corresponding path program 2 times [2019-12-18 12:55:24,354 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:55:24,354 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [682673796] [2019-12-18 12:55:24,354 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:55:24,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:55:24,507 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 12:55:24,507 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [682673796] [2019-12-18 12:55:24,508 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:55:24,508 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-18 12:55:24,508 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1056284959] [2019-12-18 12:55:24,509 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 12:55:24,509 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:55:24,509 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 12:55:24,509 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-12-18 12:55:24,510 INFO L87 Difference]: Start difference. First operand 7948 states and 24811 transitions. Second operand 9 states. [2019-12-18 12:55:25,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:55:25,860 INFO L93 Difference]: Finished difference Result 17269 states and 51692 transitions. [2019-12-18 12:55:25,860 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-18 12:55:25,860 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 54 [2019-12-18 12:55:25,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:55:25,884 INFO L225 Difference]: With dead ends: 17269 [2019-12-18 12:55:25,884 INFO L226 Difference]: Without dead ends: 17065 [2019-12-18 12:55:25,885 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=69, Invalid=237, Unknown=0, NotChecked=0, Total=306 [2019-12-18 12:55:25,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17065 states. [2019-12-18 12:55:26,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17065 to 13336. [2019-12-18 12:55:26,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13336 states. [2019-12-18 12:55:26,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13336 states to 13336 states and 40648 transitions. [2019-12-18 12:55:26,116 INFO L78 Accepts]: Start accepts. Automaton has 13336 states and 40648 transitions. Word has length 54 [2019-12-18 12:55:26,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:55:26,117 INFO L462 AbstractCegarLoop]: Abstraction has 13336 states and 40648 transitions. [2019-12-18 12:55:26,117 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 12:55:26,117 INFO L276 IsEmpty]: Start isEmpty. Operand 13336 states and 40648 transitions. [2019-12-18 12:55:26,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-18 12:55:26,132 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:55:26,132 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:55:26,132 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:55:26,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:55:26,132 INFO L82 PathProgramCache]: Analyzing trace with hash -1876186184, now seen corresponding path program 1 times [2019-12-18 12:55:26,132 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:55:26,133 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [997966773] [2019-12-18 12:55:26,133 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:55:26,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:55:26,174 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:55:26,174 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [997966773] [2019-12-18 12:55:26,174 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:55:26,175 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 12:55:26,175 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [867865177] [2019-12-18 12:55:26,175 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 12:55:26,175 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:55:26,176 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 12:55:26,176 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 12:55:26,176 INFO L87 Difference]: Start difference. First operand 13336 states and 40648 transitions. Second operand 3 states. [2019-12-18 12:55:26,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:55:26,271 INFO L93 Difference]: Finished difference Result 15137 states and 45063 transitions. [2019-12-18 12:55:26,271 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 12:55:26,271 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 54 [2019-12-18 12:55:26,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:55:26,297 INFO L225 Difference]: With dead ends: 15137 [2019-12-18 12:55:26,298 INFO L226 Difference]: Without dead ends: 15137 [2019-12-18 12:55:26,298 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 12:55:26,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15137 states. [2019-12-18 12:55:26,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15137 to 10529. [2019-12-18 12:55:26,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10529 states. [2019-12-18 12:55:26,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10529 states to 10529 states and 31259 transitions. [2019-12-18 12:55:26,488 INFO L78 Accepts]: Start accepts. Automaton has 10529 states and 31259 transitions. Word has length 54 [2019-12-18 12:55:26,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:55:26,488 INFO L462 AbstractCegarLoop]: Abstraction has 10529 states and 31259 transitions. [2019-12-18 12:55:26,488 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 12:55:26,488 INFO L276 IsEmpty]: Start isEmpty. Operand 10529 states and 31259 transitions. [2019-12-18 12:55:26,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-18 12:55:26,499 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:55:26,499 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:55:26,499 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:55:26,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:55:26,500 INFO L82 PathProgramCache]: Analyzing trace with hash 225488507, now seen corresponding path program 3 times [2019-12-18 12:55:26,500 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:55:26,500 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [792640915] [2019-12-18 12:55:26,500 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:55:26,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:55:26,578 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 12:55:26,578 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [792640915] [2019-12-18 12:55:26,579 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:55:26,579 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 12:55:26,579 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1613908494] [2019-12-18 12:55:26,579 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 12:55:26,579 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:55:26,580 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 12:55:26,580 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 12:55:26,580 INFO L87 Difference]: Start difference. First operand 10529 states and 31259 transitions. Second operand 5 states. [2019-12-18 12:55:27,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:55:27,012 INFO L93 Difference]: Finished difference Result 15324 states and 44385 transitions. [2019-12-18 12:55:27,012 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 12:55:27,012 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 54 [2019-12-18 12:55:27,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:55:27,033 INFO L225 Difference]: With dead ends: 15324 [2019-12-18 12:55:27,033 INFO L226 Difference]: Without dead ends: 15240 [2019-12-18 12:55:27,034 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-18 12:55:27,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15240 states. [2019-12-18 12:55:27,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15240 to 11226. [2019-12-18 12:55:27,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11226 states. [2019-12-18 12:55:27,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11226 states to 11226 states and 33137 transitions. [2019-12-18 12:55:27,209 INFO L78 Accepts]: Start accepts. Automaton has 11226 states and 33137 transitions. Word has length 54 [2019-12-18 12:55:27,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:55:27,210 INFO L462 AbstractCegarLoop]: Abstraction has 11226 states and 33137 transitions. [2019-12-18 12:55:27,210 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 12:55:27,210 INFO L276 IsEmpty]: Start isEmpty. Operand 11226 states and 33137 transitions. [2019-12-18 12:55:27,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-18 12:55:27,221 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:55:27,221 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:55:27,222 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:55:27,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:55:27,222 INFO L82 PathProgramCache]: Analyzing trace with hash 1966745669, now seen corresponding path program 4 times [2019-12-18 12:55:27,222 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:55:27,222 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1167363521] [2019-12-18 12:55:27,222 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:55:27,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:55:27,526 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 12:55:27,526 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1167363521] [2019-12-18 12:55:27,526 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:55:27,526 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-18 12:55:27,527 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [539987495] [2019-12-18 12:55:27,527 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-18 12:55:27,527 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:55:27,528 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-18 12:55:27,528 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2019-12-18 12:55:27,528 INFO L87 Difference]: Start difference. First operand 11226 states and 33137 transitions. Second operand 13 states. [2019-12-18 12:55:29,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:55:29,203 INFO L93 Difference]: Finished difference Result 17356 states and 52000 transitions. [2019-12-18 12:55:29,204 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-12-18 12:55:29,204 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 54 [2019-12-18 12:55:29,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:55:29,229 INFO L225 Difference]: With dead ends: 17356 [2019-12-18 12:55:29,229 INFO L226 Difference]: Without dead ends: 16786 [2019-12-18 12:55:29,229 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 287 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=218, Invalid=1114, Unknown=0, NotChecked=0, Total=1332 [2019-12-18 12:55:29,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16786 states. [2019-12-18 12:55:29,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16786 to 12079. [2019-12-18 12:55:29,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12079 states. [2019-12-18 12:55:29,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12079 states to 12079 states and 35691 transitions. [2019-12-18 12:55:29,437 INFO L78 Accepts]: Start accepts. Automaton has 12079 states and 35691 transitions. Word has length 54 [2019-12-18 12:55:29,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:55:29,437 INFO L462 AbstractCegarLoop]: Abstraction has 12079 states and 35691 transitions. [2019-12-18 12:55:29,437 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-18 12:55:29,437 INFO L276 IsEmpty]: Start isEmpty. Operand 12079 states and 35691 transitions. [2019-12-18 12:55:29,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-18 12:55:29,450 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:55:29,450 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:55:29,450 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:55:29,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:55:29,451 INFO L82 PathProgramCache]: Analyzing trace with hash -1143336617, now seen corresponding path program 5 times [2019-12-18 12:55:29,451 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:55:29,451 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1125833295] [2019-12-18 12:55:29,451 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:55:29,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:55:29,959 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 12:55:29,960 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1125833295] [2019-12-18 12:55:29,960 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:55:29,960 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-18 12:55:29,960 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1458173346] [2019-12-18 12:55:29,961 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-18 12:55:29,961 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:55:29,961 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-18 12:55:29,961 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=204, Unknown=0, NotChecked=0, Total=240 [2019-12-18 12:55:29,961 INFO L87 Difference]: Start difference. First operand 12079 states and 35691 transitions. Second operand 16 states. [2019-12-18 12:55:32,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:55:32,395 INFO L93 Difference]: Finished difference Result 13282 states and 38814 transitions. [2019-12-18 12:55:32,395 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-12-18 12:55:32,396 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 54 [2019-12-18 12:55:32,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:55:32,424 INFO L225 Difference]: With dead ends: 13282 [2019-12-18 12:55:32,424 INFO L226 Difference]: Without dead ends: 12710 [2019-12-18 12:55:32,425 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 383 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=256, Invalid=1466, Unknown=0, NotChecked=0, Total=1722 [2019-12-18 12:55:32,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12710 states. [2019-12-18 12:55:32,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12710 to 12188. [2019-12-18 12:55:32,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12188 states. [2019-12-18 12:55:32,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12188 states to 12188 states and 35942 transitions. [2019-12-18 12:55:32,739 INFO L78 Accepts]: Start accepts. Automaton has 12188 states and 35942 transitions. Word has length 54 [2019-12-18 12:55:32,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:55:32,739 INFO L462 AbstractCegarLoop]: Abstraction has 12188 states and 35942 transitions. [2019-12-18 12:55:32,739 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-18 12:55:32,740 INFO L276 IsEmpty]: Start isEmpty. Operand 12188 states and 35942 transitions. [2019-12-18 12:55:32,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-18 12:55:32,752 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:55:32,752 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:55:32,752 INFO L410 AbstractCegarLoop]: === Iteration 24 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:55:32,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:55:32,753 INFO L82 PathProgramCache]: Analyzing trace with hash 1918168465, now seen corresponding path program 6 times [2019-12-18 12:55:32,753 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:55:32,753 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1549280289] [2019-12-18 12:55:32,753 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:55:32,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:55:33,027 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 12:55:33,028 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1549280289] [2019-12-18 12:55:33,028 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:55:33,028 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-18 12:55:33,028 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [463811087] [2019-12-18 12:55:33,029 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-18 12:55:33,029 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:55:33,029 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-18 12:55:33,029 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2019-12-18 12:55:33,029 INFO L87 Difference]: Start difference. First operand 12188 states and 35942 transitions. Second operand 13 states. [2019-12-18 12:55:34,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:55:34,852 INFO L93 Difference]: Finished difference Result 17163 states and 51160 transitions. [2019-12-18 12:55:34,852 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-12-18 12:55:34,852 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 54 [2019-12-18 12:55:34,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:55:34,874 INFO L225 Difference]: With dead ends: 17163 [2019-12-18 12:55:34,874 INFO L226 Difference]: Without dead ends: 17077 [2019-12-18 12:55:34,875 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 250 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=201, Invalid=989, Unknown=0, NotChecked=0, Total=1190 [2019-12-18 12:55:34,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17077 states. [2019-12-18 12:55:35,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17077 to 12234. [2019-12-18 12:55:35,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12234 states. [2019-12-18 12:55:35,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12234 states to 12234 states and 36018 transitions. [2019-12-18 12:55:35,082 INFO L78 Accepts]: Start accepts. Automaton has 12234 states and 36018 transitions. Word has length 54 [2019-12-18 12:55:35,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:55:35,082 INFO L462 AbstractCegarLoop]: Abstraction has 12234 states and 36018 transitions. [2019-12-18 12:55:35,082 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-18 12:55:35,082 INFO L276 IsEmpty]: Start isEmpty. Operand 12234 states and 36018 transitions. [2019-12-18 12:55:35,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-18 12:55:35,095 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:55:35,095 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:55:35,095 INFO L410 AbstractCegarLoop]: === Iteration 25 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:55:35,095 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:55:35,096 INFO L82 PathProgramCache]: Analyzing trace with hash -1783293779, now seen corresponding path program 7 times [2019-12-18 12:55:35,096 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:55:35,096 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2016068145] [2019-12-18 12:55:35,096 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:55:35,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:55:35,466 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 12:55:35,467 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2016068145] [2019-12-18 12:55:35,467 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:55:35,467 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-18 12:55:35,468 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [429777456] [2019-12-18 12:55:35,468 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-18 12:55:35,468 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:55:35,468 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-18 12:55:35,469 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=174, Unknown=0, NotChecked=0, Total=210 [2019-12-18 12:55:35,469 INFO L87 Difference]: Start difference. First operand 12234 states and 36018 transitions. Second operand 15 states. [2019-12-18 12:55:37,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:55:37,512 INFO L93 Difference]: Finished difference Result 15036 states and 43568 transitions. [2019-12-18 12:55:37,512 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-12-18 12:55:37,512 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 54 [2019-12-18 12:55:37,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:55:37,531 INFO L225 Difference]: With dead ends: 15036 [2019-12-18 12:55:37,531 INFO L226 Difference]: Without dead ends: 14144 [2019-12-18 12:55:37,532 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 254 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=218, Invalid=1114, Unknown=0, NotChecked=0, Total=1332 [2019-12-18 12:55:37,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14144 states. [2019-12-18 12:55:37,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14144 to 12198. [2019-12-18 12:55:37,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12198 states. [2019-12-18 12:55:37,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12198 states to 12198 states and 35933 transitions. [2019-12-18 12:55:37,721 INFO L78 Accepts]: Start accepts. Automaton has 12198 states and 35933 transitions. Word has length 54 [2019-12-18 12:55:37,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:55:37,721 INFO L462 AbstractCegarLoop]: Abstraction has 12198 states and 35933 transitions. [2019-12-18 12:55:37,721 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-18 12:55:37,722 INFO L276 IsEmpty]: Start isEmpty. Operand 12198 states and 35933 transitions. [2019-12-18 12:55:37,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-18 12:55:37,739 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:55:37,739 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:55:37,739 INFO L410 AbstractCegarLoop]: === Iteration 26 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:55:37,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:55:37,740 INFO L82 PathProgramCache]: Analyzing trace with hash -597181835, now seen corresponding path program 8 times [2019-12-18 12:55:37,740 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:55:37,740 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [492912345] [2019-12-18 12:55:37,740 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:55:37,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:55:37,794 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 12:55:37,795 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [492912345] [2019-12-18 12:55:37,795 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:55:37,795 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 12:55:37,795 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1726653441] [2019-12-18 12:55:37,796 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 12:55:37,796 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:55:37,796 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 12:55:37,796 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 12:55:37,797 INFO L87 Difference]: Start difference. First operand 12198 states and 35933 transitions. Second operand 3 states. [2019-12-18 12:55:37,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:55:37,849 INFO L93 Difference]: Finished difference Result 12196 states and 35928 transitions. [2019-12-18 12:55:37,849 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 12:55:37,849 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 54 [2019-12-18 12:55:37,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:55:37,869 INFO L225 Difference]: With dead ends: 12196 [2019-12-18 12:55:37,869 INFO L226 Difference]: Without dead ends: 12196 [2019-12-18 12:55:37,870 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 12:55:37,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12196 states. [2019-12-18 12:55:38,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12196 to 9587. [2019-12-18 12:55:38,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9587 states. [2019-12-18 12:55:38,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9587 states to 9587 states and 28721 transitions. [2019-12-18 12:55:38,082 INFO L78 Accepts]: Start accepts. Automaton has 9587 states and 28721 transitions. Word has length 54 [2019-12-18 12:55:38,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:55:38,082 INFO L462 AbstractCegarLoop]: Abstraction has 9587 states and 28721 transitions. [2019-12-18 12:55:38,082 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 12:55:38,082 INFO L276 IsEmpty]: Start isEmpty. Operand 9587 states and 28721 transitions. [2019-12-18 12:55:38,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-18 12:55:38,095 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:55:38,095 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:55:38,095 INFO L410 AbstractCegarLoop]: === Iteration 27 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:55:38,095 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:55:38,095 INFO L82 PathProgramCache]: Analyzing trace with hash 905870895, now seen corresponding path program 1 times [2019-12-18 12:55:38,095 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:55:38,095 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [703132572] [2019-12-18 12:55:38,095 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:55:38,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:55:38,259 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 12:55:38,260 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [703132572] [2019-12-18 12:55:38,260 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:55:38,260 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-18 12:55:38,260 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1157768436] [2019-12-18 12:55:38,260 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-18 12:55:38,260 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:55:38,261 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-18 12:55:38,261 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-18 12:55:38,261 INFO L87 Difference]: Start difference. First operand 9587 states and 28721 transitions. Second operand 11 states. [2019-12-18 12:55:39,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:55:39,063 INFO L93 Difference]: Finished difference Result 11737 states and 34485 transitions. [2019-12-18 12:55:39,063 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-12-18 12:55:39,064 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 55 [2019-12-18 12:55:39,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:55:39,077 INFO L225 Difference]: With dead ends: 11737 [2019-12-18 12:55:39,077 INFO L226 Difference]: Without dead ends: 9229 [2019-12-18 12:55:39,077 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 180 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=168, Invalid=702, Unknown=0, NotChecked=0, Total=870 [2019-12-18 12:55:39,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9229 states. [2019-12-18 12:55:39,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9229 to 8227. [2019-12-18 12:55:39,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8227 states. [2019-12-18 12:55:39,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8227 states to 8227 states and 24810 transitions. [2019-12-18 12:55:39,263 INFO L78 Accepts]: Start accepts. Automaton has 8227 states and 24810 transitions. Word has length 55 [2019-12-18 12:55:39,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:55:39,263 INFO L462 AbstractCegarLoop]: Abstraction has 8227 states and 24810 transitions. [2019-12-18 12:55:39,263 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-18 12:55:39,263 INFO L276 IsEmpty]: Start isEmpty. Operand 8227 states and 24810 transitions. [2019-12-18 12:55:39,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-18 12:55:39,272 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:55:39,272 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:55:39,272 INFO L410 AbstractCegarLoop]: === Iteration 28 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:55:39,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:55:39,273 INFO L82 PathProgramCache]: Analyzing trace with hash 406067685, now seen corresponding path program 2 times [2019-12-18 12:55:39,273 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:55:39,273 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1840607216] [2019-12-18 12:55:39,273 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:55:39,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 12:55:39,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 12:55:39,403 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-18 12:55:39,403 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-18 12:55:39,407 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [817] [817] ULTIMATE.startENTRY-->L831: Formula: (let ((.cse0 (store |v_#valid_71| 0 0))) (and (= 0 v_~y$read_delayed_var~0.base_6) (= v_~y$r_buff0_thd1~0_335 0) (= 0 v_~y$r_buff1_thd3~0_125) (= v_~x~0_35 0) (= v_~y$w_buff1~0_269 0) (= 0 v_~y$r_buff1_thd2~0_133) (= v_~a~0_54 0) (= v_~y$w_buff1_used~0_559 0) (= v_~main$tmp_guard1~0_48 0) (= |v_#NULL.offset_3| 0) (= |v_#length_21| (store |v_#length_22| |v_ULTIMATE.start_main_~#t648~0.base_28| 4)) (= 0 v_~__unbuffered_p2_EAX~0_59) (= 0 v_~y$r_buff0_thd2~0_172) (= |v_ULTIMATE.start_main_~#t648~0.offset_19| 0) (< |v_#StackHeapBarrier_18| |v_ULTIMATE.start_main_~#t648~0.base_28|) (= v_~y$read_delayed~0_6 0) (< 0 |v_#StackHeapBarrier_18|) (= v_~y$w_buff0_used~0_854 0) (= 0 v_~__unbuffered_p0_EAX~0_68) (= v_~__unbuffered_p0_EBX~0_53 0) (= v_~z~0_107 0) (= 0 v_~y$r_buff0_thd3~0_136) (= v_~weak$$choice2~0_153 0) (= v_~y$mem_tmp~0_47 0) (= v_~__unbuffered_p2_EBX~0_59 0) (= v_~main$tmp_guard0~0_21 0) (= v_~__unbuffered_cnt~0_162 0) (= 0 v_~y$flush_delayed~0_90) (= 0 |v_#NULL.base_3|) (= v_~y$r_buff0_thd0~0_138 0) (= 0 v_~y$w_buff0~0_440) (= v_~y$r_buff1_thd1~0_236 0) (= |v_#valid_69| (store .cse0 |v_ULTIMATE.start_main_~#t648~0.base_28| 1)) (= 0 v_~y$read_delayed_var~0.offset_6) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t648~0.base_28| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t648~0.base_28|) |v_ULTIMATE.start_main_~#t648~0.offset_19| 0)) |v_#memory_int_17|) (= 0 v_~weak$$choice0~0_34) (= v_~y$r_buff1_thd0~0_136 0) (= v_~y~0_214 0) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t648~0.base_28|)))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_18|, #valid=|v_#valid_71|, #memory_int=|v_#memory_int_18|, #length=|v_#length_22|} OutVars{ULTIMATE.start_main_~#t648~0.offset=|v_ULTIMATE.start_main_~#t648~0.offset_19|, ULTIMATE.start_main_~#t650~0.base=|v_ULTIMATE.start_main_~#t650~0.base_23|, #NULL.offset=|v_#NULL.offset_3|, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_37|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_33|, ~y$read_delayed~0=v_~y$read_delayed~0_6, ~a~0=v_~a~0_54, ~y$mem_tmp~0=v_~y$mem_tmp~0_47, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_68, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_125, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_335, ~y$flush_delayed~0=v_~y$flush_delayed~0_90, #length=|v_#length_21|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_59, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_59, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_53, ULTIMATE.start_main_~#t650~0.offset=|v_ULTIMATE.start_main_~#t650~0.offset_17|, ~weak$$choice0~0=v_~weak$$choice0~0_34, #StackHeapBarrier=|v_#StackHeapBarrier_18|, ~y$w_buff1~0=v_~y$w_buff1~0_269, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_6, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_172, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_162, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_136, ~x~0=v_~x~0_35, ~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_6, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_854, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_95|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_48, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_67|, ULTIMATE.start_main_~#t648~0.base=|v_ULTIMATE.start_main_~#t648~0.base_28|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_37|, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_236, ~y$w_buff0~0=v_~y$w_buff0~0_440, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_136, ULTIMATE.start_main_~#t649~0.offset=|v_ULTIMATE.start_main_~#t649~0.offset_17|, ~y~0=v_~y~0_214, ULTIMATE.start_main_#t~nondet40=|v_ULTIMATE.start_main_#t~nondet40_17|, ULTIMATE.start_main_~#t649~0.base=|v_ULTIMATE.start_main_~#t649~0.base_23|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_21, #NULL.base=|v_#NULL.base_3|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_133, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_53|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_31|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_138, #valid=|v_#valid_69|, #memory_int=|v_#memory_int_17|, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_8|, ~z~0=v_~z~0_107, ~weak$$choice2~0=v_~weak$$choice2~0_153, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_559} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t648~0.offset, ULTIMATE.start_main_~#t650~0.base, #NULL.offset, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite45, ~y$read_delayed~0, ~a~0, ~y$mem_tmp~0, ~__unbuffered_p0_EAX~0, ~y$r_buff1_thd3~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, #length, ~__unbuffered_p2_EAX~0, ~__unbuffered_p2_EBX~0, ~__unbuffered_p0_EBX~0, ULTIMATE.start_main_~#t650~0.offset, ~weak$$choice0~0, ~y$w_buff1~0, ~y$read_delayed_var~0.base, ~y$r_buff0_thd2~0, ULTIMATE.start_main_#t~nondet38, ~__unbuffered_cnt~0, ~y$r_buff1_thd0~0, ~x~0, ~y$read_delayed_var~0.offset, ~y$w_buff0_used~0, ULTIMATE.start_main_#t~ite46, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_~#t648~0.base, ULTIMATE.start_main_#t~ite44, ~y$r_buff1_thd1~0, ~y$w_buff0~0, ~y$r_buff0_thd3~0, ULTIMATE.start_main_~#t649~0.offset, ~y~0, ULTIMATE.start_main_#t~nondet40, ULTIMATE.start_main_~#t649~0.base, ~main$tmp_guard0~0, #NULL.base, ~y$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, #valid, #memory_int, ULTIMATE.start_main_#t~nondet39, ~z~0, ~weak$$choice2~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-18 12:55:39,408 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [783] [783] L831-1-->L833: Formula: (and (= |v_#valid_33| (store |v_#valid_34| |v_ULTIMATE.start_main_~#t649~0.base_11| 1)) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t649~0.base_11| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t649~0.base_11|) |v_ULTIMATE.start_main_~#t649~0.offset_10| 1)) |v_#memory_int_13|) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t649~0.base_11|) (not (= |v_ULTIMATE.start_main_~#t649~0.base_11| 0)) (= 0 |v_ULTIMATE.start_main_~#t649~0.offset_10|) (= 0 (select |v_#valid_34| |v_ULTIMATE.start_main_~#t649~0.base_11|)) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t649~0.base_11| 4))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_34|, #memory_int=|v_#memory_int_14|, #length=|v_#length_18|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_11|, ULTIMATE.start_main_~#t649~0.base=|v_ULTIMATE.start_main_~#t649~0.base_11|, ULTIMATE.start_main_~#t649~0.offset=|v_ULTIMATE.start_main_~#t649~0.offset_10|, #valid=|v_#valid_33|, #memory_int=|v_#memory_int_13|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_5|, #length=|v_#length_17|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t649~0.base, ULTIMATE.start_main_~#t649~0.offset, #valid, #memory_int, ULTIMATE.start_main_#t~nondet38, #length] because there is no mapped edge [2019-12-18 12:55:39,409 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [766] [766] L833-1-->L835: Formula: (and (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t650~0.base_11| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t650~0.base_11|) |v_ULTIMATE.start_main_~#t650~0.offset_10| 2)) |v_#memory_int_11|) (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t650~0.base_11| 4)) (= |v_ULTIMATE.start_main_~#t650~0.offset_10| 0) (= 0 (select |v_#valid_32| |v_ULTIMATE.start_main_~#t650~0.base_11|)) (not (= |v_ULTIMATE.start_main_~#t650~0.base_11| 0)) (= |v_#valid_31| (store |v_#valid_32| |v_ULTIMATE.start_main_~#t650~0.base_11| 1)) (< |v_#StackHeapBarrier_10| |v_ULTIMATE.start_main_~#t650~0.base_11|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_32|, #memory_int=|v_#memory_int_12|, #length=|v_#length_16|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_31|, #memory_int=|v_#memory_int_11|, ULTIMATE.start_main_~#t650~0.base=|v_ULTIMATE.start_main_~#t650~0.base_11|, ULTIMATE.start_main_~#t650~0.offset=|v_ULTIMATE.start_main_~#t650~0.offset_10|, #length=|v_#length_15|, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_6|} AuxVars[] AssignedVars[#valid, #memory_int, ULTIMATE.start_main_~#t650~0.base, ULTIMATE.start_main_~#t650~0.offset, #length, ULTIMATE.start_main_#t~nondet39] because there is no mapped edge [2019-12-18 12:55:39,410 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [798] [798] P1ENTRY-->L5-3: Formula: (and (= |P1Thread1of1ForFork1_#in~arg.base_In1016932441| P1Thread1of1ForFork1_~arg.base_Out1016932441) (= 1 |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_Out1016932441|) (= P1Thread1of1ForFork1___VERIFIER_assert_~expression_Out1016932441 |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_Out1016932441|) (= ~y$w_buff1~0_Out1016932441 ~y$w_buff0~0_In1016932441) (= ~y$w_buff0~0_Out1016932441 1) (= (mod ~y$w_buff1_used~0_Out1016932441 256) 0) (= P1Thread1of1ForFork1_~arg.offset_Out1016932441 |P1Thread1of1ForFork1_#in~arg.offset_In1016932441|) (= ~y$w_buff1_used~0_Out1016932441 ~y$w_buff0_used~0_In1016932441) (= 1 ~y$w_buff0_used~0_Out1016932441)) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1016932441, ~y$w_buff0~0=~y$w_buff0~0_In1016932441, P1Thread1of1ForFork1_#in~arg.base=|P1Thread1of1ForFork1_#in~arg.base_In1016932441|, P1Thread1of1ForFork1_#in~arg.offset=|P1Thread1of1ForFork1_#in~arg.offset_In1016932441|} OutVars{P1Thread1of1ForFork1___VERIFIER_assert_~expression=P1Thread1of1ForFork1___VERIFIER_assert_~expression_Out1016932441, P1Thread1of1ForFork1_~arg.offset=P1Thread1of1ForFork1_~arg.offset_Out1016932441, ~y$w_buff0_used~0=~y$w_buff0_used~0_Out1016932441, ~y$w_buff1~0=~y$w_buff1~0_Out1016932441, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression=|P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_Out1016932441|, P1Thread1of1ForFork1_~arg.base=P1Thread1of1ForFork1_~arg.base_Out1016932441, ~y$w_buff0~0=~y$w_buff0~0_Out1016932441, P1Thread1of1ForFork1_#in~arg.base=|P1Thread1of1ForFork1_#in~arg.base_In1016932441|, P1Thread1of1ForFork1_#in~arg.offset=|P1Thread1of1ForFork1_#in~arg.offset_In1016932441|, ~y$w_buff1_used~0=~y$w_buff1_used~0_Out1016932441} AuxVars[] AssignedVars[P1Thread1of1ForFork1___VERIFIER_assert_~expression, P1Thread1of1ForFork1_~arg.offset, ~y$w_buff0_used~0, ~y$w_buff1~0, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression, P1Thread1of1ForFork1_~arg.base, ~y$w_buff0~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-18 12:55:39,415 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [763] [763] L808-2-->L808-5: Formula: (let ((.cse0 (= (mod ~y$w_buff1_used~0_In-87718790 256) 0)) (.cse1 (= 0 (mod ~y$r_buff1_thd3~0_In-87718790 256))) (.cse2 (= |P2Thread1of1ForFork2_#t~ite32_Out-87718790| |P2Thread1of1ForFork2_#t~ite33_Out-87718790|))) (or (and (not .cse0) (= |P2Thread1of1ForFork2_#t~ite32_Out-87718790| ~y$w_buff1~0_In-87718790) (not .cse1) .cse2) (and (or .cse0 .cse1) .cse2 (= |P2Thread1of1ForFork2_#t~ite32_Out-87718790| ~y~0_In-87718790)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-87718790, ~y$w_buff1~0=~y$w_buff1~0_In-87718790, ~y~0=~y~0_In-87718790, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-87718790} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-87718790, ~y$w_buff1~0=~y$w_buff1~0_In-87718790, P2Thread1of1ForFork2_#t~ite33=|P2Thread1of1ForFork2_#t~ite33_Out-87718790|, P2Thread1of1ForFork2_#t~ite32=|P2Thread1of1ForFork2_#t~ite32_Out-87718790|, ~y~0=~y~0_In-87718790, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-87718790} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite33, P2Thread1of1ForFork2_#t~ite32] because there is no mapped edge [2019-12-18 12:55:39,416 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [758] [758] L786-->L786-2: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd2~0_In-400750025 256) 0)) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In-400750025 256)))) (or (and (= 0 |P1Thread1of1ForFork1_#t~ite28_Out-400750025|) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= ~y$w_buff0_used~0_In-400750025 |P1Thread1of1ForFork1_#t~ite28_Out-400750025|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-400750025, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-400750025} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-400750025, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-400750025, P1Thread1of1ForFork1_#t~ite28=|P1Thread1of1ForFork1_#t~ite28_Out-400750025|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite28] because there is no mapped edge [2019-12-18 12:55:39,417 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [754] [754] L809-->L809-2: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd3~0_In-514515339 256) 0)) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In-514515339 256)))) (or (and (or .cse0 .cse1) (= |P2Thread1of1ForFork2_#t~ite34_Out-514515339| ~y$w_buff0_used~0_In-514515339)) (and (not .cse0) (not .cse1) (= 0 |P2Thread1of1ForFork2_#t~ite34_Out-514515339|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-514515339, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-514515339} OutVars{P2Thread1of1ForFork2_#t~ite34=|P2Thread1of1ForFork2_#t~ite34_Out-514515339|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-514515339, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-514515339} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite34] because there is no mapped edge [2019-12-18 12:55:39,418 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [760] [760] L810-->L810-2: Formula: (let ((.cse3 (= (mod ~y$r_buff1_thd3~0_In-2099149000 256) 0)) (.cse2 (= 0 (mod ~y$w_buff1_used~0_In-2099149000 256))) (.cse1 (= (mod ~y$w_buff0_used~0_In-2099149000 256) 0)) (.cse0 (= (mod ~y$r_buff0_thd3~0_In-2099149000 256) 0))) (or (and (= 0 |P2Thread1of1ForFork2_#t~ite35_Out-2099149000|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse3 .cse2) (or .cse1 .cse0) (= ~y$w_buff1_used~0_In-2099149000 |P2Thread1of1ForFork2_#t~ite35_Out-2099149000|)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-2099149000, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-2099149000, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-2099149000, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2099149000} OutVars{P2Thread1of1ForFork2_#t~ite35=|P2Thread1of1ForFork2_#t~ite35_Out-2099149000|, ~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-2099149000, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-2099149000, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-2099149000, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2099149000} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite35] because there is no mapped edge [2019-12-18 12:55:39,419 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [752] [752] L811-->L811-2: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd3~0_In-630161415 256) 0)) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In-630161415 256)))) (or (and (or .cse0 .cse1) (= |P2Thread1of1ForFork2_#t~ite36_Out-630161415| ~y$r_buff0_thd3~0_In-630161415)) (and (not .cse1) (= |P2Thread1of1ForFork2_#t~ite36_Out-630161415| 0) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-630161415, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-630161415} OutVars{P2Thread1of1ForFork2_#t~ite36=|P2Thread1of1ForFork2_#t~ite36_Out-630161415|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-630161415, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-630161415} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite36] because there is no mapped edge [2019-12-18 12:55:39,420 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [747] [747] L812-->L812-2: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd3~0_In-1079190218 256) 0)) (.cse1 (= (mod ~y$w_buff0_used~0_In-1079190218 256) 0)) (.cse2 (= 0 (mod ~y$r_buff1_thd3~0_In-1079190218 256))) (.cse3 (= 0 (mod ~y$w_buff1_used~0_In-1079190218 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~y$r_buff1_thd3~0_In-1079190218 |P2Thread1of1ForFork2_#t~ite37_Out-1079190218|)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P2Thread1of1ForFork2_#t~ite37_Out-1079190218|)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-1079190218, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1079190218, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-1079190218, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1079190218} OutVars{P2Thread1of1ForFork2_#t~ite37=|P2Thread1of1ForFork2_#t~ite37_Out-1079190218|, ~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-1079190218, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1079190218, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-1079190218, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1079190218} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite37] because there is no mapped edge [2019-12-18 12:55:39,420 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [794] [794] L812-2-->P2EXIT: Formula: (and (= 0 |v_P2Thread1of1ForFork2_#res.base_5|) (= |v_P2Thread1of1ForFork2_#t~ite37_40| v_~y$r_buff1_thd3~0_74) (= |v_P2Thread1of1ForFork2_#res.offset_5| 0) (= v_~__unbuffered_cnt~0_90 (+ v_~__unbuffered_cnt~0_91 1))) InVars {P2Thread1of1ForFork2_#t~ite37=|v_P2Thread1of1ForFork2_#t~ite37_40|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_91} OutVars{P2Thread1of1ForFork2_#t~ite37=|v_P2Thread1of1ForFork2_#t~ite37_39|, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_74, P2Thread1of1ForFork2_#res.base=|v_P2Thread1of1ForFork2_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_90, P2Thread1of1ForFork2_#res.offset=|v_P2Thread1of1ForFork2_#res.offset_5|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite37, ~y$r_buff1_thd3~0, P2Thread1of1ForFork2_#res.base, ~__unbuffered_cnt~0, P2Thread1of1ForFork2_#res.offset] because there is no mapped edge [2019-12-18 12:55:39,421 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [755] [755] L787-->L787-2: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In286956092 256) 0)) (.cse1 (= (mod ~y$r_buff0_thd2~0_In286956092 256) 0)) (.cse3 (= (mod ~y$r_buff1_thd2~0_In286956092 256) 0)) (.cse2 (= 0 (mod ~y$w_buff1_used~0_In286956092 256)))) (or (and (= |P1Thread1of1ForFork1_#t~ite29_Out286956092| ~y$w_buff1_used~0_In286956092) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2))) (= 0 |P1Thread1of1ForFork1_#t~ite29_Out286956092|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In286956092, ~y$w_buff0_used~0=~y$w_buff0_used~0_In286956092, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In286956092, ~y$w_buff1_used~0=~y$w_buff1_used~0_In286956092} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In286956092, P1Thread1of1ForFork1_#t~ite29=|P1Thread1of1ForFork1_#t~ite29_Out286956092|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In286956092, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In286956092, ~y$w_buff1_used~0=~y$w_buff1_used~0_In286956092} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite29] because there is no mapped edge [2019-12-18 12:55:39,422 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [751] [751] L788-->L789: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In-1769450899 256))) (.cse0 (= (mod ~y$r_buff0_thd2~0_In-1769450899 256) 0))) (or (and (or .cse0 .cse1) (= ~y$r_buff0_thd2~0_In-1769450899 ~y$r_buff0_thd2~0_Out-1769450899)) (and (not .cse1) (not .cse0) (= 0 ~y$r_buff0_thd2~0_Out-1769450899)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1769450899, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1769450899} OutVars{P1Thread1of1ForFork1_#t~ite30=|P1Thread1of1ForFork1_#t~ite30_Out-1769450899|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1769450899, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_Out-1769450899} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite30, ~y$r_buff0_thd2~0] because there is no mapped edge [2019-12-18 12:55:39,422 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [764] [764] L789-->L789-2: Formula: (let ((.cse0 (= (mod ~y$r_buff1_thd2~0_In-1737646044 256) 0)) (.cse1 (= 0 (mod ~y$w_buff1_used~0_In-1737646044 256))) (.cse2 (= 0 (mod ~y$r_buff0_thd2~0_In-1737646044 256))) (.cse3 (= (mod ~y$w_buff0_used~0_In-1737646044 256) 0))) (or (and (or .cse0 .cse1) (= ~y$r_buff1_thd2~0_In-1737646044 |P1Thread1of1ForFork1_#t~ite31_Out-1737646044|) (or .cse2 .cse3)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P1Thread1of1ForFork1_#t~ite31_Out-1737646044| 0)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1737646044, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1737646044, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1737646044, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1737646044} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1737646044, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1737646044, P1Thread1of1ForFork1_#t~ite31=|P1Thread1of1ForFork1_#t~ite31_Out-1737646044|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1737646044, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1737646044} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite31] because there is no mapped edge [2019-12-18 12:55:39,423 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [773] [773] L789-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork1_#res.base_5|) (= (+ v_~__unbuffered_cnt~0_70 1) v_~__unbuffered_cnt~0_69) (= |v_P1Thread1of1ForFork1_#t~ite31_40| v_~y$r_buff1_thd2~0_54) (= |v_P1Thread1of1ForFork1_#res.offset_5| 0)) InVars {P1Thread1of1ForFork1_#t~ite31=|v_P1Thread1of1ForFork1_#t~ite31_40|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_70} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_54, P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_5|, P1Thread1of1ForFork1_#t~ite31=|v_P1Thread1of1ForFork1_#t~ite31_39|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_69, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_5|} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, P1Thread1of1ForFork1_#res.offset, P1Thread1of1ForFork1_#t~ite31, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#res.base] because there is no mapped edge [2019-12-18 12:55:39,424 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [797] [797] L750-->L750-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In1411532214 256)))) (or (and (= |P0Thread1of1ForFork0_#t~ite8_In1411532214| |P0Thread1of1ForFork0_#t~ite8_Out1411532214|) (not .cse0) (= ~y$w_buff0~0_In1411532214 |P0Thread1of1ForFork0_#t~ite9_Out1411532214|)) (and (let ((.cse1 (= 0 (mod ~y$r_buff0_thd1~0_In1411532214 256)))) (or (and (= 0 (mod ~y$w_buff1_used~0_In1411532214 256)) .cse1) (and .cse1 (= (mod ~y$r_buff1_thd1~0_In1411532214 256) 0)) (= 0 (mod ~y$w_buff0_used~0_In1411532214 256)))) (= ~y$w_buff0~0_In1411532214 |P0Thread1of1ForFork0_#t~ite8_Out1411532214|) .cse0 (= |P0Thread1of1ForFork0_#t~ite8_Out1411532214| |P0Thread1of1ForFork0_#t~ite9_Out1411532214|)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In1411532214, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1411532214, ~y$w_buff0~0=~y$w_buff0~0_In1411532214, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1411532214, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_In1411532214|, ~weak$$choice2~0=~weak$$choice2~0_In1411532214, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1411532214} OutVars{~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In1411532214, P0Thread1of1ForFork0_#t~ite9=|P0Thread1of1ForFork0_#t~ite9_Out1411532214|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1411532214, ~y$w_buff0~0=~y$w_buff0~0_In1411532214, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out1411532214|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1411532214, ~weak$$choice2~0=~weak$$choice2~0_In1411532214, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1411532214} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite9, P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-18 12:55:39,425 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [796] [796] L751-->L751-8: Formula: (let ((.cse1 (= 0 (mod ~weak$$choice2~0_In1703566998 256)))) (or (and (let ((.cse0 (= (mod ~y$r_buff0_thd1~0_In1703566998 256) 0))) (or (= (mod ~y$w_buff0_used~0_In1703566998 256) 0) (and (= 0 (mod ~y$w_buff1_used~0_In1703566998 256)) .cse0) (and .cse0 (= (mod ~y$r_buff1_thd1~0_In1703566998 256) 0)))) .cse1 (= |P0Thread1of1ForFork0_#t~ite11_Out1703566998| ~y$w_buff1~0_In1703566998) (= |P0Thread1of1ForFork0_#t~ite11_Out1703566998| |P0Thread1of1ForFork0_#t~ite12_Out1703566998|)) (and (= |P0Thread1of1ForFork0_#t~ite11_In1703566998| |P0Thread1of1ForFork0_#t~ite11_Out1703566998|) (= |P0Thread1of1ForFork0_#t~ite12_Out1703566998| ~y$w_buff1~0_In1703566998) (not .cse1)))) InVars {P0Thread1of1ForFork0_#t~ite11=|P0Thread1of1ForFork0_#t~ite11_In1703566998|, ~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In1703566998, ~y$w_buff1~0=~y$w_buff1~0_In1703566998, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1703566998, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1703566998, ~weak$$choice2~0=~weak$$choice2~0_In1703566998, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1703566998} OutVars{P0Thread1of1ForFork0_#t~ite11=|P0Thread1of1ForFork0_#t~ite11_Out1703566998|, ~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In1703566998, ~y$w_buff1~0=~y$w_buff1~0_In1703566998, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1703566998, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1703566998, ~weak$$choice2~0=~weak$$choice2~0_In1703566998, P0Thread1of1ForFork0_#t~ite12=|P0Thread1of1ForFork0_#t~ite12_Out1703566998|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1703566998} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite11, P0Thread1of1ForFork0_#t~ite12] because there is no mapped edge [2019-12-18 12:55:39,430 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [812] [812] L754-->L755-8: Formula: (and (= |v_P0Thread1of1ForFork0_#t~ite22_35| |v_P0Thread1of1ForFork0_#t~ite22_34|) (= |v_P0Thread1of1ForFork0_#t~ite23_31| |v_P0Thread1of1ForFork0_#t~ite23_30|) (= v_~y$r_buff1_thd1~0_224 |v_P0Thread1of1ForFork0_#t~ite24_32|) (= v_~y$r_buff0_thd1~0_326 v_~y$r_buff0_thd1~0_325) (not (= 0 (mod v_~weak$$choice2~0_143 256)))) InVars {P0Thread1of1ForFork0_#t~ite22=|v_P0Thread1of1ForFork0_#t~ite22_35|, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_224, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_326, ~weak$$choice2~0=v_~weak$$choice2~0_143, P0Thread1of1ForFork0_#t~ite23=|v_P0Thread1of1ForFork0_#t~ite23_31|} OutVars{P0Thread1of1ForFork0_#t~ite22=|v_P0Thread1of1ForFork0_#t~ite22_34|, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_224, P0Thread1of1ForFork0_#t~ite21=|v_P0Thread1of1ForFork0_#t~ite21_37|, P0Thread1of1ForFork0_#t~ite20=|v_P0Thread1of1ForFork0_#t~ite20_48|, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_325, P0Thread1of1ForFork0_#t~ite19=|v_P0Thread1of1ForFork0_#t~ite19_33|, ~weak$$choice2~0=v_~weak$$choice2~0_143, P0Thread1of1ForFork0_#t~ite24=|v_P0Thread1of1ForFork0_#t~ite24_32|, P0Thread1of1ForFork0_#t~ite23=|v_P0Thread1of1ForFork0_#t~ite23_30|} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite22, P0Thread1of1ForFork0_#t~ite21, P0Thread1of1ForFork0_#t~ite20, ~y$r_buff0_thd1~0, P0Thread1of1ForFork0_#t~ite19, P0Thread1of1ForFork0_#t~ite24, P0Thread1of1ForFork0_#t~ite23] because there is no mapped edge [2019-12-18 12:55:39,431 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [702] [702] L757-->L765: Formula: (and (not (= (mod v_~y$flush_delayed~0_17 256) 0)) (= v_~y~0_46 v_~y$mem_tmp~0_7) (= 0 v_~y$flush_delayed~0_16) (= (+ v_~__unbuffered_cnt~0_36 1) v_~__unbuffered_cnt~0_35)) InVars {~y$mem_tmp~0=v_~y$mem_tmp~0_7, ~y$flush_delayed~0=v_~y$flush_delayed~0_17, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_36} OutVars{P0Thread1of1ForFork0_#t~ite25=|v_P0Thread1of1ForFork0_#t~ite25_21|, ~y$mem_tmp~0=v_~y$mem_tmp~0_7, ~y$flush_delayed~0=v_~y$flush_delayed~0_16, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_35, ~y~0=v_~y~0_46} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite25, ~y$flush_delayed~0, ~__unbuffered_cnt~0, ~y~0] because there is no mapped edge [2019-12-18 12:55:39,431 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [722] [722] L835-1-->L841: Formula: (and (= 3 v_~__unbuffered_cnt~0_42) (= v_~main$tmp_guard0~0_8 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_42} OutVars{ULTIMATE.start_main_#t~nondet40=|v_ULTIMATE.start_main_#t~nondet40_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_42, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet40, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-18 12:55:39,432 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [748] [748] L841-2-->L841-4: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff1_thd0~0_In514480707 256))) (.cse1 (= (mod ~y$w_buff1_used~0_In514480707 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite41_Out514480707| ~y$w_buff1~0_In514480707) (not .cse0) (not .cse1)) (and (= |ULTIMATE.start_main_#t~ite41_Out514480707| ~y~0_In514480707) (or .cse0 .cse1)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In514480707, ~y~0=~y~0_In514480707, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In514480707, ~y$w_buff1_used~0=~y$w_buff1_used~0_In514480707} OutVars{ULTIMATE.start_main_#t~ite41=|ULTIMATE.start_main_#t~ite41_Out514480707|, ~y$w_buff1~0=~y$w_buff1~0_In514480707, ~y~0=~y~0_In514480707, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In514480707, ~y$w_buff1_used~0=~y$w_buff1_used~0_In514480707} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41] because there is no mapped edge [2019-12-18 12:55:39,432 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [681] [681] L841-4-->L842: Formula: (= v_~y~0_14 |v_ULTIMATE.start_main_#t~ite41_7|) InVars {ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_7|} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_6|, ~y~0=v_~y~0_14, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_6|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ~y~0, ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-18 12:55:39,432 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [761] [761] L842-->L842-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In-1217618716 256))) (.cse0 (= 0 (mod ~y$r_buff0_thd0~0_In-1217618716 256)))) (or (and (= |ULTIMATE.start_main_#t~ite43_Out-1217618716| ~y$w_buff0_used~0_In-1217618716) (or .cse0 .cse1)) (and (not .cse1) (not .cse0) (= |ULTIMATE.start_main_#t~ite43_Out-1217618716| 0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1217618716, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1217618716} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1217618716, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1217618716, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out-1217618716|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43] because there is no mapped edge [2019-12-18 12:55:39,433 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [759] [759] L843-->L843-2: Formula: (let ((.cse1 (= (mod ~y$w_buff1_used~0_In1834393019 256) 0)) (.cse0 (= 0 (mod ~y$r_buff1_thd0~0_In1834393019 256))) (.cse2 (= 0 (mod ~y$r_buff0_thd0~0_In1834393019 256))) (.cse3 (= (mod ~y$w_buff0_used~0_In1834393019 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite44_Out1834393019| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse1 .cse0) (= |ULTIMATE.start_main_#t~ite44_Out1834393019| ~y$w_buff1_used~0_In1834393019) (or .cse2 .cse3)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1834393019, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1834393019, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1834393019, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1834393019} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1834393019, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1834393019, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1834393019, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out1834393019|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1834393019} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-18 12:55:39,434 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [745] [745] L844-->L844-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In-632865348 256))) (.cse0 (= (mod ~y$r_buff0_thd0~0_In-632865348 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite45_Out-632865348| 0) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= |ULTIMATE.start_main_#t~ite45_Out-632865348| ~y$r_buff0_thd0~0_In-632865348)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-632865348, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-632865348} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-632865348, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-632865348, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out-632865348|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-12-18 12:55:39,435 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [762] [762] L845-->L845-2: Formula: (let ((.cse2 (= 0 (mod ~y$w_buff0_used~0_In-626458026 256))) (.cse3 (= 0 (mod ~y$r_buff0_thd0~0_In-626458026 256))) (.cse0 (= 0 (mod ~y$r_buff1_thd0~0_In-626458026 256))) (.cse1 (= 0 (mod ~y$w_buff1_used~0_In-626458026 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~y$r_buff1_thd0~0_In-626458026 |ULTIMATE.start_main_#t~ite46_Out-626458026|)) (and (= 0 |ULTIMATE.start_main_#t~ite46_Out-626458026|) (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1)))))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-626458026, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-626458026, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-626458026, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-626458026} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-626458026, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-626458026, ULTIMATE.start_main_#t~ite46=|ULTIMATE.start_main_#t~ite46_Out-626458026|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-626458026, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-626458026} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite46] because there is no mapped edge [2019-12-18 12:55:39,435 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [802] [802] L845-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= (mod v_~main$tmp_guard1~0_17 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_15|) (= v_~main$tmp_guard1~0_17 0) (= v_~z~0_50 2) (= 1 v_~__unbuffered_p0_EAX~0_34) (= v_~__unbuffered_p0_EBX~0_19 0) (= v_ULTIMATE.start___VERIFIER_assert_~expression_18 0) (= 2 v_~__unbuffered_p2_EAX~0_22) (= |v_ULTIMATE.start_main_#t~ite46_39| v_~y$r_buff1_thd0~0_74) (= v_~__unbuffered_p2_EBX~0_22 0)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_34, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_19, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_22, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_39|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_22, ~z~0=v_~z~0_50} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_34, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_18, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_19, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_22, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_38|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_17, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_22, ~z~0=v_~z~0_50, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_74, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_15|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ULTIMATE.start_main_#t~ite46, ~main$tmp_guard1~0, ~y$r_buff1_thd0~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-18 12:55:39,523 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.12 12:55:39 BasicIcfg [2019-12-18 12:55:39,523 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-18 12:55:39,525 INFO L168 Benchmark]: Toolchain (without parser) took 63316.58 ms. Allocated memory was 141.6 MB in the beginning and 2.2 GB in the end (delta: 2.1 GB). Free memory was 103.8 MB in the beginning and 1.4 GB in the end (delta: -1.3 GB). Peak memory consumption was 723.4 MB. Max. memory is 7.1 GB. [2019-12-18 12:55:39,525 INFO L168 Benchmark]: CDTParser took 1.53 ms. Allocated memory is still 141.6 MB. Free memory was 123.5 MB in the beginning and 123.3 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. [2019-12-18 12:55:39,526 INFO L168 Benchmark]: CACSL2BoogieTranslator took 742.45 ms. Allocated memory was 141.6 MB in the beginning and 204.5 MB in the end (delta: 62.9 MB). Free memory was 103.3 MB in the beginning and 158.2 MB in the end (delta: -54.8 MB). Peak memory consumption was 24.6 MB. Max. memory is 7.1 GB. [2019-12-18 12:55:39,526 INFO L168 Benchmark]: Boogie Procedure Inliner took 73.98 ms. Allocated memory is still 204.5 MB. Free memory was 158.2 MB in the beginning and 155.7 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 7.1 GB. [2019-12-18 12:55:39,526 INFO L168 Benchmark]: Boogie Preprocessor took 44.34 ms. Allocated memory is still 204.5 MB. Free memory was 155.7 MB in the beginning and 153.2 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 7.1 GB. [2019-12-18 12:55:39,530 INFO L168 Benchmark]: RCFGBuilder took 785.97 ms. Allocated memory is still 204.5 MB. Free memory was 153.2 MB in the beginning and 106.2 MB in the end (delta: 47.0 MB). Peak memory consumption was 47.0 MB. Max. memory is 7.1 GB. [2019-12-18 12:55:39,531 INFO L168 Benchmark]: TraceAbstraction took 61663.74 ms. Allocated memory was 204.5 MB in the beginning and 2.2 GB in the end (delta: 2.0 GB). Free memory was 106.2 MB in the beginning and 1.4 GB in the end (delta: -1.3 GB). Peak memory consumption was 663.0 MB. Max. memory is 7.1 GB. [2019-12-18 12:55:39,536 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.53 ms. Allocated memory is still 141.6 MB. Free memory was 123.5 MB in the beginning and 123.3 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 742.45 ms. Allocated memory was 141.6 MB in the beginning and 204.5 MB in the end (delta: 62.9 MB). Free memory was 103.3 MB in the beginning and 158.2 MB in the end (delta: -54.8 MB). Peak memory consumption was 24.6 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 73.98 ms. Allocated memory is still 204.5 MB. Free memory was 158.2 MB in the beginning and 155.7 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 44.34 ms. Allocated memory is still 204.5 MB. Free memory was 155.7 MB in the beginning and 153.2 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 7.1 GB. * RCFGBuilder took 785.97 ms. Allocated memory is still 204.5 MB. Free memory was 153.2 MB in the beginning and 106.2 MB in the end (delta: 47.0 MB). Peak memory consumption was 47.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 61663.74 ms. Allocated memory was 204.5 MB in the beginning and 2.2 GB in the end (delta: 2.0 GB). Free memory was 106.2 MB in the beginning and 1.4 GB in the end (delta: -1.3 GB). Peak memory consumption was 663.0 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 6.0s, 166 ProgramPointsBefore, 83 ProgramPointsAfterwards, 197 TransitionsBefore, 90 TransitionsAfterwards, 16696 CoEnabledTransitionPairs, 8 FixpointIterations, 35 TrivialSequentialCompositions, 47 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 31 ConcurrentYvCompositions, 28 ChoiceCompositions, 6616 VarBasedMoverChecksPositive, 243 VarBasedMoverChecksNegative, 66 SemBasedMoverChecksPositive, 263 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.8s, 0 MoverChecksTotal, 74173 CheckedPairsTotal, 113 TotalNumberOfCompositions - CounterExampleResult [Line: 5]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L831] FCALL, FORK 0 pthread_create(&t648, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L833] FCALL, FORK 0 pthread_create(&t649, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L835] FCALL, FORK 0 pthread_create(&t650, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L775] 2 y$r_buff1_thd0 = y$r_buff0_thd0 [L776] 2 y$r_buff1_thd1 = y$r_buff0_thd1 [L777] 2 y$r_buff1_thd2 = y$r_buff0_thd2 [L778] 2 y$r_buff1_thd3 = y$r_buff0_thd3 [L779] 2 y$r_buff0_thd2 = (_Bool)1 [L782] 2 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L785] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L799] 3 z = 2 [L802] 3 __unbuffered_p2_EAX = z [L805] 3 __unbuffered_p2_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L808] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L785] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L808] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L809] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L810] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L811] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L786] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L787] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L736] 1 a = 1 [L739] 1 x = 1 [L742] 1 __unbuffered_p0_EAX = x [L745] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L746] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L747] 1 y$flush_delayed = weak$$choice2 [L748] 1 y$mem_tmp = y VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L749] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) VAL [!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1)=0, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L749] 1 y = !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) [L750] 1 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)) [L751] 1 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)) [L752] EXPR 1 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L752] 1 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) [L753] EXPR 1 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L753] 1 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L755] 1 y$r_buff1_thd1 = weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L756] 1 __unbuffered_p0_EBX = y VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L841] 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [\result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L842] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L843] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L844] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 157 locations, 2 error locations. Result: UNSAFE, OverallTime: 61.3s, OverallIterations: 28, TraceHistogramMax: 1, AutomataDifference: 23.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 5057 SDtfs, 8274 SDslu, 17817 SDs, 0 SdLazy, 11040 SolverSat, 405 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 9.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 407 GetRequests, 51 SyntacticMatches, 16 SemanticMatches, 340 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2172 ImplicationChecksByTransitivity, 5.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=82802occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 15.1s AutomataMinimizationTime, 27 MinimizatonAttempts, 125240 StatesRemovedByMinimization, 23 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.8s InterpolantComputationTime, 1173 NumberOfCodeBlocks, 1173 NumberOfCodeBlocksAsserted, 28 NumberOfCheckSat, 1091 ConstructedInterpolants, 0 QuantifiedInterpolants, 223517 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 27 InterpolantComputations, 27 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...