/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/mix010_pso.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-26 21:27:57,904 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-26 21:27:57,907 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-26 21:27:57,921 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-26 21:27:57,921 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-26 21:27:57,922 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-26 21:27:57,926 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-26 21:27:57,929 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-26 21:27:57,933 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-26 21:27:57,934 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-26 21:27:57,941 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-26 21:27:57,943 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-26 21:27:57,943 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-26 21:27:57,945 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-26 21:27:57,946 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-26 21:27:57,948 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-26 21:27:57,948 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-26 21:27:57,951 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-26 21:27:57,955 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-26 21:27:57,959 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-26 21:27:57,962 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-26 21:27:57,965 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-26 21:27:57,966 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-26 21:27:57,967 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-26 21:27:57,970 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-26 21:27:57,970 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-26 21:27:57,970 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-26 21:27:57,972 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-26 21:27:57,973 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-26 21:27:57,975 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-26 21:27:57,976 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-26 21:27:57,978 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-26 21:27:57,978 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-26 21:27:57,981 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-26 21:27:57,983 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-26 21:27:57,984 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-26 21:27:57,984 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-26 21:27:57,985 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-26 21:27:57,985 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-26 21:27:57,987 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-26 21:27:57,989 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-26 21:27:57,990 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-26 21:27:58,023 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-26 21:27:58,024 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-26 21:27:58,025 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-26 21:27:58,025 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-26 21:27:58,025 INFO L138 SettingsManager]: * Use SBE=true [2019-12-26 21:27:58,030 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-26 21:27:58,030 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-26 21:27:58,030 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-26 21:27:58,031 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-26 21:27:58,031 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-26 21:27:58,031 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-26 21:27:58,031 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-26 21:27:58,031 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-26 21:27:58,032 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-26 21:27:58,032 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-26 21:27:58,032 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-26 21:27:58,032 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-26 21:27:58,032 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-26 21:27:58,032 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-26 21:27:58,033 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-26 21:27:58,033 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-26 21:27:58,033 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-26 21:27:58,033 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-26 21:27:58,033 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-26 21:27:58,034 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-26 21:27:58,035 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-26 21:27:58,036 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-26 21:27:58,036 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-26 21:27:58,036 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-26 21:27:58,036 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-26 21:27:58,329 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-26 21:27:58,342 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-26 21:27:58,347 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-26 21:27:58,349 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-26 21:27:58,349 INFO L275 PluginConnector]: CDTParser initialized [2019-12-26 21:27:58,350 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix010_pso.oepc.i [2019-12-26 21:27:58,413 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1e82da75f/bbbb4d5aa582444f82582f90f6815635/FLAGf20e2bc47 [2019-12-26 21:27:58,928 INFO L306 CDTParser]: Found 1 translation units. [2019-12-26 21:27:58,928 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix010_pso.oepc.i [2019-12-26 21:27:58,958 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1e82da75f/bbbb4d5aa582444f82582f90f6815635/FLAGf20e2bc47 [2019-12-26 21:27:59,214 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1e82da75f/bbbb4d5aa582444f82582f90f6815635 [2019-12-26 21:27:59,224 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-26 21:27:59,226 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-26 21:27:59,227 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-26 21:27:59,227 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-26 21:27:59,230 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-26 21:27:59,232 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.12 09:27:59" (1/1) ... [2019-12-26 21:27:59,235 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1008bde5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 09:27:59, skipping insertion in model container [2019-12-26 21:27:59,236 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.12 09:27:59" (1/1) ... [2019-12-26 21:27:59,245 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-26 21:27:59,317 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-26 21:27:59,853 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-26 21:27:59,866 INFO L203 MainTranslator]: Completed pre-run [2019-12-26 21:27:59,947 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-26 21:28:00,024 INFO L208 MainTranslator]: Completed translation [2019-12-26 21:28:00,025 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 09:28:00 WrapperNode [2019-12-26 21:28:00,025 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-26 21:28:00,026 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-26 21:28:00,026 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-26 21:28:00,026 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-26 21:28:00,035 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 09:28:00" (1/1) ... [2019-12-26 21:28:00,060 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 09:28:00" (1/1) ... [2019-12-26 21:28:00,094 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-26 21:28:00,094 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-26 21:28:00,094 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-26 21:28:00,094 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-26 21:28:00,103 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 09:28:00" (1/1) ... [2019-12-26 21:28:00,104 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 09:28:00" (1/1) ... [2019-12-26 21:28:00,108 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 09:28:00" (1/1) ... [2019-12-26 21:28:00,108 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 09:28:00" (1/1) ... [2019-12-26 21:28:00,119 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 09:28:00" (1/1) ... [2019-12-26 21:28:00,123 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 09:28:00" (1/1) ... [2019-12-26 21:28:00,127 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 09:28:00" (1/1) ... [2019-12-26 21:28:00,132 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-26 21:28:00,133 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-26 21:28:00,133 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-26 21:28:00,133 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-26 21:28:00,134 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 09:28:00" (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-26 21:28:00,194 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-26 21:28:00,195 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-26 21:28:00,195 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-26 21:28:00,195 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-26 21:28:00,195 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-26 21:28:00,195 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-26 21:28:00,196 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-26 21:28:00,196 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-26 21:28:00,196 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-26 21:28:00,196 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-26 21:28:00,196 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-26 21:28:00,196 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-26 21:28:00,197 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-26 21:28:00,199 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-26 21:28:00,890 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-26 21:28:00,891 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-26 21:28:00,892 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.12 09:28:00 BoogieIcfgContainer [2019-12-26 21:28:00,892 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-26 21:28:00,894 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-26 21:28:00,894 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-26 21:28:00,897 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-26 21:28:00,898 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.12 09:27:59" (1/3) ... [2019-12-26 21:28:00,898 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@f301873 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.12 09:28:00, skipping insertion in model container [2019-12-26 21:28:00,899 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 09:28:00" (2/3) ... [2019-12-26 21:28:00,899 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@f301873 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.12 09:28:00, skipping insertion in model container [2019-12-26 21:28:00,899 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.12 09:28:00" (3/3) ... [2019-12-26 21:28:00,901 INFO L109 eAbstractionObserver]: Analyzing ICFG mix010_pso.oepc.i [2019-12-26 21:28:00,912 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-26 21:28:00,912 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-26 21:28:00,920 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-26 21:28:00,921 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-26 21:28:00,964 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:28:00,964 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:28:00,965 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:28:00,965 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:28:00,965 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:28:00,966 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:28:00,966 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:28:00,966 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:28:00,967 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:28:00,967 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:28:00,967 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:28:00,968 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:28:00,968 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:28:00,968 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:28:00,969 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:28:00,969 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:28:00,969 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:28:00,969 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:28:00,970 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:28:00,970 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:28:00,970 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:28:00,970 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:28:00,971 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:28:00,972 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:28:00,972 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:28:00,990 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:28:00,990 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:28:00,990 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:28:00,991 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:28:00,992 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:28:00,993 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:28:00,993 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:28:00,993 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:28:00,993 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:28:00,995 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:28:00,995 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:28:00,996 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:28:00,996 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:28:00,996 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:28:00,997 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:28:00,998 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:28:00,998 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:28:00,999 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:28:00,999 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:28:00,999 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:28:00,999 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:28:00,999 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:28:01,000 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:28:01,000 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:28:01,000 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:28:01,000 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:28:01,000 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:28:01,001 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:28:01,001 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:28:01,001 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:28:01,001 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:28:01,002 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:28:01,002 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:28:01,002 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:28:01,004 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:28:01,004 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:28:01,005 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:28:01,005 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:28:01,005 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:28:01,011 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:28:01,011 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:28:01,012 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:28:01,012 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:28:01,012 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:28:01,012 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:28:01,012 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:28:01,013 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:28:01,013 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:28:01,013 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:28:01,013 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:28:01,014 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:28:01,014 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:28:01,014 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:28:01,014 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:28:01,014 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:28:01,015 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:28:01,015 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:28:01,016 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:28:01,016 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:28:01,016 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:28:01,017 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:28:01,017 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:28:01,017 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:28:01,018 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:28:01,018 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:28:01,018 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:28:01,018 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:28:01,018 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:28:01,018 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:28:01,019 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:28:01,019 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:28:01,019 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:28:01,019 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:28:01,019 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:28:01,020 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:28:01,020 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:28:01,021 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:28:01,024 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:28:01,025 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:28:01,025 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:28:01,025 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:28:01,032 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:28:01,032 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:28:01,033 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:28:01,033 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:28:01,033 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:28:01,034 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:28:01,034 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:28:01,034 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:28:01,034 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:28:01,034 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:28:01,035 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:28:01,035 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:28:01,035 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:28:01,035 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:28:01,035 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:28:01,035 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:28:01,036 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:28:01,036 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:28:01,036 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:28:01,036 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:28:01,036 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:28:01,037 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:28:01,037 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:28:01,037 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:28:01,037 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:28:01,037 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:28:01,038 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:28:01,038 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:28:01,038 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:28:01,038 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:28:01,039 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:28:01,039 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:28:01,039 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:28:01,039 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:28:01,039 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:28:01,040 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:28:01,040 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:28:01,040 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:28:01,040 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:28:01,040 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:28:01,041 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:28:01,041 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:28:01,041 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:28:01,041 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:28:01,041 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:28:01,042 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:28:01,042 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:28:01,042 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:28:01,042 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:28:01,043 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:28:01,043 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:28:01,043 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:28:01,043 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:28:01,044 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:28:01,044 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:28:01,044 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:28:01,044 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:28:01,044 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:28:01,045 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:28:01,045 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:28:01,045 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:28:01,046 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:28:01,046 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:28:01,046 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:28:01,047 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:28:01,048 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:28:01,048 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:28:01,048 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:28:01,048 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:28:01,048 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:28:01,049 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:28:01,049 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:28:01,051 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:28:01,051 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:28:01,051 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:28:01,051 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:28:01,056 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:28:01,056 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:28:01,056 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:28:01,057 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:28:01,057 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:28:01,057 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:28:01,057 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:28:01,057 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:28:01,058 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:28:01,058 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:28:01,058 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:28:01,058 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:28:01,058 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:28:01,058 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:28:01,059 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:28:01,059 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:28:01,059 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:28:01,059 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:28:01,059 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:28:01,059 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:28:01,060 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:28:01,060 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:28:01,060 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:28:01,060 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:28:01,060 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:28:01,061 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:28:01,061 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:28:01,061 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:28:01,061 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:28:01,061 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:28:01,062 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:28:01,062 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:28:01,062 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:28:01,066 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:28:01,066 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:28:01,066 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:28:01,066 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:28:01,071 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:28:01,071 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:28:01,072 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:28:01,072 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:28:01,072 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:28:01,072 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:28:01,072 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:28:01,072 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:28:01,075 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:28:01,075 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:28:01,076 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:28:01,076 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:28:01,076 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:28:01,076 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:28:01,076 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:28:01,076 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:28:01,077 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:28:01,079 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:28:01,093 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-26 21:28:01,113 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-26 21:28:01,113 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-26 21:28:01,113 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-26 21:28:01,113 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-26 21:28:01,113 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-26 21:28:01,113 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-26 21:28:01,113 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-26 21:28:01,114 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-26 21:28:01,129 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 179 places, 216 transitions [2019-12-26 21:28:01,131 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 179 places, 216 transitions [2019-12-26 21:28:01,240 INFO L132 PetriNetUnfolder]: 47/213 cut-off events. [2019-12-26 21:28:01,240 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-26 21:28:01,257 INFO L76 FinitePrefix]: Finished finitePrefix Result has 223 conditions, 213 events. 47/213 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 431 event pairs. 0/164 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-26 21:28:01,285 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 179 places, 216 transitions [2019-12-26 21:28:01,369 INFO L132 PetriNetUnfolder]: 47/213 cut-off events. [2019-12-26 21:28:01,370 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-26 21:28:01,381 INFO L76 FinitePrefix]: Finished finitePrefix Result has 223 conditions, 213 events. 47/213 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 431 event pairs. 0/164 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-26 21:28:01,406 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 19004 [2019-12-26 21:28:01,407 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-26 21:28:05,564 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 25 [2019-12-26 21:28:06,806 WARN L192 SmtUtils]: Spent 285.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 95 [2019-12-26 21:28:06,962 WARN L192 SmtUtils]: Spent 150.00 ms on a formula simplification that was a NOOP. DAG size: 93 [2019-12-26 21:28:06,995 INFO L206 etLargeBlockEncoding]: Checked pairs total: 91218 [2019-12-26 21:28:06,996 INFO L214 etLargeBlockEncoding]: Total number of compositions: 116 [2019-12-26 21:28:07,000 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 95 places, 105 transitions [2019-12-26 21:28:28,053 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 126452 states. [2019-12-26 21:28:28,055 INFO L276 IsEmpty]: Start isEmpty. Operand 126452 states. [2019-12-26 21:28:28,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-26 21:28:28,060 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:28:28,061 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-26 21:28:28,061 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 21:28:28,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:28:28,066 INFO L82 PathProgramCache]: Analyzing trace with hash 921826, now seen corresponding path program 1 times [2019-12-26 21:28:28,074 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:28:28,074 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1748983101] [2019-12-26 21:28:28,074 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:28:28,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:28:28,313 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-26 21:28:28,314 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1748983101] [2019-12-26 21:28:28,315 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:28:28,315 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-26 21:28:28,316 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [921112070] [2019-12-26 21:28:28,321 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 21:28:28,321 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:28:28,337 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 21:28:28,338 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 21:28:28,341 INFO L87 Difference]: Start difference. First operand 126452 states. Second operand 3 states. [2019-12-26 21:28:29,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:28:29,999 INFO L93 Difference]: Finished difference Result 125226 states and 534182 transitions. [2019-12-26 21:28:30,000 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 21:28:30,001 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-26 21:28:30,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:28:30,760 INFO L225 Difference]: With dead ends: 125226 [2019-12-26 21:28:30,760 INFO L226 Difference]: Without dead ends: 117946 [2019-12-26 21:28:30,761 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-26 21:28:39,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117946 states. [2019-12-26 21:28:41,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117946 to 117946. [2019-12-26 21:28:41,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117946 states. [2019-12-26 21:28:42,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117946 states to 117946 states and 502500 transitions. [2019-12-26 21:28:42,488 INFO L78 Accepts]: Start accepts. Automaton has 117946 states and 502500 transitions. Word has length 3 [2019-12-26 21:28:42,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:28:42,489 INFO L462 AbstractCegarLoop]: Abstraction has 117946 states and 502500 transitions. [2019-12-26 21:28:42,489 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 21:28:42,489 INFO L276 IsEmpty]: Start isEmpty. Operand 117946 states and 502500 transitions. [2019-12-26 21:28:42,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-26 21:28:42,493 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:28:42,494 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 21:28:42,494 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 21:28:42,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:28:42,494 INFO L82 PathProgramCache]: Analyzing trace with hash -2034548154, now seen corresponding path program 1 times [2019-12-26 21:28:42,495 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:28:42,495 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1791565194] [2019-12-26 21:28:42,495 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:28:42,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:28:42,629 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-26 21:28:42,630 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1791565194] [2019-12-26 21:28:42,630 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:28:42,630 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 21:28:42,630 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [37129838] [2019-12-26 21:28:42,632 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-26 21:28:42,632 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:28:42,632 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-26 21:28:42,633 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-26 21:28:42,633 INFO L87 Difference]: Start difference. First operand 117946 states and 502500 transitions. Second operand 4 states. [2019-12-26 21:28:47,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:28:47,826 INFO L93 Difference]: Finished difference Result 183040 states and 750092 transitions. [2019-12-26 21:28:47,827 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-26 21:28:47,827 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-26 21:28:47,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:28:48,411 INFO L225 Difference]: With dead ends: 183040 [2019-12-26 21:28:48,411 INFO L226 Difference]: Without dead ends: 182991 [2019-12-26 21:28:48,412 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-26 21:28:59,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182991 states. [2019-12-26 21:29:03,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182991 to 168271. [2019-12-26 21:29:03,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168271 states. [2019-12-26 21:29:03,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168271 states to 168271 states and 697811 transitions. [2019-12-26 21:29:03,737 INFO L78 Accepts]: Start accepts. Automaton has 168271 states and 697811 transitions. Word has length 11 [2019-12-26 21:29:03,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:29:03,738 INFO L462 AbstractCegarLoop]: Abstraction has 168271 states and 697811 transitions. [2019-12-26 21:29:03,738 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-26 21:29:03,738 INFO L276 IsEmpty]: Start isEmpty. Operand 168271 states and 697811 transitions. [2019-12-26 21:29:03,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-26 21:29:03,744 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:29:03,745 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 21:29:03,745 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 21:29:03,745 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:29:03,745 INFO L82 PathProgramCache]: Analyzing trace with hash -579003435, now seen corresponding path program 1 times [2019-12-26 21:29:03,746 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:29:03,746 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [589478096] [2019-12-26 21:29:03,746 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:29:03,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:29:03,797 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-26 21:29:03,798 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [589478096] [2019-12-26 21:29:03,798 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:29:03,798 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 21:29:03,799 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1595181832] [2019-12-26 21:29:03,799 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 21:29:03,799 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:29:03,800 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 21:29:03,800 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 21:29:03,800 INFO L87 Difference]: Start difference. First operand 168271 states and 697811 transitions. Second operand 3 states. [2019-12-26 21:29:03,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:29:03,985 INFO L93 Difference]: Finished difference Result 35531 states and 115505 transitions. [2019-12-26 21:29:03,986 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 21:29:03,986 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-26 21:29:03,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:29:04,063 INFO L225 Difference]: With dead ends: 35531 [2019-12-26 21:29:04,064 INFO L226 Difference]: Without dead ends: 35531 [2019-12-26 21:29:04,064 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-26 21:29:04,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35531 states. [2019-12-26 21:29:10,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35531 to 35531. [2019-12-26 21:29:10,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35531 states. [2019-12-26 21:29:10,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35531 states to 35531 states and 115505 transitions. [2019-12-26 21:29:10,362 INFO L78 Accepts]: Start accepts. Automaton has 35531 states and 115505 transitions. Word has length 13 [2019-12-26 21:29:10,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:29:10,362 INFO L462 AbstractCegarLoop]: Abstraction has 35531 states and 115505 transitions. [2019-12-26 21:29:10,362 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 21:29:10,362 INFO L276 IsEmpty]: Start isEmpty. Operand 35531 states and 115505 transitions. [2019-12-26 21:29:10,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-26 21:29:10,365 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:29:10,365 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 21:29:10,365 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 21:29:10,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:29:10,365 INFO L82 PathProgramCache]: Analyzing trace with hash -1458626840, now seen corresponding path program 1 times [2019-12-26 21:29:10,366 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:29:10,366 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1863851263] [2019-12-26 21:29:10,366 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:29:10,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:29:10,449 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-26 21:29:10,450 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1863851263] [2019-12-26 21:29:10,450 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:29:10,451 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 21:29:10,451 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [411274923] [2019-12-26 21:29:10,451 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-26 21:29:10,451 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:29:10,452 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-26 21:29:10,452 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-26 21:29:10,452 INFO L87 Difference]: Start difference. First operand 35531 states and 115505 transitions. Second operand 5 states. [2019-12-26 21:29:11,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:29:11,011 INFO L93 Difference]: Finished difference Result 49606 states and 159424 transitions. [2019-12-26 21:29:11,012 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-26 21:29:11,012 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2019-12-26 21:29:11,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:29:11,098 INFO L225 Difference]: With dead ends: 49606 [2019-12-26 21:29:11,098 INFO L226 Difference]: Without dead ends: 49606 [2019-12-26 21:29:11,099 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-26 21:29:11,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49606 states. [2019-12-26 21:29:11,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49606 to 42335. [2019-12-26 21:29:11,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42335 states. [2019-12-26 21:29:11,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42335 states to 42335 states and 137188 transitions. [2019-12-26 21:29:11,945 INFO L78 Accepts]: Start accepts. Automaton has 42335 states and 137188 transitions. Word has length 16 [2019-12-26 21:29:11,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:29:11,946 INFO L462 AbstractCegarLoop]: Abstraction has 42335 states and 137188 transitions. [2019-12-26 21:29:11,946 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-26 21:29:11,946 INFO L276 IsEmpty]: Start isEmpty. Operand 42335 states and 137188 transitions. [2019-12-26 21:29:11,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-26 21:29:11,958 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:29:11,958 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-26 21:29:11,958 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 21:29:11,959 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:29:11,959 INFO L82 PathProgramCache]: Analyzing trace with hash -311730194, now seen corresponding path program 1 times [2019-12-26 21:29:11,959 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:29:11,959 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1944166566] [2019-12-26 21:29:11,959 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:29:11,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:29:12,069 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-26 21:29:12,070 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1944166566] [2019-12-26 21:29:12,070 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:29:12,070 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-26 21:29:12,071 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [532170204] [2019-12-26 21:29:12,071 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-26 21:29:12,071 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:29:12,071 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-26 21:29:12,072 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-12-26 21:29:12,074 INFO L87 Difference]: Start difference. First operand 42335 states and 137188 transitions. Second operand 7 states. [2019-12-26 21:29:13,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:29:13,082 INFO L93 Difference]: Finished difference Result 68217 states and 214442 transitions. [2019-12-26 21:29:13,083 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-26 21:29:13,083 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 22 [2019-12-26 21:29:13,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:29:13,208 INFO L225 Difference]: With dead ends: 68217 [2019-12-26 21:29:13,208 INFO L226 Difference]: Without dead ends: 68203 [2019-12-26 21:29:13,209 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=144, Unknown=0, NotChecked=0, Total=210 [2019-12-26 21:29:13,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68203 states. [2019-12-26 21:29:14,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68203 to 42009. [2019-12-26 21:29:14,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42009 states. [2019-12-26 21:29:14,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42009 states to 42009 states and 135594 transitions. [2019-12-26 21:29:14,483 INFO L78 Accepts]: Start accepts. Automaton has 42009 states and 135594 transitions. Word has length 22 [2019-12-26 21:29:14,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:29:14,484 INFO L462 AbstractCegarLoop]: Abstraction has 42009 states and 135594 transitions. [2019-12-26 21:29:14,484 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-26 21:29:14,484 INFO L276 IsEmpty]: Start isEmpty. Operand 42009 states and 135594 transitions. [2019-12-26 21:29:14,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-26 21:29:14,499 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:29:14,500 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-26 21:29:14,500 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 21:29:14,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:29:14,500 INFO L82 PathProgramCache]: Analyzing trace with hash 573582081, now seen corresponding path program 1 times [2019-12-26 21:29:14,500 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:29:14,501 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1149983540] [2019-12-26 21:29:14,501 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:29:14,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:29:14,558 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-26 21:29:14,558 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1149983540] [2019-12-26 21:29:14,558 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:29:14,558 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 21:29:14,559 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1117924290] [2019-12-26 21:29:14,559 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-26 21:29:14,559 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:29:14,559 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-26 21:29:14,560 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-26 21:29:14,560 INFO L87 Difference]: Start difference. First operand 42009 states and 135594 transitions. Second operand 4 states. [2019-12-26 21:29:14,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:29:14,633 INFO L93 Difference]: Finished difference Result 16636 states and 50803 transitions. [2019-12-26 21:29:14,633 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-26 21:29:14,633 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2019-12-26 21:29:14,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:29:14,662 INFO L225 Difference]: With dead ends: 16636 [2019-12-26 21:29:14,663 INFO L226 Difference]: Without dead ends: 16636 [2019-12-26 21:29:14,663 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-26 21:29:14,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16636 states. [2019-12-26 21:29:14,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16636 to 16378. [2019-12-26 21:29:14,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16378 states. [2019-12-26 21:29:14,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16378 states to 16378 states and 50067 transitions. [2019-12-26 21:29:14,911 INFO L78 Accepts]: Start accepts. Automaton has 16378 states and 50067 transitions. Word has length 25 [2019-12-26 21:29:14,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:29:14,911 INFO L462 AbstractCegarLoop]: Abstraction has 16378 states and 50067 transitions. [2019-12-26 21:29:14,912 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-26 21:29:14,912 INFO L276 IsEmpty]: Start isEmpty. Operand 16378 states and 50067 transitions. [2019-12-26 21:29:14,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-26 21:29:14,923 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:29:14,923 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 21:29:14,924 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 21:29:14,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:29:14,924 INFO L82 PathProgramCache]: Analyzing trace with hash 574668024, now seen corresponding path program 1 times [2019-12-26 21:29:14,924 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:29:14,924 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [528071625] [2019-12-26 21:29:14,925 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:29:14,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:29:15,019 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-26 21:29:15,020 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [528071625] [2019-12-26 21:29:15,020 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:29:15,020 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-26 21:29:15,020 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [779242316] [2019-12-26 21:29:15,021 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-26 21:29:15,021 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:29:15,022 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-26 21:29:15,022 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-26 21:29:15,022 INFO L87 Difference]: Start difference. First operand 16378 states and 50067 transitions. Second operand 6 states. [2019-12-26 21:29:15,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:29:15,558 INFO L93 Difference]: Finished difference Result 23754 states and 70239 transitions. [2019-12-26 21:29:15,558 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-26 21:29:15,558 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2019-12-26 21:29:15,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:29:15,591 INFO L225 Difference]: With dead ends: 23754 [2019-12-26 21:29:15,591 INFO L226 Difference]: Without dead ends: 23754 [2019-12-26 21:29:15,592 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-12-26 21:29:15,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23754 states. [2019-12-26 21:29:16,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23754 to 19127. [2019-12-26 21:29:16,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19127 states. [2019-12-26 21:29:16,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19127 states to 19127 states and 57723 transitions. [2019-12-26 21:29:16,089 INFO L78 Accepts]: Start accepts. Automaton has 19127 states and 57723 transitions. Word has length 27 [2019-12-26 21:29:16,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:29:16,089 INFO L462 AbstractCegarLoop]: Abstraction has 19127 states and 57723 transitions. [2019-12-26 21:29:16,089 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-26 21:29:16,089 INFO L276 IsEmpty]: Start isEmpty. Operand 19127 states and 57723 transitions. [2019-12-26 21:29:16,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-26 21:29:16,109 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:29:16,109 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 21:29:16,110 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 21:29:16,110 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:29:16,110 INFO L82 PathProgramCache]: Analyzing trace with hash -1393723506, now seen corresponding path program 1 times [2019-12-26 21:29:16,110 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:29:16,110 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1092743513] [2019-12-26 21:29:16,110 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:29:16,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:29:16,212 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-26 21:29:16,212 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1092743513] [2019-12-26 21:29:16,212 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:29:16,212 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 21:29:16,213 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1145644725] [2019-12-26 21:29:16,213 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-26 21:29:16,213 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:29:16,213 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-26 21:29:16,214 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-26 21:29:16,214 INFO L87 Difference]: Start difference. First operand 19127 states and 57723 transitions. Second operand 5 states. [2019-12-26 21:29:16,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:29:16,577 INFO L93 Difference]: Finished difference Result 23902 states and 71215 transitions. [2019-12-26 21:29:16,577 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-26 21:29:16,577 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 33 [2019-12-26 21:29:16,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:29:16,609 INFO L225 Difference]: With dead ends: 23902 [2019-12-26 21:29:16,609 INFO L226 Difference]: Without dead ends: 23902 [2019-12-26 21:29:16,610 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-26 21:29:16,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23902 states. [2019-12-26 21:29:16,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23902 to 20179. [2019-12-26 21:29:16,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20179 states. [2019-12-26 21:29:16,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20179 states to 20179 states and 61180 transitions. [2019-12-26 21:29:16,931 INFO L78 Accepts]: Start accepts. Automaton has 20179 states and 61180 transitions. Word has length 33 [2019-12-26 21:29:16,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:29:16,931 INFO L462 AbstractCegarLoop]: Abstraction has 20179 states and 61180 transitions. [2019-12-26 21:29:16,931 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-26 21:29:16,931 INFO L276 IsEmpty]: Start isEmpty. Operand 20179 states and 61180 transitions. [2019-12-26 21:29:16,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-26 21:29:16,954 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:29:16,954 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 21:29:16,954 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 21:29:16,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:29:16,955 INFO L82 PathProgramCache]: Analyzing trace with hash 305072172, now seen corresponding path program 2 times [2019-12-26 21:29:16,955 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:29:16,955 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1801205354] [2019-12-26 21:29:16,955 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:29:16,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:29:17,046 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-26 21:29:17,046 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1801205354] [2019-12-26 21:29:17,046 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:29:17,046 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-26 21:29:17,047 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1521090437] [2019-12-26 21:29:17,047 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-26 21:29:17,047 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:29:17,047 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-26 21:29:17,048 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-12-26 21:29:17,048 INFO L87 Difference]: Start difference. First operand 20179 states and 61180 transitions. Second operand 8 states. [2019-12-26 21:29:18,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:29:18,279 INFO L93 Difference]: Finished difference Result 27626 states and 80996 transitions. [2019-12-26 21:29:18,279 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-12-26 21:29:18,280 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 33 [2019-12-26 21:29:18,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:29:18,318 INFO L225 Difference]: With dead ends: 27626 [2019-12-26 21:29:18,319 INFO L226 Difference]: Without dead ends: 27626 [2019-12-26 21:29:18,319 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=110, Invalid=352, Unknown=0, NotChecked=0, Total=462 [2019-12-26 21:29:18,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27626 states. [2019-12-26 21:29:18,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27626 to 17400. [2019-12-26 21:29:18,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17400 states. [2019-12-26 21:29:18,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17400 states to 17400 states and 52480 transitions. [2019-12-26 21:29:18,643 INFO L78 Accepts]: Start accepts. Automaton has 17400 states and 52480 transitions. Word has length 33 [2019-12-26 21:29:18,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:29:18,643 INFO L462 AbstractCegarLoop]: Abstraction has 17400 states and 52480 transitions. [2019-12-26 21:29:18,643 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-26 21:29:18,643 INFO L276 IsEmpty]: Start isEmpty. Operand 17400 states and 52480 transitions. [2019-12-26 21:29:18,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-26 21:29:18,665 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:29:18,665 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 21:29:18,665 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 21:29:18,666 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:29:18,666 INFO L82 PathProgramCache]: Analyzing trace with hash -1779229683, now seen corresponding path program 1 times [2019-12-26 21:29:18,666 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:29:18,666 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [388215474] [2019-12-26 21:29:18,666 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:29:18,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:29:18,721 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-26 21:29:18,721 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [388215474] [2019-12-26 21:29:18,722 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:29:18,722 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-26 21:29:18,722 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1062374276] [2019-12-26 21:29:18,722 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 21:29:18,723 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:29:18,723 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 21:29:18,723 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 21:29:18,723 INFO L87 Difference]: Start difference. First operand 17400 states and 52480 transitions. Second operand 3 states. [2019-12-26 21:29:18,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:29:18,786 INFO L93 Difference]: Finished difference Result 17399 states and 52478 transitions. [2019-12-26 21:29:18,786 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 21:29:18,786 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2019-12-26 21:29:18,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:29:18,816 INFO L225 Difference]: With dead ends: 17399 [2019-12-26 21:29:18,816 INFO L226 Difference]: Without dead ends: 17399 [2019-12-26 21:29:18,817 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-26 21:29:18,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17399 states. [2019-12-26 21:29:19,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17399 to 17399. [2019-12-26 21:29:19,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17399 states. [2019-12-26 21:29:19,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17399 states to 17399 states and 52478 transitions. [2019-12-26 21:29:19,085 INFO L78 Accepts]: Start accepts. Automaton has 17399 states and 52478 transitions. Word has length 39 [2019-12-26 21:29:19,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:29:19,085 INFO L462 AbstractCegarLoop]: Abstraction has 17399 states and 52478 transitions. [2019-12-26 21:29:19,085 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 21:29:19,085 INFO L276 IsEmpty]: Start isEmpty. Operand 17399 states and 52478 transitions. [2019-12-26 21:29:19,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-26 21:29:19,104 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:29:19,104 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-26 21:29:19,104 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 21:29:19,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:29:19,105 INFO L82 PathProgramCache]: Analyzing trace with hash 1175786798, now seen corresponding path program 1 times [2019-12-26 21:29:19,105 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:29:19,105 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [108697135] [2019-12-26 21:29:19,106 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:29:19,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:29:19,198 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-26 21:29:19,199 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [108697135] [2019-12-26 21:29:19,199 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:29:19,199 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-26 21:29:19,199 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1643211723] [2019-12-26 21:29:19,200 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-26 21:29:19,200 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:29:19,200 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-26 21:29:19,201 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-26 21:29:19,201 INFO L87 Difference]: Start difference. First operand 17399 states and 52478 transitions. Second operand 6 states. [2019-12-26 21:29:20,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:29:20,229 INFO L93 Difference]: Finished difference Result 34243 states and 103303 transitions. [2019-12-26 21:29:20,230 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-26 21:29:20,230 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 40 [2019-12-26 21:29:20,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:29:20,277 INFO L225 Difference]: With dead ends: 34243 [2019-12-26 21:29:20,278 INFO L226 Difference]: Without dead ends: 34243 [2019-12-26 21:29:20,278 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 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-26 21:29:20,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34243 states. [2019-12-26 21:29:20,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34243 to 22015. [2019-12-26 21:29:20,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22015 states. [2019-12-26 21:29:20,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22015 states to 22015 states and 66470 transitions. [2019-12-26 21:29:20,676 INFO L78 Accepts]: Start accepts. Automaton has 22015 states and 66470 transitions. Word has length 40 [2019-12-26 21:29:20,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:29:20,677 INFO L462 AbstractCegarLoop]: Abstraction has 22015 states and 66470 transitions. [2019-12-26 21:29:20,677 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-26 21:29:20,677 INFO L276 IsEmpty]: Start isEmpty. Operand 22015 states and 66470 transitions. [2019-12-26 21:29:20,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-26 21:29:20,699 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:29:20,700 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-26 21:29:20,700 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 21:29:20,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:29:20,700 INFO L82 PathProgramCache]: Analyzing trace with hash -93454286, now seen corresponding path program 2 times [2019-12-26 21:29:20,700 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:29:20,701 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [918676909] [2019-12-26 21:29:20,701 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:29:20,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:29:20,812 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-26 21:29:20,813 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [918676909] [2019-12-26 21:29:20,813 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:29:20,813 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-26 21:29:20,813 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2115394614] [2019-12-26 21:29:20,814 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-26 21:29:20,814 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:29:20,814 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-26 21:29:20,814 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-26 21:29:20,814 INFO L87 Difference]: Start difference. First operand 22015 states and 66470 transitions. Second operand 5 states. [2019-12-26 21:29:21,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:29:21,433 INFO L93 Difference]: Finished difference Result 30046 states and 90242 transitions. [2019-12-26 21:29:21,434 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-26 21:29:21,434 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 40 [2019-12-26 21:29:21,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:29:21,481 INFO L225 Difference]: With dead ends: 30046 [2019-12-26 21:29:21,481 INFO L226 Difference]: Without dead ends: 30046 [2019-12-26 21:29:21,482 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 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-26 21:29:21,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30046 states. [2019-12-26 21:29:21,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30046 to 26807. [2019-12-26 21:29:21,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26807 states. [2019-12-26 21:29:21,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26807 states to 26807 states and 81221 transitions. [2019-12-26 21:29:21,921 INFO L78 Accepts]: Start accepts. Automaton has 26807 states and 81221 transitions. Word has length 40 [2019-12-26 21:29:21,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:29:21,921 INFO L462 AbstractCegarLoop]: Abstraction has 26807 states and 81221 transitions. [2019-12-26 21:29:21,921 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-26 21:29:21,921 INFO L276 IsEmpty]: Start isEmpty. Operand 26807 states and 81221 transitions. [2019-12-26 21:29:21,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-26 21:29:21,953 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:29:21,954 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-26 21:29:21,954 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 21:29:21,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:29:21,954 INFO L82 PathProgramCache]: Analyzing trace with hash 152430908, now seen corresponding path program 3 times [2019-12-26 21:29:21,954 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:29:21,955 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [455697149] [2019-12-26 21:29:21,955 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:29:21,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:29:22,009 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-26 21:29:22,009 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [455697149] [2019-12-26 21:29:22,009 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:29:22,010 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-26 21:29:22,010 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [713456061] [2019-12-26 21:29:22,010 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-26 21:29:22,010 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:29:22,011 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-26 21:29:22,011 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-26 21:29:22,011 INFO L87 Difference]: Start difference. First operand 26807 states and 81221 transitions. Second operand 5 states. [2019-12-26 21:29:22,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:29:22,126 INFO L93 Difference]: Finished difference Result 25470 states and 78136 transitions. [2019-12-26 21:29:22,126 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-26 21:29:22,126 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 40 [2019-12-26 21:29:22,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:29:22,164 INFO L225 Difference]: With dead ends: 25470 [2019-12-26 21:29:22,164 INFO L226 Difference]: Without dead ends: 25470 [2019-12-26 21:29:22,164 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-26 21:29:22,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25470 states. [2019-12-26 21:29:22,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25470 to 24504. [2019-12-26 21:29:22,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24504 states. [2019-12-26 21:29:22,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24504 states to 24504 states and 75530 transitions. [2019-12-26 21:29:22,822 INFO L78 Accepts]: Start accepts. Automaton has 24504 states and 75530 transitions. Word has length 40 [2019-12-26 21:29:22,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:29:22,822 INFO L462 AbstractCegarLoop]: Abstraction has 24504 states and 75530 transitions. [2019-12-26 21:29:22,822 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-26 21:29:22,822 INFO L276 IsEmpty]: Start isEmpty. Operand 24504 states and 75530 transitions. [2019-12-26 21:29:22,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-26 21:29:22,853 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:29:22,853 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 21:29:22,853 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 21:29:22,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:29:22,853 INFO L82 PathProgramCache]: Analyzing trace with hash 974609302, now seen corresponding path program 1 times [2019-12-26 21:29:22,854 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:29:22,854 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1648166735] [2019-12-26 21:29:22,854 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:29:22,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:29:22,923 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-26 21:29:22,924 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1648166735] [2019-12-26 21:29:22,924 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:29:22,924 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 21:29:22,924 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [504400216] [2019-12-26 21:29:22,924 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 21:29:22,925 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:29:22,925 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 21:29:22,925 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 21:29:22,925 INFO L87 Difference]: Start difference. First operand 24504 states and 75530 transitions. Second operand 3 states. [2019-12-26 21:29:23,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:29:23,080 INFO L93 Difference]: Finished difference Result 34625 states and 106821 transitions. [2019-12-26 21:29:23,080 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 21:29:23,080 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 64 [2019-12-26 21:29:23,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:29:23,139 INFO L225 Difference]: With dead ends: 34625 [2019-12-26 21:29:23,140 INFO L226 Difference]: Without dead ends: 34625 [2019-12-26 21:29:23,140 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-26 21:29:23,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34625 states. [2019-12-26 21:29:23,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34625 to 27128. [2019-12-26 21:29:23,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27128 states. [2019-12-26 21:29:23,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27128 states to 27128 states and 84304 transitions. [2019-12-26 21:29:23,820 INFO L78 Accepts]: Start accepts. Automaton has 27128 states and 84304 transitions. Word has length 64 [2019-12-26 21:29:23,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:29:23,820 INFO L462 AbstractCegarLoop]: Abstraction has 27128 states and 84304 transitions. [2019-12-26 21:29:23,820 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 21:29:23,820 INFO L276 IsEmpty]: Start isEmpty. Operand 27128 states and 84304 transitions. [2019-12-26 21:29:23,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-26 21:29:23,848 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:29:23,848 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 21:29:23,848 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 21:29:23,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:29:23,848 INFO L82 PathProgramCache]: Analyzing trace with hash -1487362447, now seen corresponding path program 1 times [2019-12-26 21:29:23,849 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:29:23,849 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [285734358] [2019-12-26 21:29:23,849 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:29:23,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:29:23,926 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-26 21:29:23,927 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [285734358] [2019-12-26 21:29:23,927 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:29:23,927 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-26 21:29:23,927 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [525453764] [2019-12-26 21:29:23,928 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-26 21:29:23,928 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:29:23,928 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-26 21:29:23,928 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-26 21:29:23,928 INFO L87 Difference]: Start difference. First operand 27128 states and 84304 transitions. Second operand 7 states. [2019-12-26 21:29:24,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:29:24,480 INFO L93 Difference]: Finished difference Result 73273 states and 226524 transitions. [2019-12-26 21:29:24,480 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-26 21:29:24,480 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 64 [2019-12-26 21:29:24,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:29:24,590 INFO L225 Difference]: With dead ends: 73273 [2019-12-26 21:29:24,591 INFO L226 Difference]: Without dead ends: 55201 [2019-12-26 21:29:24,591 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2019-12-26 21:29:24,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55201 states. [2019-12-26 21:29:25,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55201 to 31445. [2019-12-26 21:29:25,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31445 states. [2019-12-26 21:29:25,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31445 states to 31445 states and 97708 transitions. [2019-12-26 21:29:25,239 INFO L78 Accepts]: Start accepts. Automaton has 31445 states and 97708 transitions. Word has length 64 [2019-12-26 21:29:25,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:29:25,239 INFO L462 AbstractCegarLoop]: Abstraction has 31445 states and 97708 transitions. [2019-12-26 21:29:25,239 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-26 21:29:25,239 INFO L276 IsEmpty]: Start isEmpty. Operand 31445 states and 97708 transitions. [2019-12-26 21:29:25,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-26 21:29:25,271 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:29:25,271 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 21:29:25,271 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 21:29:25,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:29:25,271 INFO L82 PathProgramCache]: Analyzing trace with hash 1007546921, now seen corresponding path program 2 times [2019-12-26 21:29:25,271 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:29:25,271 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1395687355] [2019-12-26 21:29:25,271 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:29:25,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:29:25,347 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-26 21:29:25,348 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1395687355] [2019-12-26 21:29:25,350 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:29:25,350 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-26 21:29:25,350 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [136943942] [2019-12-26 21:29:25,351 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-26 21:29:25,351 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:29:25,351 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-26 21:29:25,351 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-26 21:29:25,351 INFO L87 Difference]: Start difference. First operand 31445 states and 97708 transitions. Second operand 7 states. [2019-12-26 21:29:26,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:29:26,131 INFO L93 Difference]: Finished difference Result 81140 states and 248111 transitions. [2019-12-26 21:29:26,132 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-26 21:29:26,132 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 64 [2019-12-26 21:29:26,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:29:26,220 INFO L225 Difference]: With dead ends: 81140 [2019-12-26 21:29:26,220 INFO L226 Difference]: Without dead ends: 57495 [2019-12-26 21:29:26,221 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2019-12-26 21:29:26,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57495 states. [2019-12-26 21:29:26,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57495 to 35246. [2019-12-26 21:29:26,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35246 states. [2019-12-26 21:29:26,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35246 states to 35246 states and 109148 transitions. [2019-12-26 21:29:26,982 INFO L78 Accepts]: Start accepts. Automaton has 35246 states and 109148 transitions. Word has length 64 [2019-12-26 21:29:26,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:29:26,982 INFO L462 AbstractCegarLoop]: Abstraction has 35246 states and 109148 transitions. [2019-12-26 21:29:26,982 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-26 21:29:26,982 INFO L276 IsEmpty]: Start isEmpty. Operand 35246 states and 109148 transitions. [2019-12-26 21:29:27,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-26 21:29:27,026 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:29:27,026 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 21:29:27,026 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 21:29:27,026 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:29:27,026 INFO L82 PathProgramCache]: Analyzing trace with hash 1228276157, now seen corresponding path program 3 times [2019-12-26 21:29:27,027 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:29:27,027 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [676423752] [2019-12-26 21:29:27,027 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:29:27,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:29:27,136 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 21:29:27,136 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [676423752] [2019-12-26 21:29:27,136 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:29:27,136 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-26 21:29:27,137 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [680611275] [2019-12-26 21:29:27,138 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-26 21:29:27,138 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:29:27,138 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-26 21:29:27,138 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-12-26 21:29:27,139 INFO L87 Difference]: Start difference. First operand 35246 states and 109148 transitions. Second operand 8 states. [2019-12-26 21:29:28,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:29:28,284 INFO L93 Difference]: Finished difference Result 98595 states and 302496 transitions. [2019-12-26 21:29:28,284 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-12-26 21:29:28,284 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 64 [2019-12-26 21:29:28,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:29:28,422 INFO L225 Difference]: With dead ends: 98595 [2019-12-26 21:29:28,423 INFO L226 Difference]: Without dead ends: 87943 [2019-12-26 21:29:28,423 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=119, Invalid=343, Unknown=0, NotChecked=0, Total=462 [2019-12-26 21:29:28,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87943 states. [2019-12-26 21:29:29,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87943 to 35744. [2019-12-26 21:29:29,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35744 states. [2019-12-26 21:29:29,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35744 states to 35744 states and 111048 transitions. [2019-12-26 21:29:29,829 INFO L78 Accepts]: Start accepts. Automaton has 35744 states and 111048 transitions. Word has length 64 [2019-12-26 21:29:29,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:29:29,830 INFO L462 AbstractCegarLoop]: Abstraction has 35744 states and 111048 transitions. [2019-12-26 21:29:29,830 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-26 21:29:29,830 INFO L276 IsEmpty]: Start isEmpty. Operand 35744 states and 111048 transitions. [2019-12-26 21:29:29,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-26 21:29:29,869 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:29:29,870 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 21:29:29,870 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 21:29:29,870 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:29:29,870 INFO L82 PathProgramCache]: Analyzing trace with hash -2056816817, now seen corresponding path program 4 times [2019-12-26 21:29:29,870 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:29:29,870 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2034025898] [2019-12-26 21:29:29,870 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:29:29,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:29:29,978 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-26 21:29:29,979 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2034025898] [2019-12-26 21:29:29,980 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:29:29,980 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-26 21:29:29,980 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [751772013] [2019-12-26 21:29:29,980 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-26 21:29:29,981 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:29:29,981 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-26 21:29:29,981 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-26 21:29:29,981 INFO L87 Difference]: Start difference. First operand 35744 states and 111048 transitions. Second operand 9 states. [2019-12-26 21:29:31,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:29:31,618 INFO L93 Difference]: Finished difference Result 119468 states and 363005 transitions. [2019-12-26 21:29:31,618 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-26 21:29:31,618 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 64 [2019-12-26 21:29:31,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:29:31,801 INFO L225 Difference]: With dead ends: 119468 [2019-12-26 21:29:31,801 INFO L226 Difference]: Without dead ends: 105156 [2019-12-26 21:29:31,802 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 223 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=227, Invalid=703, Unknown=0, NotChecked=0, Total=930 [2019-12-26 21:29:32,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105156 states. [2019-12-26 21:29:33,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105156 to 35780. [2019-12-26 21:29:33,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35780 states. [2019-12-26 21:29:33,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35780 states to 35780 states and 111205 transitions. [2019-12-26 21:29:33,447 INFO L78 Accepts]: Start accepts. Automaton has 35780 states and 111205 transitions. Word has length 64 [2019-12-26 21:29:33,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:29:33,448 INFO L462 AbstractCegarLoop]: Abstraction has 35780 states and 111205 transitions. [2019-12-26 21:29:33,448 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-26 21:29:33,448 INFO L276 IsEmpty]: Start isEmpty. Operand 35780 states and 111205 transitions. [2019-12-26 21:29:33,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-26 21:29:33,486 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:29:33,486 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 21:29:33,486 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 21:29:33,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:29:33,486 INFO L82 PathProgramCache]: Analyzing trace with hash 836129701, now seen corresponding path program 5 times [2019-12-26 21:29:33,487 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:29:33,487 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [14014514] [2019-12-26 21:29:33,487 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:29:33,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:29:33,586 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-26 21:29:33,587 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [14014514] [2019-12-26 21:29:33,587 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:29:33,587 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-26 21:29:33,587 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [38330195] [2019-12-26 21:29:33,588 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-26 21:29:33,588 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:29:33,588 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-26 21:29:33,589 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-26 21:29:33,589 INFO L87 Difference]: Start difference. First operand 35780 states and 111205 transitions. Second operand 9 states. [2019-12-26 21:29:35,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:29:35,143 INFO L93 Difference]: Finished difference Result 131669 states and 399951 transitions. [2019-12-26 21:29:35,143 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-12-26 21:29:35,143 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 64 [2019-12-26 21:29:35,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:29:35,338 INFO L225 Difference]: With dead ends: 131669 [2019-12-26 21:29:35,338 INFO L226 Difference]: Without dead ends: 121803 [2019-12-26 21:29:35,338 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 209 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=235, Invalid=635, Unknown=0, NotChecked=0, Total=870 [2019-12-26 21:29:35,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121803 states. [2019-12-26 21:29:36,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121803 to 35817. [2019-12-26 21:29:36,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35817 states. [2019-12-26 21:29:36,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35817 states to 35817 states and 111367 transitions. [2019-12-26 21:29:36,555 INFO L78 Accepts]: Start accepts. Automaton has 35817 states and 111367 transitions. Word has length 64 [2019-12-26 21:29:36,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:29:36,556 INFO L462 AbstractCegarLoop]: Abstraction has 35817 states and 111367 transitions. [2019-12-26 21:29:36,556 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-26 21:29:36,556 INFO L276 IsEmpty]: Start isEmpty. Operand 35817 states and 111367 transitions. [2019-12-26 21:29:36,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-26 21:29:36,593 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:29:36,594 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 21:29:36,594 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 21:29:36,594 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:29:36,594 INFO L82 PathProgramCache]: Analyzing trace with hash -17789391, now seen corresponding path program 6 times [2019-12-26 21:29:36,594 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:29:36,594 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1742185312] [2019-12-26 21:29:36,595 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:29:36,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:29:36,654 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 21:29:36,654 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1742185312] [2019-12-26 21:29:36,654 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:29:36,655 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 21:29:36,655 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1999012682] [2019-12-26 21:29:36,655 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 21:29:36,655 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:29:36,655 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 21:29:36,656 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 21:29:36,656 INFO L87 Difference]: Start difference. First operand 35817 states and 111367 transitions. Second operand 3 states. [2019-12-26 21:29:37,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:29:37,108 INFO L93 Difference]: Finished difference Result 42547 states and 131537 transitions. [2019-12-26 21:29:37,109 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 21:29:37,109 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 64 [2019-12-26 21:29:37,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:29:37,213 INFO L225 Difference]: With dead ends: 42547 [2019-12-26 21:29:37,214 INFO L226 Difference]: Without dead ends: 42547 [2019-12-26 21:29:37,214 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 21:29:37,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42547 states. [2019-12-26 21:29:38,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42547 to 37071. [2019-12-26 21:29:38,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37071 states. [2019-12-26 21:29:38,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37071 states to 37071 states and 115326 transitions. [2019-12-26 21:29:38,247 INFO L78 Accepts]: Start accepts. Automaton has 37071 states and 115326 transitions. Word has length 64 [2019-12-26 21:29:38,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:29:38,247 INFO L462 AbstractCegarLoop]: Abstraction has 37071 states and 115326 transitions. [2019-12-26 21:29:38,247 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 21:29:38,247 INFO L276 IsEmpty]: Start isEmpty. Operand 37071 states and 115326 transitions. [2019-12-26 21:29:38,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-26 21:29:38,288 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:29:38,288 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 21:29:38,289 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 21:29:38,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:29:38,289 INFO L82 PathProgramCache]: Analyzing trace with hash 1046831716, now seen corresponding path program 1 times [2019-12-26 21:29:38,289 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:29:38,289 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1163996676] [2019-12-26 21:29:38,289 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:29:38,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:29:38,395 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-26 21:29:38,396 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1163996676] [2019-12-26 21:29:38,396 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:29:38,397 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-26 21:29:38,397 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1657508863] [2019-12-26 21:29:38,397 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-26 21:29:38,398 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:29:38,399 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-26 21:29:38,399 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-12-26 21:29:38,399 INFO L87 Difference]: Start difference. First operand 37071 states and 115326 transitions. Second operand 8 states. [2019-12-26 21:29:39,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:29:39,589 INFO L93 Difference]: Finished difference Result 111740 states and 339408 transitions. [2019-12-26 21:29:39,589 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-12-26 21:29:39,589 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 65 [2019-12-26 21:29:39,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:29:39,745 INFO L225 Difference]: With dead ends: 111740 [2019-12-26 21:29:39,745 INFO L226 Difference]: Without dead ends: 99733 [2019-12-26 21:29:39,745 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=119, Invalid=343, Unknown=0, NotChecked=0, Total=462 [2019-12-26 21:29:40,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99733 states. [2019-12-26 21:29:41,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99733 to 37073. [2019-12-26 21:29:41,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37073 states. [2019-12-26 21:29:41,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37073 states to 37073 states and 115341 transitions. [2019-12-26 21:29:41,378 INFO L78 Accepts]: Start accepts. Automaton has 37073 states and 115341 transitions. Word has length 65 [2019-12-26 21:29:41,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:29:41,378 INFO L462 AbstractCegarLoop]: Abstraction has 37073 states and 115341 transitions. [2019-12-26 21:29:41,378 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-26 21:29:41,378 INFO L276 IsEmpty]: Start isEmpty. Operand 37073 states and 115341 transitions. [2019-12-26 21:29:41,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-26 21:29:41,419 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:29:41,419 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 21:29:41,419 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 21:29:41,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:29:41,420 INFO L82 PathProgramCache]: Analyzing trace with hash 501635668, now seen corresponding path program 2 times [2019-12-26 21:29:41,420 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:29:41,420 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1400556124] [2019-12-26 21:29:41,420 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:29:41,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:29:41,529 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-26 21:29:41,529 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1400556124] [2019-12-26 21:29:41,530 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:29:41,530 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-26 21:29:41,530 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [498817159] [2019-12-26 21:29:41,530 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-26 21:29:41,530 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:29:41,531 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-26 21:29:41,531 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-26 21:29:41,533 INFO L87 Difference]: Start difference. First operand 37073 states and 115341 transitions. Second operand 9 states. [2019-12-26 21:29:43,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:29:43,150 INFO L93 Difference]: Finished difference Result 134194 states and 407074 transitions. [2019-12-26 21:29:43,150 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-12-26 21:29:43,150 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 65 [2019-12-26 21:29:43,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:29:43,343 INFO L225 Difference]: With dead ends: 134194 [2019-12-26 21:29:43,343 INFO L226 Difference]: Without dead ends: 122325 [2019-12-26 21:29:43,344 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 183 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=205, Invalid=607, Unknown=0, NotChecked=0, Total=812 [2019-12-26 21:29:43,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122325 states. [2019-12-26 21:29:44,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122325 to 37029. [2019-12-26 21:29:44,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37029 states. [2019-12-26 21:29:44,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37029 states to 37029 states and 115116 transitions. [2019-12-26 21:29:44,620 INFO L78 Accepts]: Start accepts. Automaton has 37029 states and 115116 transitions. Word has length 65 [2019-12-26 21:29:44,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:29:44,620 INFO L462 AbstractCegarLoop]: Abstraction has 37029 states and 115116 transitions. [2019-12-26 21:29:44,620 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-26 21:29:44,620 INFO L276 IsEmpty]: Start isEmpty. Operand 37029 states and 115116 transitions. [2019-12-26 21:29:44,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-26 21:29:44,664 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:29:44,664 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 21:29:44,665 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 21:29:44,665 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:29:44,665 INFO L82 PathProgramCache]: Analyzing trace with hash 1293437306, now seen corresponding path program 3 times [2019-12-26 21:29:44,665 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:29:44,665 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [498062279] [2019-12-26 21:29:44,666 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:29:44,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:29:44,791 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-26 21:29:44,792 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [498062279] [2019-12-26 21:29:44,792 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:29:44,792 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-26 21:29:44,793 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2060869287] [2019-12-26 21:29:44,793 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-26 21:29:44,793 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:29:44,793 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-26 21:29:44,794 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-26 21:29:44,794 INFO L87 Difference]: Start difference. First operand 37029 states and 115116 transitions. Second operand 9 states. [2019-12-26 21:29:46,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:29:46,842 INFO L93 Difference]: Finished difference Result 153077 states and 465403 transitions. [2019-12-26 21:29:46,843 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-26 21:29:46,843 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 65 [2019-12-26 21:29:46,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:29:47,046 INFO L225 Difference]: With dead ends: 153077 [2019-12-26 21:29:47,046 INFO L226 Difference]: Without dead ends: 125434 [2019-12-26 21:29:47,046 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 214 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=261, Invalid=669, Unknown=0, NotChecked=0, Total=930 [2019-12-26 21:29:47,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125434 states. [2019-12-26 21:29:48,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125434 to 40153. [2019-12-26 21:29:48,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40153 states. [2019-12-26 21:29:48,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40153 states to 40153 states and 125039 transitions. [2019-12-26 21:29:48,418 INFO L78 Accepts]: Start accepts. Automaton has 40153 states and 125039 transitions. Word has length 65 [2019-12-26 21:29:48,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:29:48,418 INFO L462 AbstractCegarLoop]: Abstraction has 40153 states and 125039 transitions. [2019-12-26 21:29:48,418 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-26 21:29:48,418 INFO L276 IsEmpty]: Start isEmpty. Operand 40153 states and 125039 transitions. [2019-12-26 21:29:48,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-26 21:29:48,463 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:29:48,463 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 21:29:48,464 INFO L410 AbstractCegarLoop]: === Iteration 24 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 21:29:48,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:29:48,464 INFO L82 PathProgramCache]: Analyzing trace with hash 1980366454, now seen corresponding path program 4 times [2019-12-26 21:29:48,464 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:29:48,464 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2002916952] [2019-12-26 21:29:48,464 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:29:48,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:29:48,562 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-26 21:29:48,563 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2002916952] [2019-12-26 21:29:48,563 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:29:48,563 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-26 21:29:48,563 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1007109492] [2019-12-26 21:29:48,564 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-26 21:29:48,564 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:29:48,564 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-26 21:29:48,564 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-26 21:29:48,564 INFO L87 Difference]: Start difference. First operand 40153 states and 125039 transitions. Second operand 7 states. [2019-12-26 21:29:49,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:29:49,606 INFO L93 Difference]: Finished difference Result 55596 states and 169227 transitions. [2019-12-26 21:29:49,607 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-26 21:29:49,607 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 65 [2019-12-26 21:29:49,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:29:49,690 INFO L225 Difference]: With dead ends: 55596 [2019-12-26 21:29:49,690 INFO L226 Difference]: Without dead ends: 55596 [2019-12-26 21:29:49,690 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=158, Unknown=0, NotChecked=0, Total=210 [2019-12-26 21:29:49,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55596 states. [2019-12-26 21:29:50,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55596 to 42525. [2019-12-26 21:29:50,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42525 states. [2019-12-26 21:29:50,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42525 states to 42525 states and 131689 transitions. [2019-12-26 21:29:50,749 INFO L78 Accepts]: Start accepts. Automaton has 42525 states and 131689 transitions. Word has length 65 [2019-12-26 21:29:50,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:29:50,749 INFO L462 AbstractCegarLoop]: Abstraction has 42525 states and 131689 transitions. [2019-12-26 21:29:50,749 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-26 21:29:50,750 INFO L276 IsEmpty]: Start isEmpty. Operand 42525 states and 131689 transitions. [2019-12-26 21:29:50,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-26 21:29:50,796 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:29:50,796 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 21:29:50,797 INFO L410 AbstractCegarLoop]: === Iteration 25 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 21:29:50,797 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:29:50,797 INFO L82 PathProgramCache]: Analyzing trace with hash -25014344, now seen corresponding path program 5 times [2019-12-26 21:29:50,797 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:29:50,797 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2076021538] [2019-12-26 21:29:50,797 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:29:50,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:29:50,925 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-26 21:29:50,926 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2076021538] [2019-12-26 21:29:50,926 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:29:50,926 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-26 21:29:50,926 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [742717960] [2019-12-26 21:29:50,927 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-26 21:29:50,927 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:29:50,927 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-26 21:29:50,927 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-12-26 21:29:50,927 INFO L87 Difference]: Start difference. First operand 42525 states and 131689 transitions. Second operand 9 states. [2019-12-26 21:29:52,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:29:52,893 INFO L93 Difference]: Finished difference Result 66164 states and 202890 transitions. [2019-12-26 21:29:52,893 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-12-26 21:29:52,893 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 65 [2019-12-26 21:29:52,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:29:52,994 INFO L225 Difference]: With dead ends: 66164 [2019-12-26 21:29:52,994 INFO L226 Difference]: Without dead ends: 66164 [2019-12-26 21:29:52,995 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 15 SyntacticMatches, 2 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 143 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=138, Invalid=512, Unknown=0, NotChecked=0, Total=650 [2019-12-26 21:29:53,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66164 states. [2019-12-26 21:29:53,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66164 to 41944. [2019-12-26 21:29:53,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41944 states. [2019-12-26 21:29:53,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41944 states to 41944 states and 130085 transitions. [2019-12-26 21:29:53,855 INFO L78 Accepts]: Start accepts. Automaton has 41944 states and 130085 transitions. Word has length 65 [2019-12-26 21:29:53,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:29:53,855 INFO L462 AbstractCegarLoop]: Abstraction has 41944 states and 130085 transitions. [2019-12-26 21:29:53,855 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-26 21:29:53,855 INFO L276 IsEmpty]: Start isEmpty. Operand 41944 states and 130085 transitions. [2019-12-26 21:29:53,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-26 21:29:53,900 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:29:53,900 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 21:29:53,900 INFO L410 AbstractCegarLoop]: === Iteration 26 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 21:29:53,901 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:29:53,901 INFO L82 PathProgramCache]: Analyzing trace with hash 373916454, now seen corresponding path program 1 times [2019-12-26 21:29:53,901 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:29:53,901 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1760266620] [2019-12-26 21:29:53,901 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:29:53,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:29:54,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-26 21:29:54,009 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1760266620] [2019-12-26 21:29:54,009 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:29:54,009 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-26 21:29:54,009 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1825380952] [2019-12-26 21:29:54,010 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-26 21:29:54,010 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:29:54,010 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-26 21:29:54,010 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-12-26 21:29:54,010 INFO L87 Difference]: Start difference. First operand 41944 states and 130085 transitions. Second operand 8 states. [2019-12-26 21:29:55,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:29:55,959 INFO L93 Difference]: Finished difference Result 55795 states and 168786 transitions. [2019-12-26 21:29:55,959 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-12-26 21:29:55,959 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 65 [2019-12-26 21:29:55,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:29:56,041 INFO L225 Difference]: With dead ends: 55795 [2019-12-26 21:29:56,042 INFO L226 Difference]: Without dead ends: 55795 [2019-12-26 21:29:56,042 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 6 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=100, Invalid=406, Unknown=0, NotChecked=0, Total=506 [2019-12-26 21:29:56,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55795 states. [2019-12-26 21:29:56,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55795 to 43437. [2019-12-26 21:29:56,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43437 states. [2019-12-26 21:29:56,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43437 states to 43437 states and 134338 transitions. [2019-12-26 21:29:56,829 INFO L78 Accepts]: Start accepts. Automaton has 43437 states and 134338 transitions. Word has length 65 [2019-12-26 21:29:56,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:29:56,829 INFO L462 AbstractCegarLoop]: Abstraction has 43437 states and 134338 transitions. [2019-12-26 21:29:56,829 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-26 21:29:56,829 INFO L276 IsEmpty]: Start isEmpty. Operand 43437 states and 134338 transitions. [2019-12-26 21:29:56,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-26 21:29:56,875 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:29:56,875 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 21:29:56,875 INFO L410 AbstractCegarLoop]: === Iteration 27 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 21:29:56,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:29:56,875 INFO L82 PathProgramCache]: Analyzing trace with hash 1193547640, now seen corresponding path program 2 times [2019-12-26 21:29:56,875 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:29:56,876 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1745625759] [2019-12-26 21:29:56,876 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:29:56,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:29:56,975 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 21:29:56,975 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1745625759] [2019-12-26 21:29:56,975 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:29:56,976 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-26 21:29:56,976 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2009844198] [2019-12-26 21:29:56,976 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-26 21:29:56,976 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:29:56,976 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-26 21:29:56,977 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-26 21:29:56,977 INFO L87 Difference]: Start difference. First operand 43437 states and 134338 transitions. Second operand 7 states. [2019-12-26 21:29:58,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:29:58,280 INFO L93 Difference]: Finished difference Result 63283 states and 194671 transitions. [2019-12-26 21:29:58,281 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-26 21:29:58,281 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 65 [2019-12-26 21:29:58,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:29:58,377 INFO L225 Difference]: With dead ends: 63283 [2019-12-26 21:29:58,377 INFO L226 Difference]: Without dead ends: 63283 [2019-12-26 21:29:58,378 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 7 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2019-12-26 21:29:58,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63283 states. [2019-12-26 21:29:59,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63283 to 42978. [2019-12-26 21:29:59,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42978 states. [2019-12-26 21:29:59,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42978 states to 42978 states and 133075 transitions. [2019-12-26 21:29:59,184 INFO L78 Accepts]: Start accepts. Automaton has 42978 states and 133075 transitions. Word has length 65 [2019-12-26 21:29:59,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:29:59,184 INFO L462 AbstractCegarLoop]: Abstraction has 42978 states and 133075 transitions. [2019-12-26 21:29:59,184 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-26 21:29:59,184 INFO L276 IsEmpty]: Start isEmpty. Operand 42978 states and 133075 transitions. [2019-12-26 21:29:59,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-26 21:29:59,227 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:29:59,227 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 21:29:59,227 INFO L410 AbstractCegarLoop]: === Iteration 28 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 21:29:59,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:29:59,228 INFO L82 PathProgramCache]: Analyzing trace with hash 1646807062, now seen corresponding path program 3 times [2019-12-26 21:29:59,228 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:29:59,228 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1754878475] [2019-12-26 21:29:59,228 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:29:59,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:29:59,799 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-26 21:29:59,800 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1754878475] [2019-12-26 21:29:59,800 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:29:59,800 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-26 21:29:59,800 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1510922641] [2019-12-26 21:29:59,800 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-26 21:29:59,801 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:29:59,801 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-26 21:29:59,801 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2019-12-26 21:29:59,801 INFO L87 Difference]: Start difference. First operand 42978 states and 133075 transitions. Second operand 10 states. [2019-12-26 21:30:02,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:30:02,434 INFO L93 Difference]: Finished difference Result 66926 states and 204148 transitions. [2019-12-26 21:30:02,434 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-12-26 21:30:02,434 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 65 [2019-12-26 21:30:02,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:30:02,542 INFO L225 Difference]: With dead ends: 66926 [2019-12-26 21:30:02,542 INFO L226 Difference]: Without dead ends: 66926 [2019-12-26 21:30:02,543 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 25 SyntacticMatches, 2 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 379 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=224, Invalid=1182, Unknown=0, NotChecked=0, Total=1406 [2019-12-26 21:30:02,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66926 states. [2019-12-26 21:30:03,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66926 to 39586. [2019-12-26 21:30:03,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39586 states. [2019-12-26 21:30:03,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39586 states to 39586 states and 123177 transitions. [2019-12-26 21:30:03,423 INFO L78 Accepts]: Start accepts. Automaton has 39586 states and 123177 transitions. Word has length 65 [2019-12-26 21:30:03,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:30:03,423 INFO L462 AbstractCegarLoop]: Abstraction has 39586 states and 123177 transitions. [2019-12-26 21:30:03,423 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-26 21:30:03,423 INFO L276 IsEmpty]: Start isEmpty. Operand 39586 states and 123177 transitions. [2019-12-26 21:30:03,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-26 21:30:03,471 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:30:03,471 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 21:30:03,471 INFO L410 AbstractCegarLoop]: === Iteration 29 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 21:30:03,471 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:30:03,471 INFO L82 PathProgramCache]: Analyzing trace with hash 1534293356, now seen corresponding path program 6 times [2019-12-26 21:30:03,471 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:30:03,471 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [794420605] [2019-12-26 21:30:03,472 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:30:03,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:30:03,540 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-26 21:30:03,541 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [794420605] [2019-12-26 21:30:03,541 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:30:03,541 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 21:30:03,541 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [756616389] [2019-12-26 21:30:03,542 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-26 21:30:03,542 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:30:03,542 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-26 21:30:03,542 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-26 21:30:03,542 INFO L87 Difference]: Start difference. First operand 39586 states and 123177 transitions. Second operand 4 states. [2019-12-26 21:30:03,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:30:03,837 INFO L93 Difference]: Finished difference Result 39586 states and 122905 transitions. [2019-12-26 21:30:03,837 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-26 21:30:03,837 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 65 [2019-12-26 21:30:03,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:30:03,925 INFO L225 Difference]: With dead ends: 39586 [2019-12-26 21:30:03,926 INFO L226 Difference]: Without dead ends: 39586 [2019-12-26 21:30:03,926 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-26 21:30:04,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39586 states. [2019-12-26 21:30:04,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39586 to 37695. [2019-12-26 21:30:04,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37695 states. [2019-12-26 21:30:04,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37695 states to 37695 states and 117130 transitions. [2019-12-26 21:30:04,638 INFO L78 Accepts]: Start accepts. Automaton has 37695 states and 117130 transitions. Word has length 65 [2019-12-26 21:30:04,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:30:04,638 INFO L462 AbstractCegarLoop]: Abstraction has 37695 states and 117130 transitions. [2019-12-26 21:30:04,638 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-26 21:30:04,638 INFO L276 IsEmpty]: Start isEmpty. Operand 37695 states and 117130 transitions. [2019-12-26 21:30:04,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-26 21:30:04,682 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:30:04,682 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 21:30:04,682 INFO L410 AbstractCegarLoop]: === Iteration 30 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 21:30:04,682 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:30:04,682 INFO L82 PathProgramCache]: Analyzing trace with hash -1521961444, now seen corresponding path program 4 times [2019-12-26 21:30:04,683 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:30:04,683 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1956853899] [2019-12-26 21:30:04,683 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:30:04,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:30:05,157 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-26 21:30:05,157 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1956853899] [2019-12-26 21:30:05,157 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:30:05,158 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 21:30:05,158 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1520056163] [2019-12-26 21:30:05,158 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 21:30:05,158 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:30:05,158 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 21:30:05,159 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 21:30:05,159 INFO L87 Difference]: Start difference. First operand 37695 states and 117130 transitions. Second operand 3 states. [2019-12-26 21:30:05,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:30:05,276 INFO L93 Difference]: Finished difference Result 37694 states and 117128 transitions. [2019-12-26 21:30:05,277 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 21:30:05,277 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-26 21:30:05,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:30:05,339 INFO L225 Difference]: With dead ends: 37694 [2019-12-26 21:30:05,339 INFO L226 Difference]: Without dead ends: 37694 [2019-12-26 21:30:05,340 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-26 21:30:05,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37694 states. [2019-12-26 21:30:05,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37694 to 29303. [2019-12-26 21:30:05,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29303 states. [2019-12-26 21:30:05,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29303 states to 29303 states and 93686 transitions. [2019-12-26 21:30:05,972 INFO L78 Accepts]: Start accepts. Automaton has 29303 states and 93686 transitions. Word has length 65 [2019-12-26 21:30:05,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:30:05,973 INFO L462 AbstractCegarLoop]: Abstraction has 29303 states and 93686 transitions. [2019-12-26 21:30:05,973 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 21:30:05,973 INFO L276 IsEmpty]: Start isEmpty. Operand 29303 states and 93686 transitions. [2019-12-26 21:30:06,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-26 21:30:06,005 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:30:06,005 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 21:30:06,005 INFO L410 AbstractCegarLoop]: === Iteration 31 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 21:30:06,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:30:06,006 INFO L82 PathProgramCache]: Analyzing trace with hash 392067852, now seen corresponding path program 1 times [2019-12-26 21:30:06,006 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:30:06,006 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1772414777] [2019-12-26 21:30:06,006 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:30:06,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:30:06,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-26 21:30:06,096 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1772414777] [2019-12-26 21:30:06,097 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:30:06,097 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 21:30:06,097 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [476384252] [2019-12-26 21:30:06,097 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 21:30:06,097 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:30:06,098 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 21:30:06,098 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 21:30:06,098 INFO L87 Difference]: Start difference. First operand 29303 states and 93686 transitions. Second operand 3 states. [2019-12-26 21:30:06,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:30:06,200 INFO L93 Difference]: Finished difference Result 24020 states and 75388 transitions. [2019-12-26 21:30:06,200 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 21:30:06,200 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-12-26 21:30:06,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:30:06,244 INFO L225 Difference]: With dead ends: 24020 [2019-12-26 21:30:06,244 INFO L226 Difference]: Without dead ends: 24020 [2019-12-26 21:30:06,245 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-26 21:30:06,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24020 states. [2019-12-26 21:30:06,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24020 to 22094. [2019-12-26 21:30:06,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22094 states. [2019-12-26 21:30:06,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22094 states to 22094 states and 69094 transitions. [2019-12-26 21:30:06,619 INFO L78 Accepts]: Start accepts. Automaton has 22094 states and 69094 transitions. Word has length 66 [2019-12-26 21:30:06,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:30:06,619 INFO L462 AbstractCegarLoop]: Abstraction has 22094 states and 69094 transitions. [2019-12-26 21:30:06,619 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 21:30:06,619 INFO L276 IsEmpty]: Start isEmpty. Operand 22094 states and 69094 transitions. [2019-12-26 21:30:06,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-26 21:30:06,646 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:30:06,646 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 21:30:06,646 INFO L410 AbstractCegarLoop]: === Iteration 32 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 21:30:06,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:30:06,646 INFO L82 PathProgramCache]: Analyzing trace with hash 2062742571, now seen corresponding path program 1 times [2019-12-26 21:30:06,646 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:30:06,647 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [664977747] [2019-12-26 21:30:06,647 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:30:06,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:30:06,751 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-26 21:30:06,752 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [664977747] [2019-12-26 21:30:06,752 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:30:06,752 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-26 21:30:06,752 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1472512538] [2019-12-26 21:30:06,752 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-26 21:30:06,753 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:30:06,753 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-26 21:30:06,753 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-12-26 21:30:06,753 INFO L87 Difference]: Start difference. First operand 22094 states and 69094 transitions. Second operand 9 states. [2019-12-26 21:30:08,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:30:08,376 INFO L93 Difference]: Finished difference Result 42939 states and 132861 transitions. [2019-12-26 21:30:08,377 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-12-26 21:30:08,377 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 67 [2019-12-26 21:30:08,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:30:08,427 INFO L225 Difference]: With dead ends: 42939 [2019-12-26 21:30:08,427 INFO L226 Difference]: Without dead ends: 35065 [2019-12-26 21:30:08,428 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=107, Invalid=399, Unknown=0, NotChecked=0, Total=506 [2019-12-26 21:30:08,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35065 states. [2019-12-26 21:30:08,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35065 to 22778. [2019-12-26 21:30:08,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22778 states. [2019-12-26 21:30:08,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22778 states to 22778 states and 70805 transitions. [2019-12-26 21:30:08,896 INFO L78 Accepts]: Start accepts. Automaton has 22778 states and 70805 transitions. Word has length 67 [2019-12-26 21:30:08,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:30:08,896 INFO L462 AbstractCegarLoop]: Abstraction has 22778 states and 70805 transitions. [2019-12-26 21:30:08,897 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-26 21:30:08,897 INFO L276 IsEmpty]: Start isEmpty. Operand 22778 states and 70805 transitions. [2019-12-26 21:30:08,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-26 21:30:08,926 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:30:08,926 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 21:30:08,927 INFO L410 AbstractCegarLoop]: === Iteration 33 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 21:30:08,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:30:08,927 INFO L82 PathProgramCache]: Analyzing trace with hash 1535531457, now seen corresponding path program 2 times [2019-12-26 21:30:08,927 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:30:08,927 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1007559125] [2019-12-26 21:30:08,927 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:30:08,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:30:09,087 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-26 21:30:09,088 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1007559125] [2019-12-26 21:30:09,088 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:30:09,088 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-26 21:30:09,088 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1236290021] [2019-12-26 21:30:09,088 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-26 21:30:09,089 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:30:09,089 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-26 21:30:09,089 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-12-26 21:30:09,089 INFO L87 Difference]: Start difference. First operand 22778 states and 70805 transitions. Second operand 10 states. [2019-12-26 21:30:10,185 WARN L192 SmtUtils]: Spent 217.00 ms on a formula simplification that was a NOOP. DAG size: 9 [2019-12-26 21:30:10,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:30:10,277 INFO L93 Difference]: Finished difference Result 44683 states and 137584 transitions. [2019-12-26 21:30:10,277 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-12-26 21:30:10,277 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 67 [2019-12-26 21:30:10,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:30:10,334 INFO L225 Difference]: With dead ends: 44683 [2019-12-26 21:30:10,334 INFO L226 Difference]: Without dead ends: 42768 [2019-12-26 21:30:10,335 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 154 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=152, Invalid=604, Unknown=0, NotChecked=0, Total=756 [2019-12-26 21:30:10,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42768 states. [2019-12-26 21:30:10,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42768 to 26032. [2019-12-26 21:30:10,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26032 states. [2019-12-26 21:30:10,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26032 states to 26032 states and 80627 transitions. [2019-12-26 21:30:10,846 INFO L78 Accepts]: Start accepts. Automaton has 26032 states and 80627 transitions. Word has length 67 [2019-12-26 21:30:10,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:30:10,847 INFO L462 AbstractCegarLoop]: Abstraction has 26032 states and 80627 transitions. [2019-12-26 21:30:10,847 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-26 21:30:10,847 INFO L276 IsEmpty]: Start isEmpty. Operand 26032 states and 80627 transitions. [2019-12-26 21:30:10,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-26 21:30:10,876 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:30:10,876 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 21:30:10,876 INFO L410 AbstractCegarLoop]: === Iteration 34 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 21:30:10,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:30:10,877 INFO L82 PathProgramCache]: Analyzing trace with hash 1442171729, now seen corresponding path program 3 times [2019-12-26 21:30:10,877 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:30:10,877 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2077992610] [2019-12-26 21:30:10,877 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:30:10,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:30:11,016 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-26 21:30:11,016 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2077992610] [2019-12-26 21:30:11,017 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:30:11,017 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-26 21:30:11,017 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1889818491] [2019-12-26 21:30:11,017 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-26 21:30:11,017 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:30:11,017 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-26 21:30:11,017 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-12-26 21:30:11,018 INFO L87 Difference]: Start difference. First operand 26032 states and 80627 transitions. Second operand 10 states. [2019-12-26 21:30:11,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:30:11,775 INFO L93 Difference]: Finished difference Result 43340 states and 133082 transitions. [2019-12-26 21:30:11,775 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-26 21:30:11,775 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 67 [2019-12-26 21:30:11,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:30:11,827 INFO L225 Difference]: With dead ends: 43340 [2019-12-26 21:30:11,828 INFO L226 Difference]: Without dead ends: 36825 [2019-12-26 21:30:11,828 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=100, Invalid=362, Unknown=0, NotChecked=0, Total=462 [2019-12-26 21:30:11,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36825 states. [2019-12-26 21:30:12,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36825 to 22389. [2019-12-26 21:30:12,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22389 states. [2019-12-26 21:30:12,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22389 states to 22389 states and 69376 transitions. [2019-12-26 21:30:12,268 INFO L78 Accepts]: Start accepts. Automaton has 22389 states and 69376 transitions. Word has length 67 [2019-12-26 21:30:12,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:30:12,269 INFO L462 AbstractCegarLoop]: Abstraction has 22389 states and 69376 transitions. [2019-12-26 21:30:12,269 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-26 21:30:12,269 INFO L276 IsEmpty]: Start isEmpty. Operand 22389 states and 69376 transitions. [2019-12-26 21:30:12,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-26 21:30:12,292 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:30:12,292 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 21:30:12,292 INFO L410 AbstractCegarLoop]: === Iteration 35 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 21:30:12,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:30:12,292 INFO L82 PathProgramCache]: Analyzing trace with hash -2065446981, now seen corresponding path program 4 times [2019-12-26 21:30:12,293 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:30:12,293 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [226777742] [2019-12-26 21:30:12,293 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:30:12,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:30:12,835 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-26 21:30:12,836 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [226777742] [2019-12-26 21:30:12,836 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:30:12,836 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-12-26 21:30:12,836 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [400526220] [2019-12-26 21:30:12,837 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-12-26 21:30:12,837 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:30:12,837 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-12-26 21:30:12,837 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=253, Unknown=0, NotChecked=0, Total=306 [2019-12-26 21:30:12,837 INFO L87 Difference]: Start difference. First operand 22389 states and 69376 transitions. Second operand 18 states. [2019-12-26 21:30:17,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:30:17,640 INFO L93 Difference]: Finished difference Result 38883 states and 117240 transitions. [2019-12-26 21:30:17,640 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-12-26 21:30:17,640 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 67 [2019-12-26 21:30:17,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:30:17,912 INFO L225 Difference]: With dead ends: 38883 [2019-12-26 21:30:17,912 INFO L226 Difference]: Without dead ends: 36920 [2019-12-26 21:30:17,913 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 354 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=292, Invalid=1268, Unknown=0, NotChecked=0, Total=1560 [2019-12-26 21:30:18,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36920 states. [2019-12-26 21:30:18,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36920 to 22645. [2019-12-26 21:30:18,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22645 states. [2019-12-26 21:30:18,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22645 states to 22645 states and 70049 transitions. [2019-12-26 21:30:18,324 INFO L78 Accepts]: Start accepts. Automaton has 22645 states and 70049 transitions. Word has length 67 [2019-12-26 21:30:18,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:30:18,324 INFO L462 AbstractCegarLoop]: Abstraction has 22645 states and 70049 transitions. [2019-12-26 21:30:18,324 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-12-26 21:30:18,324 INFO L276 IsEmpty]: Start isEmpty. Operand 22645 states and 70049 transitions. [2019-12-26 21:30:18,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-26 21:30:18,354 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:30:18,354 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 21:30:18,354 INFO L410 AbstractCegarLoop]: === Iteration 36 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 21:30:18,354 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:30:18,355 INFO L82 PathProgramCache]: Analyzing trace with hash 10116829, now seen corresponding path program 5 times [2019-12-26 21:30:18,355 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:30:18,355 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1032854536] [2019-12-26 21:30:18,355 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:30:18,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:30:18,561 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-26 21:30:18,561 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1032854536] [2019-12-26 21:30:18,561 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:30:18,562 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-26 21:30:18,562 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1479635490] [2019-12-26 21:30:18,562 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-26 21:30:18,562 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:30:18,562 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-26 21:30:18,562 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-26 21:30:18,563 INFO L87 Difference]: Start difference. First operand 22645 states and 70049 transitions. Second operand 11 states. [2019-12-26 21:30:19,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:30:19,568 INFO L93 Difference]: Finished difference Result 39552 states and 121647 transitions. [2019-12-26 21:30:19,568 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-12-26 21:30:19,568 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 67 [2019-12-26 21:30:19,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:30:19,625 INFO L225 Difference]: With dead ends: 39552 [2019-12-26 21:30:19,625 INFO L226 Difference]: Without dead ends: 38533 [2019-12-26 21:30:19,626 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 125 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=130, Invalid=572, Unknown=0, NotChecked=0, Total=702 [2019-12-26 21:30:19,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38533 states. [2019-12-26 21:30:20,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38533 to 24908. [2019-12-26 21:30:20,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24908 states. [2019-12-26 21:30:20,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24908 states to 24908 states and 76938 transitions. [2019-12-26 21:30:20,109 INFO L78 Accepts]: Start accepts. Automaton has 24908 states and 76938 transitions. Word has length 67 [2019-12-26 21:30:20,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:30:20,110 INFO L462 AbstractCegarLoop]: Abstraction has 24908 states and 76938 transitions. [2019-12-26 21:30:20,110 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-26 21:30:20,110 INFO L276 IsEmpty]: Start isEmpty. Operand 24908 states and 76938 transitions. [2019-12-26 21:30:20,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-26 21:30:20,134 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:30:20,135 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 21:30:20,135 INFO L410 AbstractCegarLoop]: === Iteration 37 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 21:30:20,135 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:30:20,135 INFO L82 PathProgramCache]: Analyzing trace with hash -83242899, now seen corresponding path program 6 times [2019-12-26 21:30:20,135 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:30:20,135 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1442389271] [2019-12-26 21:30:20,135 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:30:20,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:30:20,315 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-26 21:30:20,315 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1442389271] [2019-12-26 21:30:20,315 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:30:20,315 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-26 21:30:20,315 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2089866334] [2019-12-26 21:30:20,316 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-26 21:30:20,316 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:30:20,316 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-26 21:30:20,316 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-26 21:30:20,316 INFO L87 Difference]: Start difference. First operand 24908 states and 76938 transitions. Second operand 11 states. [2019-12-26 21:30:21,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:30:21,235 INFO L93 Difference]: Finished difference Result 39095 states and 119829 transitions. [2019-12-26 21:30:21,237 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-12-26 21:30:21,238 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 67 [2019-12-26 21:30:21,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:30:21,286 INFO L225 Difference]: With dead ends: 39095 [2019-12-26 21:30:21,286 INFO L226 Difference]: Without dead ends: 35558 [2019-12-26 21:30:21,286 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=122, Invalid=478, Unknown=0, NotChecked=0, Total=600 [2019-12-26 21:30:21,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35558 states. [2019-12-26 21:30:21,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35558 to 21700. [2019-12-26 21:30:21,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21700 states. [2019-12-26 21:30:21,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21700 states to 21700 states and 67268 transitions. [2019-12-26 21:30:21,706 INFO L78 Accepts]: Start accepts. Automaton has 21700 states and 67268 transitions. Word has length 67 [2019-12-26 21:30:21,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:30:21,706 INFO L462 AbstractCegarLoop]: Abstraction has 21700 states and 67268 transitions. [2019-12-26 21:30:21,706 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-26 21:30:21,706 INFO L276 IsEmpty]: Start isEmpty. Operand 21700 states and 67268 transitions. [2019-12-26 21:30:21,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-26 21:30:21,728 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:30:21,728 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 21:30:21,728 INFO L410 AbstractCegarLoop]: === Iteration 38 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 21:30:21,729 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:30:21,729 INFO L82 PathProgramCache]: Analyzing trace with hash -1853423759, now seen corresponding path program 7 times [2019-12-26 21:30:21,729 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:30:21,729 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [193169209] [2019-12-26 21:30:21,729 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:30:21,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:30:21,918 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-26 21:30:21,919 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [193169209] [2019-12-26 21:30:21,919 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:30:21,919 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-26 21:30:21,919 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1616380181] [2019-12-26 21:30:21,920 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-26 21:30:21,920 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:30:21,920 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-26 21:30:21,920 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2019-12-26 21:30:21,921 INFO L87 Difference]: Start difference. First operand 21700 states and 67268 transitions. Second operand 12 states. [2019-12-26 21:30:22,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:30:22,940 INFO L93 Difference]: Finished difference Result 35737 states and 109819 transitions. [2019-12-26 21:30:22,941 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-26 21:30:22,941 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 67 [2019-12-26 21:30:22,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:30:22,990 INFO L225 Difference]: With dead ends: 35737 [2019-12-26 21:30:22,991 INFO L226 Difference]: Without dead ends: 35526 [2019-12-26 21:30:22,991 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-26 21:30:23,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35526 states. [2019-12-26 21:30:23,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35526 to 21524. [2019-12-26 21:30:23,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21524 states. [2019-12-26 21:30:23,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21524 states to 21524 states and 66796 transitions. [2019-12-26 21:30:23,557 INFO L78 Accepts]: Start accepts. Automaton has 21524 states and 66796 transitions. Word has length 67 [2019-12-26 21:30:23,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:30:23,557 INFO L462 AbstractCegarLoop]: Abstraction has 21524 states and 66796 transitions. [2019-12-26 21:30:23,558 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-26 21:30:23,558 INFO L276 IsEmpty]: Start isEmpty. Operand 21524 states and 66796 transitions. [2019-12-26 21:30:23,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-26 21:30:23,583 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:30:23,583 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 21:30:23,583 INFO L410 AbstractCegarLoop]: === Iteration 39 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 21:30:23,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:30:23,583 INFO L82 PathProgramCache]: Analyzing trace with hash 594227727, now seen corresponding path program 8 times [2019-12-26 21:30:23,583 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:30:23,584 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [978086588] [2019-12-26 21:30:23,584 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:30:23,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-26 21:30:23,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-26 21:30:23,736 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-26 21:30:23,736 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-26 21:30:23,741 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [903] [903] ULTIMATE.startENTRY-->L837: Formula: (let ((.cse0 (store |v_#valid_65| 0 0))) (and (= v_~x~0_45 0) (= 0 v_~a$w_buff0_used~0_768) (= v_~y~0_18 0) (= 0 v_~a$r_buff1_thd1~0_150) (= 0 v_~__unbuffered_p2_EAX~0_31) (= |v_#length_21| (store |v_#length_22| |v_ULTIMATE.start_main_~#t263~0.base_33| 4)) (= 0 v_~a$read_delayed_var~0.base_7) (= 0 v_~a$w_buff1_used~0_426) (= v_~main$tmp_guard0~0_29 0) (= 0 |v_ULTIMATE.start_main_~#t263~0.offset_23|) (= v_~a$read_delayed_var~0.offset_7 0) (= 0 v_~a$w_buff1~0_200) (< |v_#StackHeapBarrier_16| |v_ULTIMATE.start_main_~#t263~0.base_33|) (= v_~a$r_buff1_thd3~0_269 0) (< 0 |v_#StackHeapBarrier_16|) (= 0 v_~__unbuffered_p0_EAX~0_111) (= v_~a$r_buff0_thd3~0_320 0) (= v_~a~0_184 0) (= 0 v_~__unbuffered_p1_EAX~0_34) (= v_~__unbuffered_cnt~0_102 0) (= |v_#valid_63| (store .cse0 |v_ULTIMATE.start_main_~#t263~0.base_33| 1)) (= (store |v_#memory_int_20| |v_ULTIMATE.start_main_~#t263~0.base_33| (store (select |v_#memory_int_20| |v_ULTIMATE.start_main_~#t263~0.base_33|) |v_ULTIMATE.start_main_~#t263~0.offset_23| 0)) |v_#memory_int_19|) (= 0 |v_#NULL.base_4|) (= v_~a$flush_delayed~0_25 0) (= v_~__unbuffered_p1_EBX~0_34 0) (= v_~a$r_buff0_thd0~0_107 0) (= v_~main$tmp_guard1~0_32 0) (= v_~a$r_buff1_thd0~0_160 0) (= v_~a$w_buff0~0_274 0) (= v_~z~0_21 0) (= |v_#NULL.offset_4| 0) (= v_~a$mem_tmp~0_14 0) (= 0 v_~a$r_buff0_thd1~0_184) (= 0 v_~a$r_buff1_thd2~0_145) (= v_~a$r_buff0_thd2~0_95 0) (= v_~weak$$choice2~0_110 0) (= v_~__unbuffered_p2_EBX~0_40 0) (= (select .cse0 |v_ULTIMATE.start_main_~#t263~0.base_33|) 0) (= 0 v_~a$read_delayed~0_8) (= 0 v_~weak$$choice0~0_12))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_16|, #valid=|v_#valid_65|, #memory_int=|v_#memory_int_20|, #length=|v_#length_22|} OutVars{~a$r_buff1_thd2~0=v_~a$r_buff1_thd2~0_145, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_67|, #NULL.offset=|v_#NULL.offset_4|, ULTIMATE.start_main_#t~ite49=|v_ULTIMATE.start_main_#t~ite49_471|, ~a$r_buff0_thd0~0=v_~a$r_buff0_thd0~0_107, ULTIMATE.start_main_#t~ite50=|v_ULTIMATE.start_main_#t~ite50_41|, ~a~0=v_~a~0_184, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_64|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_111, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_34, ULTIMATE.start_main_~#t263~0.offset=|v_ULTIMATE.start_main_~#t263~0.offset_23|, #length=|v_#length_21|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_31, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_40, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_10|, ~a$r_buff1_thd3~0=v_~a$r_buff1_thd3~0_269, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_768, ~a$r_buff0_thd1~0=v_~a$r_buff0_thd1~0_184, ~weak$$choice0~0=v_~weak$$choice0~0_12, #StackHeapBarrier=|v_#StackHeapBarrier_16|, ~a$read_delayed_var~0.offset=v_~a$read_delayed_var~0.offset_7, ULTIMATE.start_main_~#t265~0.offset=|v_ULTIMATE.start_main_~#t265~0.offset_19|, ~a$w_buff0~0=v_~a$w_buff0~0_274, ~a$r_buff1_thd0~0=v_~a$r_buff1_thd0~0_160, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_102, ~x~0=v_~x~0_45, ~a$read_delayed~0=v_~a$read_delayed~0_8, ULTIMATE.start_main_~#t264~0.offset=|v_ULTIMATE.start_main_~#t264~0.offset_19|, ~a$r_buff0_thd2~0=v_~a$r_buff0_thd2~0_95, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_32, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_69|, ~a$mem_tmp~0=v_~a$mem_tmp~0_14, ULTIMATE.start_main_#t~ite51=|v_ULTIMATE.start_main_#t~ite51_29|, ~a$w_buff1~0=v_~a$w_buff1~0_200, ~y~0=v_~y~0_18, ULTIMATE.start_main_~#t265~0.base=|v_ULTIMATE.start_main_~#t265~0.base_25|, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_34, ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_27|, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_9|, ~a$r_buff1_thd1~0=v_~a$r_buff1_thd1~0_150, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_320, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_29, ULTIMATE.start_main_~#t263~0.base=|v_ULTIMATE.start_main_~#t263~0.base_33|, #NULL.base=|v_#NULL.base_4|, ULTIMATE.start_main_~#t264~0.base=|v_ULTIMATE.start_main_~#t264~0.base_25|, ~a$flush_delayed~0=v_~a$flush_delayed~0_25, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_21|, #valid=|v_#valid_63|, #memory_int=|v_#memory_int_19|, ~z~0=v_~z~0_21, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_426, ~weak$$choice2~0=v_~weak$$choice2~0_110, ~a$read_delayed_var~0.base=v_~a$read_delayed_var~0.base_7} AuxVars[] AssignedVars[~a$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite47, #NULL.offset, ULTIMATE.start_main_#t~ite49, ~a$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite50, ~a~0, ULTIMATE.start_main_#t~ite52, ~__unbuffered_p0_EAX~0, ~__unbuffered_p1_EAX~0, ULTIMATE.start_main_~#t263~0.offset, #length, ~__unbuffered_p2_EAX~0, ~__unbuffered_p2_EBX~0, ULTIMATE.start_main_#t~nondet45, ~a$r_buff1_thd3~0, ~a$w_buff0_used~0, ~a$r_buff0_thd1~0, ~weak$$choice0~0, ~a$read_delayed_var~0.offset, ULTIMATE.start_main_~#t265~0.offset, ~a$w_buff0~0, ~a$r_buff1_thd0~0, ~__unbuffered_cnt~0, ~x~0, ~a$read_delayed~0, ULTIMATE.start_main_~#t264~0.offset, ~a$r_buff0_thd2~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite48, ~a$mem_tmp~0, ULTIMATE.start_main_#t~ite51, ~a$w_buff1~0, ~y~0, ULTIMATE.start_main_~#t265~0.base, ~__unbuffered_p1_EBX~0, ULTIMATE.start_main_#t~nondet46, ULTIMATE.start_main_#t~nondet44, ~a$r_buff1_thd1~0, ~a$r_buff0_thd3~0, ~main$tmp_guard0~0, ULTIMATE.start_main_~#t263~0.base, #NULL.base, ULTIMATE.start_main_~#t264~0.base, ~a$flush_delayed~0, ULTIMATE.start_main_#res, #valid, #memory_int, ~z~0, ~a$w_buff1_used~0, ~weak$$choice2~0, ~a$read_delayed_var~0.base] because there is no mapped edge [2019-12-26 21:30:23,742 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [802] [802] P0ENTRY-->L4-3: Formula: (and (= v_P0Thread1of1ForFork1_~arg.offset_20 |v_P0Thread1of1ForFork1_#in~arg.offset_20|) (= 1 v_~a$w_buff0_used~0_240) (= (mod v_~a$w_buff1_used~0_130 256) 0) (= v_~a$w_buff0_used~0_241 v_~a$w_buff1_used~0_130) (= v_P0Thread1of1ForFork1___VERIFIER_assert_~expression_24 |v_P0Thread1of1ForFork1___VERIFIER_assert_#in~expression_20|) (= |v_P0Thread1of1ForFork1_#in~arg.base_20| v_P0Thread1of1ForFork1_~arg.base_20) (= 1 v_~a$w_buff0~0_55) (= v_~a$w_buff0~0_56 v_~a$w_buff1~0_50) (= 1 |v_P0Thread1of1ForFork1___VERIFIER_assert_#in~expression_20|)) InVars {P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_20|, ~a$w_buff0~0=v_~a$w_buff0~0_56, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_241, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_20|} OutVars{~a$w_buff1~0=v_~a$w_buff1~0_50, P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_20|, ~a$w_buff0~0=v_~a$w_buff0~0_55, P0Thread1of1ForFork1___VERIFIER_assert_~expression=v_P0Thread1of1ForFork1___VERIFIER_assert_~expression_24, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_240, P0Thread1of1ForFork1_~arg.offset=v_P0Thread1of1ForFork1_~arg.offset_20, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_130, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_20|, P0Thread1of1ForFork1___VERIFIER_assert_#in~expression=|v_P0Thread1of1ForFork1___VERIFIER_assert_#in~expression_20|, P0Thread1of1ForFork1_~arg.base=v_P0Thread1of1ForFork1_~arg.base_20} AuxVars[] AssignedVars[~a$w_buff1~0, ~a$w_buff0~0, P0Thread1of1ForFork1___VERIFIER_assert_~expression, ~a$w_buff0_used~0, P0Thread1of1ForFork1_~arg.offset, ~a$w_buff1_used~0, P0Thread1of1ForFork1___VERIFIER_assert_#in~expression, P0Thread1of1ForFork1_~arg.base] because there is no mapped edge [2019-12-26 21:30:23,743 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [872] [872] L837-1-->L839: Formula: (and (= (select |v_#valid_35| |v_ULTIMATE.start_main_~#t264~0.base_12|) 0) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t264~0.base_12| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t264~0.base_12|) |v_ULTIMATE.start_main_~#t264~0.offset_10| 1)) |v_#memory_int_13|) (not (= 0 |v_ULTIMATE.start_main_~#t264~0.base_12|)) (= 0 |v_ULTIMATE.start_main_~#t264~0.offset_10|) (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t264~0.base_12| 4)) (= |v_#valid_34| (store |v_#valid_35| |v_ULTIMATE.start_main_~#t264~0.base_12| 1)) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t264~0.base_12|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_35|, #memory_int=|v_#memory_int_14|, #length=|v_#length_16|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_11|, ULTIMATE.start_main_~#t264~0.base=|v_ULTIMATE.start_main_~#t264~0.base_12|, ULTIMATE.start_main_~#t264~0.offset=|v_ULTIMATE.start_main_~#t264~0.offset_10|, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_4|, #valid=|v_#valid_34|, #memory_int=|v_#memory_int_13|, #length=|v_#length_15|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t264~0.base, ULTIMATE.start_main_~#t264~0.offset, ULTIMATE.start_main_#t~nondet44, #valid, #memory_int, #length] because there is no mapped edge [2019-12-26 21:30:23,745 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [871] [871] L839-1-->L841: Formula: (and (= |v_#length_13| (store |v_#length_14| |v_ULTIMATE.start_main_~#t265~0.base_12| 4)) (< |v_#StackHeapBarrier_10| |v_ULTIMATE.start_main_~#t265~0.base_12|) (= (store |v_#valid_33| |v_ULTIMATE.start_main_~#t265~0.base_12| 1) |v_#valid_32|) (not (= |v_ULTIMATE.start_main_~#t265~0.base_12| 0)) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t265~0.base_12| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t265~0.base_12|) |v_ULTIMATE.start_main_~#t265~0.offset_10| 2)) |v_#memory_int_11|) (= (select |v_#valid_33| |v_ULTIMATE.start_main_~#t265~0.base_12|) 0) (= 0 |v_ULTIMATE.start_main_~#t265~0.offset_10|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_33|, #memory_int=|v_#memory_int_12|, #length=|v_#length_14|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_10|, ULTIMATE.start_main_~#t265~0.offset=|v_ULTIMATE.start_main_~#t265~0.offset_10|, #valid=|v_#valid_32|, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_5|, #memory_int=|v_#memory_int_11|, #length=|v_#length_13|, ULTIMATE.start_main_~#t265~0.base=|v_ULTIMATE.start_main_~#t265~0.base_12|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t265~0.offset, #valid, ULTIMATE.start_main_#t~nondet45, #memory_int, #length, ULTIMATE.start_main_~#t265~0.base] because there is no mapped edge [2019-12-26 21:30:23,746 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [832] [832] L778-2-->L778-4: Formula: (let ((.cse1 (= (mod ~a$w_buff1_used~0_In110843734 256) 0)) (.cse0 (= (mod ~a$r_buff1_thd2~0_In110843734 256) 0))) (or (and (= ~a~0_In110843734 |P1Thread1of1ForFork2_#t~ite9_Out110843734|) (or .cse0 .cse1)) (and (not .cse1) (not .cse0) (= |P1Thread1of1ForFork2_#t~ite9_Out110843734| ~a$w_buff1~0_In110843734)))) InVars {~a~0=~a~0_In110843734, ~a$w_buff1~0=~a$w_buff1~0_In110843734, ~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In110843734, ~a$w_buff1_used~0=~a$w_buff1_used~0_In110843734} OutVars{~a~0=~a~0_In110843734, P1Thread1of1ForFork2_#t~ite9=|P1Thread1of1ForFork2_#t~ite9_Out110843734|, ~a$w_buff1~0=~a$w_buff1~0_In110843734, ~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In110843734, ~a$w_buff1_used~0=~a$w_buff1_used~0_In110843734} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite9] because there is no mapped edge [2019-12-26 21:30:23,746 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [771] [771] L778-4-->L779: Formula: (= |v_P1Thread1of1ForFork2_#t~ite9_16| v_~a~0_33) InVars {P1Thread1of1ForFork2_#t~ite9=|v_P1Thread1of1ForFork2_#t~ite9_16|} OutVars{~a~0=v_~a~0_33, P1Thread1of1ForFork2_#t~ite9=|v_P1Thread1of1ForFork2_#t~ite9_15|, P1Thread1of1ForFork2_#t~ite10=|v_P1Thread1of1ForFork2_#t~ite10_23|} AuxVars[] AssignedVars[~a~0, P1Thread1of1ForFork2_#t~ite9, P1Thread1of1ForFork2_#t~ite10] because there is no mapped edge [2019-12-26 21:30:23,747 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [836] [836] L779-->L779-2: Formula: (let ((.cse0 (= 0 (mod ~a$w_buff0_used~0_In253101417 256))) (.cse1 (= (mod ~a$r_buff0_thd2~0_In253101417 256) 0))) (or (and (not .cse0) (= 0 |P1Thread1of1ForFork2_#t~ite11_Out253101417|) (not .cse1)) (and (or .cse0 .cse1) (= ~a$w_buff0_used~0_In253101417 |P1Thread1of1ForFork2_#t~ite11_Out253101417|)))) InVars {~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In253101417, ~a$w_buff0_used~0=~a$w_buff0_used~0_In253101417} OutVars{~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In253101417, ~a$w_buff0_used~0=~a$w_buff0_used~0_In253101417, P1Thread1of1ForFork2_#t~ite11=|P1Thread1of1ForFork2_#t~ite11_Out253101417|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite11] because there is no mapped edge [2019-12-26 21:30:23,749 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [834] [834] L753-->L753-2: Formula: (let ((.cse0 (= (mod ~a$r_buff0_thd1~0_In1303720458 256) 0)) (.cse1 (= (mod ~a$w_buff0_used~0_In1303720458 256) 0))) (or (and (= |P0Thread1of1ForFork1_#t~ite5_Out1303720458| 0) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= ~a$w_buff0_used~0_In1303720458 |P0Thread1of1ForFork1_#t~ite5_Out1303720458|)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In1303720458, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In1303720458} OutVars{P0Thread1of1ForFork1_#t~ite5=|P0Thread1of1ForFork1_#t~ite5_Out1303720458|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1303720458, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In1303720458} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite5] because there is no mapped edge [2019-12-26 21:30:23,750 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [849] [849] L754-->L754-2: Formula: (let ((.cse2 (= (mod ~a$r_buff1_thd1~0_In1433819554 256) 0)) (.cse3 (= (mod ~a$w_buff1_used~0_In1433819554 256) 0)) (.cse1 (= (mod ~a$r_buff0_thd1~0_In1433819554 256) 0)) (.cse0 (= 0 (mod ~a$w_buff0_used~0_In1433819554 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P0Thread1of1ForFork1_#t~ite6_Out1433819554| ~a$w_buff1_used~0_In1433819554)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0))) (= |P0Thread1of1ForFork1_#t~ite6_Out1433819554| 0)))) InVars {~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In1433819554, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1433819554, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In1433819554, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1433819554} OutVars{P0Thread1of1ForFork1_#t~ite6=|P0Thread1of1ForFork1_#t~ite6_Out1433819554|, ~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In1433819554, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1433819554, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In1433819554, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1433819554} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite6] because there is no mapped edge [2019-12-26 21:30:23,750 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [842] [842] L755-->L756: Formula: (let ((.cse1 (= 0 (mod ~a$w_buff0_used~0_In568953716 256))) (.cse0 (= (mod ~a$r_buff0_thd1~0_In568953716 256) 0))) (or (and (or .cse0 .cse1) (= ~a$r_buff0_thd1~0_Out568953716 ~a$r_buff0_thd1~0_In568953716)) (and (not .cse1) (= ~a$r_buff0_thd1~0_Out568953716 0) (not .cse0)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In568953716, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In568953716} OutVars{P0Thread1of1ForFork1_#t~ite7=|P0Thread1of1ForFork1_#t~ite7_Out568953716|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In568953716, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_Out568953716} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite7, ~a$r_buff0_thd1~0] because there is no mapped edge [2019-12-26 21:30:23,751 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [850] [850] L756-->L756-2: Formula: (let ((.cse1 (= 0 (mod ~a$r_buff0_thd1~0_In1857113621 256))) (.cse0 (= 0 (mod ~a$w_buff0_used~0_In1857113621 256))) (.cse3 (= (mod ~a$r_buff1_thd1~0_In1857113621 256) 0)) (.cse2 (= 0 (mod ~a$w_buff1_used~0_In1857113621 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P0Thread1of1ForFork1_#t~ite8_Out1857113621|)) (and (or .cse1 .cse0) (= ~a$r_buff1_thd1~0_In1857113621 |P0Thread1of1ForFork1_#t~ite8_Out1857113621|) (or .cse3 .cse2)))) InVars {~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In1857113621, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1857113621, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In1857113621, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1857113621} OutVars{P0Thread1of1ForFork1_#t~ite8=|P0Thread1of1ForFork1_#t~ite8_Out1857113621|, ~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In1857113621, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1857113621, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In1857113621, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1857113621} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite8] because there is no mapped edge [2019-12-26 21:30:23,751 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [867] [867] L756-2-->P0EXIT: Formula: (and (= 0 |v_P0Thread1of1ForFork1_#res.offset_5|) (= v_~a$r_buff1_thd1~0_72 |v_P0Thread1of1ForFork1_#t~ite8_50|) (= 0 |v_P0Thread1of1ForFork1_#res.base_5|) (= (+ v_~__unbuffered_cnt~0_63 1) v_~__unbuffered_cnt~0_62)) InVars {P0Thread1of1ForFork1_#t~ite8=|v_P0Thread1of1ForFork1_#t~ite8_50|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_63} OutVars{P0Thread1of1ForFork1_#t~ite8=|v_P0Thread1of1ForFork1_#t~ite8_49|, P0Thread1of1ForFork1_#res.offset=|v_P0Thread1of1ForFork1_#res.offset_5|, ~a$r_buff1_thd1~0=v_~a$r_buff1_thd1~0_72, P0Thread1of1ForFork1_#res.base=|v_P0Thread1of1ForFork1_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_62} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite8, P0Thread1of1ForFork1_#res.offset, ~a$r_buff1_thd1~0, P0Thread1of1ForFork1_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-26 21:30:23,752 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [880] [880] L803-->L803-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In1150390987 256)))) (or (and (not .cse0) (= |P2Thread1of1ForFork0_#t~ite20_In1150390987| |P2Thread1of1ForFork0_#t~ite20_Out1150390987|) (= |P2Thread1of1ForFork0_#t~ite21_Out1150390987| ~a$w_buff0~0_In1150390987)) (and (= ~a$w_buff0~0_In1150390987 |P2Thread1of1ForFork0_#t~ite20_Out1150390987|) (= |P2Thread1of1ForFork0_#t~ite21_Out1150390987| |P2Thread1of1ForFork0_#t~ite20_Out1150390987|) .cse0 (let ((.cse1 (= 0 (mod ~a$r_buff0_thd3~0_In1150390987 256)))) (or (= (mod ~a$w_buff0_used~0_In1150390987 256) 0) (and (= 0 (mod ~a$w_buff1_used~0_In1150390987 256)) .cse1) (and .cse1 (= 0 (mod ~a$r_buff1_thd3~0_In1150390987 256)))))))) InVars {~a$w_buff0~0=~a$w_buff0~0_In1150390987, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In1150390987, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1150390987, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In1150390987, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1150390987, P2Thread1of1ForFork0_#t~ite20=|P2Thread1of1ForFork0_#t~ite20_In1150390987|, ~weak$$choice2~0=~weak$$choice2~0_In1150390987} OutVars{P2Thread1of1ForFork0_#t~ite21=|P2Thread1of1ForFork0_#t~ite21_Out1150390987|, ~a$w_buff0~0=~a$w_buff0~0_In1150390987, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In1150390987, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1150390987, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In1150390987, P2Thread1of1ForFork0_#t~ite20=|P2Thread1of1ForFork0_#t~ite20_Out1150390987|, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1150390987, ~weak$$choice2~0=~weak$$choice2~0_In1150390987} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite21, P2Thread1of1ForFork0_#t~ite20] because there is no mapped edge [2019-12-26 21:30:23,754 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [881] [881] L805-->L805-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In426443831 256) 0))) (or (and (not .cse0) (= |P2Thread1of1ForFork0_#t~ite26_In426443831| |P2Thread1of1ForFork0_#t~ite26_Out426443831|) (= ~a$w_buff0_used~0_In426443831 |P2Thread1of1ForFork0_#t~ite27_Out426443831|)) (and (= |P2Thread1of1ForFork0_#t~ite26_Out426443831| ~a$w_buff0_used~0_In426443831) (= |P2Thread1of1ForFork0_#t~ite26_Out426443831| |P2Thread1of1ForFork0_#t~ite27_Out426443831|) .cse0 (let ((.cse1 (= (mod ~a$r_buff0_thd3~0_In426443831 256) 0))) (or (and (= 0 (mod ~a$r_buff1_thd3~0_In426443831 256)) .cse1) (= 0 (mod ~a$w_buff0_used~0_In426443831 256)) (and (= 0 (mod ~a$w_buff1_used~0_In426443831 256)) .cse1)))))) InVars {P2Thread1of1ForFork0_#t~ite26=|P2Thread1of1ForFork0_#t~ite26_In426443831|, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In426443831, ~a$w_buff0_used~0=~a$w_buff0_used~0_In426443831, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In426443831, ~a$w_buff1_used~0=~a$w_buff1_used~0_In426443831, ~weak$$choice2~0=~weak$$choice2~0_In426443831} OutVars{P2Thread1of1ForFork0_#t~ite26=|P2Thread1of1ForFork0_#t~ite26_Out426443831|, P2Thread1of1ForFork0_#t~ite27=|P2Thread1of1ForFork0_#t~ite27_Out426443831|, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In426443831, ~a$w_buff0_used~0=~a$w_buff0_used~0_In426443831, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In426443831, ~a$w_buff1_used~0=~a$w_buff1_used~0_In426443831, ~weak$$choice2~0=~weak$$choice2~0_In426443831} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite26, P2Thread1of1ForFork0_#t~ite27] because there is no mapped edge [2019-12-26 21:30:23,756 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [762] [762] L807-->L808: Formula: (and (= v_~a$r_buff0_thd3~0_61 v_~a$r_buff0_thd3~0_60) (not (= 0 (mod v_~weak$$choice2~0_15 256)))) InVars {~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_61, ~weak$$choice2~0=v_~weak$$choice2~0_15} OutVars{P2Thread1of1ForFork0_#t~ite33=|v_P2Thread1of1ForFork0_#t~ite33_7|, P2Thread1of1ForFork0_#t~ite32=|v_P2Thread1of1ForFork0_#t~ite32_7|, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_60, P2Thread1of1ForFork0_#t~ite31=|v_P2Thread1of1ForFork0_#t~ite31_7|, ~weak$$choice2~0=v_~weak$$choice2~0_15} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite33, P2Thread1of1ForFork0_#t~ite32, ~a$r_buff0_thd3~0, P2Thread1of1ForFork0_#t~ite31] because there is no mapped edge [2019-12-26 21:30:23,758 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [761] [761] L810-->L814: Formula: (and (not (= (mod v_~a$flush_delayed~0_7 256) 0)) (= v_~a~0_20 v_~a$mem_tmp~0_4) (= v_~a$flush_delayed~0_6 0)) InVars {~a$mem_tmp~0=v_~a$mem_tmp~0_4, ~a$flush_delayed~0=v_~a$flush_delayed~0_7} OutVars{P2Thread1of1ForFork0_#t~ite37=|v_P2Thread1of1ForFork0_#t~ite37_7|, ~a~0=v_~a~0_20, ~a$mem_tmp~0=v_~a$mem_tmp~0_4, ~a$flush_delayed~0=v_~a$flush_delayed~0_6} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite37, ~a~0, ~a$flush_delayed~0] because there is no mapped edge [2019-12-26 21:30:23,758 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [838] [838] L814-2-->L814-5: Formula: (let ((.cse1 (= 0 (mod ~a$r_buff1_thd3~0_In-490265567 256))) (.cse0 (= |P2Thread1of1ForFork0_#t~ite38_Out-490265567| |P2Thread1of1ForFork0_#t~ite39_Out-490265567|)) (.cse2 (= 0 (mod ~a$w_buff1_used~0_In-490265567 256)))) (or (and .cse0 (or .cse1 .cse2) (= |P2Thread1of1ForFork0_#t~ite38_Out-490265567| ~a~0_In-490265567)) (and (not .cse1) (= |P2Thread1of1ForFork0_#t~ite38_Out-490265567| ~a$w_buff1~0_In-490265567) .cse0 (not .cse2)))) InVars {~a~0=~a~0_In-490265567, ~a$w_buff1~0=~a$w_buff1~0_In-490265567, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-490265567, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-490265567} OutVars{~a~0=~a~0_In-490265567, P2Thread1of1ForFork0_#t~ite39=|P2Thread1of1ForFork0_#t~ite39_Out-490265567|, P2Thread1of1ForFork0_#t~ite38=|P2Thread1of1ForFork0_#t~ite38_Out-490265567|, ~a$w_buff1~0=~a$w_buff1~0_In-490265567, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-490265567, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-490265567} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite39, P2Thread1of1ForFork0_#t~ite38] because there is no mapped edge [2019-12-26 21:30:23,760 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [840] [840] L815-->L815-2: Formula: (let ((.cse1 (= 0 (mod ~a$r_buff0_thd3~0_In40623542 256))) (.cse0 (= (mod ~a$w_buff0_used~0_In40623542 256) 0))) (or (and (not .cse0) (not .cse1) (= |P2Thread1of1ForFork0_#t~ite40_Out40623542| 0)) (and (or .cse1 .cse0) (= |P2Thread1of1ForFork0_#t~ite40_Out40623542| ~a$w_buff0_used~0_In40623542)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In40623542, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In40623542} OutVars{P2Thread1of1ForFork0_#t~ite40=|P2Thread1of1ForFork0_#t~ite40_Out40623542|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In40623542, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In40623542} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite40] because there is no mapped edge [2019-12-26 21:30:23,760 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [830] [830] L816-->L816-2: Formula: (let ((.cse2 (= (mod ~a$r_buff0_thd3~0_In1885345264 256) 0)) (.cse3 (= 0 (mod ~a$w_buff0_used~0_In1885345264 256))) (.cse0 (= (mod ~a$w_buff1_used~0_In1885345264 256) 0)) (.cse1 (= 0 (mod ~a$r_buff1_thd3~0_In1885345264 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P2Thread1of1ForFork0_#t~ite41_Out1885345264| ~a$w_buff1_used~0_In1885345264)) (and (= |P2Thread1of1ForFork0_#t~ite41_Out1885345264| 0) (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1)))))) InVars {~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In1885345264, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1885345264, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In1885345264, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1885345264} OutVars{~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In1885345264, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1885345264, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In1885345264, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1885345264, P2Thread1of1ForFork0_#t~ite41=|P2Thread1of1ForFork0_#t~ite41_Out1885345264|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite41] because there is no mapped edge [2019-12-26 21:30:23,762 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [846] [846] L780-->L780-2: Formula: (let ((.cse3 (= 0 (mod ~a$w_buff0_used~0_In685343202 256))) (.cse2 (= 0 (mod ~a$r_buff0_thd2~0_In685343202 256))) (.cse1 (= 0 (mod ~a$w_buff1_used~0_In685343202 256))) (.cse0 (= 0 (mod ~a$r_buff1_thd2~0_In685343202 256)))) (or (and (= 0 |P1Thread1of1ForFork2_#t~ite12_Out685343202|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse3 .cse2) (= ~a$w_buff1_used~0_In685343202 |P1Thread1of1ForFork2_#t~ite12_Out685343202|) (or .cse1 .cse0)))) InVars {~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In685343202, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In685343202, ~a$w_buff0_used~0=~a$w_buff0_used~0_In685343202, ~a$w_buff1_used~0=~a$w_buff1_used~0_In685343202} OutVars{~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In685343202, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In685343202, ~a$w_buff0_used~0=~a$w_buff0_used~0_In685343202, P1Thread1of1ForFork2_#t~ite12=|P1Thread1of1ForFork2_#t~ite12_Out685343202|, ~a$w_buff1_used~0=~a$w_buff1_used~0_In685343202} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite12] because there is no mapped edge [2019-12-26 21:30:23,763 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [851] [851] L781-->L781-2: Formula: (let ((.cse1 (= 0 (mod ~a$w_buff0_used~0_In-281480778 256))) (.cse0 (= 0 (mod ~a$r_buff0_thd2~0_In-281480778 256)))) (or (and (or .cse0 .cse1) (= |P1Thread1of1ForFork2_#t~ite13_Out-281480778| ~a$r_buff0_thd2~0_In-281480778)) (and (= |P1Thread1of1ForFork2_#t~ite13_Out-281480778| 0) (not .cse1) (not .cse0)))) InVars {~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-281480778, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-281480778} OutVars{~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-281480778, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-281480778, P1Thread1of1ForFork2_#t~ite13=|P1Thread1of1ForFork2_#t~ite13_Out-281480778|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite13] because there is no mapped edge [2019-12-26 21:30:23,764 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [852] [852] L782-->L782-2: Formula: (let ((.cse1 (= (mod ~a$w_buff0_used~0_In-1091853433 256) 0)) (.cse0 (= (mod ~a$r_buff0_thd2~0_In-1091853433 256) 0)) (.cse3 (= 0 (mod ~a$r_buff1_thd2~0_In-1091853433 256))) (.cse2 (= (mod ~a$w_buff1_used~0_In-1091853433 256) 0))) (or (and (= ~a$r_buff1_thd2~0_In-1091853433 |P1Thread1of1ForFork2_#t~ite14_Out-1091853433|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2))) (= 0 |P1Thread1of1ForFork2_#t~ite14_Out-1091853433|)))) InVars {~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In-1091853433, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-1091853433, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1091853433, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1091853433} OutVars{~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In-1091853433, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-1091853433, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1091853433, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1091853433, P1Thread1of1ForFork2_#t~ite14=|P1Thread1of1ForFork2_#t~ite14_Out-1091853433|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite14] because there is no mapped edge [2019-12-26 21:30:23,764 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [868] [868] L782-2-->P1EXIT: Formula: (and (= v_~__unbuffered_cnt~0_68 (+ v_~__unbuffered_cnt~0_69 1)) (= 0 |v_P1Thread1of1ForFork2_#res.offset_5|) (= 0 |v_P1Thread1of1ForFork2_#res.base_5|) (= |v_P1Thread1of1ForFork2_#t~ite14_36| v_~a$r_buff1_thd2~0_63)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_69, P1Thread1of1ForFork2_#t~ite14=|v_P1Thread1of1ForFork2_#t~ite14_36|} OutVars{P1Thread1of1ForFork2_#res.offset=|v_P1Thread1of1ForFork2_#res.offset_5|, ~a$r_buff1_thd2~0=v_~a$r_buff1_thd2~0_63, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_68, P1Thread1of1ForFork2_#t~ite14=|v_P1Thread1of1ForFork2_#t~ite14_35|, P1Thread1of1ForFork2_#res.base=|v_P1Thread1of1ForFork2_#res.base_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#res.offset, ~a$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork2_#t~ite14, P1Thread1of1ForFork2_#res.base] because there is no mapped edge [2019-12-26 21:30:23,764 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [831] [831] L817-->L817-2: Formula: (let ((.cse0 (= 0 (mod ~a$w_buff0_used~0_In1593092733 256))) (.cse1 (= 0 (mod ~a$r_buff0_thd3~0_In1593092733 256)))) (or (and (not .cse0) (not .cse1) (= 0 |P2Thread1of1ForFork0_#t~ite42_Out1593092733|)) (and (= ~a$r_buff0_thd3~0_In1593092733 |P2Thread1of1ForFork0_#t~ite42_Out1593092733|) (or .cse0 .cse1)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In1593092733, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In1593092733} OutVars{~a$w_buff0_used~0=~a$w_buff0_used~0_In1593092733, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In1593092733, P2Thread1of1ForFork0_#t~ite42=|P2Thread1of1ForFork0_#t~ite42_Out1593092733|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite42] because there is no mapped edge [2019-12-26 21:30:23,765 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [841] [841] L818-->L818-2: Formula: (let ((.cse3 (= 0 (mod ~a$r_buff0_thd3~0_In-1787151952 256))) (.cse2 (= 0 (mod ~a$w_buff0_used~0_In-1787151952 256))) (.cse1 (= (mod ~a$w_buff1_used~0_In-1787151952 256) 0)) (.cse0 (= (mod ~a$r_buff1_thd3~0_In-1787151952 256) 0))) (or (and (or .cse0 .cse1) (= ~a$r_buff1_thd3~0_In-1787151952 |P2Thread1of1ForFork0_#t~ite43_Out-1787151952|) (or .cse2 .cse3)) (and (= 0 |P2Thread1of1ForFork0_#t~ite43_Out-1787151952|) (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0)))))) InVars {~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-1787151952, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1787151952, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-1787151952, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1787151952} OutVars{P2Thread1of1ForFork0_#t~ite43=|P2Thread1of1ForFork0_#t~ite43_Out-1787151952|, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-1787151952, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1787151952, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-1787151952, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1787151952} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite43] because there is no mapped edge [2019-12-26 21:30:23,765 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [875] [875] L818-2-->P2EXIT: Formula: (and (= |v_P2Thread1of1ForFork0_#res.offset_5| 0) (= v_~a$r_buff1_thd3~0_149 |v_P2Thread1of1ForFork0_#t~ite43_38|) (= v_~__unbuffered_cnt~0_78 (+ v_~__unbuffered_cnt~0_79 1)) (= |v_P2Thread1of1ForFork0_#res.base_5| 0)) InVars {P2Thread1of1ForFork0_#t~ite43=|v_P2Thread1of1ForFork0_#t~ite43_38|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_79} OutVars{P2Thread1of1ForFork0_#res.base=|v_P2Thread1of1ForFork0_#res.base_5|, P2Thread1of1ForFork0_#t~ite43=|v_P2Thread1of1ForFork0_#t~ite43_37|, ~a$r_buff1_thd3~0=v_~a$r_buff1_thd3~0_149, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_78, P2Thread1of1ForFork0_#res.offset=|v_P2Thread1of1ForFork0_#res.offset_5|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#res.base, P2Thread1of1ForFork0_#t~ite43, ~a$r_buff1_thd3~0, ~__unbuffered_cnt~0, P2Thread1of1ForFork0_#res.offset] because there is no mapped edge [2019-12-26 21:30:23,765 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [801] [801] L841-1-->L847: Formula: (and (= 3 v_~__unbuffered_cnt~0_40) (= v_~main$tmp_guard0~0_9 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_40} OutVars{ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_40, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_9} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet46, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-26 21:30:23,766 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [835] [835] L847-2-->L847-4: Formula: (let ((.cse1 (= (mod ~a$r_buff1_thd0~0_In-1163130632 256) 0)) (.cse0 (= (mod ~a$w_buff1_used~0_In-1163130632 256) 0))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite47_Out-1163130632| ~a~0_In-1163130632)) (and (not .cse1) (not .cse0) (= |ULTIMATE.start_main_#t~ite47_Out-1163130632| ~a$w_buff1~0_In-1163130632)))) InVars {~a~0=~a~0_In-1163130632, ~a$w_buff1~0=~a$w_buff1~0_In-1163130632, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In-1163130632, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1163130632} OutVars{~a~0=~a~0_In-1163130632, ~a$w_buff1~0=~a$w_buff1~0_In-1163130632, ULTIMATE.start_main_#t~ite47=|ULTIMATE.start_main_#t~ite47_Out-1163130632|, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In-1163130632, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1163130632} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite47] because there is no mapped edge [2019-12-26 21:30:23,767 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [782] [782] L847-4-->L848: Formula: (= v_~a~0_39 |v_ULTIMATE.start_main_#t~ite47_15|) InVars {ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_15|} OutVars{~a~0=v_~a~0_39, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_14|, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_6|} AuxVars[] AssignedVars[~a~0, ULTIMATE.start_main_#t~ite47, ULTIMATE.start_main_#t~ite48] because there is no mapped edge [2019-12-26 21:30:23,767 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [839] [839] L848-->L848-2: Formula: (let ((.cse0 (= 0 (mod ~a$r_buff0_thd0~0_In1571694102 256))) (.cse1 (= (mod ~a$w_buff0_used~0_In1571694102 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite49_Out1571694102| ~a$w_buff0_used~0_In1571694102) (or .cse0 .cse1)) (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite49_Out1571694102| 0)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In1571694102, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In1571694102} OutVars{~a$w_buff0_used~0=~a$w_buff0_used~0_In1571694102, ULTIMATE.start_main_#t~ite49=|ULTIMATE.start_main_#t~ite49_Out1571694102|, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In1571694102} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite49] because there is no mapped edge [2019-12-26 21:30:23,767 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [845] [845] L849-->L849-2: Formula: (let ((.cse3 (= 0 (mod ~a$w_buff0_used~0_In-2119412451 256))) (.cse2 (= (mod ~a$r_buff0_thd0~0_In-2119412451 256) 0)) (.cse1 (= (mod ~a$w_buff1_used~0_In-2119412451 256) 0)) (.cse0 (= 0 (mod ~a$r_buff1_thd0~0_In-2119412451 256)))) (or (and (= |ULTIMATE.start_main_#t~ite50_Out-2119412451| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse3 .cse2) (= ~a$w_buff1_used~0_In-2119412451 |ULTIMATE.start_main_#t~ite50_Out-2119412451|) (or .cse1 .cse0)))) InVars {~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In-2119412451, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-2119412451, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-2119412451, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-2119412451} OutVars{ULTIMATE.start_main_#t~ite50=|ULTIMATE.start_main_#t~ite50_Out-2119412451|, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In-2119412451, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-2119412451, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-2119412451, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-2119412451} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite50] because there is no mapped edge [2019-12-26 21:30:23,768 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [828] [828] L850-->L850-2: Formula: (let ((.cse1 (= 0 (mod ~a$r_buff0_thd0~0_In1242952467 256))) (.cse0 (= 0 (mod ~a$w_buff0_used~0_In1242952467 256)))) (or (and (not .cse0) (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite51_Out1242952467|)) (and (or .cse1 .cse0) (= ~a$r_buff0_thd0~0_In1242952467 |ULTIMATE.start_main_#t~ite51_Out1242952467|)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In1242952467, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In1242952467} OutVars{ULTIMATE.start_main_#t~ite51=|ULTIMATE.start_main_#t~ite51_Out1242952467|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1242952467, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In1242952467} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite51] because there is no mapped edge [2019-12-26 21:30:23,769 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [827] [827] L851-->L851-2: Formula: (let ((.cse3 (= 0 (mod ~a$r_buff0_thd0~0_In-1178774952 256))) (.cse2 (= 0 (mod ~a$w_buff0_used~0_In-1178774952 256))) (.cse0 (= (mod ~a$r_buff1_thd0~0_In-1178774952 256) 0)) (.cse1 (= 0 (mod ~a$w_buff1_used~0_In-1178774952 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite52_Out-1178774952|)) (and (or .cse3 .cse2) (= |ULTIMATE.start_main_#t~ite52_Out-1178774952| ~a$r_buff1_thd0~0_In-1178774952) (or .cse0 .cse1)))) InVars {~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In-1178774952, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1178774952, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-1178774952, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1178774952} OutVars{ULTIMATE.start_main_#t~ite52=|ULTIMATE.start_main_#t~ite52_Out-1178774952|, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In-1178774952, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1178774952, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-1178774952, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1178774952} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52] because there is no mapped edge [2019-12-26 21:30:23,769 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [887] [887] L851-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= 1 v_~__unbuffered_p2_EAX~0_17) (= v_~__unbuffered_p1_EBX~0_17 0) (= 0 v_~__unbuffered_p0_EAX~0_39) (= v_~main$tmp_guard1~0_12 0) (= 1 v_~__unbuffered_p1_EAX~0_17) (= v_ULTIMATE.start___VERIFIER_assert_~expression_16 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_12|) (= |v_ULTIMATE.start_main_#t~ite52_30| v_~a$r_buff1_thd0~0_75) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_12| (mod v_~main$tmp_guard1~0_12 256)) (= v_~__unbuffered_p2_EBX~0_22 0)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_39, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_30|, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_17, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_22, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_17, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_17} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_39, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_29|, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_16, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_17, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_22, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_17, ~a$r_buff1_thd0~0=v_~a$r_buff1_thd0~0_75, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_12, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_17, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_12|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52, ULTIMATE.start___VERIFIER_assert_~expression, ~a$r_buff1_thd0~0, ~main$tmp_guard1~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-26 21:30:23,884 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.12 09:30:23 BasicIcfg [2019-12-26 21:30:23,884 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-26 21:30:23,885 INFO L168 Benchmark]: Toolchain (without parser) took 144660.83 ms. Allocated memory was 139.5 MB in the beginning and 4.0 GB in the end (delta: 3.9 GB). Free memory was 102.8 MB in the beginning and 2.4 GB in the end (delta: -2.3 GB). Peak memory consumption was 1.6 GB. Max. memory is 7.1 GB. [2019-12-26 21:30:23,886 INFO L168 Benchmark]: CDTParser took 0.47 ms. Allocated memory is still 139.5 MB. Free memory was 122.6 MB in the beginning and 122.4 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-12-26 21:30:23,886 INFO L168 Benchmark]: CACSL2BoogieTranslator took 798.80 ms. Allocated memory was 139.5 MB in the beginning and 203.9 MB in the end (delta: 64.5 MB). Free memory was 102.4 MB in the beginning and 157.4 MB in the end (delta: -55.1 MB). Peak memory consumption was 26.0 MB. Max. memory is 7.1 GB. [2019-12-26 21:30:23,886 INFO L168 Benchmark]: Boogie Procedure Inliner took 68.10 ms. Allocated memory is still 203.9 MB. Free memory was 157.4 MB in the beginning and 154.7 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-26 21:30:23,887 INFO L168 Benchmark]: Boogie Preprocessor took 38.07 ms. Allocated memory is still 203.9 MB. Free memory was 154.7 MB in the beginning and 152.1 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-12-26 21:30:23,887 INFO L168 Benchmark]: RCFGBuilder took 760.12 ms. Allocated memory is still 203.9 MB. Free memory was 152.1 MB in the beginning and 101.3 MB in the end (delta: 50.8 MB). Peak memory consumption was 50.8 MB. Max. memory is 7.1 GB. [2019-12-26 21:30:23,887 INFO L168 Benchmark]: TraceAbstraction took 142990.34 ms. Allocated memory was 203.9 MB in the beginning and 4.0 GB in the end (delta: 3.8 GB). Free memory was 101.3 MB in the beginning and 2.4 GB in the end (delta: -2.3 GB). Peak memory consumption was 1.5 GB. Max. memory is 7.1 GB. [2019-12-26 21:30:23,889 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.47 ms. Allocated memory is still 139.5 MB. Free memory was 122.6 MB in the beginning and 122.4 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 798.80 ms. Allocated memory was 139.5 MB in the beginning and 203.9 MB in the end (delta: 64.5 MB). Free memory was 102.4 MB in the beginning and 157.4 MB in the end (delta: -55.1 MB). Peak memory consumption was 26.0 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 68.10 ms. Allocated memory is still 203.9 MB. Free memory was 157.4 MB in the beginning and 154.7 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 38.07 ms. Allocated memory is still 203.9 MB. Free memory was 154.7 MB in the beginning and 152.1 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 760.12 ms. Allocated memory is still 203.9 MB. Free memory was 152.1 MB in the beginning and 101.3 MB in the end (delta: 50.8 MB). Peak memory consumption was 50.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 142990.34 ms. Allocated memory was 203.9 MB in the beginning and 4.0 GB in the end (delta: 3.8 GB). Free memory was 101.3 MB in the beginning and 2.4 GB in the end (delta: -2.3 GB). Peak memory consumption was 1.5 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 5.8s, 179 ProgramPointsBefore, 95 ProgramPointsAfterwards, 216 TransitionsBefore, 105 TransitionsAfterwards, 19004 CoEnabledTransitionPairs, 8 FixpointIterations, 36 TrivialSequentialCompositions, 48 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 32 ConcurrentYvCompositions, 31 ChoiceCompositions, 6646 VarBasedMoverChecksPositive, 237 VarBasedMoverChecksNegative, 59 SemBasedMoverChecksPositive, 236 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.5s, 0 MoverChecksTotal, 91218 CheckedPairsTotal, 116 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L837] FCALL, FORK 0 pthread_create(&t263, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L742] 1 a$r_buff1_thd0 = a$r_buff0_thd0 [L743] 1 a$r_buff1_thd1 = a$r_buff0_thd1 [L744] 1 a$r_buff1_thd2 = a$r_buff0_thd2 [L745] 1 a$r_buff1_thd3 = a$r_buff0_thd3 [L746] 1 a$r_buff0_thd1 = (_Bool)1 [L749] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L752] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L839] FCALL, FORK 0 pthread_create(&t264, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L766] 2 x = 1 [L769] 2 y = 1 [L772] 2 __unbuffered_p1_EAX = y [L775] 2 __unbuffered_p1_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L841] FCALL, FORK 0 pthread_create(&t265, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L778] 2 a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L792] 3 z = 1 [L795] 3 __unbuffered_p2_EAX = z [L798] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L799] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L800] 3 a$flush_delayed = weak$$choice2 [L801] 3 a$mem_tmp = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=1, z=1] [L802] EXPR 3 !a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff1) VAL [!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=1, z=1] [L752] 1 a = a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) [L753] 1 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L754] 1 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$w_buff1_used [L802] 3 a = !a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff1) [L803] 3 a$w_buff0 = weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff0)) [L804] EXPR 3 weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff1 : a$w_buff1)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff1 : a$w_buff1))=0, x=1, y=1, z=1] [L804] 3 a$w_buff1 = weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff1 : a$w_buff1)) [L805] 3 a$w_buff0_used = weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used)) [L806] EXPR 3 weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))=0, x=1, y=1, z=1] [L806] 3 a$w_buff1_used = weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L808] EXPR 3 weak$$choice2 ? a$r_buff1_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff1_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? a$r_buff1_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff1_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))=0, x=1, y=1, z=1] [L808] 3 a$r_buff1_thd3 = weak$$choice2 ? a$r_buff1_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff1_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L809] 3 __unbuffered_p2_EBX = a VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=1, z=1] [L814] EXPR 3 a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=1, z=1] [L814] 3 a = a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) [L815] 3 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used [L816] 3 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$w_buff1_used [L779] 2 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L780] 2 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used [L781] 2 a$r_buff0_thd2 = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L817] 3 a$r_buff0_thd3 = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3 [L847] 0 a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=1, z=1] [L848] 0 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L849] 0 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$w_buff1_used [L850] 0 a$r_buff0_thd0 = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 170 locations, 2 error locations. Result: UNSAFE, OverallTime: 142.6s, OverallIterations: 39, TraceHistogramMax: 1, AutomataDifference: 49.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 11495 SDtfs, 17402 SDslu, 44984 SDs, 0 SdLazy, 25128 SolverSat, 876 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 21.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 666 GetRequests, 102 SyntacticMatches, 25 SemanticMatches, 539 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2841 ImplicationChecksByTransitivity, 6.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=168271occurred in iteration=2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 59.6s AutomataMinimizationTime, 38 MinimizatonAttempts, 791949 StatesRemovedByMinimization, 35 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 4.0s InterpolantComputationTime, 2042 NumberOfCodeBlocks, 2042 NumberOfCodeBlocksAsserted, 39 NumberOfCheckSat, 1937 ConstructedInterpolants, 0 QuantifiedInterpolants, 444291 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 38 InterpolantComputations, 38 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...