/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/safe005_power.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-fae578e [2019-12-18 14:30:29,838 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-18 14:30:29,840 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-18 14:30:29,856 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-18 14:30:29,856 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-18 14:30:29,858 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-18 14:30:29,860 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-18 14:30:29,871 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-18 14:30:29,872 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-18 14:30:29,873 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-18 14:30:29,874 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-18 14:30:29,875 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-18 14:30:29,875 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-18 14:30:29,876 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-18 14:30:29,877 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-18 14:30:29,878 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-18 14:30:29,879 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-18 14:30:29,880 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-18 14:30:29,881 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-18 14:30:29,883 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-18 14:30:29,885 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-18 14:30:29,885 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-18 14:30:29,887 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-18 14:30:29,887 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-18 14:30:29,889 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-18 14:30:29,890 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-18 14:30:29,890 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-18 14:30:29,891 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-18 14:30:29,891 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-18 14:30:29,892 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-18 14:30:29,892 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-18 14:30:29,893 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-18 14:30:29,894 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-18 14:30:29,894 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-18 14:30:29,895 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-18 14:30:29,895 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-18 14:30:29,896 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-18 14:30:29,896 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-18 14:30:29,896 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-18 14:30:29,897 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-18 14:30:29,898 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-18 14:30:29,899 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 14:30:29,921 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-18 14:30:29,922 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-18 14:30:29,923 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-18 14:30:29,924 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-18 14:30:29,924 INFO L138 SettingsManager]: * Use SBE=true [2019-12-18 14:30:29,924 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-18 14:30:29,924 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-18 14:30:29,925 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-18 14:30:29,925 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-18 14:30:29,925 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-18 14:30:29,926 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-18 14:30:29,926 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-18 14:30:29,926 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-18 14:30:29,927 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-18 14:30:29,927 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-18 14:30:29,927 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-18 14:30:29,927 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-18 14:30:29,928 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-18 14:30:29,928 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-18 14:30:29,928 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-18 14:30:29,928 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-18 14:30:29,929 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 14:30:29,929 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-18 14:30:29,929 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-18 14:30:29,929 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-18 14:30:29,930 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-18 14:30:29,930 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-18 14:30:29,930 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-18 14:30:29,930 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-18 14:30:29,930 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-18 14:30:30,228 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-18 14:30:30,252 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-18 14:30:30,257 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-18 14:30:30,259 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-18 14:30:30,259 INFO L275 PluginConnector]: CDTParser initialized [2019-12-18 14:30:30,260 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe005_power.oepc.i [2019-12-18 14:30:30,324 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c9f99947f/9e984c7b43e741bd9af47549501a44f9/FLAG216f424ae [2019-12-18 14:30:30,873 INFO L306 CDTParser]: Found 1 translation units. [2019-12-18 14:30:30,873 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe005_power.oepc.i [2019-12-18 14:30:30,889 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c9f99947f/9e984c7b43e741bd9af47549501a44f9/FLAG216f424ae [2019-12-18 14:30:31,161 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c9f99947f/9e984c7b43e741bd9af47549501a44f9 [2019-12-18 14:30:31,171 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-18 14:30:31,173 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-18 14:30:31,174 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-18 14:30:31,175 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-18 14:30:31,179 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-18 14:30:31,180 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 02:30:31" (1/1) ... [2019-12-18 14:30:31,183 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2983cbdb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:30:31, skipping insertion in model container [2019-12-18 14:30:31,183 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 02:30:31" (1/1) ... [2019-12-18 14:30:31,191 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-18 14:30:31,261 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-18 14:30:31,774 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 14:30:31,786 INFO L203 MainTranslator]: Completed pre-run [2019-12-18 14:30:31,852 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 14:30:31,923 INFO L208 MainTranslator]: Completed translation [2019-12-18 14:30:31,924 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:30:31 WrapperNode [2019-12-18 14:30:31,924 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-18 14:30:31,925 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-18 14:30:31,925 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-18 14:30:31,925 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-18 14:30:31,934 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:30:31" (1/1) ... [2019-12-18 14:30:31,955 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:30:31" (1/1) ... [2019-12-18 14:30:31,987 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-18 14:30:31,988 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-18 14:30:31,988 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-18 14:30:31,988 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-18 14:30:31,996 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:30:31" (1/1) ... [2019-12-18 14:30:31,996 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:30:31" (1/1) ... [2019-12-18 14:30:32,004 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:30:31" (1/1) ... [2019-12-18 14:30:32,004 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:30:31" (1/1) ... [2019-12-18 14:30:32,017 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:30:31" (1/1) ... [2019-12-18 14:30:32,022 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:30:31" (1/1) ... [2019-12-18 14:30:32,026 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:30:31" (1/1) ... [2019-12-18 14:30:32,031 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-18 14:30:32,032 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-18 14:30:32,032 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-18 14:30:32,032 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-18 14:30:32,033 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:30:31" (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 14:30:32,113 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-18 14:30:32,114 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-18 14:30:32,114 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-18 14:30:32,114 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-18 14:30:32,114 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-18 14:30:32,114 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-18 14:30:32,115 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-18 14:30:32,115 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-18 14:30:32,115 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-18 14:30:32,115 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-18 14:30:32,115 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-18 14:30:32,115 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-18 14:30:32,116 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-18 14:30:32,118 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 14:30:32,887 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-18 14:30:32,888 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-18 14:30:32,889 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 02:30:32 BoogieIcfgContainer [2019-12-18 14:30:32,889 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-18 14:30:32,890 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-18 14:30:32,891 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-18 14:30:32,894 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-18 14:30:32,894 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 02:30:31" (1/3) ... [2019-12-18 14:30:32,895 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@9efb280 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 02:30:32, skipping insertion in model container [2019-12-18 14:30:32,896 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:30:31" (2/3) ... [2019-12-18 14:30:32,896 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@9efb280 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 02:30:32, skipping insertion in model container [2019-12-18 14:30:32,896 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 02:30:32" (3/3) ... [2019-12-18 14:30:32,898 INFO L109 eAbstractionObserver]: Analyzing ICFG safe005_power.oepc.i [2019-12-18 14:30:32,908 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-18 14:30:32,909 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-18 14:30:32,917 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-18 14:30:32,918 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-18 14:30:32,958 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:30:32,958 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:30:32,959 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:30:32,959 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:30:32,959 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:30:32,959 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:30:32,960 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:30:32,960 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:30:32,960 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:30:32,961 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:30:32,961 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:30:32,961 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:30:32,962 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:30:32,962 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:30:32,962 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:30:32,963 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:30:32,963 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:30:32,963 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:30:32,963 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:30:32,964 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:30:32,964 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:30:32,964 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:30:32,964 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:30:32,965 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:30:32,965 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:30:32,966 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:30:32,966 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:30:32,966 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:30:32,966 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:30:32,967 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:30:32,967 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:30:32,967 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:30:32,967 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:30:32,968 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:30:32,968 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:30:32,968 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:30:32,968 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:30:32,969 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:30:32,969 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:30:32,969 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:30:32,970 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:30:32,970 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:30:32,970 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:30:32,970 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:30:32,971 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:30:32,971 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:30:32,971 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:30:32,971 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:30:32,972 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:30:32,972 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:30:32,972 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:30:32,972 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:30:32,973 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:30:32,973 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:30:32,973 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:30:32,973 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:30:32,974 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:30:32,974 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:30:32,974 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:30:32,974 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:30:32,975 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:30:32,975 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:30:32,975 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:30:32,975 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:30:32,976 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:30:32,976 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:30:32,976 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:30:32,976 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:30:32,977 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:30:32,977 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:30:32,977 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:30:32,977 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:30:32,978 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:30:32,978 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:30:32,978 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:30:32,978 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:30:32,979 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:30:32,979 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:30:32,979 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:30:32,979 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:30:32,979 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:30:32,980 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:30:32,980 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:30:32,980 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:30:32,980 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:30:32,981 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:30:32,981 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:30:32,981 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:30:32,981 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:30:32,982 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:30:32,982 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:30:32,982 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:30:32,982 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:30:32,983 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:30:32,984 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:30:32,984 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:30:32,984 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:30:32,984 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:30:32,984 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:30:32,985 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:30:32,985 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:30:33,003 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:30:33,004 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:30:33,004 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:30:33,004 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:30:33,004 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:30:33,005 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:30:33,005 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:30:33,005 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:30:33,005 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:30:33,006 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:30:33,006 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:30:33,006 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:30:33,006 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:30:33,006 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:30:33,007 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:30:33,007 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:30:33,007 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:30:33,007 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:30:33,007 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:30:33,008 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:30:33,008 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:30:33,008 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:30:33,008 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:30:33,009 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:30:33,009 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:30:33,009 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:30:33,009 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:30:33,010 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:30:33,010 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:30:33,010 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:30:33,010 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:30:33,010 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:30:33,011 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:30:33,011 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:30:33,011 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:30:33,011 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:30:33,011 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:30:33,012 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:30:33,012 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:30:33,012 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:30:33,012 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:30:33,012 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:30:33,013 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:30:33,013 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:30:33,013 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:30:33,013 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:30:33,013 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:30:33,014 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:30:33,014 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:30:33,014 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:30:33,014 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:30:33,014 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:30:33,015 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:30:33,015 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:30:33,015 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:30:33,015 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:30:33,015 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:30:33,019 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:30:33,019 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:30:33,019 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:30:33,019 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:30:33,020 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:30:33,020 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:30:33,020 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:30:33,020 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:30:33,020 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:30:33,021 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:30:33,021 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:30:33,021 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:30:33,024 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:30:33,024 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:30:33,024 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:30:33,024 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:30:33,025 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:30:33,025 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:30:33,025 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:30:33,025 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:30:33,025 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:30:33,026 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:30:33,028 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:30:33,029 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:30:33,029 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:30:33,029 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:30:33,029 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:30:33,029 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:30:33,029 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:30:33,030 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:30:33,030 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:30:33,030 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:30:33,030 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:30:33,030 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:30:33,031 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:30:33,031 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:30:33,031 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:30:33,031 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:30:33,031 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:30:33,032 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:30:33,032 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:30:33,032 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:30:33,032 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:30:33,032 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:30:33,032 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:30:33,033 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:30:33,033 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:30:33,033 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:30:33,033 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:30:33,049 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-18 14:30:33,069 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-18 14:30:33,069 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-18 14:30:33,069 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-18 14:30:33,070 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-18 14:30:33,070 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-18 14:30:33,070 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-18 14:30:33,070 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-18 14:30:33,070 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-18 14:30:33,087 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 163 places, 194 transitions [2019-12-18 14:30:33,089 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 163 places, 194 transitions [2019-12-18 14:30:33,172 INFO L126 PetriNetUnfolder]: 41/191 cut-off events. [2019-12-18 14:30:33,172 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 14:30:33,193 INFO L76 FinitePrefix]: Finished finitePrefix Result has 201 conditions, 191 events. 41/191 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 452 event pairs. 9/157 useless extension candidates. Maximal degree in co-relation 161. Up to 2 conditions per place. [2019-12-18 14:30:33,220 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 163 places, 194 transitions [2019-12-18 14:30:33,314 INFO L126 PetriNetUnfolder]: 41/191 cut-off events. [2019-12-18 14:30:33,315 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 14:30:33,329 INFO L76 FinitePrefix]: Finished finitePrefix Result has 201 conditions, 191 events. 41/191 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 452 event pairs. 9/157 useless extension candidates. Maximal degree in co-relation 161. Up to 2 conditions per place. [2019-12-18 14:30:33,357 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 16696 [2019-12-18 14:30:33,359 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-18 14:30:39,002 WARN L192 SmtUtils]: Spent 219.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 87 [2019-12-18 14:30:39,109 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 85 [2019-12-18 14:30:39,211 INFO L206 etLargeBlockEncoding]: Checked pairs total: 66367 [2019-12-18 14:30:39,211 INFO L214 etLargeBlockEncoding]: Total number of compositions: 113 [2019-12-18 14:30:39,215 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 83 places, 92 transitions [2019-12-18 14:30:51,289 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 86132 states. [2019-12-18 14:30:51,291 INFO L276 IsEmpty]: Start isEmpty. Operand 86132 states. [2019-12-18 14:30:51,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-12-18 14:30:51,298 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:30:51,299 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-12-18 14:30:51,299 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:30:51,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:30:51,306 INFO L82 PathProgramCache]: Analyzing trace with hash 795562213, now seen corresponding path program 1 times [2019-12-18 14:30:51,313 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:30:51,314 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [531837196] [2019-12-18 14:30:51,314 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:30:51,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:30:51,602 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 14:30:51,603 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [531837196] [2019-12-18 14:30:51,604 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:30:51,604 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 14:30:51,605 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [972495331] [2019-12-18 14:30:51,610 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 14:30:51,610 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:30:51,625 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 14:30:51,625 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 14:30:51,627 INFO L87 Difference]: Start difference. First operand 86132 states. Second operand 3 states. [2019-12-18 14:30:55,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:30:55,073 INFO L93 Difference]: Finished difference Result 85012 states and 367904 transitions. [2019-12-18 14:30:55,073 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 14:30:55,075 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-12-18 14:30:55,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:30:55,679 INFO L225 Difference]: With dead ends: 85012 [2019-12-18 14:30:55,680 INFO L226 Difference]: Without dead ends: 80140 [2019-12-18 14:30:55,681 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 14:31:00,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80140 states. [2019-12-18 14:31:02,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80140 to 80140. [2019-12-18 14:31:02,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80140 states. [2019-12-18 14:31:03,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80140 states to 80140 states and 346330 transitions. [2019-12-18 14:31:03,144 INFO L78 Accepts]: Start accepts. Automaton has 80140 states and 346330 transitions. Word has length 5 [2019-12-18 14:31:03,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:31:03,145 INFO L462 AbstractCegarLoop]: Abstraction has 80140 states and 346330 transitions. [2019-12-18 14:31:03,145 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 14:31:03,145 INFO L276 IsEmpty]: Start isEmpty. Operand 80140 states and 346330 transitions. [2019-12-18 14:31:03,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-18 14:31:03,153 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:31:03,153 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:31:03,154 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:31:03,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:31:03,154 INFO L82 PathProgramCache]: Analyzing trace with hash -36571135, now seen corresponding path program 1 times [2019-12-18 14:31:03,154 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:31:03,155 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [85063868] [2019-12-18 14:31:03,155 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:31:03,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:31:03,263 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 14:31:03,264 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [85063868] [2019-12-18 14:31:03,264 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:31:03,264 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 14:31:03,264 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [191480198] [2019-12-18 14:31:03,267 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 14:31:03,267 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:31:03,268 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 14:31:03,268 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 14:31:03,268 INFO L87 Difference]: Start difference. First operand 80140 states and 346330 transitions. Second operand 4 states. [2019-12-18 14:31:07,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:31:07,687 INFO L93 Difference]: Finished difference Result 123388 states and 510822 transitions. [2019-12-18 14:31:07,688 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 14:31:07,688 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-18 14:31:07,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:31:08,210 INFO L225 Difference]: With dead ends: 123388 [2019-12-18 14:31:08,210 INFO L226 Difference]: Without dead ends: 123290 [2019-12-18 14:31:08,211 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 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 14:31:11,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123290 states. [2019-12-18 14:31:14,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123290 to 114218. [2019-12-18 14:31:14,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114218 states. [2019-12-18 14:31:14,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114218 states to 114218 states and 477794 transitions. [2019-12-18 14:31:14,795 INFO L78 Accepts]: Start accepts. Automaton has 114218 states and 477794 transitions. Word has length 13 [2019-12-18 14:31:14,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:31:14,797 INFO L462 AbstractCegarLoop]: Abstraction has 114218 states and 477794 transitions. [2019-12-18 14:31:14,797 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 14:31:14,797 INFO L276 IsEmpty]: Start isEmpty. Operand 114218 states and 477794 transitions. [2019-12-18 14:31:14,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-18 14:31:14,800 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:31:14,801 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:31:14,801 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:31:14,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:31:14,801 INFO L82 PathProgramCache]: Analyzing trace with hash 424299118, now seen corresponding path program 1 times [2019-12-18 14:31:14,802 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:31:14,802 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1503532552] [2019-12-18 14:31:14,802 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:31:14,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:31:14,921 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 14:31:14,922 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1503532552] [2019-12-18 14:31:14,922 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:31:14,922 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 14:31:14,923 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [31176452] [2019-12-18 14:31:14,923 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 14:31:14,923 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:31:14,923 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 14:31:14,924 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 14:31:14,924 INFO L87 Difference]: Start difference. First operand 114218 states and 477794 transitions. Second operand 4 states. [2019-12-18 14:31:20,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:31:20,029 INFO L93 Difference]: Finished difference Result 159677 states and 652290 transitions. [2019-12-18 14:31:20,029 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 14:31:20,029 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-18 14:31:20,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:31:20,617 INFO L225 Difference]: With dead ends: 159677 [2019-12-18 14:31:20,618 INFO L226 Difference]: Without dead ends: 159565 [2019-12-18 14:31:20,618 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 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 14:31:24,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159565 states. [2019-12-18 14:31:27,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159565 to 136035. [2019-12-18 14:31:27,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136035 states. [2019-12-18 14:31:28,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136035 states to 136035 states and 564894 transitions. [2019-12-18 14:31:28,019 INFO L78 Accepts]: Start accepts. Automaton has 136035 states and 564894 transitions. Word has length 13 [2019-12-18 14:31:28,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:31:28,020 INFO L462 AbstractCegarLoop]: Abstraction has 136035 states and 564894 transitions. [2019-12-18 14:31:28,020 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 14:31:28,020 INFO L276 IsEmpty]: Start isEmpty. Operand 136035 states and 564894 transitions. [2019-12-18 14:31:28,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-18 14:31:28,025 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:31:28,025 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:31:28,025 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:31:28,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:31:28,025 INFO L82 PathProgramCache]: Analyzing trace with hash -2100241523, now seen corresponding path program 1 times [2019-12-18 14:31:28,026 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:31:28,026 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1549170994] [2019-12-18 14:31:28,026 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:31:28,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:31:28,070 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 14:31:28,070 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1549170994] [2019-12-18 14:31:28,070 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:31:28,074 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 14:31:28,074 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [916411254] [2019-12-18 14:31:28,075 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 14:31:28,075 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:31:28,075 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 14:31:28,075 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 14:31:28,075 INFO L87 Difference]: Start difference. First operand 136035 states and 564894 transitions. Second operand 3 states. [2019-12-18 14:31:34,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:31:34,527 INFO L93 Difference]: Finished difference Result 181618 states and 742473 transitions. [2019-12-18 14:31:34,527 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 14:31:34,527 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2019-12-18 14:31:34,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:31:35,114 INFO L225 Difference]: With dead ends: 181618 [2019-12-18 14:31:35,115 INFO L226 Difference]: Without dead ends: 181618 [2019-12-18 14:31:35,115 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 14:31:39,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181618 states. [2019-12-18 14:31:42,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181618 to 152081. [2019-12-18 14:31:42,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152081 states. [2019-12-18 14:31:42,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152081 states to 152081 states and 628919 transitions. [2019-12-18 14:31:42,750 INFO L78 Accepts]: Start accepts. Automaton has 152081 states and 628919 transitions. Word has length 14 [2019-12-18 14:31:42,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:31:42,750 INFO L462 AbstractCegarLoop]: Abstraction has 152081 states and 628919 transitions. [2019-12-18 14:31:42,750 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 14:31:42,750 INFO L276 IsEmpty]: Start isEmpty. Operand 152081 states and 628919 transitions. [2019-12-18 14:31:42,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-18 14:31:42,755 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:31:42,755 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:31:42,755 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:31:42,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:31:42,756 INFO L82 PathProgramCache]: Analyzing trace with hash -2100376187, now seen corresponding path program 1 times [2019-12-18 14:31:42,756 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:31:42,756 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1214766651] [2019-12-18 14:31:42,756 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:31:42,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:31:42,818 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 14:31:42,818 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1214766651] [2019-12-18 14:31:42,818 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:31:42,818 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 14:31:42,819 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1077186072] [2019-12-18 14:31:42,819 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 14:31:42,819 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:31:42,819 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 14:31:42,820 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 14:31:42,820 INFO L87 Difference]: Start difference. First operand 152081 states and 628919 transitions. Second operand 4 states. [2019-12-18 14:31:48,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:31:48,647 INFO L93 Difference]: Finished difference Result 179622 states and 732719 transitions. [2019-12-18 14:31:48,648 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 14:31:48,648 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-12-18 14:31:48,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:31:49,227 INFO L225 Difference]: With dead ends: 179622 [2019-12-18 14:31:49,227 INFO L226 Difference]: Without dead ends: 179542 [2019-12-18 14:31:49,227 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 14:31:53,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179542 states. [2019-12-18 14:31:59,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179542 to 157787. [2019-12-18 14:31:59,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157787 states. [2019-12-18 14:32:00,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157787 states to 157787 states and 651479 transitions. [2019-12-18 14:32:00,133 INFO L78 Accepts]: Start accepts. Automaton has 157787 states and 651479 transitions. Word has length 14 [2019-12-18 14:32:00,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:32:00,133 INFO L462 AbstractCegarLoop]: Abstraction has 157787 states and 651479 transitions. [2019-12-18 14:32:00,133 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 14:32:00,134 INFO L276 IsEmpty]: Start isEmpty. Operand 157787 states and 651479 transitions. [2019-12-18 14:32:00,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-18 14:32:00,137 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:32:00,137 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:32:00,137 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:32:00,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:32:00,138 INFO L82 PathProgramCache]: Analyzing trace with hash -1940234062, now seen corresponding path program 1 times [2019-12-18 14:32:00,138 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:32:00,138 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [557583222] [2019-12-18 14:32:00,138 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:32:00,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:32:00,213 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 14:32:00,213 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [557583222] [2019-12-18 14:32:00,216 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:32:00,216 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 14:32:00,216 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1861759748] [2019-12-18 14:32:00,217 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 14:32:00,217 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:32:00,217 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 14:32:00,217 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 14:32:00,218 INFO L87 Difference]: Start difference. First operand 157787 states and 651479 transitions. Second operand 4 states. [2019-12-18 14:32:02,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:32:02,363 INFO L93 Difference]: Finished difference Result 189091 states and 772001 transitions. [2019-12-18 14:32:02,363 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 14:32:02,363 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-12-18 14:32:02,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:32:02,913 INFO L225 Difference]: With dead ends: 189091 [2019-12-18 14:32:02,913 INFO L226 Difference]: Without dead ends: 188995 [2019-12-18 14:32:02,913 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 14:32:13,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188995 states. [2019-12-18 14:32:16,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188995 to 161868. [2019-12-18 14:32:16,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161868 states. [2019-12-18 14:32:17,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161868 states to 161868 states and 668265 transitions. [2019-12-18 14:32:17,377 INFO L78 Accepts]: Start accepts. Automaton has 161868 states and 668265 transitions. Word has length 14 [2019-12-18 14:32:17,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:32:17,377 INFO L462 AbstractCegarLoop]: Abstraction has 161868 states and 668265 transitions. [2019-12-18 14:32:17,377 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 14:32:17,377 INFO L276 IsEmpty]: Start isEmpty. Operand 161868 states and 668265 transitions. [2019-12-18 14:32:17,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-18 14:32:17,400 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:32:17,401 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:32:17,401 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:32:17,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:32:17,401 INFO L82 PathProgramCache]: Analyzing trace with hash -1828891691, now seen corresponding path program 1 times [2019-12-18 14:32:17,402 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:32:17,402 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [951972761] [2019-12-18 14:32:17,402 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:32:17,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:32:17,455 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 14:32:17,456 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [951972761] [2019-12-18 14:32:17,456 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:32:17,456 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 14:32:17,456 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1452724755] [2019-12-18 14:32:17,457 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 14:32:17,457 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:32:17,457 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 14:32:17,457 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 14:32:17,457 INFO L87 Difference]: Start difference. First operand 161868 states and 668265 transitions. Second operand 3 states. [2019-12-18 14:32:19,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:32:19,760 INFO L93 Difference]: Finished difference Result 160940 states and 664422 transitions. [2019-12-18 14:32:19,761 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 14:32:19,761 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-12-18 14:32:19,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:32:20,247 INFO L225 Difference]: With dead ends: 160940 [2019-12-18 14:32:20,247 INFO L226 Difference]: Without dead ends: 160940 [2019-12-18 14:32:20,247 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 14:32:25,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160940 states. [2019-12-18 14:32:34,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160940 to 160940. [2019-12-18 14:32:34,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160940 states. [2019-12-18 14:32:34,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160940 states to 160940 states and 664422 transitions. [2019-12-18 14:32:34,560 INFO L78 Accepts]: Start accepts. Automaton has 160940 states and 664422 transitions. Word has length 18 [2019-12-18 14:32:34,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:32:34,561 INFO L462 AbstractCegarLoop]: Abstraction has 160940 states and 664422 transitions. [2019-12-18 14:32:34,561 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 14:32:34,561 INFO L276 IsEmpty]: Start isEmpty. Operand 160940 states and 664422 transitions. [2019-12-18 14:32:34,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-18 14:32:34,587 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:32:34,587 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:32:34,587 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:32:34,587 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:32:34,587 INFO L82 PathProgramCache]: Analyzing trace with hash 2025528817, now seen corresponding path program 1 times [2019-12-18 14:32:34,587 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:32:34,587 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [983529238] [2019-12-18 14:32:34,588 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:32:34,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:32:34,636 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 14:32:34,637 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [983529238] [2019-12-18 14:32:34,637 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:32:34,637 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 14:32:34,638 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [644471149] [2019-12-18 14:32:34,638 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 14:32:34,638 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:32:34,638 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 14:32:34,639 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 14:32:34,639 INFO L87 Difference]: Start difference. First operand 160940 states and 664422 transitions. Second operand 4 states. [2019-12-18 14:32:44,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:32:44,177 INFO L93 Difference]: Finished difference Result 297697 states and 1230452 transitions. [2019-12-18 14:32:44,177 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 14:32:44,177 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 19 [2019-12-18 14:32:44,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:32:44,696 INFO L225 Difference]: With dead ends: 297697 [2019-12-18 14:32:44,696 INFO L226 Difference]: Without dead ends: 170729 [2019-12-18 14:32:44,697 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 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 14:32:48,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170729 states. [2019-12-18 14:32:51,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170729 to 169732. [2019-12-18 14:32:51,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169732 states. [2019-12-18 14:32:51,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169732 states to 169732 states and 694021 transitions. [2019-12-18 14:32:51,835 INFO L78 Accepts]: Start accepts. Automaton has 169732 states and 694021 transitions. Word has length 19 [2019-12-18 14:32:51,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:32:51,836 INFO L462 AbstractCegarLoop]: Abstraction has 169732 states and 694021 transitions. [2019-12-18 14:32:51,836 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 14:32:51,836 INFO L276 IsEmpty]: Start isEmpty. Operand 169732 states and 694021 transitions. [2019-12-18 14:32:51,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-18 14:32:51,855 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:32:51,856 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:32:51,856 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:32:51,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:32:51,856 INFO L82 PathProgramCache]: Analyzing trace with hash 550104482, now seen corresponding path program 1 times [2019-12-18 14:32:51,856 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:32:51,856 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1256389900] [2019-12-18 14:32:51,856 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:32:51,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:32:53,039 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 14:32:53,039 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1256389900] [2019-12-18 14:32:53,039 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:32:53,039 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 14:32:53,040 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [248060731] [2019-12-18 14:32:53,040 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 14:32:53,040 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:32:53,041 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 14:32:53,041 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 14:32:53,041 INFO L87 Difference]: Start difference. First operand 169732 states and 694021 transitions. Second operand 4 states. [2019-12-18 14:32:53,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:32:53,296 INFO L93 Difference]: Finished difference Result 49048 states and 168395 transitions. [2019-12-18 14:32:53,296 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 14:32:53,296 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 19 [2019-12-18 14:32:53,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:32:53,369 INFO L225 Difference]: With dead ends: 49048 [2019-12-18 14:32:53,369 INFO L226 Difference]: Without dead ends: 38053 [2019-12-18 14:32:53,371 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 14:32:53,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38053 states. [2019-12-18 14:32:53,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38053 to 37601. [2019-12-18 14:32:53,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37601 states. [2019-12-18 14:32:54,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37601 states to 37601 states and 124116 transitions. [2019-12-18 14:32:54,021 INFO L78 Accepts]: Start accepts. Automaton has 37601 states and 124116 transitions. Word has length 19 [2019-12-18 14:32:54,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:32:54,022 INFO L462 AbstractCegarLoop]: Abstraction has 37601 states and 124116 transitions. [2019-12-18 14:32:54,022 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 14:32:54,022 INFO L276 IsEmpty]: Start isEmpty. Operand 37601 states and 124116 transitions. [2019-12-18 14:32:54,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-18 14:32:54,029 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:32:54,029 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 14:32:54,029 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:32:54,029 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:32:54,029 INFO L82 PathProgramCache]: Analyzing trace with hash -70181007, now seen corresponding path program 1 times [2019-12-18 14:32:54,030 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:32:54,030 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1388554039] [2019-12-18 14:32:54,030 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:32:54,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:32:54,096 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 14:32:54,097 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1388554039] [2019-12-18 14:32:54,097 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:32:54,097 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 14:32:54,097 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1381754072] [2019-12-18 14:32:54,098 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 14:32:54,098 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:32:54,099 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 14:32:54,099 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 14:32:54,099 INFO L87 Difference]: Start difference. First operand 37601 states and 124116 transitions. Second operand 5 states. [2019-12-18 14:32:54,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:32:54,673 INFO L93 Difference]: Finished difference Result 50439 states and 163679 transitions. [2019-12-18 14:32:54,673 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-18 14:32:54,673 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-12-18 14:32:54,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:32:54,763 INFO L225 Difference]: With dead ends: 50439 [2019-12-18 14:32:54,763 INFO L226 Difference]: Without dead ends: 50137 [2019-12-18 14:32:54,763 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-18 14:32:57,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50137 states. [2019-12-18 14:32:57,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50137 to 38325. [2019-12-18 14:32:57,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38325 states. [2019-12-18 14:32:57,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38325 states to 38325 states and 126442 transitions. [2019-12-18 14:32:57,725 INFO L78 Accepts]: Start accepts. Automaton has 38325 states and 126442 transitions. Word has length 22 [2019-12-18 14:32:57,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:32:57,726 INFO L462 AbstractCegarLoop]: Abstraction has 38325 states and 126442 transitions. [2019-12-18 14:32:57,726 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 14:32:57,726 INFO L276 IsEmpty]: Start isEmpty. Operand 38325 states and 126442 transitions. [2019-12-18 14:32:57,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-18 14:32:57,733 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:32:57,733 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 14:32:57,734 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:32:57,734 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:32:57,734 INFO L82 PathProgramCache]: Analyzing trace with hash -633645132, now seen corresponding path program 1 times [2019-12-18 14:32:57,734 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:32:57,735 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [914403991] [2019-12-18 14:32:57,735 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:32:57,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:32:57,820 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 14:32:57,821 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [914403991] [2019-12-18 14:32:57,821 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:32:57,821 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 14:32:57,822 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [232898809] [2019-12-18 14:32:57,822 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 14:32:57,822 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:32:57,822 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 14:32:57,822 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 14:32:57,823 INFO L87 Difference]: Start difference. First operand 38325 states and 126442 transitions. Second operand 5 states. [2019-12-18 14:32:58,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:32:58,423 INFO L93 Difference]: Finished difference Result 50758 states and 164508 transitions. [2019-12-18 14:32:58,424 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-18 14:32:58,424 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-12-18 14:32:58,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:32:58,519 INFO L225 Difference]: With dead ends: 50758 [2019-12-18 14:32:58,520 INFO L226 Difference]: Without dead ends: 50338 [2019-12-18 14:32:58,520 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 14:32:58,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50338 states. [2019-12-18 14:32:59,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50338 to 35870. [2019-12-18 14:32:59,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35870 states. [2019-12-18 14:32:59,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35870 states to 35870 states and 118280 transitions. [2019-12-18 14:32:59,584 INFO L78 Accepts]: Start accepts. Automaton has 35870 states and 118280 transitions. Word has length 22 [2019-12-18 14:32:59,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:32:59,584 INFO L462 AbstractCegarLoop]: Abstraction has 35870 states and 118280 transitions. [2019-12-18 14:32:59,585 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 14:32:59,585 INFO L276 IsEmpty]: Start isEmpty. Operand 35870 states and 118280 transitions. [2019-12-18 14:32:59,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 14:32:59,596 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:32:59,596 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 14:32:59,597 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:32:59,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:32:59,597 INFO L82 PathProgramCache]: Analyzing trace with hash 400071569, now seen corresponding path program 1 times [2019-12-18 14:32:59,597 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:32:59,597 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1770773509] [2019-12-18 14:32:59,597 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:32:59,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:32:59,668 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 14:32:59,668 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1770773509] [2019-12-18 14:32:59,668 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:32:59,669 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 14:32:59,669 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [824595787] [2019-12-18 14:32:59,669 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 14:32:59,669 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:32:59,670 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 14:32:59,670 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 14:32:59,670 INFO L87 Difference]: Start difference. First operand 35870 states and 118280 transitions. Second operand 5 states. [2019-12-18 14:33:00,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:33:00,192 INFO L93 Difference]: Finished difference Result 49184 states and 158828 transitions. [2019-12-18 14:33:00,193 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 14:33:00,193 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2019-12-18 14:33:00,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:33:00,276 INFO L225 Difference]: With dead ends: 49184 [2019-12-18 14:33:00,276 INFO L226 Difference]: Without dead ends: 48744 [2019-12-18 14:33:00,276 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-18 14:33:00,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48744 states. [2019-12-18 14:33:01,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48744 to 39958. [2019-12-18 14:33:01,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39958 states. [2019-12-18 14:33:01,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39958 states to 39958 states and 131043 transitions. [2019-12-18 14:33:01,574 INFO L78 Accepts]: Start accepts. Automaton has 39958 states and 131043 transitions. Word has length 25 [2019-12-18 14:33:01,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:33:01,574 INFO L462 AbstractCegarLoop]: Abstraction has 39958 states and 131043 transitions. [2019-12-18 14:33:01,575 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 14:33:01,575 INFO L276 IsEmpty]: Start isEmpty. Operand 39958 states and 131043 transitions. [2019-12-18 14:33:01,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-18 14:33:01,592 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:33:01,592 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:33:01,592 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:33:01,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:33:01,593 INFO L82 PathProgramCache]: Analyzing trace with hash -819070516, now seen corresponding path program 1 times [2019-12-18 14:33:01,593 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:33:01,593 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1864599201] [2019-12-18 14:33:01,593 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:33:01,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:33:01,668 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 14:33:01,668 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1864599201] [2019-12-18 14:33:01,669 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:33:01,670 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 14:33:01,670 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1835675975] [2019-12-18 14:33:01,670 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 14:33:01,670 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:33:01,671 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 14:33:01,671 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 14:33:01,671 INFO L87 Difference]: Start difference. First operand 39958 states and 131043 transitions. Second operand 5 states. [2019-12-18 14:33:02,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:33:02,198 INFO L93 Difference]: Finished difference Result 50424 states and 163757 transitions. [2019-12-18 14:33:02,199 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 14:33:02,199 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2019-12-18 14:33:02,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:33:02,289 INFO L225 Difference]: With dead ends: 50424 [2019-12-18 14:33:02,289 INFO L226 Difference]: Without dead ends: 50050 [2019-12-18 14:33:02,289 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-18 14:33:02,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50050 states. [2019-12-18 14:33:02,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50050 to 41737. [2019-12-18 14:33:02,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41737 states. [2019-12-18 14:33:03,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41737 states to 41737 states and 136855 transitions. [2019-12-18 14:33:03,049 INFO L78 Accepts]: Start accepts. Automaton has 41737 states and 136855 transitions. Word has length 28 [2019-12-18 14:33:03,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:33:03,049 INFO L462 AbstractCegarLoop]: Abstraction has 41737 states and 136855 transitions. [2019-12-18 14:33:03,049 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 14:33:03,049 INFO L276 IsEmpty]: Start isEmpty. Operand 41737 states and 136855 transitions. [2019-12-18 14:33:03,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-18 14:33:03,070 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:33:03,070 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:33:03,071 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:33:03,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:33:03,071 INFO L82 PathProgramCache]: Analyzing trace with hash 377940687, now seen corresponding path program 1 times [2019-12-18 14:33:03,071 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:33:03,071 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1012040049] [2019-12-18 14:33:03,072 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:33:03,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:33:03,109 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 14:33:03,109 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1012040049] [2019-12-18 14:33:03,110 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:33:03,110 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 14:33:03,110 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1184514932] [2019-12-18 14:33:03,110 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 14:33:03,111 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:33:03,111 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 14:33:03,111 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 14:33:03,111 INFO L87 Difference]: Start difference. First operand 41737 states and 136855 transitions. Second operand 3 states. [2019-12-18 14:33:03,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:33:03,582 INFO L93 Difference]: Finished difference Result 52983 states and 172445 transitions. [2019-12-18 14:33:03,583 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 14:33:03,583 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2019-12-18 14:33:03,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:33:03,677 INFO L225 Difference]: With dead ends: 52983 [2019-12-18 14:33:03,677 INFO L226 Difference]: Without dead ends: 52983 [2019-12-18 14:33:03,677 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 14:33:03,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52983 states. [2019-12-18 14:33:04,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52983 to 43481. [2019-12-18 14:33:04,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43481 states. [2019-12-18 14:33:04,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43481 states to 43481 states and 140263 transitions. [2019-12-18 14:33:04,449 INFO L78 Accepts]: Start accepts. Automaton has 43481 states and 140263 transitions. Word has length 28 [2019-12-18 14:33:04,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:33:04,450 INFO L462 AbstractCegarLoop]: Abstraction has 43481 states and 140263 transitions. [2019-12-18 14:33:04,450 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 14:33:04,450 INFO L276 IsEmpty]: Start isEmpty. Operand 43481 states and 140263 transitions. [2019-12-18 14:33:04,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-12-18 14:33:04,468 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:33:04,469 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] [2019-12-18 14:33:04,469 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:33:04,469 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:33:04,469 INFO L82 PathProgramCache]: Analyzing trace with hash -589973380, now seen corresponding path program 1 times [2019-12-18 14:33:04,469 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:33:04,469 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1255362718] [2019-12-18 14:33:04,470 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:33:04,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:33:04,554 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 14:33:04,555 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1255362718] [2019-12-18 14:33:04,555 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:33:04,555 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 14:33:04,555 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1697191902] [2019-12-18 14:33:04,556 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 14:33:04,556 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:33:04,556 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 14:33:04,556 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 14:33:04,556 INFO L87 Difference]: Start difference. First operand 43481 states and 140263 transitions. Second operand 5 states. [2019-12-18 14:33:05,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:33:05,199 INFO L93 Difference]: Finished difference Result 54179 states and 173086 transitions. [2019-12-18 14:33:05,199 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 14:33:05,200 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 29 [2019-12-18 14:33:05,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:33:05,344 INFO L225 Difference]: With dead ends: 54179 [2019-12-18 14:33:05,345 INFO L226 Difference]: Without dead ends: 53785 [2019-12-18 14:33:05,345 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-18 14:33:06,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53785 states. [2019-12-18 14:33:06,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53785 to 42787. [2019-12-18 14:33:06,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42787 states. [2019-12-18 14:33:06,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42787 states to 42787 states and 137824 transitions. [2019-12-18 14:33:06,580 INFO L78 Accepts]: Start accepts. Automaton has 42787 states and 137824 transitions. Word has length 29 [2019-12-18 14:33:06,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:33:06,581 INFO L462 AbstractCegarLoop]: Abstraction has 42787 states and 137824 transitions. [2019-12-18 14:33:06,581 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 14:33:06,581 INFO L276 IsEmpty]: Start isEmpty. Operand 42787 states and 137824 transitions. [2019-12-18 14:33:06,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-12-18 14:33:06,599 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:33:06,599 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] [2019-12-18 14:33:06,599 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:33:06,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:33:06,600 INFO L82 PathProgramCache]: Analyzing trace with hash -934002539, now seen corresponding path program 1 times [2019-12-18 14:33:06,600 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:33:06,600 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [398277278] [2019-12-18 14:33:06,600 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:33:06,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:33:06,636 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 14:33:06,637 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [398277278] [2019-12-18 14:33:06,637 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:33:06,637 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 14:33:06,637 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [403361287] [2019-12-18 14:33:06,640 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 14:33:06,640 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:33:06,640 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 14:33:06,641 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 14:33:06,641 INFO L87 Difference]: Start difference. First operand 42787 states and 137824 transitions. Second operand 3 states. [2019-12-18 14:33:06,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:33:06,861 INFO L93 Difference]: Finished difference Result 62369 states and 203785 transitions. [2019-12-18 14:33:06,861 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 14:33:06,861 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2019-12-18 14:33:06,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:33:06,908 INFO L225 Difference]: With dead ends: 62369 [2019-12-18 14:33:06,909 INFO L226 Difference]: Without dead ends: 27708 [2019-12-18 14:33:06,910 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 14:33:07,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27708 states. [2019-12-18 14:33:07,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27708 to 26920. [2019-12-18 14:33:07,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26920 states. [2019-12-18 14:33:07,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26920 states to 26920 states and 86266 transitions. [2019-12-18 14:33:07,780 INFO L78 Accepts]: Start accepts. Automaton has 26920 states and 86266 transitions. Word has length 29 [2019-12-18 14:33:07,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:33:07,781 INFO L462 AbstractCegarLoop]: Abstraction has 26920 states and 86266 transitions. [2019-12-18 14:33:07,781 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 14:33:07,781 INFO L276 IsEmpty]: Start isEmpty. Operand 26920 states and 86266 transitions. [2019-12-18 14:33:07,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-12-18 14:33:07,793 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:33:07,794 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:33:07,794 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:33:07,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:33:07,794 INFO L82 PathProgramCache]: Analyzing trace with hash -2124026772, now seen corresponding path program 1 times [2019-12-18 14:33:07,794 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:33:07,794 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1656396990] [2019-12-18 14:33:07,794 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:33:07,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:33:07,840 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 14:33:07,840 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1656396990] [2019-12-18 14:33:07,840 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:33:07,841 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 14:33:07,841 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1063956497] [2019-12-18 14:33:07,841 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 14:33:07,841 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:33:07,842 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 14:33:07,842 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 14:33:07,842 INFO L87 Difference]: Start difference. First operand 26920 states and 86266 transitions. Second operand 4 states. [2019-12-18 14:33:08,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:33:08,010 INFO L93 Difference]: Finished difference Result 44120 states and 145060 transitions. [2019-12-18 14:33:08,010 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 14:33:08,010 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 30 [2019-12-18 14:33:08,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:33:08,047 INFO L225 Difference]: With dead ends: 44120 [2019-12-18 14:33:08,047 INFO L226 Difference]: Without dead ends: 21429 [2019-12-18 14:33:08,048 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 14:33:08,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21429 states. [2019-12-18 14:33:08,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21429 to 20333. [2019-12-18 14:33:08,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20333 states. [2019-12-18 14:33:08,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20333 states to 20333 states and 67715 transitions. [2019-12-18 14:33:08,418 INFO L78 Accepts]: Start accepts. Automaton has 20333 states and 67715 transitions. Word has length 30 [2019-12-18 14:33:08,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:33:08,418 INFO L462 AbstractCegarLoop]: Abstraction has 20333 states and 67715 transitions. [2019-12-18 14:33:08,418 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 14:33:08,418 INFO L276 IsEmpty]: Start isEmpty. Operand 20333 states and 67715 transitions. [2019-12-18 14:33:08,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-12-18 14:33:08,429 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:33:08,429 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:33:08,429 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:33:08,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:33:08,429 INFO L82 PathProgramCache]: Analyzing trace with hash -936488553, now seen corresponding path program 1 times [2019-12-18 14:33:08,430 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:33:08,430 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1466931749] [2019-12-18 14:33:08,430 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:33:08,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:33:08,525 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 14:33:08,526 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1466931749] [2019-12-18 14:33:08,526 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:33:08,526 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 14:33:08,526 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1567408643] [2019-12-18 14:33:08,527 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 14:33:08,527 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:33:08,527 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 14:33:08,527 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 14:33:08,527 INFO L87 Difference]: Start difference. First operand 20333 states and 67715 transitions. Second operand 5 states. [2019-12-18 14:33:09,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:33:09,161 INFO L93 Difference]: Finished difference Result 34767 states and 112990 transitions. [2019-12-18 14:33:09,161 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 14:33:09,161 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 30 [2019-12-18 14:33:09,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:33:09,219 INFO L225 Difference]: With dead ends: 34767 [2019-12-18 14:33:09,220 INFO L226 Difference]: Without dead ends: 34767 [2019-12-18 14:33:09,220 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 14:33:09,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34767 states. [2019-12-18 14:33:09,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34767 to 29090. [2019-12-18 14:33:09,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29090 states. [2019-12-18 14:33:10,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29090 states to 29090 states and 95089 transitions. [2019-12-18 14:33:10,001 INFO L78 Accepts]: Start accepts. Automaton has 29090 states and 95089 transitions. Word has length 30 [2019-12-18 14:33:10,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:33:10,001 INFO L462 AbstractCegarLoop]: Abstraction has 29090 states and 95089 transitions. [2019-12-18 14:33:10,001 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 14:33:10,001 INFO L276 IsEmpty]: Start isEmpty. Operand 29090 states and 95089 transitions. [2019-12-18 14:33:10,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-12-18 14:33:10,022 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:33:10,022 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] [2019-12-18 14:33:10,022 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:33:10,022 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:33:10,022 INFO L82 PathProgramCache]: Analyzing trace with hash -1151300207, now seen corresponding path program 1 times [2019-12-18 14:33:10,023 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:33:10,023 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [743570828] [2019-12-18 14:33:10,023 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:33:10,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:33:10,086 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 14:33:10,087 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [743570828] [2019-12-18 14:33:10,087 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:33:10,087 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 14:33:10,087 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [759067449] [2019-12-18 14:33:10,088 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 14:33:10,088 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:33:10,088 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 14:33:10,088 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-18 14:33:10,088 INFO L87 Difference]: Start difference. First operand 29090 states and 95089 transitions. Second operand 5 states. [2019-12-18 14:33:10,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:33:10,199 INFO L93 Difference]: Finished difference Result 13178 states and 39760 transitions. [2019-12-18 14:33:10,199 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 14:33:10,199 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 31 [2019-12-18 14:33:10,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:33:10,219 INFO L225 Difference]: With dead ends: 13178 [2019-12-18 14:33:10,220 INFO L226 Difference]: Without dead ends: 11110 [2019-12-18 14:33:10,220 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-18 14:33:10,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11110 states. [2019-12-18 14:33:10,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11110 to 10943. [2019-12-18 14:33:10,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10943 states. [2019-12-18 14:33:10,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10943 states to 10943 states and 32777 transitions. [2019-12-18 14:33:10,474 INFO L78 Accepts]: Start accepts. Automaton has 10943 states and 32777 transitions. Word has length 31 [2019-12-18 14:33:10,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:33:10,475 INFO L462 AbstractCegarLoop]: Abstraction has 10943 states and 32777 transitions. [2019-12-18 14:33:10,475 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 14:33:10,475 INFO L276 IsEmpty]: Start isEmpty. Operand 10943 states and 32777 transitions. [2019-12-18 14:33:10,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-18 14:33:10,489 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:33:10,490 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:33:10,490 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:33:10,490 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:33:10,490 INFO L82 PathProgramCache]: Analyzing trace with hash -134226549, now seen corresponding path program 1 times [2019-12-18 14:33:10,490 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:33:10,491 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [50766921] [2019-12-18 14:33:10,491 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:33:10,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:33:10,605 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 14:33:10,606 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [50766921] [2019-12-18 14:33:10,606 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:33:10,606 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 14:33:10,606 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [70408228] [2019-12-18 14:33:10,607 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 14:33:10,607 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:33:10,607 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 14:33:10,607 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-18 14:33:10,607 INFO L87 Difference]: Start difference. First operand 10943 states and 32777 transitions. Second operand 6 states. [2019-12-18 14:33:10,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:33:10,831 INFO L93 Difference]: Finished difference Result 11069 states and 33011 transitions. [2019-12-18 14:33:10,832 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 14:33:10,832 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 40 [2019-12-18 14:33:10,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:33:10,847 INFO L225 Difference]: With dead ends: 11069 [2019-12-18 14:33:10,847 INFO L226 Difference]: Without dead ends: 10842 [2019-12-18 14:33:10,847 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 3 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-18 14:33:10,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10842 states. [2019-12-18 14:33:10,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10842 to 10842. [2019-12-18 14:33:10,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10842 states. [2019-12-18 14:33:11,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10842 states to 10842 states and 32566 transitions. [2019-12-18 14:33:11,002 INFO L78 Accepts]: Start accepts. Automaton has 10842 states and 32566 transitions. Word has length 40 [2019-12-18 14:33:11,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:33:11,002 INFO L462 AbstractCegarLoop]: Abstraction has 10842 states and 32566 transitions. [2019-12-18 14:33:11,002 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 14:33:11,002 INFO L276 IsEmpty]: Start isEmpty. Operand 10842 states and 32566 transitions. [2019-12-18 14:33:11,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-18 14:33:11,014 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:33:11,014 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:33:11,014 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:33:11,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:33:11,014 INFO L82 PathProgramCache]: Analyzing trace with hash 809189858, now seen corresponding path program 1 times [2019-12-18 14:33:11,014 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:33:11,014 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [764552046] [2019-12-18 14:33:11,015 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:33:11,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:33:11,095 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 14:33:11,095 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [764552046] [2019-12-18 14:33:11,096 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:33:11,096 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 14:33:11,096 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1846274895] [2019-12-18 14:33:11,096 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 14:33:11,096 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:33:11,097 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 14:33:11,097 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-18 14:33:11,097 INFO L87 Difference]: Start difference. First operand 10842 states and 32566 transitions. Second operand 6 states. [2019-12-18 14:33:11,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:33:11,903 INFO L93 Difference]: Finished difference Result 20964 states and 62804 transitions. [2019-12-18 14:33:11,903 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-18 14:33:11,904 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 40 [2019-12-18 14:33:11,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:33:11,933 INFO L225 Difference]: With dead ends: 20964 [2019-12-18 14:33:11,934 INFO L226 Difference]: Without dead ends: 20964 [2019-12-18 14:33:11,934 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-12-18 14:33:11,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20964 states. [2019-12-18 14:33:12,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20964 to 13761. [2019-12-18 14:33:12,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13761 states. [2019-12-18 14:33:12,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13761 states to 13761 states and 41473 transitions. [2019-12-18 14:33:12,194 INFO L78 Accepts]: Start accepts. Automaton has 13761 states and 41473 transitions. Word has length 40 [2019-12-18 14:33:12,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:33:12,194 INFO L462 AbstractCegarLoop]: Abstraction has 13761 states and 41473 transitions. [2019-12-18 14:33:12,195 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 14:33:12,195 INFO L276 IsEmpty]: Start isEmpty. Operand 13761 states and 41473 transitions. [2019-12-18 14:33:12,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-18 14:33:12,210 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:33:12,210 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:33:12,211 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:33:12,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:33:12,211 INFO L82 PathProgramCache]: Analyzing trace with hash -2114152388, now seen corresponding path program 2 times [2019-12-18 14:33:12,211 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:33:12,211 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1543542400] [2019-12-18 14:33:12,211 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:33:12,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:33:12,310 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 14:33:12,311 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1543542400] [2019-12-18 14:33:12,311 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:33:12,311 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 14:33:12,311 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [370328095] [2019-12-18 14:33:12,312 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 14:33:12,312 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:33:12,312 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 14:33:12,312 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-18 14:33:12,313 INFO L87 Difference]: Start difference. First operand 13761 states and 41473 transitions. Second operand 7 states. [2019-12-18 14:33:13,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:33:13,461 INFO L93 Difference]: Finished difference Result 23178 states and 68867 transitions. [2019-12-18 14:33:13,462 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-18 14:33:13,462 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 40 [2019-12-18 14:33:13,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:33:13,491 INFO L225 Difference]: With dead ends: 23178 [2019-12-18 14:33:13,491 INFO L226 Difference]: Without dead ends: 23178 [2019-12-18 14:33:13,492 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2019-12-18 14:33:13,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23178 states. [2019-12-18 14:33:13,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23178 to 13796. [2019-12-18 14:33:13,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13796 states. [2019-12-18 14:33:13,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13796 states to 13796 states and 41573 transitions. [2019-12-18 14:33:13,739 INFO L78 Accepts]: Start accepts. Automaton has 13796 states and 41573 transitions. Word has length 40 [2019-12-18 14:33:13,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:33:13,739 INFO L462 AbstractCegarLoop]: Abstraction has 13796 states and 41573 transitions. [2019-12-18 14:33:13,739 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 14:33:13,739 INFO L276 IsEmpty]: Start isEmpty. Operand 13796 states and 41573 transitions. [2019-12-18 14:33:13,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-18 14:33:13,753 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:33:13,753 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:33:13,753 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:33:13,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:33:13,753 INFO L82 PathProgramCache]: Analyzing trace with hash -582218170, now seen corresponding path program 3 times [2019-12-18 14:33:13,753 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:33:13,754 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [247734789] [2019-12-18 14:33:13,754 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:33:13,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:33:13,863 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 14:33:13,864 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [247734789] [2019-12-18 14:33:13,864 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:33:13,864 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 14:33:13,864 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1678955920] [2019-12-18 14:33:13,865 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 14:33:13,865 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:33:13,865 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 14:33:13,865 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-12-18 14:33:13,866 INFO L87 Difference]: Start difference. First operand 13796 states and 41573 transitions. Second operand 7 states. [2019-12-18 14:33:14,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:33:14,570 INFO L93 Difference]: Finished difference Result 18988 states and 55814 transitions. [2019-12-18 14:33:14,571 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-18 14:33:14,572 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 40 [2019-12-18 14:33:14,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:33:14,597 INFO L225 Difference]: With dead ends: 18988 [2019-12-18 14:33:14,597 INFO L226 Difference]: Without dead ends: 18988 [2019-12-18 14:33:14,597 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 3 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-12-18 14:33:14,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18988 states. [2019-12-18 14:33:14,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18988 to 13856. [2019-12-18 14:33:14,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13856 states. [2019-12-18 14:33:14,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13856 states to 13856 states and 41743 transitions. [2019-12-18 14:33:14,829 INFO L78 Accepts]: Start accepts. Automaton has 13856 states and 41743 transitions. Word has length 40 [2019-12-18 14:33:14,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:33:14,830 INFO L462 AbstractCegarLoop]: Abstraction has 13856 states and 41743 transitions. [2019-12-18 14:33:14,830 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 14:33:14,830 INFO L276 IsEmpty]: Start isEmpty. Operand 13856 states and 41743 transitions. [2019-12-18 14:33:14,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-12-18 14:33:14,844 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:33:14,844 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:33:14,845 INFO L410 AbstractCegarLoop]: === Iteration 24 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:33:14,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:33:14,845 INFO L82 PathProgramCache]: Analyzing trace with hash -1136448647, now seen corresponding path program 1 times [2019-12-18 14:33:14,845 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:33:14,845 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [960724077] [2019-12-18 14:33:14,845 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:33:14,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:33:14,929 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 14:33:14,929 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [960724077] [2019-12-18 14:33:14,929 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:33:14,929 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 14:33:14,930 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1244201148] [2019-12-18 14:33:14,930 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 14:33:14,930 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:33:14,930 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 14:33:14,931 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-18 14:33:14,931 INFO L87 Difference]: Start difference. First operand 13856 states and 41743 transitions. Second operand 6 states. [2019-12-18 14:33:15,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:33:15,165 INFO L93 Difference]: Finished difference Result 13842 states and 41710 transitions. [2019-12-18 14:33:15,165 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 14:33:15,165 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 41 [2019-12-18 14:33:15,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:33:15,183 INFO L225 Difference]: With dead ends: 13842 [2019-12-18 14:33:15,184 INFO L226 Difference]: Without dead ends: 13501 [2019-12-18 14:33:15,184 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-18 14:33:15,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13501 states. [2019-12-18 14:33:15,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13501 to 13501. [2019-12-18 14:33:15,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13501 states. [2019-12-18 14:33:15,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13501 states to 13501 states and 41055 transitions. [2019-12-18 14:33:15,378 INFO L78 Accepts]: Start accepts. Automaton has 13501 states and 41055 transitions. Word has length 41 [2019-12-18 14:33:15,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:33:15,378 INFO L462 AbstractCegarLoop]: Abstraction has 13501 states and 41055 transitions. [2019-12-18 14:33:15,378 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 14:33:15,378 INFO L276 IsEmpty]: Start isEmpty. Operand 13501 states and 41055 transitions. [2019-12-18 14:33:15,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-12-18 14:33:15,392 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:33:15,392 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:33:15,393 INFO L410 AbstractCegarLoop]: === Iteration 25 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:33:15,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:33:15,393 INFO L82 PathProgramCache]: Analyzing trace with hash 1425122982, now seen corresponding path program 1 times [2019-12-18 14:33:15,393 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:33:15,393 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1045838058] [2019-12-18 14:33:15,393 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:33:15,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:33:15,444 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 14:33:15,445 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1045838058] [2019-12-18 14:33:15,445 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:33:15,445 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 14:33:15,445 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1730291587] [2019-12-18 14:33:15,445 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 14:33:15,446 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:33:15,446 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 14:33:15,446 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 14:33:15,446 INFO L87 Difference]: Start difference. First operand 13501 states and 41055 transitions. Second operand 3 states. [2019-12-18 14:33:15,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:33:15,494 INFO L93 Difference]: Finished difference Result 10187 states and 30316 transitions. [2019-12-18 14:33:15,494 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 14:33:15,494 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 41 [2019-12-18 14:33:15,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:33:15,512 INFO L225 Difference]: With dead ends: 10187 [2019-12-18 14:33:15,512 INFO L226 Difference]: Without dead ends: 10187 [2019-12-18 14:33:15,513 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 14:33:15,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10187 states. [2019-12-18 14:33:15,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10187 to 10179. [2019-12-18 14:33:15,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10179 states. [2019-12-18 14:33:15,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10179 states to 10179 states and 30296 transitions. [2019-12-18 14:33:15,755 INFO L78 Accepts]: Start accepts. Automaton has 10179 states and 30296 transitions. Word has length 41 [2019-12-18 14:33:15,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:33:15,755 INFO L462 AbstractCegarLoop]: Abstraction has 10179 states and 30296 transitions. [2019-12-18 14:33:15,755 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 14:33:15,756 INFO L276 IsEmpty]: Start isEmpty. Operand 10179 states and 30296 transitions. [2019-12-18 14:33:15,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-12-18 14:33:15,775 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:33:15,775 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:33:15,775 INFO L410 AbstractCegarLoop]: === Iteration 26 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:33:15,775 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:33:15,776 INFO L82 PathProgramCache]: Analyzing trace with hash -1212552046, now seen corresponding path program 1 times [2019-12-18 14:33:15,776 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:33:15,776 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1658188416] [2019-12-18 14:33:15,776 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:33:15,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:33:15,871 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 14:33:15,871 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1658188416] [2019-12-18 14:33:15,871 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:33:15,872 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 14:33:15,872 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1446941294] [2019-12-18 14:33:15,872 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 14:33:15,873 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:33:15,873 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 14:33:15,873 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-18 14:33:15,873 INFO L87 Difference]: Start difference. First operand 10179 states and 30296 transitions. Second operand 6 states. [2019-12-18 14:33:16,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:33:16,110 INFO L93 Difference]: Finished difference Result 9188 states and 27748 transitions. [2019-12-18 14:33:16,110 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 14:33:16,111 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 41 [2019-12-18 14:33:16,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:33:16,128 INFO L225 Difference]: With dead ends: 9188 [2019-12-18 14:33:16,129 INFO L226 Difference]: Without dead ends: 9032 [2019-12-18 14:33:16,129 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2019-12-18 14:33:16,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9032 states. [2019-12-18 14:33:16,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9032 to 8630. [2019-12-18 14:33:16,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8630 states. [2019-12-18 14:33:16,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8630 states to 8630 states and 26283 transitions. [2019-12-18 14:33:16,376 INFO L78 Accepts]: Start accepts. Automaton has 8630 states and 26283 transitions. Word has length 41 [2019-12-18 14:33:16,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:33:16,376 INFO L462 AbstractCegarLoop]: Abstraction has 8630 states and 26283 transitions. [2019-12-18 14:33:16,376 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 14:33:16,377 INFO L276 IsEmpty]: Start isEmpty. Operand 8630 states and 26283 transitions. [2019-12-18 14:33:16,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-18 14:33:16,390 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:33:16,391 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:33:16,391 INFO L410 AbstractCegarLoop]: === Iteration 27 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:33:16,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:33:16,391 INFO L82 PathProgramCache]: Analyzing trace with hash 1879967444, now seen corresponding path program 1 times [2019-12-18 14:33:16,391 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:33:16,392 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [557749735] [2019-12-18 14:33:16,392 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:33:16,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:33:16,496 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 14:33:16,496 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [557749735] [2019-12-18 14:33:16,497 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:33:16,497 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 14:33:16,497 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [135284943] [2019-12-18 14:33:16,498 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 14:33:16,498 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:33:16,498 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 14:33:16,498 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-12-18 14:33:16,498 INFO L87 Difference]: Start difference. First operand 8630 states and 26283 transitions. Second operand 9 states. [2019-12-18 14:33:17,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:33:17,581 INFO L93 Difference]: Finished difference Result 17140 states and 51169 transitions. [2019-12-18 14:33:17,581 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-12-18 14:33:17,582 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 55 [2019-12-18 14:33:17,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:33:17,607 INFO L225 Difference]: With dead ends: 17140 [2019-12-18 14:33:17,607 INFO L226 Difference]: Without dead ends: 11109 [2019-12-18 14:33:17,608 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=105, Invalid=401, Unknown=0, NotChecked=0, Total=506 [2019-12-18 14:33:17,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11109 states. [2019-12-18 14:33:17,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11109 to 10235. [2019-12-18 14:33:17,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10235 states. [2019-12-18 14:33:17,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10235 states to 10235 states and 30469 transitions. [2019-12-18 14:33:17,863 INFO L78 Accepts]: Start accepts. Automaton has 10235 states and 30469 transitions. Word has length 55 [2019-12-18 14:33:17,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:33:17,863 INFO L462 AbstractCegarLoop]: Abstraction has 10235 states and 30469 transitions. [2019-12-18 14:33:17,864 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 14:33:17,864 INFO L276 IsEmpty]: Start isEmpty. Operand 10235 states and 30469 transitions. [2019-12-18 14:33:17,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-18 14:33:17,879 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:33:17,879 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 14:33:17,879 INFO L410 AbstractCegarLoop]: === Iteration 28 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:33:17,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:33:17,879 INFO L82 PathProgramCache]: Analyzing trace with hash 1331122226, now seen corresponding path program 2 times [2019-12-18 14:33:17,880 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:33:17,880 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [157949377] [2019-12-18 14:33:17,880 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:33:17,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:33:18,008 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 14:33:18,009 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [157949377] [2019-12-18 14:33:18,009 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:33:18,010 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-18 14:33:18,010 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1652908083] [2019-12-18 14:33:18,010 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 14:33:18,011 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:33:18,011 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 14:33:18,011 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-18 14:33:18,011 INFO L87 Difference]: Start difference. First operand 10235 states and 30469 transitions. Second operand 9 states. [2019-12-18 14:33:19,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:33:19,196 INFO L93 Difference]: Finished difference Result 16210 states and 47272 transitions. [2019-12-18 14:33:19,197 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-18 14:33:19,197 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 55 [2019-12-18 14:33:19,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:33:19,219 INFO L225 Difference]: With dead ends: 16210 [2019-12-18 14:33:19,219 INFO L226 Difference]: Without dead ends: 16210 [2019-12-18 14:33:19,220 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2019-12-18 14:33:19,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16210 states. [2019-12-18 14:33:19,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16210 to 11291. [2019-12-18 14:33:19,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11291 states. [2019-12-18 14:33:19,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11291 states to 11291 states and 33513 transitions. [2019-12-18 14:33:19,411 INFO L78 Accepts]: Start accepts. Automaton has 11291 states and 33513 transitions. Word has length 55 [2019-12-18 14:33:19,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:33:19,411 INFO L462 AbstractCegarLoop]: Abstraction has 11291 states and 33513 transitions. [2019-12-18 14:33:19,411 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 14:33:19,411 INFO L276 IsEmpty]: Start isEmpty. Operand 11291 states and 33513 transitions. [2019-12-18 14:33:19,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-18 14:33:19,428 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:33:19,428 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 14:33:19,429 INFO L410 AbstractCegarLoop]: === Iteration 29 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:33:19,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:33:19,429 INFO L82 PathProgramCache]: Analyzing trace with hash 1675553042, now seen corresponding path program 3 times [2019-12-18 14:33:19,429 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:33:19,429 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [802014067] [2019-12-18 14:33:19,429 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:33:19,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:33:19,967 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 14:33:19,967 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [802014067] [2019-12-18 14:33:19,967 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:33:19,967 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-12-18 14:33:19,967 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1826368941] [2019-12-18 14:33:19,968 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-12-18 14:33:19,968 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:33:19,968 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-12-18 14:33:19,968 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=233, Unknown=0, NotChecked=0, Total=272 [2019-12-18 14:33:19,969 INFO L87 Difference]: Start difference. First operand 11291 states and 33513 transitions. Second operand 17 states. [2019-12-18 14:33:22,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:33:22,250 INFO L93 Difference]: Finished difference Result 12985 states and 38194 transitions. [2019-12-18 14:33:22,251 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-12-18 14:33:22,251 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 55 [2019-12-18 14:33:22,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:33:22,268 INFO L225 Difference]: With dead ends: 12985 [2019-12-18 14:33:22,268 INFO L226 Difference]: Without dead ends: 12163 [2019-12-18 14:33:22,269 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 321 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=234, Invalid=1406, Unknown=0, NotChecked=0, Total=1640 [2019-12-18 14:33:22,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12163 states. [2019-12-18 14:33:22,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12163 to 11712. [2019-12-18 14:33:22,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11712 states. [2019-12-18 14:33:22,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11712 states to 11712 states and 34606 transitions. [2019-12-18 14:33:22,429 INFO L78 Accepts]: Start accepts. Automaton has 11712 states and 34606 transitions. Word has length 55 [2019-12-18 14:33:22,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:33:22,430 INFO L462 AbstractCegarLoop]: Abstraction has 11712 states and 34606 transitions. [2019-12-18 14:33:22,430 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-12-18 14:33:22,430 INFO L276 IsEmpty]: Start isEmpty. Operand 11712 states and 34606 transitions. [2019-12-18 14:33:22,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-18 14:33:22,441 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:33:22,441 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 14:33:22,441 INFO L410 AbstractCegarLoop]: === Iteration 30 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:33:22,441 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:33:22,441 INFO L82 PathProgramCache]: Analyzing trace with hash -17231120, now seen corresponding path program 4 times [2019-12-18 14:33:22,441 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:33:22,442 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1843851814] [2019-12-18 14:33:22,442 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:33:22,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:33:22,591 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 14:33:22,591 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1843851814] [2019-12-18 14:33:22,594 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:33:22,594 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-18 14:33:22,594 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [635493373] [2019-12-18 14:33:22,594 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-18 14:33:22,595 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:33:22,595 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-18 14:33:22,595 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-18 14:33:22,595 INFO L87 Difference]: Start difference. First operand 11712 states and 34606 transitions. Second operand 11 states. [2019-12-18 14:33:23,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:33:23,488 INFO L93 Difference]: Finished difference Result 18356 states and 53635 transitions. [2019-12-18 14:33:23,489 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-18 14:33:23,489 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 55 [2019-12-18 14:33:23,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:33:23,507 INFO L225 Difference]: With dead ends: 18356 [2019-12-18 14:33:23,507 INFO L226 Difference]: Without dead ends: 12602 [2019-12-18 14:33:23,508 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 192 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=183, Invalid=747, Unknown=0, NotChecked=0, Total=930 [2019-12-18 14:33:23,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12602 states. [2019-12-18 14:33:23,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12602 to 11164. [2019-12-18 14:33:23,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11164 states. [2019-12-18 14:33:23,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11164 states to 11164 states and 32935 transitions. [2019-12-18 14:33:23,684 INFO L78 Accepts]: Start accepts. Automaton has 11164 states and 32935 transitions. Word has length 55 [2019-12-18 14:33:23,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:33:23,684 INFO L462 AbstractCegarLoop]: Abstraction has 11164 states and 32935 transitions. [2019-12-18 14:33:23,684 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-18 14:33:23,684 INFO L276 IsEmpty]: Start isEmpty. Operand 11164 states and 32935 transitions. [2019-12-18 14:33:23,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-18 14:33:23,696 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:33:23,696 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 14:33:23,697 INFO L410 AbstractCegarLoop]: === Iteration 31 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:33:23,697 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:33:23,697 INFO L82 PathProgramCache]: Analyzing trace with hash 1658904824, now seen corresponding path program 5 times [2019-12-18 14:33:23,697 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:33:23,697 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1694173520] [2019-12-18 14:33:23,697 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:33:23,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:33:23,829 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 14:33:23,829 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1694173520] [2019-12-18 14:33:23,830 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:33:23,830 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-18 14:33:23,830 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1636759845] [2019-12-18 14:33:23,830 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 14:33:23,830 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:33:23,831 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 14:33:23,831 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-12-18 14:33:23,831 INFO L87 Difference]: Start difference. First operand 11164 states and 32935 transitions. Second operand 9 states. [2019-12-18 14:33:25,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:33:25,287 INFO L93 Difference]: Finished difference Result 18256 states and 52744 transitions. [2019-12-18 14:33:25,288 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-18 14:33:25,288 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 55 [2019-12-18 14:33:25,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:33:25,312 INFO L225 Difference]: With dead ends: 18256 [2019-12-18 14:33:25,312 INFO L226 Difference]: Without dead ends: 18256 [2019-12-18 14:33:25,313 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=69, Invalid=237, Unknown=0, NotChecked=0, Total=306 [2019-12-18 14:33:25,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18256 states. [2019-12-18 14:33:25,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18256 to 10801. [2019-12-18 14:33:25,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10801 states. [2019-12-18 14:33:25,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10801 states to 10801 states and 31956 transitions. [2019-12-18 14:33:25,514 INFO L78 Accepts]: Start accepts. Automaton has 10801 states and 31956 transitions. Word has length 55 [2019-12-18 14:33:25,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:33:25,514 INFO L462 AbstractCegarLoop]: Abstraction has 10801 states and 31956 transitions. [2019-12-18 14:33:25,514 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 14:33:25,514 INFO L276 IsEmpty]: Start isEmpty. Operand 10801 states and 31956 transitions. [2019-12-18 14:33:25,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-18 14:33:25,526 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:33:25,526 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 14:33:25,526 INFO L410 AbstractCegarLoop]: === Iteration 32 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:33:25,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:33:25,527 INFO L82 PathProgramCache]: Analyzing trace with hash 677875510, now seen corresponding path program 6 times [2019-12-18 14:33:25,527 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:33:25,527 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1144892503] [2019-12-18 14:33:25,527 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:33:25,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:33:25,584 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 14:33:25,584 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1144892503] [2019-12-18 14:33:25,584 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:33:25,584 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 14:33:25,585 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [20085513] [2019-12-18 14:33:25,585 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 14:33:25,585 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:33:25,585 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 14:33:25,586 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 14:33:25,586 INFO L87 Difference]: Start difference. First operand 10801 states and 31956 transitions. Second operand 3 states. [2019-12-18 14:33:25,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:33:25,634 INFO L93 Difference]: Finished difference Result 10799 states and 31951 transitions. [2019-12-18 14:33:25,634 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 14:33:25,634 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 55 [2019-12-18 14:33:25,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:33:25,649 INFO L225 Difference]: With dead ends: 10799 [2019-12-18 14:33:25,650 INFO L226 Difference]: Without dead ends: 10799 [2019-12-18 14:33:25,650 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 14:33:25,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10799 states. [2019-12-18 14:33:25,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10799 to 8674. [2019-12-18 14:33:25,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8674 states. [2019-12-18 14:33:25,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8674 states to 8674 states and 25965 transitions. [2019-12-18 14:33:25,852 INFO L78 Accepts]: Start accepts. Automaton has 8674 states and 25965 transitions. Word has length 55 [2019-12-18 14:33:25,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:33:25,853 INFO L462 AbstractCegarLoop]: Abstraction has 8674 states and 25965 transitions. [2019-12-18 14:33:25,853 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 14:33:25,853 INFO L276 IsEmpty]: Start isEmpty. Operand 8674 states and 25965 transitions. [2019-12-18 14:33:25,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-18 14:33:25,862 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:33:25,862 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:33:25,862 INFO L410 AbstractCegarLoop]: === Iteration 33 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:33:25,862 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:33:25,862 INFO L82 PathProgramCache]: Analyzing trace with hash 918799478, now seen corresponding path program 1 times [2019-12-18 14:33:25,863 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:33:25,863 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1220711150] [2019-12-18 14:33:25,863 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:33:25,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:33:26,013 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 14:33:26,014 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1220711150] [2019-12-18 14:33:26,014 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:33:26,014 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-18 14:33:26,014 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [880446273] [2019-12-18 14:33:26,015 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-18 14:33:26,015 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:33:26,015 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-18 14:33:26,015 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2019-12-18 14:33:26,015 INFO L87 Difference]: Start difference. First operand 8674 states and 25965 transitions. Second operand 12 states. [2019-12-18 14:33:26,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:33:26,728 INFO L93 Difference]: Finished difference Result 9880 states and 28998 transitions. [2019-12-18 14:33:26,729 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-18 14:33:26,729 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 56 [2019-12-18 14:33:26,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:33:26,744 INFO L225 Difference]: With dead ends: 9880 [2019-12-18 14:33:26,744 INFO L226 Difference]: Without dead ends: 9238 [2019-12-18 14:33:26,745 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=133, Invalid=569, Unknown=0, NotChecked=0, Total=702 [2019-12-18 14:33:26,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9238 states. [2019-12-18 14:33:26,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9238 to 8384. [2019-12-18 14:33:26,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8384 states. [2019-12-18 14:33:26,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8384 states to 8384 states and 25211 transitions. [2019-12-18 14:33:26,884 INFO L78 Accepts]: Start accepts. Automaton has 8384 states and 25211 transitions. Word has length 56 [2019-12-18 14:33:26,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:33:26,884 INFO L462 AbstractCegarLoop]: Abstraction has 8384 states and 25211 transitions. [2019-12-18 14:33:26,884 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-18 14:33:26,885 INFO L276 IsEmpty]: Start isEmpty. Operand 8384 states and 25211 transitions. [2019-12-18 14:33:26,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-18 14:33:26,894 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:33:26,895 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:33:26,895 INFO L410 AbstractCegarLoop]: === Iteration 34 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:33:26,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:33:26,895 INFO L82 PathProgramCache]: Analyzing trace with hash 1649345490, now seen corresponding path program 2 times [2019-12-18 14:33:26,895 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:33:26,895 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1206663891] [2019-12-18 14:33:26,895 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:33:26,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 14:33:26,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 14:33:26,994 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-18 14:33:26,994 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-18 14:33:26,998 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [808] [808] ULTIMATE.startENTRY-->L818: Formula: (let ((.cse0 (store |v_#valid_64| 0 0))) (and (= 0 v_~x$read_delayed_var~0.base_6) (= v_~x$r_buff1_thd1~0_448 0) (= 0 v_~x$read_delayed_var~0.offset_6) (= 0 v_~x$w_buff1_used~0_643) (= 0 v_~x~0_243) (= v_~__unbuffered_p2_EBX~0_64 0) (= 0 v_~__unbuffered_p0_EAX~0_82) (= 0 v_~x$r_buff1_thd2~0_283) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t1897~0.base_26|)) (= v_~x$flush_delayed~0_67 0) (= 0 v_~__unbuffered_p2_EAX~0_64) (< |v_#StackHeapBarrier_17| |v_ULTIMATE.start_main_~#t1897~0.base_26|) (= v_~main$tmp_guard1~0_51 0) (= v_~main$tmp_guard0~0_41 0) (< 0 |v_#StackHeapBarrier_17|) (= v_~x$r_buff1_thd0~0_322 0) (= 0 v_~x$w_buff1~0_350) (= v_~weak$$choice2~0_208 0) (= 0 v_~x$w_buff0~0_432) (= 0 v_~x$read_delayed~0_6) (= 0 v_~__unbuffered_cnt~0_96) (= 0 v_~x$r_buff0_thd3~0_150) (= v_~x$r_buff0_thd1~0_385 0) (= 0 v_~x$r_buff1_thd3~0_288) (= |v_#valid_62| (store .cse0 |v_ULTIMATE.start_main_~#t1897~0.base_26| 1)) (= v_~x$mem_tmp~0_44 0) (= 0 v_~x$r_buff0_thd2~0_345) (= |v_#NULL.offset_5| 0) (= 0 v_~x$w_buff0_used~0_952) (= (store |v_#length_24| |v_ULTIMATE.start_main_~#t1897~0.base_26| 4) |v_#length_23|) (= v_~x$r_buff0_thd0~0_164 0) (= 0 v_~weak$$choice0~0_40) (= v_~y~0_300 0) (= 0 |v_ULTIMATE.start_main_~#t1897~0.offset_20|) (= (store |v_#memory_int_24| |v_ULTIMATE.start_main_~#t1897~0.base_26| (store (select |v_#memory_int_24| |v_ULTIMATE.start_main_~#t1897~0.base_26|) |v_ULTIMATE.start_main_~#t1897~0.offset_20| 0)) |v_#memory_int_23|) (= 0 |v_#NULL.base_5|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_17|, #valid=|v_#valid_64|, #memory_int=|v_#memory_int_24|, #length=|v_#length_24|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_432, ~x$flush_delayed~0=v_~x$flush_delayed~0_67, #NULL.offset=|v_#NULL.offset_5|, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_448, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_150, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_40|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_34|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_82, ULTIMATE.start_main_~#t1899~0.base=|v_ULTIMATE.start_main_~#t1899~0.base_21|, #length=|v_#length_23|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_64, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_164, ULTIMATE.start_main_~#t1898~0.base=|v_ULTIMATE.start_main_~#t1898~0.base_27|, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_64, ~x$w_buff1~0=v_~x$w_buff1~0_350, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_643, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_283, ~x$read_delayed_var~0.base=v_~x$read_delayed_var~0.base_6, ~weak$$choice0~0=v_~weak$$choice0~0_40, #StackHeapBarrier=|v_#StackHeapBarrier_17|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_96, ~x~0=v_~x~0_243, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_385, ULTIMATE.start_main_~#t1897~0.offset=|v_ULTIMATE.start_main_~#t1897~0.offset_20|, ULTIMATE.start_main_~#t1897~0.base=|v_ULTIMATE.start_main_~#t1897~0.base_26|, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_106|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_288, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_51, ~x$mem_tmp~0=v_~x$mem_tmp~0_44, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_51|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_60|, ~y~0=v_~y~0_300, ULTIMATE.start_main_#t~nondet40=|v_ULTIMATE.start_main_#t~nondet40_15|, ULTIMATE.start_main_~#t1898~0.offset=|v_ULTIMATE.start_main_~#t1898~0.offset_20|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_41, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_322, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_345, #NULL.base=|v_#NULL.base_5|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_952, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_60|, ~x$read_delayed_var~0.offset=v_~x$read_delayed_var~0.offset_6, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_20|, #valid=|v_#valid_62|, #memory_int=|v_#memory_int_23|, ULTIMATE.start_main_~#t1899~0.offset=|v_ULTIMATE.start_main_~#t1899~0.offset_14|, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_8|, ~weak$$choice2~0=v_~weak$$choice2~0_208, ~x$read_delayed~0=v_~x$read_delayed~0_6} AuxVars[] AssignedVars[~x$w_buff0~0, ~x$r_buff0_thd1~0, ULTIMATE.start_main_~#t1897~0.offset, ~x$flush_delayed~0, ULTIMATE.start_main_~#t1897~0.base, #NULL.offset, ULTIMATE.start_main_#t~ite46, ~x$r_buff1_thd3~0, ~x$r_buff1_thd1~0, ~main$tmp_guard1~0, ~x$r_buff0_thd3~0, ~x$mem_tmp~0, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_#t~ite44, ~__unbuffered_p0_EAX~0, ULTIMATE.start_main_~#t1899~0.base, #length, ~__unbuffered_p2_EAX~0, ~y~0, ~x$r_buff0_thd0~0, ULTIMATE.start_main_~#t1898~0.base, ULTIMATE.start_main_#t~nondet40, ~__unbuffered_p2_EBX~0, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd2~0, ULTIMATE.start_main_~#t1898~0.offset, ~main$tmp_guard0~0, ~x$r_buff1_thd0~0, ~x$r_buff0_thd2~0, ~x$read_delayed_var~0.base, #NULL.base, ~x$w_buff0_used~0, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite41, ~x$read_delayed_var~0.offset, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_main_#t~nondet38, #memory_int, ULTIMATE.start_main_~#t1899~0.offset, ~__unbuffered_cnt~0, ULTIMATE.start_main_#t~nondet39, ~weak$$choice2~0, ~x~0, ~x$read_delayed~0] because there is no mapped edge [2019-12-18 14:33:26,999 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [777] [777] L818-1-->L820: Formula: (and (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1898~0.base_10| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1898~0.base_10|) |v_ULTIMATE.start_main_~#t1898~0.offset_9| 1)) |v_#memory_int_15|) (= 0 |v_ULTIMATE.start_main_~#t1898~0.offset_9|) (not (= 0 |v_ULTIMATE.start_main_~#t1898~0.base_10|)) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t1898~0.base_10|) (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t1898~0.base_10| 4)) (= 0 (select |v_#valid_32| |v_ULTIMATE.start_main_~#t1898~0.base_10|)) (= |v_#valid_31| (store |v_#valid_32| |v_ULTIMATE.start_main_~#t1898~0.base_10| 1))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_32|, #memory_int=|v_#memory_int_16|, #length=|v_#length_16|} OutVars{ULTIMATE.start_main_~#t1898~0.base=|v_ULTIMATE.start_main_~#t1898~0.base_10|, #StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_31|, #memory_int=|v_#memory_int_15|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_4|, ULTIMATE.start_main_~#t1898~0.offset=|v_ULTIMATE.start_main_~#t1898~0.offset_9|, #length=|v_#length_15|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1898~0.base, #valid, #memory_int, ULTIMATE.start_main_#t~nondet38, ULTIMATE.start_main_~#t1898~0.offset, #length] because there is no mapped edge [2019-12-18 14:33:26,999 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [672] [672] P1ENTRY-->L5-3: Formula: (and (= (mod v_~x$w_buff1_used~0_45 256) 0) (= v_P1Thread1of1ForFork0___VERIFIER_assert_~expression_10 |v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression_8|) (= 1 v_~x$w_buff0_used~0_82) (= v_P1Thread1of1ForFork0_~arg.offset_8 |v_P1Thread1of1ForFork0_#in~arg.offset_8|) (= v_~x$w_buff1_used~0_45 v_~x$w_buff0_used~0_83) (= v_~x$w_buff0~0_23 v_~x$w_buff1~0_17) (= v_P1Thread1of1ForFork0_~arg.base_8 |v_P1Thread1of1ForFork0_#in~arg.base_8|) (= 1 v_~x$w_buff0~0_22) (= 1 |v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression_8|)) InVars {~x$w_buff0~0=v_~x$w_buff0~0_23, P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_8|, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_8|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_83} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_22, P1Thread1of1ForFork0___VERIFIER_assert_~expression=v_P1Thread1of1ForFork0___VERIFIER_assert_~expression_10, P1Thread1of1ForFork0_~arg.offset=v_P1Thread1of1ForFork0_~arg.offset_8, P1Thread1of1ForFork0_~arg.base=v_P1Thread1of1ForFork0_~arg.base_8, P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_8|, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression=|v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression_8|, ~x$w_buff1~0=v_~x$w_buff1~0_17, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_8|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_45, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_82} AuxVars[] AssignedVars[~x$w_buff0~0, P1Thread1of1ForFork0___VERIFIER_assert_~expression, P1Thread1of1ForFork0_~arg.offset, P1Thread1of1ForFork0_~arg.base, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$w_buff0_used~0] because there is no mapped edge [2019-12-18 14:33:27,000 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [772] [772] L820-1-->L822: Formula: (and (not (= |v_ULTIMATE.start_main_~#t1899~0.base_11| 0)) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t1899~0.base_11| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t1899~0.base_11|) |v_ULTIMATE.start_main_~#t1899~0.offset_10| 2)) |v_#memory_int_13|) (= (select |v_#valid_28| |v_ULTIMATE.start_main_~#t1899~0.base_11|) 0) (= |v_#length_13| (store |v_#length_14| |v_ULTIMATE.start_main_~#t1899~0.base_11| 4)) (< |v_#StackHeapBarrier_9| |v_ULTIMATE.start_main_~#t1899~0.base_11|) (= |v_#valid_27| (store |v_#valid_28| |v_ULTIMATE.start_main_~#t1899~0.base_11| 1)) (= 0 |v_ULTIMATE.start_main_~#t1899~0.offset_10|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_28|, #memory_int=|v_#memory_int_14|, #length=|v_#length_14|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_9|, ULTIMATE.start_main_~#t1899~0.base=|v_ULTIMATE.start_main_~#t1899~0.base_11|, #valid=|v_#valid_27|, #memory_int=|v_#memory_int_13|, ULTIMATE.start_main_~#t1899~0.offset=|v_ULTIMATE.start_main_~#t1899~0.offset_10|, #length=|v_#length_13|, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1899~0.base, #valid, #memory_int, ULTIMATE.start_main_~#t1899~0.offset, #length, ULTIMATE.start_main_#t~nondet39] because there is no mapped edge [2019-12-18 14:33:27,002 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [755] [755] L795-2-->L795-4: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff1_used~0_In-48654215 256))) (.cse0 (= (mod ~x$r_buff1_thd3~0_In-48654215 256) 0))) (or (and (= |P2Thread1of1ForFork1_#t~ite32_Out-48654215| ~x~0_In-48654215) (or .cse0 .cse1)) (and (not .cse1) (= ~x$w_buff1~0_In-48654215 |P2Thread1of1ForFork1_#t~ite32_Out-48654215|) (not .cse0)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In-48654215, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-48654215, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-48654215, ~x~0=~x~0_In-48654215} OutVars{P2Thread1of1ForFork1_#t~ite32=|P2Thread1of1ForFork1_#t~ite32_Out-48654215|, ~x$w_buff1~0=~x$w_buff1~0_In-48654215, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-48654215, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-48654215, ~x~0=~x~0_In-48654215} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite32] because there is no mapped edge [2019-12-18 14:33:27,003 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [677] [677] L795-4-->L796: Formula: (= v_~x~0_18 |v_P2Thread1of1ForFork1_#t~ite32_8|) InVars {P2Thread1of1ForFork1_#t~ite32=|v_P2Thread1of1ForFork1_#t~ite32_8|} OutVars{P2Thread1of1ForFork1_#t~ite32=|v_P2Thread1of1ForFork1_#t~ite32_7|, P2Thread1of1ForFork1_#t~ite33=|v_P2Thread1of1ForFork1_#t~ite33_7|, ~x~0=v_~x~0_18} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite32, P2Thread1of1ForFork1_#t~ite33, ~x~0] because there is no mapped edge [2019-12-18 14:33:27,003 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [757] [757] L796-->L796-2: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff0_used~0_In-1854950883 256))) (.cse0 (= (mod ~x$r_buff0_thd3~0_In-1854950883 256) 0))) (or (and (= ~x$w_buff0_used~0_In-1854950883 |P2Thread1of1ForFork1_#t~ite34_Out-1854950883|) (or .cse0 .cse1)) (and (not .cse1) (= 0 |P2Thread1of1ForFork1_#t~ite34_Out-1854950883|) (not .cse0)))) InVars {~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-1854950883, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1854950883} OutVars{P2Thread1of1ForFork1_#t~ite34=|P2Thread1of1ForFork1_#t~ite34_Out-1854950883|, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-1854950883, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1854950883} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite34] because there is no mapped edge [2019-12-18 14:33:27,005 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [789] [789] L740-->L740-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In-1534088201 256) 0))) (or (and (= |P0Thread1of1ForFork2_#t~ite8_In-1534088201| |P0Thread1of1ForFork2_#t~ite8_Out-1534088201|) (not .cse0) (= |P0Thread1of1ForFork2_#t~ite9_Out-1534088201| ~x$w_buff0~0_In-1534088201)) (and .cse0 (= |P0Thread1of1ForFork2_#t~ite9_Out-1534088201| |P0Thread1of1ForFork2_#t~ite8_Out-1534088201|) (let ((.cse1 (= 0 (mod ~x$r_buff0_thd1~0_In-1534088201 256)))) (or (and .cse1 (= (mod ~x$r_buff1_thd1~0_In-1534088201 256) 0)) (and (= (mod ~x$w_buff1_used~0_In-1534088201 256) 0) .cse1) (= 0 (mod ~x$w_buff0_used~0_In-1534088201 256)))) (= ~x$w_buff0~0_In-1534088201 |P0Thread1of1ForFork2_#t~ite8_Out-1534088201|)))) InVars {~x$w_buff0~0=~x$w_buff0~0_In-1534088201, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1534088201, P0Thread1of1ForFork2_#t~ite8=|P0Thread1of1ForFork2_#t~ite8_In-1534088201|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1534088201, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-1534088201, ~weak$$choice2~0=~weak$$choice2~0_In-1534088201, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1534088201} OutVars{~x$w_buff0~0=~x$w_buff0~0_In-1534088201, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1534088201, P0Thread1of1ForFork2_#t~ite8=|P0Thread1of1ForFork2_#t~ite8_Out-1534088201|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1534088201, P0Thread1of1ForFork2_#t~ite9=|P0Thread1of1ForFork2_#t~ite9_Out-1534088201|, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-1534088201, ~weak$$choice2~0=~weak$$choice2~0_In-1534088201, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1534088201} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite8, P0Thread1of1ForFork2_#t~ite9] because there is no mapped edge [2019-12-18 14:33:27,007 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [747] [747] L776-->L776-2: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff0_thd2~0_In1402242647 256))) (.cse1 (= (mod ~x$w_buff0_used~0_In1402242647 256) 0))) (or (and (= 0 |P1Thread1of1ForFork0_#t~ite28_Out1402242647|) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= ~x$w_buff0_used~0_In1402242647 |P1Thread1of1ForFork0_#t~ite28_Out1402242647|)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1402242647, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1402242647} OutVars{~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1402242647, P1Thread1of1ForFork0_#t~ite28=|P1Thread1of1ForFork0_#t~ite28_Out1402242647|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1402242647} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite28] because there is no mapped edge [2019-12-18 14:33:27,007 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [739] [739] L777-->L777-2: Formula: (let ((.cse2 (= (mod ~x$w_buff1_used~0_In-1939426913 256) 0)) (.cse3 (= 0 (mod ~x$r_buff1_thd2~0_In-1939426913 256))) (.cse0 (= 0 (mod ~x$r_buff0_thd2~0_In-1939426913 256))) (.cse1 (= (mod ~x$w_buff0_used~0_In-1939426913 256) 0))) (or (and (or .cse0 .cse1) (= |P1Thread1of1ForFork0_#t~ite29_Out-1939426913| ~x$w_buff1_used~0_In-1939426913) (or .cse2 .cse3)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1))) (= |P1Thread1of1ForFork0_#t~ite29_Out-1939426913| 0)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-1939426913, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-1939426913, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1939426913, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1939426913} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In-1939426913, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-1939426913, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1939426913, P1Thread1of1ForFork0_#t~ite29=|P1Thread1of1ForFork0_#t~ite29_Out-1939426913|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1939426913} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite29] because there is no mapped edge [2019-12-18 14:33:27,008 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [753] [753] L778-->L779: Formula: (let ((.cse0 (= (mod ~x$r_buff0_thd2~0_In-477912967 256) 0)) (.cse1 (= (mod ~x$w_buff0_used~0_In-477912967 256) 0))) (or (and (not .cse0) (not .cse1) (= 0 ~x$r_buff0_thd2~0_Out-477912967)) (and (or .cse0 .cse1) (= ~x$r_buff0_thd2~0_In-477912967 ~x$r_buff0_thd2~0_Out-477912967)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-477912967, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-477912967} OutVars{P1Thread1of1ForFork0_#t~ite30=|P1Thread1of1ForFork0_#t~ite30_Out-477912967|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_Out-477912967, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-477912967} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite30, ~x$r_buff0_thd2~0] because there is no mapped edge [2019-12-18 14:33:27,008 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [758] [758] L779-->L779-2: Formula: (let ((.cse2 (= 0 (mod ~x$r_buff0_thd2~0_In1267247173 256))) (.cse3 (= 0 (mod ~x$w_buff0_used~0_In1267247173 256))) (.cse1 (= 0 (mod ~x$w_buff1_used~0_In1267247173 256))) (.cse0 (= (mod ~x$r_buff1_thd2~0_In1267247173 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P1Thread1of1ForFork0_#t~ite31_Out1267247173| 0)) (and (= |P1Thread1of1ForFork0_#t~ite31_Out1267247173| ~x$r_buff1_thd2~0_In1267247173) (or .cse2 .cse3) (or .cse1 .cse0)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In1267247173, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In1267247173, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1267247173, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1267247173} OutVars{P1Thread1of1ForFork0_#t~ite31=|P1Thread1of1ForFork0_#t~ite31_Out1267247173|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1267247173, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In1267247173, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1267247173, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1267247173} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite31] because there is no mapped edge [2019-12-18 14:33:27,008 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [765] [765] L779-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork0_#res.base_5|) (= 0 |v_P1Thread1of1ForFork0_#res.offset_5|) (= v_~x$r_buff1_thd2~0_52 |v_P1Thread1of1ForFork0_#t~ite31_30|) (= (+ v_~__unbuffered_cnt~0_63 1) v_~__unbuffered_cnt~0_62)) InVars {P1Thread1of1ForFork0_#t~ite31=|v_P1Thread1of1ForFork0_#t~ite31_30|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_63} OutVars{P1Thread1of1ForFork0_#t~ite31=|v_P1Thread1of1ForFork0_#t~ite31_29|, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_52, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_62, P1Thread1of1ForFork0_#res.offset=|v_P1Thread1of1ForFork0_#res.offset_5|, P1Thread1of1ForFork0_#res.base=|v_P1Thread1of1ForFork0_#res.base_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite31, ~x$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork0_#res.offset, P1Thread1of1ForFork0_#res.base] because there is no mapped edge [2019-12-18 14:33:27,009 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [759] [759] L797-->L797-2: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff1_used~0_In175604660 256))) (.cse0 (= (mod ~x$r_buff1_thd3~0_In175604660 256) 0)) (.cse2 (= 0 (mod ~x$r_buff0_thd3~0_In175604660 256))) (.cse3 (= (mod ~x$w_buff0_used~0_In175604660 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P2Thread1of1ForFork1_#t~ite35_Out175604660|)) (and (or .cse1 .cse0) (or .cse2 .cse3) (= ~x$w_buff1_used~0_In175604660 |P2Thread1of1ForFork1_#t~ite35_Out175604660|)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In175604660, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In175604660, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In175604660, ~x$w_buff0_used~0=~x$w_buff0_used~0_In175604660} OutVars{P2Thread1of1ForFork1_#t~ite35=|P2Thread1of1ForFork1_#t~ite35_Out175604660|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In175604660, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In175604660, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In175604660, ~x$w_buff0_used~0=~x$w_buff0_used~0_In175604660} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite35] because there is no mapped edge [2019-12-18 14:33:27,010 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [745] [745] L798-->L798-2: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff0_thd3~0_In1465884911 256))) (.cse0 (= (mod ~x$w_buff0_used~0_In1465884911 256) 0))) (or (and (= |P2Thread1of1ForFork1_#t~ite36_Out1465884911| 0) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= |P2Thread1of1ForFork1_#t~ite36_Out1465884911| ~x$r_buff0_thd3~0_In1465884911)))) InVars {~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In1465884911, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1465884911} OutVars{P2Thread1of1ForFork1_#t~ite36=|P2Thread1of1ForFork1_#t~ite36_Out1465884911|, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In1465884911, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1465884911} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite36] because there is no mapped edge [2019-12-18 14:33:27,011 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [791] [791] L743-->L743-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-1080722676 256)))) (or (and (= |P0Thread1of1ForFork2_#t~ite17_In-1080722676| |P0Thread1of1ForFork2_#t~ite17_Out-1080722676|) (= ~x$w_buff1_used~0_In-1080722676 |P0Thread1of1ForFork2_#t~ite18_Out-1080722676|) (not .cse0)) (and .cse0 (= |P0Thread1of1ForFork2_#t~ite17_Out-1080722676| ~x$w_buff1_used~0_In-1080722676) (= |P0Thread1of1ForFork2_#t~ite17_Out-1080722676| |P0Thread1of1ForFork2_#t~ite18_Out-1080722676|) (let ((.cse1 (= (mod ~x$r_buff0_thd1~0_In-1080722676 256) 0))) (or (= 0 (mod ~x$w_buff0_used~0_In-1080722676 256)) (and (= 0 (mod ~x$w_buff1_used~0_In-1080722676 256)) .cse1) (and (= (mod ~x$r_buff1_thd1~0_In-1080722676 256) 0) .cse1)))))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1080722676, P0Thread1of1ForFork2_#t~ite17=|P0Thread1of1ForFork2_#t~ite17_In-1080722676|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1080722676, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-1080722676, ~weak$$choice2~0=~weak$$choice2~0_In-1080722676, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1080722676} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1080722676, P0Thread1of1ForFork2_#t~ite18=|P0Thread1of1ForFork2_#t~ite18_Out-1080722676|, P0Thread1of1ForFork2_#t~ite17=|P0Thread1of1ForFork2_#t~ite17_Out-1080722676|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1080722676, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-1080722676, ~weak$$choice2~0=~weak$$choice2~0_In-1080722676, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1080722676} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite18, P0Thread1of1ForFork2_#t~ite17] because there is no mapped edge [2019-12-18 14:33:27,012 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [730] [730] L744-->L745: Formula: (and (= v_~x$r_buff0_thd1~0_104 v_~x$r_buff0_thd1~0_103) (not (= (mod v_~weak$$choice2~0_39 256) 0))) InVars {~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_104, ~weak$$choice2~0=v_~weak$$choice2~0_39} OutVars{P0Thread1of1ForFork2_#t~ite20=|v_P0Thread1of1ForFork2_#t~ite20_12|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_103, P0Thread1of1ForFork2_#t~ite19=|v_P0Thread1of1ForFork2_#t~ite19_13|, ~weak$$choice2~0=v_~weak$$choice2~0_39, P0Thread1of1ForFork2_#t~ite21=|v_P0Thread1of1ForFork2_#t~ite21_8|} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite20, ~x$r_buff0_thd1~0, P0Thread1of1ForFork2_#t~ite19, P0Thread1of1ForFork2_#t~ite21] because there is no mapped edge [2019-12-18 14:33:27,012 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [790] [790] L745-->L745-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In1116219980 256)))) (or (and .cse0 (= |P0Thread1of1ForFork2_#t~ite23_Out1116219980| |P0Thread1of1ForFork2_#t~ite24_Out1116219980|) (= ~x$r_buff1_thd1~0_In1116219980 |P0Thread1of1ForFork2_#t~ite23_Out1116219980|) (let ((.cse1 (= 0 (mod ~x$r_buff0_thd1~0_In1116219980 256)))) (or (= (mod ~x$w_buff0_used~0_In1116219980 256) 0) (and .cse1 (= 0 (mod ~x$r_buff1_thd1~0_In1116219980 256))) (and .cse1 (= 0 (mod ~x$w_buff1_used~0_In1116219980 256)))))) (and (= ~x$r_buff1_thd1~0_In1116219980 |P0Thread1of1ForFork2_#t~ite24_Out1116219980|) (not .cse0) (= |P0Thread1of1ForFork2_#t~ite23_In1116219980| |P0Thread1of1ForFork2_#t~ite23_Out1116219980|)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1116219980, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1116219980, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In1116219980, ~weak$$choice2~0=~weak$$choice2~0_In1116219980, P0Thread1of1ForFork2_#t~ite23=|P0Thread1of1ForFork2_#t~ite23_In1116219980|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1116219980} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1116219980, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1116219980, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In1116219980, P0Thread1of1ForFork2_#t~ite24=|P0Thread1of1ForFork2_#t~ite24_Out1116219980|, ~weak$$choice2~0=~weak$$choice2~0_In1116219980, P0Thread1of1ForFork2_#t~ite23=|P0Thread1of1ForFork2_#t~ite23_Out1116219980|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1116219980} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite24, P0Thread1of1ForFork2_#t~ite23] because there is no mapped edge [2019-12-18 14:33:27,013 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [749] [749] L799-->L799-2: Formula: (let ((.cse2 (= (mod ~x$r_buff0_thd3~0_In-1839619775 256) 0)) (.cse3 (= (mod ~x$w_buff0_used~0_In-1839619775 256) 0)) (.cse0 (= 0 (mod ~x$r_buff1_thd3~0_In-1839619775 256))) (.cse1 (= (mod ~x$w_buff1_used~0_In-1839619775 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P2Thread1of1ForFork1_#t~ite37_Out-1839619775| 0)) (and (or .cse2 .cse3) (= |P2Thread1of1ForFork1_#t~ite37_Out-1839619775| ~x$r_buff1_thd3~0_In-1839619775) (or .cse0 .cse1)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-1839619775, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-1839619775, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-1839619775, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1839619775} OutVars{P2Thread1of1ForFork1_#t~ite37=|P2Thread1of1ForFork1_#t~ite37_Out-1839619775|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1839619775, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-1839619775, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-1839619775, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1839619775} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-18 14:33:27,013 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [763] [763] L799-2-->P2EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_57 1) v_~__unbuffered_cnt~0_56) (= 0 |v_P2Thread1of1ForFork1_#res.offset_5|) (= 0 |v_P2Thread1of1ForFork1_#res.base_5|) (= v_~x$r_buff1_thd3~0_54 |v_P2Thread1of1ForFork1_#t~ite37_30|)) InVars {P2Thread1of1ForFork1_#t~ite37=|v_P2Thread1of1ForFork1_#t~ite37_30|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_57} OutVars{P2Thread1of1ForFork1_#t~ite37=|v_P2Thread1of1ForFork1_#t~ite37_29|, P2Thread1of1ForFork1_#res.base=|v_P2Thread1of1ForFork1_#res.base_5|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_54, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_56, P2Thread1of1ForFork1_#res.offset=|v_P2Thread1of1ForFork1_#res.offset_5|} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite37, P2Thread1of1ForFork1_#res.base, ~x$r_buff1_thd3~0, ~__unbuffered_cnt~0, P2Thread1of1ForFork1_#res.offset] because there is no mapped edge [2019-12-18 14:33:27,013 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [703] [703] L747-->L755: Formula: (and (= v_~x$flush_delayed~0_16 0) (not (= (mod v_~x$flush_delayed~0_17 256) 0)) (= v_~x~0_35 v_~x$mem_tmp~0_10) (= (+ v_~__unbuffered_cnt~0_30 1) v_~__unbuffered_cnt~0_29)) InVars {~x$flush_delayed~0=v_~x$flush_delayed~0_17, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_30, ~x$mem_tmp~0=v_~x$mem_tmp~0_10} OutVars{P0Thread1of1ForFork2_#t~ite25=|v_P0Thread1of1ForFork2_#t~ite25_15|, ~x$flush_delayed~0=v_~x$flush_delayed~0_16, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_29, ~x$mem_tmp~0=v_~x$mem_tmp~0_10, ~x~0=v_~x~0_35} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite25, ~x$flush_delayed~0, ~__unbuffered_cnt~0, ~x~0] because there is no mapped edge [2019-12-18 14:33:27,014 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [698] [698] L826-->L828-2: Formula: (and (or (= 0 (mod v_~x$w_buff0_used~0_172 256)) (= (mod v_~x$r_buff0_thd0~0_29 256) 0)) (not (= (mod v_~main$tmp_guard0~0_7 256) 0))) InVars {~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_29, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_7, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_172} OutVars{~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_29, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_7, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_172} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-18 14:33:27,014 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [752] [752] L828-2-->L828-4: Formula: (let ((.cse0 (= 0 (mod ~x$w_buff1_used~0_In-1575361625 256))) (.cse1 (= 0 (mod ~x$r_buff1_thd0~0_In-1575361625 256)))) (or (and (not .cse0) (= ~x$w_buff1~0_In-1575361625 |ULTIMATE.start_main_#t~ite41_Out-1575361625|) (not .cse1)) (and (or .cse0 .cse1) (= ~x~0_In-1575361625 |ULTIMATE.start_main_#t~ite41_Out-1575361625|)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In-1575361625, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1575361625, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1575361625, ~x~0=~x~0_In-1575361625} OutVars{ULTIMATE.start_main_#t~ite41=|ULTIMATE.start_main_#t~ite41_Out-1575361625|, ~x$w_buff1~0=~x$w_buff1~0_In-1575361625, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1575361625, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1575361625, ~x~0=~x~0_In-1575361625} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41] because there is no mapped edge [2019-12-18 14:33:27,014 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [688] [688] L828-4-->L829: Formula: (= v_~x~0_24 |v_ULTIMATE.start_main_#t~ite41_11|) InVars {ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_11|} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_10|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_6|, ~x~0=v_~x~0_24} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite42, ~x~0] because there is no mapped edge [2019-12-18 14:33:27,014 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [744] [744] L829-->L829-2: Formula: (let ((.cse1 (= (mod ~x$w_buff0_used~0_In1225245966 256) 0)) (.cse0 (= 0 (mod ~x$r_buff0_thd0~0_In1225245966 256)))) (or (and (= |ULTIMATE.start_main_#t~ite43_Out1225245966| ~x$w_buff0_used~0_In1225245966) (or .cse0 .cse1)) (and (= |ULTIMATE.start_main_#t~ite43_Out1225245966| 0) (not .cse1) (not .cse0)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1225245966, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1225245966} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1225245966, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out1225245966|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1225245966} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43] because there is no mapped edge [2019-12-18 14:33:27,015 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [746] [746] L830-->L830-2: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff0_thd0~0_In879500939 256))) (.cse1 (= (mod ~x$w_buff0_used~0_In879500939 256) 0)) (.cse2 (= 0 (mod ~x$w_buff1_used~0_In879500939 256))) (.cse3 (= 0 (mod ~x$r_buff1_thd0~0_In879500939 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite44_Out879500939| 0)) (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite44_Out879500939| ~x$w_buff1_used~0_In879500939) (or .cse2 .cse3)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In879500939, ~x$w_buff1_used~0=~x$w_buff1_used~0_In879500939, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In879500939, ~x$w_buff0_used~0=~x$w_buff0_used~0_In879500939} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In879500939, ~x$w_buff1_used~0=~x$w_buff1_used~0_In879500939, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In879500939, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out879500939|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In879500939} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-18 14:33:27,016 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [751] [751] L831-->L831-2: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff0_thd0~0_In1343406558 256))) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In1343406558 256)))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite45_Out1343406558| ~x$r_buff0_thd0~0_In1343406558)) (and (= 0 |ULTIMATE.start_main_#t~ite45_Out1343406558|) (not .cse0) (not .cse1)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1343406558, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1343406558} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1343406558, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out1343406558|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1343406558} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-12-18 14:33:27,016 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [741] [741] L832-->L832-2: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff1_used~0_In-2060136840 256))) (.cse0 (= 0 (mod ~x$r_buff1_thd0~0_In-2060136840 256))) (.cse2 (= (mod ~x$w_buff0_used~0_In-2060136840 256) 0)) (.cse3 (= (mod ~x$r_buff0_thd0~0_In-2060136840 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |ULTIMATE.start_main_#t~ite46_Out-2060136840| ~x$r_buff1_thd0~0_In-2060136840)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite46_Out-2060136840| 0)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-2060136840, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-2060136840, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-2060136840, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-2060136840} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-2060136840, ULTIMATE.start_main_#t~ite46=|ULTIMATE.start_main_#t~ite46_Out-2060136840|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-2060136840, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-2060136840, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-2060136840} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite46] because there is no mapped edge [2019-12-18 14:33:27,017 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [800] [800] L832-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_~main$tmp_guard1~0_26 0) (= v_~y~0_272 2) (= v_~x$r_buff1_thd0~0_293 |v_ULTIMATE.start_main_#t~ite46_58|) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_14| (mod v_~main$tmp_guard1~0_26 256)) (= v_ULTIMATE.start___VERIFIER_assert_~expression_21 0) (= 0 v_~__unbuffered_p0_EAX~0_53) (= v_~__unbuffered_p2_EBX~0_34 1) (= 1 v_~__unbuffered_p2_EAX~0_34)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_53, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_34, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_58|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_34, ~y~0=v_~y~0_272} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_53, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_21, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_34, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_57|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_26, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_34, ~y~0=v_~y~0_272, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_293, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_14|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ULTIMATE.start_main_#t~ite46, ~main$tmp_guard1~0, ~x$r_buff1_thd0~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-18 14:33:27,091 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.12 02:33:27 BasicIcfg [2019-12-18 14:33:27,092 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-18 14:33:27,095 INFO L168 Benchmark]: Toolchain (without parser) took 175920.86 ms. Allocated memory was 140.0 MB in the beginning and 3.3 GB in the end (delta: 3.2 GB). Free memory was 100.4 MB in the beginning and 2.3 GB in the end (delta: -2.2 GB). Peak memory consumption was 910.2 MB. Max. memory is 7.1 GB. [2019-12-18 14:33:27,096 INFO L168 Benchmark]: CDTParser took 0.74 ms. Allocated memory is still 140.0 MB. Free memory was 120.5 MB in the beginning and 120.3 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. [2019-12-18 14:33:27,096 INFO L168 Benchmark]: CACSL2BoogieTranslator took 750.29 ms. Allocated memory was 140.0 MB in the beginning and 203.4 MB in the end (delta: 63.4 MB). Free memory was 100.0 MB in the beginning and 156.9 MB in the end (delta: -56.9 MB). Peak memory consumption was 23.1 MB. Max. memory is 7.1 GB. [2019-12-18 14:33:27,097 INFO L168 Benchmark]: Boogie Procedure Inliner took 62.43 ms. Allocated memory is still 203.4 MB. Free memory was 156.9 MB in the beginning and 154.3 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-12-18 14:33:27,097 INFO L168 Benchmark]: Boogie Preprocessor took 43.69 ms. Allocated memory is still 203.4 MB. Free memory was 154.3 MB in the beginning and 152.3 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2019-12-18 14:33:27,098 INFO L168 Benchmark]: RCFGBuilder took 857.62 ms. Allocated memory is still 203.4 MB. Free memory was 152.3 MB in the beginning and 105.7 MB in the end (delta: 46.6 MB). Peak memory consumption was 46.6 MB. Max. memory is 7.1 GB. [2019-12-18 14:33:27,101 INFO L168 Benchmark]: TraceAbstraction took 174201.34 ms. Allocated memory was 203.4 MB in the beginning and 3.3 GB in the end (delta: 3.1 GB). Free memory was 105.0 MB in the beginning and 2.3 GB in the end (delta: -2.2 GB). Peak memory consumption was 851.4 MB. Max. memory is 7.1 GB. [2019-12-18 14:33:27,106 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.74 ms. Allocated memory is still 140.0 MB. Free memory was 120.5 MB in the beginning and 120.3 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 750.29 ms. Allocated memory was 140.0 MB in the beginning and 203.4 MB in the end (delta: 63.4 MB). Free memory was 100.0 MB in the beginning and 156.9 MB in the end (delta: -56.9 MB). Peak memory consumption was 23.1 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 62.43 ms. Allocated memory is still 203.4 MB. Free memory was 156.9 MB in the beginning and 154.3 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 43.69 ms. Allocated memory is still 203.4 MB. Free memory was 154.3 MB in the beginning and 152.3 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 857.62 ms. Allocated memory is still 203.4 MB. Free memory was 152.3 MB in the beginning and 105.7 MB in the end (delta: 46.6 MB). Peak memory consumption was 46.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 174201.34 ms. Allocated memory was 203.4 MB in the beginning and 3.3 GB in the end (delta: 3.1 GB). Free memory was 105.0 MB in the beginning and 2.3 GB in the end (delta: -2.2 GB). Peak memory consumption was 851.4 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 6.1s, 163 ProgramPointsBefore, 83 ProgramPointsAfterwards, 194 TransitionsBefore, 92 TransitionsAfterwards, 16696 CoEnabledTransitionPairs, 7 FixpointIterations, 32 TrivialSequentialCompositions, 45 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 36 ConcurrentYvCompositions, 26 ChoiceCompositions, 6760 VarBasedMoverChecksPositive, 302 VarBasedMoverChecksNegative, 126 SemBasedMoverChecksPositive, 261 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.9s, 0 MoverChecksTotal, 66367 CheckedPairsTotal, 113 TotalNumberOfCompositions - CounterExampleResult [Line: 5]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L818] FCALL, FORK 0 pthread_create(&t1897, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L820] FCALL, FORK 0 pthread_create(&t1898, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L822] FCALL, FORK 0 pthread_create(&t1899, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L765] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L766] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L767] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L768] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L769] 2 x$r_buff0_thd2 = (_Bool)1 [L772] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L775] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L789] 3 __unbuffered_p2_EAX = y [L792] 3 __unbuffered_p2_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L795] 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L775] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L730] 1 y = 2 [L735] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L736] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L737] 1 x$flush_delayed = weak$$choice2 [L738] 1 x$mem_tmp = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L739] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) VAL [!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L739] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L740] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L741] EXPR 1 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L741] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L776] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L777] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L796] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L797] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L798] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L742] EXPR 1 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used))=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L742] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L743] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L745] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L746] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L824] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [\result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L829] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L830] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L831] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 154 locations, 2 error locations. Result: UNSAFE, OverallTime: 173.9s, OverallIterations: 34, TraceHistogramMax: 1, AutomataDifference: 60.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 5478 SDtfs, 6987 SDslu, 15077 SDs, 0 SdLazy, 10546 SolverSat, 299 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 9.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 332 GetRequests, 50 SyntacticMatches, 30 SemanticMatches, 252 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 815 ImplicationChecksByTransitivity, 4.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=169732occurred in iteration=8, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 89.8s AutomataMinimizationTime, 33 MinimizatonAttempts, 224320 StatesRemovedByMinimization, 29 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 3.7s InterpolantComputationTime, 1128 NumberOfCodeBlocks, 1128 NumberOfCodeBlocksAsserted, 34 NumberOfCheckSat, 1039 ConstructedInterpolants, 0 QuantifiedInterpolants, 175453 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 33 InterpolantComputations, 33 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...