/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix015_rmo.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 01:33:03,857 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 01:33:03,860 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 01:33:03,878 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 01:33:03,879 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 01:33:03,881 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 01:33:03,883 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 01:33:03,893 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 01:33:03,896 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 01:33:03,899 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 01:33:03,901 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 01:33:03,903 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 01:33:03,904 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 01:33:03,906 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 01:33:03,908 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 01:33:03,910 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 01:33:03,911 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 01:33:03,912 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 01:33:03,914 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 01:33:03,918 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 01:33:03,924 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 01:33:03,929 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 01:33:03,930 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 01:33:03,930 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 01:33:03,932 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 01:33:03,932 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 01:33:03,933 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 01:33:03,933 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 01:33:03,934 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 01:33:03,935 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 01:33:03,935 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 01:33:03,936 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 01:33:03,936 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 01:33:03,937 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 01:33:03,938 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 01:33:03,938 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 01:33:03,939 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 01:33:03,939 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 01:33:03,939 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 01:33:03,940 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 01:33:03,940 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 01:33:03,941 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe.epf [2019-12-27 01:33:03,955 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 01:33:03,955 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 01:33:03,956 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 01:33:03,957 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 01:33:03,957 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 01:33:03,957 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 01:33:03,957 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 01:33:03,957 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 01:33:03,958 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 01:33:03,958 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 01:33:03,958 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 01:33:03,958 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 01:33:03,958 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 01:33:03,959 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 01:33:03,959 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 01:33:03,959 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 01:33:03,959 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 01:33:03,959 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 01:33:03,960 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 01:33:03,960 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 01:33:03,960 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 01:33:03,960 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 01:33:03,960 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 01:33:03,961 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 01:33:03,961 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 01:33:03,961 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 01:33:03,961 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 01:33:03,961 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 01:33:03,962 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 01:33:04,257 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 01:33:04,272 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 01:33:04,275 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 01:33:04,277 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 01:33:04,277 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 01:33:04,278 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix015_rmo.oepc.i [2019-12-27 01:33:04,340 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d2eeadbb9/aab27bbc49db49a28e6cee038075e40b/FLAG0c4d27d23 [2019-12-27 01:33:04,944 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 01:33:04,946 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix015_rmo.oepc.i [2019-12-27 01:33:04,974 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d2eeadbb9/aab27bbc49db49a28e6cee038075e40b/FLAG0c4d27d23 [2019-12-27 01:33:05,181 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d2eeadbb9/aab27bbc49db49a28e6cee038075e40b [2019-12-27 01:33:05,190 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 01:33:05,192 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 01:33:05,193 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 01:33:05,193 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 01:33:05,196 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 01:33:05,197 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 01:33:05" (1/1) ... [2019-12-27 01:33:05,200 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@85f7a91 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 01:33:05, skipping insertion in model container [2019-12-27 01:33:05,201 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 01:33:05" (1/1) ... [2019-12-27 01:33:05,208 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 01:33:05,265 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 01:33:05,867 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 01:33:05,880 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 01:33:05,965 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 01:33:06,043 INFO L208 MainTranslator]: Completed translation [2019-12-27 01:33:06,044 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 01:33:06 WrapperNode [2019-12-27 01:33:06,044 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 01:33:06,045 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 01:33:06,045 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 01:33:06,045 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 01:33:06,054 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 01:33:06" (1/1) ... [2019-12-27 01:33:06,076 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 01:33:06" (1/1) ... [2019-12-27 01:33:06,108 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 01:33:06,109 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 01:33:06,109 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 01:33:06,109 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 01:33:06,120 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 01:33:06" (1/1) ... [2019-12-27 01:33:06,120 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 01:33:06" (1/1) ... [2019-12-27 01:33:06,126 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 01:33:06" (1/1) ... [2019-12-27 01:33:06,127 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 01:33:06" (1/1) ... [2019-12-27 01:33:06,156 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 01:33:06" (1/1) ... [2019-12-27 01:33:06,162 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 01:33:06" (1/1) ... [2019-12-27 01:33:06,165 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 01:33:06" (1/1) ... [2019-12-27 01:33:06,170 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 01:33:06,177 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 01:33:06,177 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 01:33:06,178 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 01:33:06,179 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 01:33:06" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 01:33:06,251 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 01:33:06,252 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 01:33:06,252 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 01:33:06,252 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 01:33:06,253 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 01:33:06,253 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 01:33:06,254 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 01:33:06,254 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 01:33:06,255 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-27 01:33:06,255 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-27 01:33:06,256 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 01:33:06,257 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 01:33:06,257 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 01:33:06,259 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-27 01:33:07,036 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 01:33:07,036 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 01:33:07,038 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 01:33:07 BoogieIcfgContainer [2019-12-27 01:33:07,038 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 01:33:07,039 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 01:33:07,039 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 01:33:07,043 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 01:33:07,043 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 01:33:05" (1/3) ... [2019-12-27 01:33:07,044 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c82a400 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 01:33:07, skipping insertion in model container [2019-12-27 01:33:07,044 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 01:33:06" (2/3) ... [2019-12-27 01:33:07,045 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c82a400 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 01:33:07, skipping insertion in model container [2019-12-27 01:33:07,045 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 01:33:07" (3/3) ... [2019-12-27 01:33:07,047 INFO L109 eAbstractionObserver]: Analyzing ICFG mix015_rmo.oepc.i [2019-12-27 01:33:07,056 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 01:33:07,057 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 01:33:07,064 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 01:33:07,065 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 01:33:07,106 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:33:07,107 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:33:07,107 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:33:07,107 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:33:07,107 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:33:07,108 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:33:07,108 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:33:07,108 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:33:07,109 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:33:07,109 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:33:07,109 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:33:07,110 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:33:07,110 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:33:07,110 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:33:07,110 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:33:07,111 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:33:07,111 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:33:07,111 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:33:07,111 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:33:07,111 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:33:07,112 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:33:07,112 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:33:07,112 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:33:07,112 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:33:07,113 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:33:07,113 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:33:07,113 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:33:07,113 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:33:07,114 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:33:07,114 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:33:07,114 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:33:07,114 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:33:07,115 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:33:07,115 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:33:07,116 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:33:07,116 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:33:07,116 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:33:07,116 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:33:07,117 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:33:07,117 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:33:07,117 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:33:07,117 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:33:07,118 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:33:07,118 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:33:07,118 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:33:07,135 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:33:07,136 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:33:07,136 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:33:07,136 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:33:07,136 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:33:07,137 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:33:07,137 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:33:07,137 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:33:07,137 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:33:07,138 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:33:07,138 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:33:07,138 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:33:07,138 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:33:07,138 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:33:07,139 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:33:07,139 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:33:07,139 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:33:07,139 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:33:07,139 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:33:07,140 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:33:07,141 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:33:07,141 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:33:07,141 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:33:07,141 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:33:07,141 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:33:07,142 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:33:07,142 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:33:07,142 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:33:07,142 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:33:07,142 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:33:07,143 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:33:07,143 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:33:07,143 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:33:07,143 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:33:07,143 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:33:07,144 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:33:07,144 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:33:07,144 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:33:07,144 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:33:07,144 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:33:07,144 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:33:07,145 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:33:07,145 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:33:07,145 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:33:07,145 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:33:07,146 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:33:07,146 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:33:07,146 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:33:07,146 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:33:07,146 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:33:07,147 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:33:07,147 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:33:07,147 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:33:07,147 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:33:07,147 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:33:07,148 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:33:07,148 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:33:07,148 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:33:07,148 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:33:07,149 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:33:07,149 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:33:07,149 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:33:07,149 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:33:07,149 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:33:07,150 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:33:07,150 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:33:07,150 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:33:07,150 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:33:07,150 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:33:07,151 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:33:07,151 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:33:07,151 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:33:07,151 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:33:07,151 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:33:07,152 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:33:07,152 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:33:07,152 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:33:07,152 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:33:07,153 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:33:07,153 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:33:07,153 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:33:07,153 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:33:07,153 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:33:07,154 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:33:07,154 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:33:07,154 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:33:07,154 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:33:07,154 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:33:07,155 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:33:07,155 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:33:07,155 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:33:07,155 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:33:07,155 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:33:07,156 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:33:07,156 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:33:07,156 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:33:07,156 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:33:07,156 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:33:07,157 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:33:07,157 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:33:07,157 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:33:07,157 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:33:07,157 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:33:07,158 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:33:07,158 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:33:07,158 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:33:07,158 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:33:07,158 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:33:07,158 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:33:07,159 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:33:07,159 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:33:07,159 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:33:07,159 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:33:07,159 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:33:07,160 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:33:07,160 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:33:07,160 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:33:07,160 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:33:07,160 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:33:07,161 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:33:07,161 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:33:07,161 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:33:07,161 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:33:07,161 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:33:07,161 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:33:07,162 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:33:07,162 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:33:07,162 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:33:07,162 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:33:07,162 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:33:07,163 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:33:07,163 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:33:07,163 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:33:07,163 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:33:07,163 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:33:07,164 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:33:07,164 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:33:07,167 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:33:07,168 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:33:07,168 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:33:07,168 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:33:07,168 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:33:07,168 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:33:07,169 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:33:07,169 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:33:07,169 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:33:07,169 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:33:07,169 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:33:07,170 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:33:07,170 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:33:07,170 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:33:07,170 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:33:07,170 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:33:07,171 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:33:07,171 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:33:07,171 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:33:07,171 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:33:07,171 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:33:07,172 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:33:07,172 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:33:07,172 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:33:07,172 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:33:07,172 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:33:07,173 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:33:07,173 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:33:07,173 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:33:07,173 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:33:07,173 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:33:07,173 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:33:07,174 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:33:07,177 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:33:07,178 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:33:07,178 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:33:07,178 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:33:07,178 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:33:07,179 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:33:07,179 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:33:07,179 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:33:07,179 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:33:07,179 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:33:07,180 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:33:07,180 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:33:07,182 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:33:07,182 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:33:07,182 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:33:07,182 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:33:07,183 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:33:07,183 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:33:07,183 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:33:07,183 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:33:07,183 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:33:07,184 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:33:07,198 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-27 01:33:07,219 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 01:33:07,219 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 01:33:07,219 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 01:33:07,219 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-27 01:33:07,220 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 01:33:07,220 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 01:33:07,220 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 01:33:07,220 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 01:33:07,237 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 179 places, 216 transitions [2019-12-27 01:33:07,239 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 179 places, 216 transitions [2019-12-27 01:33:07,353 INFO L132 PetriNetUnfolder]: 47/213 cut-off events. [2019-12-27 01:33:07,354 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 01:33:07,372 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 427 event pairs. 0/164 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-27 01:33:07,401 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 179 places, 216 transitions [2019-12-27 01:33:07,457 INFO L132 PetriNetUnfolder]: 47/213 cut-off events. [2019-12-27 01:33:07,457 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 01:33:07,466 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 427 event pairs. 0/164 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-27 01:33:07,489 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 19004 [2019-12-27 01:33:07,490 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-27 01:33:12,777 WARN L192 SmtUtils]: Spent 290.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 95 [2019-12-27 01:33:12,929 WARN L192 SmtUtils]: Spent 146.00 ms on a formula simplification that was a NOOP. DAG size: 93 [2019-12-27 01:33:13,078 INFO L206 etLargeBlockEncoding]: Checked pairs total: 80759 [2019-12-27 01:33:13,078 INFO L214 etLargeBlockEncoding]: Total number of compositions: 116 [2019-12-27 01:33:13,082 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 94 places, 102 transitions [2019-12-27 01:33:31,995 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 118022 states. [2019-12-27 01:33:31,997 INFO L276 IsEmpty]: Start isEmpty. Operand 118022 states. [2019-12-27 01:33:32,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-27 01:33:32,004 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:33:32,004 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-27 01:33:32,005 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-27 01:33:32,010 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:33:32,010 INFO L82 PathProgramCache]: Analyzing trace with hash 922782, now seen corresponding path program 1 times [2019-12-27 01:33:32,018 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:33:32,019 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [811761147] [2019-12-27 01:33:32,019 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:33:32,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:33:32,323 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 01:33:32,324 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [811761147] [2019-12-27 01:33:32,325 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:33:32,325 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 01:33:32,326 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1471583053] [2019-12-27 01:33:32,330 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 01:33:32,331 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:33:32,346 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 01:33:32,346 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 01:33:32,349 INFO L87 Difference]: Start difference. First operand 118022 states. Second operand 3 states. [2019-12-27 01:33:35,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:33:35,438 INFO L93 Difference]: Finished difference Result 116858 states and 495582 transitions. [2019-12-27 01:33:35,439 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 01:33:35,440 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-27 01:33:35,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:33:36,133 INFO L225 Difference]: With dead ends: 116858 [2019-12-27 01:33:36,134 INFO L226 Difference]: Without dead ends: 110138 [2019-12-27 01:33:36,137 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 01:33:40,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110138 states. [2019-12-27 01:33:46,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110138 to 110138. [2019-12-27 01:33:46,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110138 states. [2019-12-27 01:33:47,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110138 states to 110138 states and 466462 transitions. [2019-12-27 01:33:47,137 INFO L78 Accepts]: Start accepts. Automaton has 110138 states and 466462 transitions. Word has length 3 [2019-12-27 01:33:47,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:33:47,137 INFO L462 AbstractCegarLoop]: Abstraction has 110138 states and 466462 transitions. [2019-12-27 01:33:47,137 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 01:33:47,137 INFO L276 IsEmpty]: Start isEmpty. Operand 110138 states and 466462 transitions. [2019-12-27 01:33:47,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-27 01:33:47,140 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:33:47,140 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 01:33:47,141 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-27 01:33:47,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:33:47,141 INFO L82 PathProgramCache]: Analyzing trace with hash 228105342, now seen corresponding path program 1 times [2019-12-27 01:33:47,142 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:33:47,142 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [433423546] [2019-12-27 01:33:47,142 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:33:47,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:33:47,241 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 01:33:47,242 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [433423546] [2019-12-27 01:33:47,242 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:33:47,242 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 01:33:47,242 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1677544594] [2019-12-27 01:33:47,244 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 01:33:47,244 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:33:47,244 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 01:33:47,244 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 01:33:47,244 INFO L87 Difference]: Start difference. First operand 110138 states and 466462 transitions. Second operand 4 states. [2019-12-27 01:33:53,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:33:53,016 INFO L93 Difference]: Finished difference Result 170904 states and 695583 transitions. [2019-12-27 01:33:53,017 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 01:33:53,017 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-27 01:33:53,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:33:53,697 INFO L225 Difference]: With dead ends: 170904 [2019-12-27 01:33:53,697 INFO L226 Difference]: Without dead ends: 170855 [2019-12-27 01:33:53,698 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 01:33:59,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170855 states. [2019-12-27 01:34:02,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170855 to 156295. [2019-12-27 01:34:02,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156295 states. [2019-12-27 01:34:10,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156295 states to 156295 states and 644009 transitions. [2019-12-27 01:34:10,371 INFO L78 Accepts]: Start accepts. Automaton has 156295 states and 644009 transitions. Word has length 11 [2019-12-27 01:34:10,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:34:10,371 INFO L462 AbstractCegarLoop]: Abstraction has 156295 states and 644009 transitions. [2019-12-27 01:34:10,372 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 01:34:10,372 INFO L276 IsEmpty]: Start isEmpty. Operand 156295 states and 644009 transitions. [2019-12-27 01:34:10,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 01:34:10,380 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:34:10,380 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 01:34:10,380 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-27 01:34:10,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:34:10,381 INFO L82 PathProgramCache]: Analyzing trace with hash 891607686, now seen corresponding path program 1 times [2019-12-27 01:34:10,381 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:34:10,381 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1857791935] [2019-12-27 01:34:10,381 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:34:10,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:34:10,452 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 01:34:10,453 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1857791935] [2019-12-27 01:34:10,453 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:34:10,453 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 01:34:10,453 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1657220266] [2019-12-27 01:34:10,454 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 01:34:10,454 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:34:10,454 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 01:34:10,455 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 01:34:10,455 INFO L87 Difference]: Start difference. First operand 156295 states and 644009 transitions. Second operand 3 states. [2019-12-27 01:34:10,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:34:10,588 INFO L93 Difference]: Finished difference Result 33673 states and 108735 transitions. [2019-12-27 01:34:10,589 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 01:34:10,589 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-27 01:34:10,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:34:10,660 INFO L225 Difference]: With dead ends: 33673 [2019-12-27 01:34:10,661 INFO L226 Difference]: Without dead ends: 33673 [2019-12-27 01:34:10,661 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 01:34:10,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33673 states. [2019-12-27 01:34:11,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33673 to 33673. [2019-12-27 01:34:11,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33673 states. [2019-12-27 01:34:11,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33673 states to 33673 states and 108735 transitions. [2019-12-27 01:34:11,327 INFO L78 Accepts]: Start accepts. Automaton has 33673 states and 108735 transitions. Word has length 13 [2019-12-27 01:34:11,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:34:11,328 INFO L462 AbstractCegarLoop]: Abstraction has 33673 states and 108735 transitions. [2019-12-27 01:34:11,328 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 01:34:11,328 INFO L276 IsEmpty]: Start isEmpty. Operand 33673 states and 108735 transitions. [2019-12-27 01:34:11,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-27 01:34:11,331 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:34:11,331 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 01:34:11,331 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-27 01:34:11,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:34:11,331 INFO L82 PathProgramCache]: Analyzing trace with hash -1993825600, now seen corresponding path program 1 times [2019-12-27 01:34:11,332 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:34:11,332 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [27970100] [2019-12-27 01:34:11,332 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:34:11,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:34:11,410 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 01:34:11,410 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [27970100] [2019-12-27 01:34:11,411 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:34:11,414 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 01:34:11,414 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [738933529] [2019-12-27 01:34:11,415 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 01:34:11,415 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:34:11,415 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 01:34:11,415 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 01:34:11,415 INFO L87 Difference]: Start difference. First operand 33673 states and 108735 transitions. Second operand 4 states. [2019-12-27 01:34:11,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:34:11,821 INFO L93 Difference]: Finished difference Result 42056 states and 135369 transitions. [2019-12-27 01:34:11,821 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 01:34:11,821 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-12-27 01:34:11,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:34:11,911 INFO L225 Difference]: With dead ends: 42056 [2019-12-27 01:34:11,912 INFO L226 Difference]: Without dead ends: 42056 [2019-12-27 01:34:11,912 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 01:34:12,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42056 states. [2019-12-27 01:34:13,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42056 to 37770. [2019-12-27 01:34:13,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37770 states. [2019-12-27 01:34:13,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37770 states to 37770 states and 121950 transitions. [2019-12-27 01:34:13,952 INFO L78 Accepts]: Start accepts. Automaton has 37770 states and 121950 transitions. Word has length 16 [2019-12-27 01:34:13,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:34:13,953 INFO L462 AbstractCegarLoop]: Abstraction has 37770 states and 121950 transitions. [2019-12-27 01:34:13,953 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 01:34:13,953 INFO L276 IsEmpty]: Start isEmpty. Operand 37770 states and 121950 transitions. [2019-12-27 01:34:13,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-27 01:34:13,963 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:34:13,963 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 01:34:13,963 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-27 01:34:13,963 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:34:13,964 INFO L82 PathProgramCache]: Analyzing trace with hash 674854723, now seen corresponding path program 1 times [2019-12-27 01:34:13,964 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:34:13,964 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [125179075] [2019-12-27 01:34:13,964 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:34:14,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:34:14,108 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 01:34:14,109 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [125179075] [2019-12-27 01:34:14,109 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:34:14,109 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 01:34:14,110 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [230598183] [2019-12-27 01:34:14,110 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 01:34:14,110 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:34:14,110 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 01:34:14,111 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 01:34:14,111 INFO L87 Difference]: Start difference. First operand 37770 states and 121950 transitions. Second operand 5 states. [2019-12-27 01:34:14,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:34:14,751 INFO L93 Difference]: Finished difference Result 48537 states and 154193 transitions. [2019-12-27 01:34:14,751 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 01:34:14,751 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-12-27 01:34:14,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:34:14,833 INFO L225 Difference]: With dead ends: 48537 [2019-12-27 01:34:14,833 INFO L226 Difference]: Without dead ends: 48530 [2019-12-27 01:34:14,834 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-27 01:34:15,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48530 states. [2019-12-27 01:34:15,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48530 to 37459. [2019-12-27 01:34:15,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37459 states. [2019-12-27 01:34:15,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37459 states to 37459 states and 120776 transitions. [2019-12-27 01:34:15,566 INFO L78 Accepts]: Start accepts. Automaton has 37459 states and 120776 transitions. Word has length 22 [2019-12-27 01:34:15,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:34:15,566 INFO L462 AbstractCegarLoop]: Abstraction has 37459 states and 120776 transitions. [2019-12-27 01:34:15,567 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 01:34:15,567 INFO L276 IsEmpty]: Start isEmpty. Operand 37459 states and 120776 transitions. [2019-12-27 01:34:15,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 01:34:15,579 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:34:15,579 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 01:34:15,580 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-27 01:34:15,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:34:15,580 INFO L82 PathProgramCache]: Analyzing trace with hash 332765886, now seen corresponding path program 1 times [2019-12-27 01:34:15,580 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:34:15,581 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [524016169] [2019-12-27 01:34:15,581 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:34:15,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:34:15,637 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 01:34:15,638 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [524016169] [2019-12-27 01:34:15,638 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:34:15,638 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 01:34:15,639 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [789888166] [2019-12-27 01:34:15,639 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 01:34:15,639 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:34:15,639 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 01:34:15,640 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 01:34:15,640 INFO L87 Difference]: Start difference. First operand 37459 states and 120776 transitions. Second operand 4 states. [2019-12-27 01:34:15,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:34:15,722 INFO L93 Difference]: Finished difference Result 14576 states and 44297 transitions. [2019-12-27 01:34:15,723 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 01:34:15,723 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2019-12-27 01:34:15,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:34:15,751 INFO L225 Difference]: With dead ends: 14576 [2019-12-27 01:34:15,752 INFO L226 Difference]: Without dead ends: 14576 [2019-12-27 01:34:15,752 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 01:34:15,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14576 states. [2019-12-27 01:34:16,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14576 to 14332. [2019-12-27 01:34:16,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14332 states. [2019-12-27 01:34:16,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14332 states to 14332 states and 43601 transitions. [2019-12-27 01:34:16,758 INFO L78 Accepts]: Start accepts. Automaton has 14332 states and 43601 transitions. Word has length 25 [2019-12-27 01:34:16,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:34:16,759 INFO L462 AbstractCegarLoop]: Abstraction has 14332 states and 43601 transitions. [2019-12-27 01:34:16,759 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 01:34:16,759 INFO L276 IsEmpty]: Start isEmpty. Operand 14332 states and 43601 transitions. [2019-12-27 01:34:16,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-27 01:34:16,769 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:34:16,769 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-27 01:34:16,769 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-27 01:34:16,770 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:34:16,770 INFO L82 PathProgramCache]: Analyzing trace with hash 445555351, now seen corresponding path program 1 times [2019-12-27 01:34:16,770 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:34:16,771 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2030393215] [2019-12-27 01:34:16,771 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:34:16,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:34:16,813 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 01:34:16,813 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2030393215] [2019-12-27 01:34:16,813 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:34:16,813 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 01:34:16,814 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1015419070] [2019-12-27 01:34:16,814 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 01:34:16,814 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:34:16,814 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 01:34:16,815 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 01:34:16,815 INFO L87 Difference]: Start difference. First operand 14332 states and 43601 transitions. Second operand 3 states. [2019-12-27 01:34:16,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:34:16,916 INFO L93 Difference]: Finished difference Result 22367 states and 67484 transitions. [2019-12-27 01:34:16,917 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 01:34:16,917 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-12-27 01:34:16,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:34:16,948 INFO L225 Difference]: With dead ends: 22367 [2019-12-27 01:34:16,948 INFO L226 Difference]: Without dead ends: 22367 [2019-12-27 01:34:16,948 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 01:34:17,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22367 states. [2019-12-27 01:34:17,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22367 to 16938. [2019-12-27 01:34:17,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16938 states. [2019-12-27 01:34:17,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16938 states to 16938 states and 51830 transitions. [2019-12-27 01:34:17,243 INFO L78 Accepts]: Start accepts. Automaton has 16938 states and 51830 transitions. Word has length 27 [2019-12-27 01:34:17,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:34:17,243 INFO L462 AbstractCegarLoop]: Abstraction has 16938 states and 51830 transitions. [2019-12-27 01:34:17,244 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 01:34:17,244 INFO L276 IsEmpty]: Start isEmpty. Operand 16938 states and 51830 transitions. [2019-12-27 01:34:17,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-27 01:34:17,257 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:34:17,257 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-27 01:34:17,257 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-27 01:34:17,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:34:17,257 INFO L82 PathProgramCache]: Analyzing trace with hash 1217095067, now seen corresponding path program 1 times [2019-12-27 01:34:17,258 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:34:17,258 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [23210613] [2019-12-27 01:34:17,258 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:34:17,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:34:17,306 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 01:34:17,306 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [23210613] [2019-12-27 01:34:17,306 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:34:17,306 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 01:34:17,307 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [140502184] [2019-12-27 01:34:17,307 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 01:34:17,307 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:34:17,308 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 01:34:17,308 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 01:34:17,308 INFO L87 Difference]: Start difference. First operand 16938 states and 51830 transitions. Second operand 3 states. [2019-12-27 01:34:17,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:34:17,398 INFO L93 Difference]: Finished difference Result 22367 states and 66493 transitions. [2019-12-27 01:34:17,398 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 01:34:17,399 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-12-27 01:34:17,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:34:17,429 INFO L225 Difference]: With dead ends: 22367 [2019-12-27 01:34:17,429 INFO L226 Difference]: Without dead ends: 22367 [2019-12-27 01:34:17,429 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 01:34:17,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22367 states. [2019-12-27 01:34:17,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22367 to 16938. [2019-12-27 01:34:17,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16938 states. [2019-12-27 01:34:17,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16938 states to 16938 states and 50839 transitions. [2019-12-27 01:34:17,716 INFO L78 Accepts]: Start accepts. Automaton has 16938 states and 50839 transitions. Word has length 27 [2019-12-27 01:34:17,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:34:17,716 INFO L462 AbstractCegarLoop]: Abstraction has 16938 states and 50839 transitions. [2019-12-27 01:34:17,717 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 01:34:17,717 INFO L276 IsEmpty]: Start isEmpty. Operand 16938 states and 50839 transitions. [2019-12-27 01:34:17,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-27 01:34:17,729 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:34:17,729 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-27 01:34:17,729 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-27 01:34:17,729 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:34:17,729 INFO L82 PathProgramCache]: Analyzing trace with hash 1361870049, now seen corresponding path program 1 times [2019-12-27 01:34:17,730 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:34:17,730 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [181709340] [2019-12-27 01:34:17,730 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:34:17,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:34:17,815 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 01:34:17,816 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [181709340] [2019-12-27 01:34:17,816 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:34:17,816 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 01:34:17,816 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [208391584] [2019-12-27 01:34:17,817 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 01:34:17,817 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:34:17,817 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 01:34:17,817 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 01:34:17,817 INFO L87 Difference]: Start difference. First operand 16938 states and 50839 transitions. Second operand 6 states. [2019-12-27 01:34:18,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:34:18,424 INFO L93 Difference]: Finished difference Result 31275 states and 92943 transitions. [2019-12-27 01:34:18,424 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 01:34:18,425 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2019-12-27 01:34:18,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:34:18,470 INFO L225 Difference]: With dead ends: 31275 [2019-12-27 01:34:18,471 INFO L226 Difference]: Without dead ends: 31275 [2019-12-27 01:34:18,471 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2019-12-27 01:34:18,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31275 states. [2019-12-27 01:34:18,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31275 to 19607. [2019-12-27 01:34:18,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19607 states. [2019-12-27 01:34:18,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19607 states to 19607 states and 58673 transitions. [2019-12-27 01:34:18,849 INFO L78 Accepts]: Start accepts. Automaton has 19607 states and 58673 transitions. Word has length 27 [2019-12-27 01:34:18,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:34:18,849 INFO L462 AbstractCegarLoop]: Abstraction has 19607 states and 58673 transitions. [2019-12-27 01:34:18,849 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 01:34:18,849 INFO L276 IsEmpty]: Start isEmpty. Operand 19607 states and 58673 transitions. [2019-12-27 01:34:18,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-27 01:34:18,864 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:34:18,864 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 01:34:18,864 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-27 01:34:18,864 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:34:18,864 INFO L82 PathProgramCache]: Analyzing trace with hash -2015671980, now seen corresponding path program 1 times [2019-12-27 01:34:18,865 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:34:18,865 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1161276477] [2019-12-27 01:34:18,865 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:34:18,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:34:20,636 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 01:34:20,637 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1161276477] [2019-12-27 01:34:20,637 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:34:20,637 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 01:34:20,637 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [824798941] [2019-12-27 01:34:20,638 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 01:34:20,638 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:34:20,638 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 01:34:20,638 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 01:34:20,638 INFO L87 Difference]: Start difference. First operand 19607 states and 58673 transitions. Second operand 6 states. [2019-12-27 01:34:21,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:34:21,284 INFO L93 Difference]: Finished difference Result 30618 states and 90299 transitions. [2019-12-27 01:34:21,284 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 01:34:21,284 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 28 [2019-12-27 01:34:21,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:34:21,329 INFO L225 Difference]: With dead ends: 30618 [2019-12-27 01:34:21,329 INFO L226 Difference]: Without dead ends: 30618 [2019-12-27 01:34:21,330 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2019-12-27 01:34:21,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30618 states. [2019-12-27 01:34:21,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30618 to 19271. [2019-12-27 01:34:21,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19271 states. [2019-12-27 01:34:21,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19271 states to 19271 states and 57577 transitions. [2019-12-27 01:34:21,716 INFO L78 Accepts]: Start accepts. Automaton has 19271 states and 57577 transitions. Word has length 28 [2019-12-27 01:34:21,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:34:21,716 INFO L462 AbstractCegarLoop]: Abstraction has 19271 states and 57577 transitions. [2019-12-27 01:34:21,716 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 01:34:21,716 INFO L276 IsEmpty]: Start isEmpty. Operand 19271 states and 57577 transitions. [2019-12-27 01:34:21,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-27 01:34:21,737 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:34:21,737 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-27 01:34:21,738 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-27 01:34:21,738 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:34:21,738 INFO L82 PathProgramCache]: Analyzing trace with hash 405285854, now seen corresponding path program 1 times [2019-12-27 01:34:21,738 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:34:21,738 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1622150084] [2019-12-27 01:34:21,738 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:34:21,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:34:21,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-27 01:34:21,812 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1622150084] [2019-12-27 01:34:21,813 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:34:21,813 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 01:34:21,813 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1874126766] [2019-12-27 01:34:21,813 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 01:34:21,814 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:34:21,814 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 01:34:21,814 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 01:34:21,814 INFO L87 Difference]: Start difference. First operand 19271 states and 57577 transitions. Second operand 5 states. [2019-12-27 01:34:22,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:34:22,236 INFO L93 Difference]: Finished difference Result 23829 states and 70169 transitions. [2019-12-27 01:34:22,236 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 01:34:22,237 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 33 [2019-12-27 01:34:22,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:34:22,285 INFO L225 Difference]: With dead ends: 23829 [2019-12-27 01:34:22,285 INFO L226 Difference]: Without dead ends: 23829 [2019-12-27 01:34:22,286 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-27 01:34:22,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23829 states. [2019-12-27 01:34:22,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23829 to 20047. [2019-12-27 01:34:22,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20047 states. [2019-12-27 01:34:22,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20047 states to 20047 states and 59899 transitions. [2019-12-27 01:34:22,660 INFO L78 Accepts]: Start accepts. Automaton has 20047 states and 59899 transitions. Word has length 33 [2019-12-27 01:34:22,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:34:22,660 INFO L462 AbstractCegarLoop]: Abstraction has 20047 states and 59899 transitions. [2019-12-27 01:34:22,660 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 01:34:22,660 INFO L276 IsEmpty]: Start isEmpty. Operand 20047 states and 59899 transitions. [2019-12-27 01:34:22,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-27 01:34:22,685 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:34:22,685 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-27 01:34:22,685 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-27 01:34:22,686 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:34:22,686 INFO L82 PathProgramCache]: Analyzing trace with hash -1258895234, now seen corresponding path program 2 times [2019-12-27 01:34:22,686 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:34:22,686 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1128571901] [2019-12-27 01:34:22,687 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:34:22,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:34:22,780 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 01:34:22,780 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1128571901] [2019-12-27 01:34:22,780 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:34:22,780 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 01:34:22,781 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [952761167] [2019-12-27 01:34:22,781 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 01:34:22,781 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:34:22,781 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 01:34:22,783 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-27 01:34:22,783 INFO L87 Difference]: Start difference. First operand 20047 states and 59899 transitions. Second operand 7 states. [2019-12-27 01:34:24,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:34:24,124 INFO L93 Difference]: Finished difference Result 39715 states and 116920 transitions. [2019-12-27 01:34:24,127 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-27 01:34:24,127 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 33 [2019-12-27 01:34:24,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:34:24,338 INFO L225 Difference]: With dead ends: 39715 [2019-12-27 01:34:24,338 INFO L226 Difference]: Without dead ends: 39715 [2019-12-27 01:34:24,339 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=89, Invalid=253, Unknown=0, NotChecked=0, Total=342 [2019-12-27 01:34:24,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39715 states. [2019-12-27 01:34:24,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39715 to 21295. [2019-12-27 01:34:24,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21295 states. [2019-12-27 01:34:24,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21295 states to 21295 states and 63643 transitions. [2019-12-27 01:34:24,758 INFO L78 Accepts]: Start accepts. Automaton has 21295 states and 63643 transitions. Word has length 33 [2019-12-27 01:34:24,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:34:24,759 INFO L462 AbstractCegarLoop]: Abstraction has 21295 states and 63643 transitions. [2019-12-27 01:34:24,759 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 01:34:24,759 INFO L276 IsEmpty]: Start isEmpty. Operand 21295 states and 63643 transitions. [2019-12-27 01:34:24,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-27 01:34:24,776 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:34:24,776 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-27 01:34:24,776 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-27 01:34:24,777 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:34:24,777 INFO L82 PathProgramCache]: Analyzing trace with hash -454706214, now seen corresponding path program 3 times [2019-12-27 01:34:24,777 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:34:24,777 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1642637712] [2019-12-27 01:34:24,777 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:34:24,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:34:24,952 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 01:34:24,953 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1642637712] [2019-12-27 01:34:24,953 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:34:24,953 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 01:34:24,953 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [276796582] [2019-12-27 01:34:24,954 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 01:34:24,954 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:34:24,954 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 01:34:24,954 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-12-27 01:34:24,954 INFO L87 Difference]: Start difference. First operand 21295 states and 63643 transitions. Second operand 9 states. [2019-12-27 01:34:27,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:34:27,933 INFO L93 Difference]: Finished difference Result 60311 states and 174386 transitions. [2019-12-27 01:34:27,933 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-12-27 01:34:27,933 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 33 [2019-12-27 01:34:27,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:34:28,031 INFO L225 Difference]: With dead ends: 60311 [2019-12-27 01:34:28,032 INFO L226 Difference]: Without dead ends: 60311 [2019-12-27 01:34:28,033 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 410 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=333, Invalid=1149, Unknown=0, NotChecked=0, Total=1482 [2019-12-27 01:34:28,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60311 states. [2019-12-27 01:34:28,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60311 to 21323. [2019-12-27 01:34:28,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21323 states. [2019-12-27 01:34:28,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21323 states to 21323 states and 63892 transitions. [2019-12-27 01:34:28,801 INFO L78 Accepts]: Start accepts. Automaton has 21323 states and 63892 transitions. Word has length 33 [2019-12-27 01:34:28,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:34:28,801 INFO L462 AbstractCegarLoop]: Abstraction has 21323 states and 63892 transitions. [2019-12-27 01:34:28,801 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 01:34:28,801 INFO L276 IsEmpty]: Start isEmpty. Operand 21323 states and 63892 transitions. [2019-12-27 01:34:28,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-12-27 01:34:28,820 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:34:28,820 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] [2019-12-27 01:34:28,821 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-27 01:34:28,821 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:34:28,821 INFO L82 PathProgramCache]: Analyzing trace with hash -1655017129, now seen corresponding path program 1 times [2019-12-27 01:34:28,821 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:34:28,821 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [596948812] [2019-12-27 01:34:28,821 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:34:28,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:34:28,903 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 01:34:28,904 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [596948812] [2019-12-27 01:34:28,904 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:34:28,904 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 01:34:28,904 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1351237354] [2019-12-27 01:34:28,905 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 01:34:28,905 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:34:28,905 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 01:34:28,905 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-27 01:34:28,905 INFO L87 Difference]: Start difference. First operand 21323 states and 63892 transitions. Second operand 7 states. [2019-12-27 01:34:30,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:34:30,202 INFO L93 Difference]: Finished difference Result 37558 states and 110158 transitions. [2019-12-27 01:34:30,202 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-27 01:34:30,202 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 34 [2019-12-27 01:34:30,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:34:30,257 INFO L225 Difference]: With dead ends: 37558 [2019-12-27 01:34:30,257 INFO L226 Difference]: Without dead ends: 37558 [2019-12-27 01:34:30,258 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=89, Invalid=253, Unknown=0, NotChecked=0, Total=342 [2019-12-27 01:34:30,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37558 states. [2019-12-27 01:34:30,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37558 to 19946. [2019-12-27 01:34:30,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19946 states. [2019-12-27 01:34:30,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19946 states to 19946 states and 59792 transitions. [2019-12-27 01:34:30,686 INFO L78 Accepts]: Start accepts. Automaton has 19946 states and 59792 transitions. Word has length 34 [2019-12-27 01:34:30,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:34:30,686 INFO L462 AbstractCegarLoop]: Abstraction has 19946 states and 59792 transitions. [2019-12-27 01:34:30,686 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 01:34:30,686 INFO L276 IsEmpty]: Start isEmpty. Operand 19946 states and 59792 transitions. [2019-12-27 01:34:30,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-12-27 01:34:30,706 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:34:30,706 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] [2019-12-27 01:34:30,706 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-27 01:34:30,707 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:34:30,707 INFO L82 PathProgramCache]: Analyzing trace with hash 2107636055, now seen corresponding path program 2 times [2019-12-27 01:34:30,707 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:34:30,707 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1477765858] [2019-12-27 01:34:30,707 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:34:30,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:34:30,889 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 01:34:30,889 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1477765858] [2019-12-27 01:34:30,890 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:34:30,890 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 01:34:30,890 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1355602122] [2019-12-27 01:34:30,890 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 01:34:30,890 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:34:30,891 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 01:34:30,891 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-27 01:34:30,891 INFO L87 Difference]: Start difference. First operand 19946 states and 59792 transitions. Second operand 9 states. [2019-12-27 01:34:32,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:34:32,575 INFO L93 Difference]: Finished difference Result 40625 states and 118770 transitions. [2019-12-27 01:34:32,575 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-12-27 01:34:32,575 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 34 [2019-12-27 01:34:32,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:34:32,652 INFO L225 Difference]: With dead ends: 40625 [2019-12-27 01:34:32,652 INFO L226 Difference]: Without dead ends: 40625 [2019-12-27 01:34:32,653 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=129, Invalid=377, Unknown=0, NotChecked=0, Total=506 [2019-12-27 01:34:32,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40625 states. [2019-12-27 01:34:33,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40625 to 19721. [2019-12-27 01:34:33,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19721 states. [2019-12-27 01:34:33,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19721 states to 19721 states and 59146 transitions. [2019-12-27 01:34:33,206 INFO L78 Accepts]: Start accepts. Automaton has 19721 states and 59146 transitions. Word has length 34 [2019-12-27 01:34:33,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:34:33,206 INFO L462 AbstractCegarLoop]: Abstraction has 19721 states and 59146 transitions. [2019-12-27 01:34:33,207 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 01:34:33,207 INFO L276 IsEmpty]: Start isEmpty. Operand 19721 states and 59146 transitions. [2019-12-27 01:34:33,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-12-27 01:34:33,232 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:34:33,232 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] [2019-12-27 01:34:33,232 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-27 01:34:33,233 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:34:33,233 INFO L82 PathProgramCache]: Analyzing trace with hash 1254078343, now seen corresponding path program 1 times [2019-12-27 01:34:33,233 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:34:33,233 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [542447569] [2019-12-27 01:34:33,233 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:34:33,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:34:33,493 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 01:34:33,493 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [542447569] [2019-12-27 01:34:33,494 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:34:33,494 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 01:34:33,494 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1841370696] [2019-12-27 01:34:33,494 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 01:34:33,495 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:34:33,495 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 01:34:33,495 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2019-12-27 01:34:33,495 INFO L87 Difference]: Start difference. First operand 19721 states and 59146 transitions. Second operand 9 states. [2019-12-27 01:34:35,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:34:35,476 INFO L93 Difference]: Finished difference Result 54494 states and 158328 transitions. [2019-12-27 01:34:35,477 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-12-27 01:34:35,477 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 37 [2019-12-27 01:34:35,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:34:35,565 INFO L225 Difference]: With dead ends: 54494 [2019-12-27 01:34:35,565 INFO L226 Difference]: Without dead ends: 54494 [2019-12-27 01:34:35,566 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 1 SyntacticMatches, 3 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 158 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=187, Invalid=515, Unknown=0, NotChecked=0, Total=702 [2019-12-27 01:34:35,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54494 states. [2019-12-27 01:34:36,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54494 to 19238. [2019-12-27 01:34:36,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19238 states. [2019-12-27 01:34:36,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19238 states to 19238 states and 57800 transitions. [2019-12-27 01:34:36,099 INFO L78 Accepts]: Start accepts. Automaton has 19238 states and 57800 transitions. Word has length 37 [2019-12-27 01:34:36,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:34:36,099 INFO L462 AbstractCegarLoop]: Abstraction has 19238 states and 57800 transitions. [2019-12-27 01:34:36,099 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 01:34:36,099 INFO L276 IsEmpty]: Start isEmpty. Operand 19238 states and 57800 transitions. [2019-12-27 01:34:36,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-27 01:34:36,118 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:34:36,118 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 01:34:36,118 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-27 01:34:36,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:34:36,118 INFO L82 PathProgramCache]: Analyzing trace with hash -887512480, now seen corresponding path program 1 times [2019-12-27 01:34:36,119 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:34:36,119 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1361518867] [2019-12-27 01:34:36,119 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:34:36,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:34:36,179 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 01:34:36,180 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1361518867] [2019-12-27 01:34:36,180 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:34:36,180 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 01:34:36,180 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1620101156] [2019-12-27 01:34:36,181 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 01:34:36,181 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:34:36,181 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 01:34:36,181 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 01:34:36,182 INFO L87 Difference]: Start difference. First operand 19238 states and 57800 transitions. Second operand 4 states. [2019-12-27 01:34:36,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:34:36,416 INFO L93 Difference]: Finished difference Result 32515 states and 98000 transitions. [2019-12-27 01:34:36,416 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 01:34:36,416 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 39 [2019-12-27 01:34:36,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:34:36,460 INFO L225 Difference]: With dead ends: 32515 [2019-12-27 01:34:36,460 INFO L226 Difference]: Without dead ends: 16214 [2019-12-27 01:34:36,461 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 01:34:36,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16214 states. [2019-12-27 01:34:36,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16214 to 16119. [2019-12-27 01:34:36,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16119 states. [2019-12-27 01:34:36,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16119 states to 16119 states and 47508 transitions. [2019-12-27 01:34:36,943 INFO L78 Accepts]: Start accepts. Automaton has 16119 states and 47508 transitions. Word has length 39 [2019-12-27 01:34:36,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:34:36,944 INFO L462 AbstractCegarLoop]: Abstraction has 16119 states and 47508 transitions. [2019-12-27 01:34:36,944 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 01:34:36,944 INFO L276 IsEmpty]: Start isEmpty. Operand 16119 states and 47508 transitions. [2019-12-27 01:34:36,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-27 01:34:36,974 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:34:36,975 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 01:34:36,975 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-27 01:34:36,975 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:34:36,975 INFO L82 PathProgramCache]: Analyzing trace with hash -1585510358, now seen corresponding path program 2 times [2019-12-27 01:34:36,976 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:34:36,976 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [252668798] [2019-12-27 01:34:36,976 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:34:36,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:34:37,044 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 01:34:37,044 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [252668798] [2019-12-27 01:34:37,046 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:34:37,046 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 01:34:37,046 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [180938203] [2019-12-27 01:34:37,047 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 01:34:37,047 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:34:37,047 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 01:34:37,048 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 01:34:37,048 INFO L87 Difference]: Start difference. First operand 16119 states and 47508 transitions. Second operand 3 states. [2019-12-27 01:34:37,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:34:37,161 INFO L93 Difference]: Finished difference Result 16118 states and 47506 transitions. [2019-12-27 01:34:37,161 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 01:34:37,161 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2019-12-27 01:34:37,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:34:37,199 INFO L225 Difference]: With dead ends: 16118 [2019-12-27 01:34:37,200 INFO L226 Difference]: Without dead ends: 16118 [2019-12-27 01:34:37,202 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 01:34:37,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16118 states. [2019-12-27 01:34:37,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16118 to 16118. [2019-12-27 01:34:37,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16118 states. [2019-12-27 01:34:37,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16118 states to 16118 states and 47506 transitions. [2019-12-27 01:34:37,633 INFO L78 Accepts]: Start accepts. Automaton has 16118 states and 47506 transitions. Word has length 39 [2019-12-27 01:34:37,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:34:37,633 INFO L462 AbstractCegarLoop]: Abstraction has 16118 states and 47506 transitions. [2019-12-27 01:34:37,633 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 01:34:37,633 INFO L276 IsEmpty]: Start isEmpty. Operand 16118 states and 47506 transitions. [2019-12-27 01:34:37,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-27 01:34:37,655 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:34:37,655 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 01:34:37,655 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-27 01:34:37,655 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:34:37,655 INFO L82 PathProgramCache]: Analyzing trace with hash -408863373, now seen corresponding path program 1 times [2019-12-27 01:34:37,655 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:34:37,656 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1209056749] [2019-12-27 01:34:37,656 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:34:37,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:34:37,708 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 01:34:37,709 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1209056749] [2019-12-27 01:34:37,709 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:34:37,709 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 01:34:37,709 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [53006781] [2019-12-27 01:34:37,709 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 01:34:37,710 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:34:37,710 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 01:34:37,710 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 01:34:37,710 INFO L87 Difference]: Start difference. First operand 16118 states and 47506 transitions. Second operand 4 states. [2019-12-27 01:34:37,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:34:37,824 INFO L93 Difference]: Finished difference Result 25338 states and 74950 transitions. [2019-12-27 01:34:37,824 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 01:34:37,824 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 40 [2019-12-27 01:34:37,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:34:37,845 INFO L225 Difference]: With dead ends: 25338 [2019-12-27 01:34:37,845 INFO L226 Difference]: Without dead ends: 11243 [2019-12-27 01:34:37,846 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 01:34:37,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11243 states. [2019-12-27 01:34:38,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11243 to 11185. [2019-12-27 01:34:38,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11185 states. [2019-12-27 01:34:38,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11185 states to 11185 states and 32016 transitions. [2019-12-27 01:34:38,022 INFO L78 Accepts]: Start accepts. Automaton has 11185 states and 32016 transitions. Word has length 40 [2019-12-27 01:34:38,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:34:38,022 INFO L462 AbstractCegarLoop]: Abstraction has 11185 states and 32016 transitions. [2019-12-27 01:34:38,022 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 01:34:38,022 INFO L276 IsEmpty]: Start isEmpty. Operand 11185 states and 32016 transitions. [2019-12-27 01:34:38,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-27 01:34:38,034 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:34:38,034 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 01:34:38,034 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-27 01:34:38,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:34:38,034 INFO L82 PathProgramCache]: Analyzing trace with hash 1542545665, now seen corresponding path program 2 times [2019-12-27 01:34:38,035 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:34:38,035 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [623186820] [2019-12-27 01:34:38,035 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:34:38,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:34:38,088 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 01:34:38,088 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [623186820] [2019-12-27 01:34:38,088 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:34:38,088 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 01:34:38,089 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [348094647] [2019-12-27 01:34:38,090 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 01:34:38,090 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:34:38,090 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 01:34:38,090 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 01:34:38,091 INFO L87 Difference]: Start difference. First operand 11185 states and 32016 transitions. Second operand 5 states. [2019-12-27 01:34:38,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:34:38,154 INFO L93 Difference]: Finished difference Result 10223 states and 29875 transitions. [2019-12-27 01:34:38,154 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 01:34:38,155 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 40 [2019-12-27 01:34:38,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:34:38,175 INFO L225 Difference]: With dead ends: 10223 [2019-12-27 01:34:38,175 INFO L226 Difference]: Without dead ends: 7230 [2019-12-27 01:34:38,175 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 01:34:38,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7230 states. [2019-12-27 01:34:38,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7230 to 7230. [2019-12-27 01:34:38,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7230 states. [2019-12-27 01:34:38,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7230 states to 7230 states and 23189 transitions. [2019-12-27 01:34:38,420 INFO L78 Accepts]: Start accepts. Automaton has 7230 states and 23189 transitions. Word has length 40 [2019-12-27 01:34:38,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:34:38,421 INFO L462 AbstractCegarLoop]: Abstraction has 7230 states and 23189 transitions. [2019-12-27 01:34:38,421 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 01:34:38,421 INFO L276 IsEmpty]: Start isEmpty. Operand 7230 states and 23189 transitions. [2019-12-27 01:34:38,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 01:34:38,435 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:34:38,435 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-27 01:34:38,436 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-27 01:34:38,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:34:38,436 INFO L82 PathProgramCache]: Analyzing trace with hash -101932291, now seen corresponding path program 1 times [2019-12-27 01:34:38,436 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:34:38,438 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1103405181] [2019-12-27 01:34:38,438 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:34:38,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:34:38,578 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 01:34:38,579 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1103405181] [2019-12-27 01:34:38,579 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:34:38,579 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 01:34:38,580 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [122896664] [2019-12-27 01:34:38,581 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 01:34:38,581 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:34:38,581 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 01:34:38,582 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-27 01:34:38,582 INFO L87 Difference]: Start difference. First operand 7230 states and 23189 transitions. Second operand 7 states. [2019-12-27 01:34:38,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:34:38,854 INFO L93 Difference]: Finished difference Result 14425 states and 45327 transitions. [2019-12-27 01:34:38,855 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-27 01:34:38,855 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 64 [2019-12-27 01:34:38,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:34:38,872 INFO L225 Difference]: With dead ends: 14425 [2019-12-27 01:34:38,872 INFO L226 Difference]: Without dead ends: 10624 [2019-12-27 01:34:38,872 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2019-12-27 01:34:38,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10624 states. [2019-12-27 01:34:39,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10624 to 8673. [2019-12-27 01:34:39,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8673 states. [2019-12-27 01:34:39,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8673 states to 8673 states and 27719 transitions. [2019-12-27 01:34:39,024 INFO L78 Accepts]: Start accepts. Automaton has 8673 states and 27719 transitions. Word has length 64 [2019-12-27 01:34:39,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:34:39,025 INFO L462 AbstractCegarLoop]: Abstraction has 8673 states and 27719 transitions. [2019-12-27 01:34:39,025 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 01:34:39,025 INFO L276 IsEmpty]: Start isEmpty. Operand 8673 states and 27719 transitions. [2019-12-27 01:34:39,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 01:34:39,035 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:34:39,035 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-27 01:34:39,035 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-27 01:34:39,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:34:39,036 INFO L82 PathProgramCache]: Analyzing trace with hash -244237027, now seen corresponding path program 2 times [2019-12-27 01:34:39,036 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:34:39,036 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [293442431] [2019-12-27 01:34:39,036 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:34:39,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:34:39,109 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 01:34:39,110 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [293442431] [2019-12-27 01:34:39,110 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:34:39,110 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 01:34:39,110 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [260688661] [2019-12-27 01:34:39,111 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 01:34:39,111 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:34:39,111 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 01:34:39,111 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-27 01:34:39,111 INFO L87 Difference]: Start difference. First operand 8673 states and 27719 transitions. Second operand 7 states. [2019-12-27 01:34:39,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:34:39,574 INFO L93 Difference]: Finished difference Result 16977 states and 52978 transitions. [2019-12-27 01:34:39,575 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-27 01:34:39,575 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 64 [2019-12-27 01:34:39,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:34:39,601 INFO L225 Difference]: With dead ends: 16977 [2019-12-27 01:34:39,601 INFO L226 Difference]: Without dead ends: 12608 [2019-12-27 01:34:39,601 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2019-12-27 01:34:39,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12608 states. [2019-12-27 01:34:39,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12608 to 10249. [2019-12-27 01:34:39,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10249 states. [2019-12-27 01:34:39,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10249 states to 10249 states and 32525 transitions. [2019-12-27 01:34:39,871 INFO L78 Accepts]: Start accepts. Automaton has 10249 states and 32525 transitions. Word has length 64 [2019-12-27 01:34:39,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:34:39,871 INFO L462 AbstractCegarLoop]: Abstraction has 10249 states and 32525 transitions. [2019-12-27 01:34:39,871 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 01:34:39,872 INFO L276 IsEmpty]: Start isEmpty. Operand 10249 states and 32525 transitions. [2019-12-27 01:34:39,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 01:34:39,891 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:34:39,892 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-27 01:34:39,892 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-27 01:34:39,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:34:39,893 INFO L82 PathProgramCache]: Analyzing trace with hash 407961531, now seen corresponding path program 3 times [2019-12-27 01:34:39,893 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:34:39,893 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1639178422] [2019-12-27 01:34:39,893 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:34:39,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:34:40,032 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 01:34:40,033 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1639178422] [2019-12-27 01:34:40,033 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:34:40,033 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 01:34:40,036 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [578605770] [2019-12-27 01:34:40,036 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 01:34:40,036 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:34:40,036 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 01:34:40,037 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-27 01:34:40,037 INFO L87 Difference]: Start difference. First operand 10249 states and 32525 transitions. Second operand 9 states. [2019-12-27 01:34:40,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:34:40,989 INFO L93 Difference]: Finished difference Result 29742 states and 92736 transitions. [2019-12-27 01:34:40,989 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-27 01:34:40,989 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 64 [2019-12-27 01:34:40,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:34:41,029 INFO L225 Difference]: With dead ends: 29742 [2019-12-27 01:34:41,029 INFO L226 Difference]: Without dead ends: 27534 [2019-12-27 01:34:41,030 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 143 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=157, Invalid=493, Unknown=0, NotChecked=0, Total=650 [2019-12-27 01:34:41,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27534 states. [2019-12-27 01:34:41,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27534 to 10384. [2019-12-27 01:34:41,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10384 states. [2019-12-27 01:34:41,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10384 states to 10384 states and 33017 transitions. [2019-12-27 01:34:41,309 INFO L78 Accepts]: Start accepts. Automaton has 10384 states and 33017 transitions. Word has length 64 [2019-12-27 01:34:41,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:34:41,309 INFO L462 AbstractCegarLoop]: Abstraction has 10384 states and 33017 transitions. [2019-12-27 01:34:41,309 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 01:34:41,309 INFO L276 IsEmpty]: Start isEmpty. Operand 10384 states and 33017 transitions. [2019-12-27 01:34:41,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 01:34:41,322 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:34:41,322 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-27 01:34:41,322 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-27 01:34:41,322 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:34:41,322 INFO L82 PathProgramCache]: Analyzing trace with hash -1263766943, now seen corresponding path program 4 times [2019-12-27 01:34:41,323 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:34:41,323 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1143990720] [2019-12-27 01:34:41,323 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:34:41,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:34:41,426 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 01:34:41,426 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1143990720] [2019-12-27 01:34:41,426 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:34:41,426 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 01:34:41,426 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2101533373] [2019-12-27 01:34:41,428 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 01:34:41,429 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:34:41,429 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 01:34:41,429 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-27 01:34:41,429 INFO L87 Difference]: Start difference. First operand 10384 states and 33017 transitions. Second operand 9 states. [2019-12-27 01:34:42,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:34:42,404 INFO L93 Difference]: Finished difference Result 23762 states and 74154 transitions. [2019-12-27 01:34:42,404 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-12-27 01:34:42,404 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 64 [2019-12-27 01:34:42,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:34:42,435 INFO L225 Difference]: With dead ends: 23762 [2019-12-27 01:34:42,435 INFO L226 Difference]: Without dead ends: 22008 [2019-12-27 01:34:42,436 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 154 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=166, Invalid=536, Unknown=0, NotChecked=0, Total=702 [2019-12-27 01:34:42,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22008 states. [2019-12-27 01:34:42,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22008 to 10264. [2019-12-27 01:34:42,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10264 states. [2019-12-27 01:34:42,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10264 states to 10264 states and 32661 transitions. [2019-12-27 01:34:42,680 INFO L78 Accepts]: Start accepts. Automaton has 10264 states and 32661 transitions. Word has length 64 [2019-12-27 01:34:42,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:34:42,680 INFO L462 AbstractCegarLoop]: Abstraction has 10264 states and 32661 transitions. [2019-12-27 01:34:42,681 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 01:34:42,681 INFO L276 IsEmpty]: Start isEmpty. Operand 10264 states and 32661 transitions. [2019-12-27 01:34:42,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 01:34:42,692 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:34:42,693 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-27 01:34:42,693 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-27 01:34:42,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:34:42,693 INFO L82 PathProgramCache]: Analyzing trace with hash -1739892295, now seen corresponding path program 5 times [2019-12-27 01:34:42,693 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:34:42,694 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2014386891] [2019-12-27 01:34:42,694 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:34:42,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:34:42,748 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 01:34:42,748 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2014386891] [2019-12-27 01:34:42,748 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:34:42,748 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 01:34:42,749 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [683281888] [2019-12-27 01:34:42,749 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 01:34:42,749 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:34:42,749 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 01:34:42,749 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 01:34:42,750 INFO L87 Difference]: Start difference. First operand 10264 states and 32661 transitions. Second operand 3 states. [2019-12-27 01:34:42,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:34:42,836 INFO L93 Difference]: Finished difference Result 11837 states and 37523 transitions. [2019-12-27 01:34:42,836 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 01:34:42,837 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 64 [2019-12-27 01:34:42,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:34:42,859 INFO L225 Difference]: With dead ends: 11837 [2019-12-27 01:34:42,859 INFO L226 Difference]: Without dead ends: 11837 [2019-12-27 01:34:42,860 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-27 01:34:42,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11837 states. [2019-12-27 01:34:43,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11837 to 10693. [2019-12-27 01:34:43,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10693 states. [2019-12-27 01:34:43,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10693 states to 10693 states and 34091 transitions. [2019-12-27 01:34:43,169 INFO L78 Accepts]: Start accepts. Automaton has 10693 states and 34091 transitions. Word has length 64 [2019-12-27 01:34:43,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:34:43,170 INFO L462 AbstractCegarLoop]: Abstraction has 10693 states and 34091 transitions. [2019-12-27 01:34:43,170 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 01:34:43,170 INFO L276 IsEmpty]: Start isEmpty. Operand 10693 states and 34091 transitions. [2019-12-27 01:34:43,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 01:34:43,182 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:34:43,182 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-27 01:34:43,182 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-27 01:34:43,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:34:43,182 INFO L82 PathProgramCache]: Analyzing trace with hash -671653730, now seen corresponding path program 1 times [2019-12-27 01:34:43,183 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:34:43,183 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1415384218] [2019-12-27 01:34:43,183 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:34:43,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:34:43,311 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 01:34:43,312 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1415384218] [2019-12-27 01:34:43,312 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:34:43,312 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 01:34:43,312 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [405194267] [2019-12-27 01:34:43,314 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 01:34:43,314 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:34:43,315 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 01:34:43,315 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-27 01:34:43,315 INFO L87 Difference]: Start difference. First operand 10693 states and 34091 transitions. Second operand 9 states. [2019-12-27 01:34:44,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:34:44,445 INFO L93 Difference]: Finished difference Result 25976 states and 80362 transitions. [2019-12-27 01:34:44,445 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-12-27 01:34:44,445 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 65 [2019-12-27 01:34:44,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:34:44,476 INFO L225 Difference]: With dead ends: 25976 [2019-12-27 01:34:44,477 INFO L226 Difference]: Without dead ends: 21905 [2019-12-27 01:34:44,477 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 124 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=141, Invalid=459, Unknown=0, NotChecked=0, Total=600 [2019-12-27 01:34:44,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21905 states. [2019-12-27 01:34:44,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21905 to 10558. [2019-12-27 01:34:44,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10558 states. [2019-12-27 01:34:44,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10558 states to 10558 states and 33265 transitions. [2019-12-27 01:34:44,718 INFO L78 Accepts]: Start accepts. Automaton has 10558 states and 33265 transitions. Word has length 65 [2019-12-27 01:34:44,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:34:44,718 INFO L462 AbstractCegarLoop]: Abstraction has 10558 states and 33265 transitions. [2019-12-27 01:34:44,718 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 01:34:44,719 INFO L276 IsEmpty]: Start isEmpty. Operand 10558 states and 33265 transitions. [2019-12-27 01:34:44,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 01:34:44,730 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:34:44,730 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-27 01:34:44,730 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-27 01:34:44,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:34:44,731 INFO L82 PathProgramCache]: Analyzing trace with hash 1962638562, now seen corresponding path program 2 times [2019-12-27 01:34:44,731 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:34:44,731 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [134842369] [2019-12-27 01:34:44,731 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:34:44,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:34:44,843 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 01:34:44,844 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [134842369] [2019-12-27 01:34:44,844 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:34:44,844 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 01:34:44,844 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [632365617] [2019-12-27 01:34:44,845 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 01:34:44,845 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:34:44,845 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 01:34:44,845 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-27 01:34:44,845 INFO L87 Difference]: Start difference. First operand 10558 states and 33265 transitions. Second operand 9 states. [2019-12-27 01:34:45,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:34:45,659 INFO L93 Difference]: Finished difference Result 21151 states and 64928 transitions. [2019-12-27 01:34:45,660 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-27 01:34:45,660 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 65 [2019-12-27 01:34:45,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:34:45,688 INFO L225 Difference]: With dead ends: 21151 [2019-12-27 01:34:45,688 INFO L226 Difference]: Without dead ends: 19285 [2019-12-27 01:34:45,688 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 114 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=129, Invalid=423, Unknown=0, NotChecked=0, Total=552 [2019-12-27 01:34:45,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19285 states. [2019-12-27 01:34:45,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19285 to 10198. [2019-12-27 01:34:45,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10198 states. [2019-12-27 01:34:45,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10198 states to 10198 states and 32203 transitions. [2019-12-27 01:34:45,904 INFO L78 Accepts]: Start accepts. Automaton has 10198 states and 32203 transitions. Word has length 65 [2019-12-27 01:34:45,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:34:45,904 INFO L462 AbstractCegarLoop]: Abstraction has 10198 states and 32203 transitions. [2019-12-27 01:34:45,904 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 01:34:45,904 INFO L276 IsEmpty]: Start isEmpty. Operand 10198 states and 32203 transitions. [2019-12-27 01:34:45,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 01:34:45,915 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:34:45,915 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-27 01:34:45,916 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-27 01:34:45,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:34:45,916 INFO L82 PathProgramCache]: Analyzing trace with hash -151344766, now seen corresponding path program 3 times [2019-12-27 01:34:45,916 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:34:45,916 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [645485847] [2019-12-27 01:34:45,916 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:34:45,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:34:45,983 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 01:34:45,984 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [645485847] [2019-12-27 01:34:45,984 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:34:45,984 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 01:34:45,984 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2073412013] [2019-12-27 01:34:45,984 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 01:34:45,985 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:34:45,985 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 01:34:45,985 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 01:34:45,985 INFO L87 Difference]: Start difference. First operand 10198 states and 32203 transitions. Second operand 4 states. [2019-12-27 01:34:46,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:34:46,100 INFO L93 Difference]: Finished difference Result 10055 states and 31631 transitions. [2019-12-27 01:34:46,100 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 01:34:46,100 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 65 [2019-12-27 01:34:46,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:34:46,119 INFO L225 Difference]: With dead ends: 10055 [2019-12-27 01:34:46,120 INFO L226 Difference]: Without dead ends: 10055 [2019-12-27 01:34:46,120 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-27 01:34:46,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10055 states. [2019-12-27 01:34:46,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10055 to 9626. [2019-12-27 01:34:46,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9626 states. [2019-12-27 01:34:46,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9626 states to 9626 states and 30201 transitions. [2019-12-27 01:34:46,356 INFO L78 Accepts]: Start accepts. Automaton has 9626 states and 30201 transitions. Word has length 65 [2019-12-27 01:34:46,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:34:46,359 INFO L462 AbstractCegarLoop]: Abstraction has 9626 states and 30201 transitions. [2019-12-27 01:34:46,359 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 01:34:46,359 INFO L276 IsEmpty]: Start isEmpty. Operand 9626 states and 30201 transitions. [2019-12-27 01:34:46,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 01:34:46,374 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:34:46,375 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-27 01:34:46,375 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-27 01:34:46,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:34:46,375 INFO L82 PathProgramCache]: Analyzing trace with hash -547409899, now seen corresponding path program 1 times [2019-12-27 01:34:46,375 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:34:46,375 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1109641941] [2019-12-27 01:34:46,376 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:34:46,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:34:46,587 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 01:34:46,588 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1109641941] [2019-12-27 01:34:46,588 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:34:46,588 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 01:34:46,588 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [398241958] [2019-12-27 01:34:46,588 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 01:34:46,589 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:34:46,589 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 01:34:46,589 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-12-27 01:34:46,589 INFO L87 Difference]: Start difference. First operand 9626 states and 30201 transitions. Second operand 9 states. [2019-12-27 01:34:49,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:34:49,242 INFO L93 Difference]: Finished difference Result 26641 states and 79803 transitions. [2019-12-27 01:34:49,242 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-27 01:34:49,242 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 65 [2019-12-27 01:34:49,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:34:49,290 INFO L225 Difference]: With dead ends: 26641 [2019-12-27 01:34:49,290 INFO L226 Difference]: Without dead ends: 26401 [2019-12-27 01:34:49,292 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 7 SyntacticMatches, 3 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 114 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=117, Invalid=435, Unknown=0, NotChecked=0, Total=552 [2019-12-27 01:34:49,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26401 states. [2019-12-27 01:34:49,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26401 to 15099. [2019-12-27 01:34:49,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15099 states. [2019-12-27 01:34:49,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15099 states to 15099 states and 45910 transitions. [2019-12-27 01:34:49,613 INFO L78 Accepts]: Start accepts. Automaton has 15099 states and 45910 transitions. Word has length 65 [2019-12-27 01:34:49,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:34:49,613 INFO L462 AbstractCegarLoop]: Abstraction has 15099 states and 45910 transitions. [2019-12-27 01:34:49,614 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 01:34:49,614 INFO L276 IsEmpty]: Start isEmpty. Operand 15099 states and 45910 transitions. [2019-12-27 01:34:49,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 01:34:49,630 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:34:49,630 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 01:34:49,630 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-27 01:34:49,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:34:49,630 INFO L82 PathProgramCache]: Analyzing trace with hash -236370469, now seen corresponding path program 2 times [2019-12-27 01:34:49,630 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:34:49,630 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1423818549] [2019-12-27 01:34:49,631 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:34:49,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:34:49,707 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 01:34:49,707 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1423818549] [2019-12-27 01:34:49,709 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:34:49,710 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 01:34:49,710 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [818542348] [2019-12-27 01:34:49,710 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 01:34:49,710 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:34:49,711 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 01:34:49,711 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 01:34:49,711 INFO L87 Difference]: Start difference. First operand 15099 states and 45910 transitions. Second operand 3 states. [2019-12-27 01:34:49,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:34:49,780 INFO L93 Difference]: Finished difference Result 15098 states and 45908 transitions. [2019-12-27 01:34:49,780 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 01:34:49,780 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-27 01:34:49,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:34:49,809 INFO L225 Difference]: With dead ends: 15098 [2019-12-27 01:34:49,809 INFO L226 Difference]: Without dead ends: 15098 [2019-12-27 01:34:49,811 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 01:34:49,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15098 states. [2019-12-27 01:34:50,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15098 to 13111. [2019-12-27 01:34:50,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13111 states. [2019-12-27 01:34:50,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13111 states to 13111 states and 40413 transitions. [2019-12-27 01:34:50,224 INFO L78 Accepts]: Start accepts. Automaton has 13111 states and 40413 transitions. Word has length 65 [2019-12-27 01:34:50,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:34:50,224 INFO L462 AbstractCegarLoop]: Abstraction has 13111 states and 40413 transitions. [2019-12-27 01:34:50,225 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 01:34:50,225 INFO L276 IsEmpty]: Start isEmpty. Operand 13111 states and 40413 transitions. [2019-12-27 01:34:50,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 01:34:50,252 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:34:50,252 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-27 01:34:50,253 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-27 01:34:50,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:34:50,253 INFO L82 PathProgramCache]: Analyzing trace with hash 889984155, now seen corresponding path program 1 times [2019-12-27 01:34:50,253 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:34:50,253 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2066980220] [2019-12-27 01:34:50,254 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:34:50,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:34:50,350 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 01:34:50,350 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2066980220] [2019-12-27 01:34:50,350 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:34:50,350 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 01:34:50,350 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [250208459] [2019-12-27 01:34:50,351 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 01:34:50,351 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:34:50,351 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 01:34:50,351 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 01:34:50,351 INFO L87 Difference]: Start difference. First operand 13111 states and 40413 transitions. Second operand 3 states. [2019-12-27 01:34:50,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:34:50,403 INFO L93 Difference]: Finished difference Result 11184 states and 33816 transitions. [2019-12-27 01:34:50,403 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 01:34:50,404 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-12-27 01:34:50,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:34:50,423 INFO L225 Difference]: With dead ends: 11184 [2019-12-27 01:34:50,423 INFO L226 Difference]: Without dead ends: 11184 [2019-12-27 01:34:50,423 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 01:34:50,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11184 states. [2019-12-27 01:34:50,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11184 to 10986. [2019-12-27 01:34:50,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10986 states. [2019-12-27 01:34:50,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10986 states to 10986 states and 33244 transitions. [2019-12-27 01:34:50,602 INFO L78 Accepts]: Start accepts. Automaton has 10986 states and 33244 transitions. Word has length 66 [2019-12-27 01:34:50,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:34:50,602 INFO L462 AbstractCegarLoop]: Abstraction has 10986 states and 33244 transitions. [2019-12-27 01:34:50,603 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 01:34:50,603 INFO L276 IsEmpty]: Start isEmpty. Operand 10986 states and 33244 transitions. [2019-12-27 01:34:50,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 01:34:50,613 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:34:50,613 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-27 01:34:50,613 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-27 01:34:50,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:34:50,613 INFO L82 PathProgramCache]: Analyzing trace with hash 2078724657, now seen corresponding path program 1 times [2019-12-27 01:34:50,614 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:34:50,614 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1978582279] [2019-12-27 01:34:50,614 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:34:50,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:34:50,750 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 01:34:50,751 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1978582279] [2019-12-27 01:34:50,751 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:34:50,751 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 01:34:50,751 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1912065544] [2019-12-27 01:34:50,752 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 01:34:50,752 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:34:50,752 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 01:34:50,752 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-12-27 01:34:50,752 INFO L87 Difference]: Start difference. First operand 10986 states and 33244 transitions. Second operand 9 states. [2019-12-27 01:34:51,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:34:51,825 INFO L93 Difference]: Finished difference Result 20793 states and 62007 transitions. [2019-12-27 01:34:51,825 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-27 01:34:51,825 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 67 [2019-12-27 01:34:51,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:34:51,846 INFO L225 Difference]: With dead ends: 20793 [2019-12-27 01:34:51,846 INFO L226 Difference]: Without dead ends: 15088 [2019-12-27 01:34:51,847 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=213, Unknown=0, NotChecked=0, Total=272 [2019-12-27 01:34:51,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15088 states. [2019-12-27 01:34:52,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15088 to 11693. [2019-12-27 01:34:52,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11693 states. [2019-12-27 01:34:52,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11693 states to 11693 states and 35021 transitions. [2019-12-27 01:34:52,046 INFO L78 Accepts]: Start accepts. Automaton has 11693 states and 35021 transitions. Word has length 67 [2019-12-27 01:34:52,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:34:52,047 INFO L462 AbstractCegarLoop]: Abstraction has 11693 states and 35021 transitions. [2019-12-27 01:34:52,047 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 01:34:52,047 INFO L276 IsEmpty]: Start isEmpty. Operand 11693 states and 35021 transitions. [2019-12-27 01:34:52,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 01:34:52,059 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:34:52,059 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 01:34:52,060 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-27 01:34:52,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:34:52,060 INFO L82 PathProgramCache]: Analyzing trace with hash 721495091, now seen corresponding path program 2 times [2019-12-27 01:34:52,060 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:34:52,060 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [812434997] [2019-12-27 01:34:52,060 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:34:52,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:34:52,436 WARN L192 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 18 DAG size of output: 12 [2019-12-27 01:34:53,032 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 01:34:53,032 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [812434997] [2019-12-27 01:34:53,032 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:34:53,032 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-12-27 01:34:53,033 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [673644545] [2019-12-27 01:34:53,033 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-12-27 01:34:53,033 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:34:53,033 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-12-27 01:34:53,033 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=261, Unknown=0, NotChecked=0, Total=306 [2019-12-27 01:34:53,034 INFO L87 Difference]: Start difference. First operand 11693 states and 35021 transitions. Second operand 18 states. [2019-12-27 01:34:56,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:34:56,894 INFO L93 Difference]: Finished difference Result 13908 states and 40927 transitions. [2019-12-27 01:34:56,895 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2019-12-27 01:34:56,895 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 67 [2019-12-27 01:34:56,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:34:56,913 INFO L225 Difference]: With dead ends: 13908 [2019-12-27 01:34:56,913 INFO L226 Difference]: Without dead ends: 13297 [2019-12-27 01:34:56,914 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 739 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=376, Invalid=2594, Unknown=0, NotChecked=0, Total=2970 [2019-12-27 01:34:56,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13297 states. [2019-12-27 01:34:57,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13297 to 10779. [2019-12-27 01:34:57,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10779 states. [2019-12-27 01:34:57,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10779 states to 10779 states and 31931 transitions. [2019-12-27 01:34:57,092 INFO L78 Accepts]: Start accepts. Automaton has 10779 states and 31931 transitions. Word has length 67 [2019-12-27 01:34:57,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:34:57,092 INFO L462 AbstractCegarLoop]: Abstraction has 10779 states and 31931 transitions. [2019-12-27 01:34:57,092 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-12-27 01:34:57,093 INFO L276 IsEmpty]: Start isEmpty. Operand 10779 states and 31931 transitions. [2019-12-27 01:34:57,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 01:34:57,104 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:34:57,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 01:34:57,104 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-27 01:34:57,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:34:57,105 INFO L82 PathProgramCache]: Analyzing trace with hash 957967249, now seen corresponding path program 3 times [2019-12-27 01:34:57,105 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:34:57,105 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1302676251] [2019-12-27 01:34:57,105 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:34:57,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:34:57,264 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 01:34:57,265 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1302676251] [2019-12-27 01:34:57,265 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:34:57,265 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 01:34:57,265 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [232328095] [2019-12-27 01:34:57,266 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-27 01:34:57,266 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:34:57,266 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-27 01:34:57,266 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-12-27 01:34:57,266 INFO L87 Difference]: Start difference. First operand 10779 states and 31931 transitions. Second operand 10 states. [2019-12-27 01:34:57,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:34:57,922 INFO L93 Difference]: Finished difference Result 16404 states and 47749 transitions. [2019-12-27 01:34:57,922 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-27 01:34:57,922 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 67 [2019-12-27 01:34:57,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:34:57,941 INFO L225 Difference]: With dead ends: 16404 [2019-12-27 01:34:57,941 INFO L226 Difference]: Without dead ends: 12873 [2019-12-27 01:34:57,941 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 111 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=120, Invalid=480, Unknown=0, NotChecked=0, Total=600 [2019-12-27 01:34:57,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12873 states. [2019-12-27 01:34:58,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12873 to 10015. [2019-12-27 01:34:58,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10015 states. [2019-12-27 01:34:58,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10015 states to 10015 states and 29707 transitions. [2019-12-27 01:34:58,113 INFO L78 Accepts]: Start accepts. Automaton has 10015 states and 29707 transitions. Word has length 67 [2019-12-27 01:34:58,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:34:58,114 INFO L462 AbstractCegarLoop]: Abstraction has 10015 states and 29707 transitions. [2019-12-27 01:34:58,114 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-27 01:34:58,114 INFO L276 IsEmpty]: Start isEmpty. Operand 10015 states and 29707 transitions. [2019-12-27 01:34:58,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 01:34:58,125 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:34:58,125 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-27 01:34:58,125 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-27 01:34:58,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:34:58,125 INFO L82 PathProgramCache]: Analyzing trace with hash 88464887, now seen corresponding path program 4 times [2019-12-27 01:34:58,125 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:34:58,125 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [628652146] [2019-12-27 01:34:58,126 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:34:58,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:34:58,842 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 01:34:58,843 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [628652146] [2019-12-27 01:34:58,843 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:34:58,843 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-12-27 01:34:58,844 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [158072977] [2019-12-27 01:34:58,844 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-12-27 01:34:58,844 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:34:58,845 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-12-27 01:34:58,845 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=261, Unknown=0, NotChecked=0, Total=306 [2019-12-27 01:34:58,845 INFO L87 Difference]: Start difference. First operand 10015 states and 29707 transitions. Second operand 18 states. [2019-12-27 01:35:01,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:35:01,897 INFO L93 Difference]: Finished difference Result 15325 states and 45462 transitions. [2019-12-27 01:35:01,898 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-12-27 01:35:01,898 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 67 [2019-12-27 01:35:01,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:35:01,918 INFO L225 Difference]: With dead ends: 15325 [2019-12-27 01:35:01,918 INFO L226 Difference]: Without dead ends: 14114 [2019-12-27 01:35:01,919 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 463 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=298, Invalid=1958, Unknown=0, NotChecked=0, Total=2256 [2019-12-27 01:35:01,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14114 states. [2019-12-27 01:35:02,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14114 to 11557. [2019-12-27 01:35:02,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11557 states. [2019-12-27 01:35:02,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11557 states to 11557 states and 34448 transitions. [2019-12-27 01:35:02,105 INFO L78 Accepts]: Start accepts. Automaton has 11557 states and 34448 transitions. Word has length 67 [2019-12-27 01:35:02,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:35:02,106 INFO L462 AbstractCegarLoop]: Abstraction has 11557 states and 34448 transitions. [2019-12-27 01:35:02,106 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-12-27 01:35:02,106 INFO L276 IsEmpty]: Start isEmpty. Operand 11557 states and 34448 transitions. [2019-12-27 01:35:02,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 01:35:02,118 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:35:02,118 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 01:35:02,118 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-27 01:35:02,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:35:02,118 INFO L82 PathProgramCache]: Analyzing trace with hash 324937045, now seen corresponding path program 5 times [2019-12-27 01:35:02,118 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:35:02,119 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [84185907] [2019-12-27 01:35:02,119 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:35:02,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:35:02,276 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 01:35:02,277 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [84185907] [2019-12-27 01:35:02,277 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:35:02,277 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 01:35:02,277 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1459784147] [2019-12-27 01:35:02,278 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 01:35:02,278 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:35:02,278 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 01:35:02,278 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-27 01:35:02,278 INFO L87 Difference]: Start difference. First operand 11557 states and 34448 transitions. Second operand 11 states. [2019-12-27 01:35:03,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:35:03,000 INFO L93 Difference]: Finished difference Result 18170 states and 53431 transitions. [2019-12-27 01:35:03,000 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-12-27 01:35:03,000 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 67 [2019-12-27 01:35:03,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:35:03,019 INFO L225 Difference]: With dead ends: 18170 [2019-12-27 01:35:03,019 INFO L226 Difference]: Without dead ends: 12398 [2019-12-27 01:35:03,019 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 144 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=142, Invalid=614, Unknown=0, NotChecked=0, Total=756 [2019-12-27 01:35:03,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12398 states. [2019-12-27 01:35:03,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12398 to 10105. [2019-12-27 01:35:03,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10105 states. [2019-12-27 01:35:03,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10105 states to 10105 states and 29796 transitions. [2019-12-27 01:35:03,179 INFO L78 Accepts]: Start accepts. Automaton has 10105 states and 29796 transitions. Word has length 67 [2019-12-27 01:35:03,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:35:03,180 INFO L462 AbstractCegarLoop]: Abstraction has 10105 states and 29796 transitions. [2019-12-27 01:35:03,180 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 01:35:03,180 INFO L276 IsEmpty]: Start isEmpty. Operand 10105 states and 29796 transitions. [2019-12-27 01:35:03,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 01:35:03,192 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:35:03,192 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-27 01:35:03,192 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-27 01:35:03,193 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:35:03,193 INFO L82 PathProgramCache]: Analyzing trace with hash 975038819, now seen corresponding path program 6 times [2019-12-27 01:35:03,193 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:35:03,193 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1979912253] [2019-12-27 01:35:03,193 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:35:03,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:35:03,341 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 01:35:03,341 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1979912253] [2019-12-27 01:35:03,341 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:35:03,342 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 01:35:03,342 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [394830770] [2019-12-27 01:35:03,343 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-27 01:35:03,343 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:35:03,343 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-27 01:35:03,343 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2019-12-27 01:35:03,343 INFO L87 Difference]: Start difference. First operand 10105 states and 29796 transitions. Second operand 10 states. [2019-12-27 01:35:04,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:35:04,477 INFO L93 Difference]: Finished difference Result 12951 states and 37171 transitions. [2019-12-27 01:35:04,477 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-27 01:35:04,477 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 67 [2019-12-27 01:35:04,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:35:04,501 INFO L225 Difference]: With dead ends: 12951 [2019-12-27 01:35:04,501 INFO L226 Difference]: Without dead ends: 12076 [2019-12-27 01:35:04,503 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=67, Invalid=275, Unknown=0, NotChecked=0, Total=342 [2019-12-27 01:35:04,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12076 states. [2019-12-27 01:35:04,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12076 to 9705. [2019-12-27 01:35:04,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9705 states. [2019-12-27 01:35:04,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9705 states to 9705 states and 28685 transitions. [2019-12-27 01:35:04,680 INFO L78 Accepts]: Start accepts. Automaton has 9705 states and 28685 transitions. Word has length 67 [2019-12-27 01:35:04,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:35:04,680 INFO L462 AbstractCegarLoop]: Abstraction has 9705 states and 28685 transitions. [2019-12-27 01:35:04,680 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-27 01:35:04,680 INFO L276 IsEmpty]: Start isEmpty. Operand 9705 states and 28685 transitions. [2019-12-27 01:35:04,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 01:35:04,692 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:35:04,693 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-27 01:35:04,693 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-27 01:35:04,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:35:04,693 INFO L82 PathProgramCache]: Analyzing trace with hash -478785703, now seen corresponding path program 7 times [2019-12-27 01:35:04,693 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:35:04,693 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1722495301] [2019-12-27 01:35:04,693 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:35:04,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:35:04,817 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 01:35:04,818 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1722495301] [2019-12-27 01:35:04,818 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:35:04,818 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 01:35:04,818 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [167246737] [2019-12-27 01:35:04,819 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-27 01:35:04,820 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:35:04,820 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-27 01:35:04,820 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2019-12-27 01:35:04,820 INFO L87 Difference]: Start difference. First operand 9705 states and 28685 transitions. Second operand 10 states. [2019-12-27 01:35:05,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:35:05,723 INFO L93 Difference]: Finished difference Result 12496 states and 36166 transitions. [2019-12-27 01:35:05,723 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-27 01:35:05,724 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 67 [2019-12-27 01:35:05,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:35:05,740 INFO L225 Difference]: With dead ends: 12496 [2019-12-27 01:35:05,741 INFO L226 Difference]: Without dead ends: 12125 [2019-12-27 01:35:05,741 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=73, Invalid=307, Unknown=0, NotChecked=0, Total=380 [2019-12-27 01:35:05,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12125 states. [2019-12-27 01:35:05,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12125 to 9697. [2019-12-27 01:35:05,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9697 states. [2019-12-27 01:35:05,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9697 states to 9697 states and 28659 transitions. [2019-12-27 01:35:05,922 INFO L78 Accepts]: Start accepts. Automaton has 9697 states and 28659 transitions. Word has length 67 [2019-12-27 01:35:05,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:35:05,922 INFO L462 AbstractCegarLoop]: Abstraction has 9697 states and 28659 transitions. [2019-12-27 01:35:05,922 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-27 01:35:05,922 INFO L276 IsEmpty]: Start isEmpty. Operand 9697 states and 28659 transitions. [2019-12-27 01:35:05,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 01:35:05,932 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:35:05,932 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-27 01:35:05,933 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-27 01:35:05,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:35:05,933 INFO L82 PathProgramCache]: Analyzing trace with hash -1516551711, now seen corresponding path program 8 times [2019-12-27 01:35:05,933 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:35:05,933 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [507862788] [2019-12-27 01:35:05,933 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:35:05,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:35:06,103 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 01:35:06,104 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [507862788] [2019-12-27 01:35:06,104 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:35:06,105 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-27 01:35:06,105 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [925091656] [2019-12-27 01:35:06,105 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-27 01:35:06,106 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:35:06,106 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-27 01:35:06,106 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2019-12-27 01:35:06,106 INFO L87 Difference]: Start difference. First operand 9697 states and 28659 transitions. Second operand 12 states. [2019-12-27 01:35:06,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:35:06,875 INFO L93 Difference]: Finished difference Result 11841 states and 34458 transitions. [2019-12-27 01:35:06,875 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-27 01:35:06,875 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 67 [2019-12-27 01:35:06,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:35:06,891 INFO L225 Difference]: With dead ends: 11841 [2019-12-27 01:35:06,891 INFO L226 Difference]: Without dead ends: 11428 [2019-12-27 01:35:06,891 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=133, Invalid=569, Unknown=0, NotChecked=0, Total=702 [2019-12-27 01:35:06,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11428 states. [2019-12-27 01:35:07,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11428 to 9443. [2019-12-27 01:35:07,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9443 states. [2019-12-27 01:35:07,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9443 states to 9443 states and 28015 transitions. [2019-12-27 01:35:07,044 INFO L78 Accepts]: Start accepts. Automaton has 9443 states and 28015 transitions. Word has length 67 [2019-12-27 01:35:07,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:35:07,044 INFO L462 AbstractCegarLoop]: Abstraction has 9443 states and 28015 transitions. [2019-12-27 01:35:07,044 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-27 01:35:07,044 INFO L276 IsEmpty]: Start isEmpty. Operand 9443 states and 28015 transitions. [2019-12-27 01:35:07,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 01:35:07,055 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:35:07,055 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-27 01:35:07,055 INFO L410 AbstractCegarLoop]: === Iteration 40 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:35:07,055 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:35:07,055 INFO L82 PathProgramCache]: Analyzing trace with hash -494782975, now seen corresponding path program 9 times [2019-12-27 01:35:07,055 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:35:07,055 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [910227739] [2019-12-27 01:35:07,056 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:35:07,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 01:35:07,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 01:35:07,167 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 01:35:07,168 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 01:35:07,172 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [904] [904] ULTIMATE.startENTRY-->L837: Formula: (let ((.cse0 (store |v_#valid_64| 0 0))) (and (= 0 v_~weak$$choice0~0_10) (= v_~a$r_buff1_thd0~0_132 0) (= 0 v_~a$w_buff0_used~0_689) (= |v_ULTIMATE.start_main_~#t397~0.offset_22| 0) (= 0 v_~a$w_buff1_used~0_376) (= v_~a$r_buff0_thd3~0_328 0) (= |v_#NULL.offset_6| 0) (= v_~y~0_79 0) (= 0 v_~a$r_buff1_thd1~0_125) (= 0 v_~__unbuffered_p0_EAX~0_92) (= 0 v_~__unbuffered_p1_EAX~0_37) (= v_~x~0_69 0) (= 0 v_~a$r_buff1_thd2~0_129) (< 0 |v_#StackHeapBarrier_17|) (= v_~__unbuffered_p0_EBX~0_92 0) (= v_~a$flush_delayed~0_23 0) (= v_~a$r_buff1_thd3~0_224 0) (= v_~__unbuffered_p2_EBX~0_38 0) (= 0 v_~__unbuffered_cnt~0_98) (= v_~main$tmp_guard0~0_28 0) (= 0 v_~a$r_buff0_thd2~0_124) (= v_~a~0_181 0) (< |v_#StackHeapBarrier_17| |v_ULTIMATE.start_main_~#t397~0.base_29|) (= 0 |v_#NULL.base_6|) (= (select .cse0 |v_ULTIMATE.start_main_~#t397~0.base_29|) 0) (= 0 v_~__unbuffered_p2_EAX~0_33) (= |v_#valid_62| (store .cse0 |v_ULTIMATE.start_main_~#t397~0.base_29| 1)) (= 0 v_~a$r_buff0_thd1~0_195) (= v_~a$mem_tmp~0_12 0) (= v_~main$tmp_guard1~0_36 0) (= 0 v_~a$w_buff1~0_172) (= v_~a$r_buff0_thd0~0_144 0) (= v_~a$w_buff0~0_228 0) (= (store |v_#memory_int_22| |v_ULTIMATE.start_main_~#t397~0.base_29| (store (select |v_#memory_int_22| |v_ULTIMATE.start_main_~#t397~0.base_29|) |v_ULTIMATE.start_main_~#t397~0.offset_22| 0)) |v_#memory_int_21|) (= v_~weak$$choice2~0_107 0) (= v_~z~0_20 0) (= |v_#length_23| (store |v_#length_24| |v_ULTIMATE.start_main_~#t397~0.base_29| 4)) (= 0 v_~a$read_delayed~0_6) (= v_~a$read_delayed_var~0.offset_6 0) (= 0 v_~a$read_delayed_var~0.base_6))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_17|, #valid=|v_#valid_64|, #memory_int=|v_#memory_int_22|, #length=|v_#length_24|} OutVars{~a$r_buff1_thd2~0=v_~a$r_buff1_thd2~0_129, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_51|, #NULL.offset=|v_#NULL.offset_6|, ULTIMATE.start_main_#t~ite49=|v_ULTIMATE.start_main_#t~ite49_281|, ~a$r_buff0_thd0~0=v_~a$r_buff0_thd0~0_144, ULTIMATE.start_main_#t~ite50=|v_ULTIMATE.start_main_#t~ite50_31|, ~a~0=v_~a~0_181, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_67|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_92, ULTIMATE.start_main_~#t398~0.base=|v_ULTIMATE.start_main_~#t398~0.base_29|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_37, #length=|v_#length_23|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_33, ULTIMATE.start_main_~#t397~0.offset=|v_ULTIMATE.start_main_~#t397~0.offset_22|, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_38, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_92, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_10|, ~a$r_buff1_thd3~0=v_~a$r_buff1_thd3~0_224, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_689, ~a$r_buff0_thd1~0=v_~a$r_buff0_thd1~0_195, ~weak$$choice0~0=v_~weak$$choice0~0_10, #StackHeapBarrier=|v_#StackHeapBarrier_17|, ~a$read_delayed_var~0.offset=v_~a$read_delayed_var~0.offset_6, ~a$w_buff0~0=v_~a$w_buff0~0_228, ~a$r_buff1_thd0~0=v_~a$r_buff1_thd0~0_132, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_98, ~x~0=v_~x~0_69, ~a$read_delayed~0=v_~a$read_delayed~0_6, ~a$r_buff0_thd2~0=v_~a$r_buff0_thd2~0_124, ULTIMATE.start_main_~#t397~0.base=|v_ULTIMATE.start_main_~#t397~0.base_29|, ULTIMATE.start_main_~#t398~0.offset=|v_ULTIMATE.start_main_~#t398~0.offset_22|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_36, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_55|, ~a$mem_tmp~0=v_~a$mem_tmp~0_12, ULTIMATE.start_main_#t~ite51=|v_ULTIMATE.start_main_#t~ite51_45|, ~a$w_buff1~0=v_~a$w_buff1~0_172, ~y~0=v_~y~0_79, ULTIMATE.start_main_~#t399~0.base=|v_ULTIMATE.start_main_~#t399~0.base_17|, ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_27|, ULTIMATE.start_main_~#t399~0.offset=|v_ULTIMATE.start_main_~#t399~0.offset_15|, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_9|, ~a$r_buff1_thd1~0=v_~a$r_buff1_thd1~0_125, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_328, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_28, #NULL.base=|v_#NULL.base_6|, ~a$flush_delayed~0=v_~a$flush_delayed~0_23, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_20|, #valid=|v_#valid_62|, #memory_int=|v_#memory_int_21|, ~z~0=v_~z~0_20, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_376, ~weak$$choice2~0=v_~weak$$choice2~0_107, ~a$read_delayed_var~0.base=v_~a$read_delayed_var~0.base_6} 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, ULTIMATE.start_main_~#t398~0.base, ~__unbuffered_p1_EAX~0, #length, ~__unbuffered_p2_EAX~0, ULTIMATE.start_main_~#t397~0.offset, ~__unbuffered_p2_EBX~0, ~__unbuffered_p0_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, ~a$w_buff0~0, ~a$r_buff1_thd0~0, ~__unbuffered_cnt~0, ~x~0, ~a$read_delayed~0, ~a$r_buff0_thd2~0, ULTIMATE.start_main_~#t397~0.base, ULTIMATE.start_main_~#t398~0.offset, ~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_~#t399~0.base, ULTIMATE.start_main_#t~nondet46, ULTIMATE.start_main_~#t399~0.offset, ULTIMATE.start_main_#t~nondet44, ~a$r_buff1_thd1~0, ~a$r_buff0_thd3~0, ~main$tmp_guard0~0, #NULL.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-27 01:35:07,173 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [865] [865] L837-1-->L839: Formula: (and (= (store |v_#valid_35| |v_ULTIMATE.start_main_~#t398~0.base_12| 1) |v_#valid_34|) (not (= |v_ULTIMATE.start_main_~#t398~0.base_12| 0)) (= |v_ULTIMATE.start_main_~#t398~0.offset_10| 0) (< |v_#StackHeapBarrier_9| |v_ULTIMATE.start_main_~#t398~0.base_12|) (= |v_#length_13| (store |v_#length_14| |v_ULTIMATE.start_main_~#t398~0.base_12| 4)) (= 0 (select |v_#valid_35| |v_ULTIMATE.start_main_~#t398~0.base_12|)) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t398~0.base_12| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t398~0.base_12|) |v_ULTIMATE.start_main_~#t398~0.offset_10| 1)) |v_#memory_int_11|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_35|, #memory_int=|v_#memory_int_12|, #length=|v_#length_14|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_9|, ULTIMATE.start_main_~#t398~0.base=|v_ULTIMATE.start_main_~#t398~0.base_12|, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_4|, #valid=|v_#valid_34|, #memory_int=|v_#memory_int_11|, ULTIMATE.start_main_~#t398~0.offset=|v_ULTIMATE.start_main_~#t398~0.offset_10|, #length=|v_#length_13|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t398~0.base, ULTIMATE.start_main_#t~nondet44, #valid, #memory_int, ULTIMATE.start_main_~#t398~0.offset, #length] because there is no mapped edge [2019-12-27 01:35:07,174 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [876] [876] L839-1-->L841: Formula: (and (= 0 (select |v_#valid_37| |v_ULTIMATE.start_main_~#t399~0.base_13|)) (not (= 0 |v_ULTIMATE.start_main_~#t399~0.base_13|)) (= |v_ULTIMATE.start_main_~#t399~0.offset_11| 0) (< |v_#StackHeapBarrier_10| |v_ULTIMATE.start_main_~#t399~0.base_13|) (= |v_#memory_int_13| (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t399~0.base_13| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t399~0.base_13|) |v_ULTIMATE.start_main_~#t399~0.offset_11| 2))) (= (store |v_#length_16| |v_ULTIMATE.start_main_~#t399~0.base_13| 4) |v_#length_15|) (= |v_#valid_36| (store |v_#valid_37| |v_ULTIMATE.start_main_~#t399~0.base_13| 1))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_37|, #memory_int=|v_#memory_int_14|, #length=|v_#length_16|} OutVars{ULTIMATE.start_main_~#t399~0.base=|v_ULTIMATE.start_main_~#t399~0.base_13|, #StackHeapBarrier=|v_#StackHeapBarrier_10|, ULTIMATE.start_main_~#t399~0.offset=|v_ULTIMATE.start_main_~#t399~0.offset_11|, #valid=|v_#valid_36|, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_6|, #memory_int=|v_#memory_int_13|, #length=|v_#length_15|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t399~0.base, ULTIMATE.start_main_~#t399~0.offset, #valid, ULTIMATE.start_main_#t~nondet45, #memory_int, #length] because there is no mapped edge [2019-12-27 01:35:07,176 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [881] [881] L4-->L758: Formula: (and (= ~a$r_buff1_thd3~0_Out142638581 ~a$r_buff0_thd3~0_In142638581) (not (= 0 P0Thread1of1ForFork1___VERIFIER_assert_~expression_In142638581)) (= 1 ~a$r_buff0_thd1~0_Out142638581) (= ~__unbuffered_p0_EAX~0_Out142638581 ~x~0_Out142638581) (= ~a$r_buff1_thd0~0_Out142638581 ~a$r_buff0_thd0~0_In142638581) (= ~x~0_Out142638581 1) (= ~y~0_In142638581 ~__unbuffered_p0_EBX~0_Out142638581) (= ~a$r_buff0_thd2~0_In142638581 ~a$r_buff1_thd2~0_Out142638581) (= ~a$r_buff0_thd1~0_In142638581 ~a$r_buff1_thd1~0_Out142638581)) InVars {~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In142638581, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In142638581, P0Thread1of1ForFork1___VERIFIER_assert_~expression=P0Thread1of1ForFork1___VERIFIER_assert_~expression_In142638581, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In142638581, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In142638581, ~y~0=~y~0_In142638581} OutVars{~__unbuffered_p0_EBX~0=~__unbuffered_p0_EBX~0_Out142638581, ~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_Out142638581, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_Out142638581, ~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_Out142638581, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In142638581, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In142638581, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_Out142638581, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In142638581, ~__unbuffered_p0_EAX~0=~__unbuffered_p0_EAX~0_Out142638581, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_Out142638581, P0Thread1of1ForFork1___VERIFIER_assert_~expression=P0Thread1of1ForFork1___VERIFIER_assert_~expression_In142638581, ~y~0=~y~0_In142638581, ~x~0=~x~0_Out142638581} AuxVars[] AssignedVars[~__unbuffered_p0_EAX~0, ~__unbuffered_p0_EBX~0, ~a$r_buff1_thd1~0, ~a$r_buff1_thd3~0, ~a$r_buff1_thd2~0, ~a$r_buff1_thd0~0, ~a$r_buff0_thd1~0, ~x~0] because there is no mapped edge [2019-12-27 01:35:07,182 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [842] [842] L759-->L759-2: Formula: (let ((.cse1 (= 0 (mod ~a$r_buff0_thd1~0_In-427496059 256))) (.cse0 (= (mod ~a$w_buff0_used~0_In-427496059 256) 0))) (or (and (= ~a$w_buff0_used~0_In-427496059 |P0Thread1of1ForFork1_#t~ite5_Out-427496059|) (or .cse0 .cse1)) (and (= 0 |P0Thread1of1ForFork1_#t~ite5_Out-427496059|) (not .cse1) (not .cse0)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In-427496059, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In-427496059} OutVars{P0Thread1of1ForFork1_#t~ite5=|P0Thread1of1ForFork1_#t~ite5_Out-427496059|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-427496059, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In-427496059} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite5] because there is no mapped edge [2019-12-27 01:35:07,183 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [840] [840] L760-->L760-2: Formula: (let ((.cse0 (= (mod ~a$w_buff0_used~0_In-1849104733 256) 0)) (.cse1 (= (mod ~a$r_buff0_thd1~0_In-1849104733 256) 0)) (.cse2 (= 0 (mod ~a$w_buff1_used~0_In-1849104733 256))) (.cse3 (= 0 (mod ~a$r_buff1_thd1~0_In-1849104733 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P0Thread1of1ForFork1_#t~ite6_Out-1849104733| 0)) (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P0Thread1of1ForFork1_#t~ite6_Out-1849104733| ~a$w_buff1_used~0_In-1849104733)))) InVars {~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In-1849104733, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1849104733, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In-1849104733, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1849104733} OutVars{P0Thread1of1ForFork1_#t~ite6=|P0Thread1of1ForFork1_#t~ite6_Out-1849104733|, ~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In-1849104733, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1849104733, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In-1849104733, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1849104733} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite6] because there is no mapped edge [2019-12-27 01:35:07,183 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [829] [829] L778-2-->L778-4: Formula: (let ((.cse1 (= 0 (mod ~a$r_buff1_thd2~0_In187955541 256))) (.cse0 (= 0 (mod ~a$w_buff1_used~0_In187955541 256)))) (or (and (= |P1Thread1of1ForFork2_#t~ite9_Out187955541| ~a~0_In187955541) (or .cse0 .cse1)) (and (= |P1Thread1of1ForFork2_#t~ite9_Out187955541| ~a$w_buff1~0_In187955541) (not .cse1) (not .cse0)))) InVars {~a~0=~a~0_In187955541, ~a$w_buff1~0=~a$w_buff1~0_In187955541, ~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In187955541, ~a$w_buff1_used~0=~a$w_buff1_used~0_In187955541} OutVars{~a~0=~a~0_In187955541, P1Thread1of1ForFork2_#t~ite9=|P1Thread1of1ForFork2_#t~ite9_Out187955541|, ~a$w_buff1~0=~a$w_buff1~0_In187955541, ~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In187955541, ~a$w_buff1_used~0=~a$w_buff1_used~0_In187955541} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite9] because there is no mapped edge [2019-12-27 01:35:07,184 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [775] [775] L778-4-->L779: Formula: (= |v_P1Thread1of1ForFork2_#t~ite9_12| v_~a~0_28) InVars {P1Thread1of1ForFork2_#t~ite9=|v_P1Thread1of1ForFork2_#t~ite9_12|} OutVars{~a~0=v_~a~0_28, P1Thread1of1ForFork2_#t~ite9=|v_P1Thread1of1ForFork2_#t~ite9_11|, P1Thread1of1ForFork2_#t~ite10=|v_P1Thread1of1ForFork2_#t~ite10_15|} AuxVars[] AssignedVars[~a~0, P1Thread1of1ForFork2_#t~ite9, P1Thread1of1ForFork2_#t~ite10] because there is no mapped edge [2019-12-27 01:35:07,185 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [836] [836] L761-->L762: Formula: (let ((.cse0 (= 0 (mod ~a$w_buff0_used~0_In-72877423 256))) (.cse1 (= 0 (mod ~a$r_buff0_thd1~0_In-72877423 256)))) (or (and (not .cse0) (not .cse1) (= 0 ~a$r_buff0_thd1~0_Out-72877423)) (and (or .cse0 .cse1) (= ~a$r_buff0_thd1~0_In-72877423 ~a$r_buff0_thd1~0_Out-72877423)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In-72877423, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In-72877423} OutVars{P0Thread1of1ForFork1_#t~ite7=|P0Thread1of1ForFork1_#t~ite7_Out-72877423|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-72877423, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_Out-72877423} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite7, ~a$r_buff0_thd1~0] because there is no mapped edge [2019-12-27 01:35:07,185 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [850] [850] L762-->L762-2: Formula: (let ((.cse1 (= 0 (mod ~a$w_buff0_used~0_In1939656142 256))) (.cse0 (= (mod ~a$r_buff0_thd1~0_In1939656142 256) 0)) (.cse2 (= 0 (mod ~a$w_buff1_used~0_In1939656142 256))) (.cse3 (= (mod ~a$r_buff1_thd1~0_In1939656142 256) 0))) (or (and (= |P0Thread1of1ForFork1_#t~ite8_Out1939656142| ~a$r_buff1_thd1~0_In1939656142) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3))) (= |P0Thread1of1ForFork1_#t~ite8_Out1939656142| 0)))) InVars {~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In1939656142, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1939656142, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In1939656142, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1939656142} OutVars{P0Thread1of1ForFork1_#t~ite8=|P0Thread1of1ForFork1_#t~ite8_Out1939656142|, ~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In1939656142, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1939656142, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In1939656142, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1939656142} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite8] because there is no mapped edge [2019-12-27 01:35:07,185 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [860] [860] L762-2-->P0EXIT: Formula: (and (= v_~a$r_buff1_thd1~0_63 |v_P0Thread1of1ForFork1_#t~ite8_36|) (= 0 |v_P0Thread1of1ForFork1_#res.offset_5|) (= v_~__unbuffered_cnt~0_49 (+ v_~__unbuffered_cnt~0_50 1)) (= 0 |v_P0Thread1of1ForFork1_#res.base_5|)) InVars {P0Thread1of1ForFork1_#t~ite8=|v_P0Thread1of1ForFork1_#t~ite8_36|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_50} OutVars{P0Thread1of1ForFork1_#t~ite8=|v_P0Thread1of1ForFork1_#t~ite8_35|, P0Thread1of1ForFork1_#res.offset=|v_P0Thread1of1ForFork1_#res.offset_5|, ~a$r_buff1_thd1~0=v_~a$r_buff1_thd1~0_63, P0Thread1of1ForFork1_#res.base=|v_P0Thread1of1ForFork1_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_49} 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-27 01:35:07,185 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [846] [846] L779-->L779-2: Formula: (let ((.cse1 (= 0 (mod ~a$w_buff0_used~0_In147631564 256))) (.cse0 (= (mod ~a$r_buff0_thd2~0_In147631564 256) 0))) (or (and (not .cse0) (= 0 |P1Thread1of1ForFork2_#t~ite11_Out147631564|) (not .cse1)) (and (or .cse1 .cse0) (= ~a$w_buff0_used~0_In147631564 |P1Thread1of1ForFork2_#t~ite11_Out147631564|)))) InVars {~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In147631564, ~a$w_buff0_used~0=~a$w_buff0_used~0_In147631564} OutVars{~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In147631564, ~a$w_buff0_used~0=~a$w_buff0_used~0_In147631564, P1Thread1of1ForFork2_#t~ite11=|P1Thread1of1ForFork2_#t~ite11_Out147631564|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite11] because there is no mapped edge [2019-12-27 01:35:07,186 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [880] [880] L803-->L803-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In1535361508 256) 0))) (or (and .cse0 (= |P2Thread1of1ForFork0_#t~ite20_Out1535361508| |P2Thread1of1ForFork0_#t~ite21_Out1535361508|) (= |P2Thread1of1ForFork0_#t~ite20_Out1535361508| ~a$w_buff0~0_In1535361508) (let ((.cse1 (= (mod ~a$r_buff0_thd3~0_In1535361508 256) 0))) (or (= 0 (mod ~a$w_buff0_used~0_In1535361508 256)) (and .cse1 (= 0 (mod ~a$w_buff1_used~0_In1535361508 256))) (and .cse1 (= (mod ~a$r_buff1_thd3~0_In1535361508 256) 0))))) (and (not .cse0) (= |P2Thread1of1ForFork0_#t~ite21_Out1535361508| ~a$w_buff0~0_In1535361508) (= |P2Thread1of1ForFork0_#t~ite20_In1535361508| |P2Thread1of1ForFork0_#t~ite20_Out1535361508|)))) InVars {~a$w_buff0~0=~a$w_buff0~0_In1535361508, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In1535361508, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1535361508, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In1535361508, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1535361508, P2Thread1of1ForFork0_#t~ite20=|P2Thread1of1ForFork0_#t~ite20_In1535361508|, ~weak$$choice2~0=~weak$$choice2~0_In1535361508} OutVars{P2Thread1of1ForFork0_#t~ite21=|P2Thread1of1ForFork0_#t~ite21_Out1535361508|, ~a$w_buff0~0=~a$w_buff0~0_In1535361508, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In1535361508, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1535361508, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In1535361508, P2Thread1of1ForFork0_#t~ite20=|P2Thread1of1ForFork0_#t~ite20_Out1535361508|, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1535361508, ~weak$$choice2~0=~weak$$choice2~0_In1535361508} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite21, P2Thread1of1ForFork0_#t~ite20] because there is no mapped edge [2019-12-27 01:35:07,188 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [884] [884] L804-->L804-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In-169219483 256) 0))) (or (and (= ~a$w_buff1~0_In-169219483 |P2Thread1of1ForFork0_#t~ite24_Out-169219483|) (not .cse0) (= |P2Thread1of1ForFork0_#t~ite23_In-169219483| |P2Thread1of1ForFork0_#t~ite23_Out-169219483|)) (and (= |P2Thread1of1ForFork0_#t~ite23_Out-169219483| |P2Thread1of1ForFork0_#t~ite24_Out-169219483|) (= |P2Thread1of1ForFork0_#t~ite23_Out-169219483| ~a$w_buff1~0_In-169219483) .cse0 (let ((.cse1 (= (mod ~a$r_buff0_thd3~0_In-169219483 256) 0))) (or (and .cse1 (= (mod ~a$r_buff1_thd3~0_In-169219483 256) 0)) (= (mod ~a$w_buff0_used~0_In-169219483 256) 0) (and (= 0 (mod ~a$w_buff1_used~0_In-169219483 256)) .cse1)))))) InVars {~a$w_buff1~0=~a$w_buff1~0_In-169219483, P2Thread1of1ForFork0_#t~ite23=|P2Thread1of1ForFork0_#t~ite23_In-169219483|, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-169219483, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-169219483, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-169219483, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-169219483, ~weak$$choice2~0=~weak$$choice2~0_In-169219483} OutVars{~a$w_buff1~0=~a$w_buff1~0_In-169219483, P2Thread1of1ForFork0_#t~ite23=|P2Thread1of1ForFork0_#t~ite23_Out-169219483|, P2Thread1of1ForFork0_#t~ite24=|P2Thread1of1ForFork0_#t~ite24_Out-169219483|, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-169219483, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-169219483, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-169219483, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-169219483, ~weak$$choice2~0=~weak$$choice2~0_In-169219483} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite23, P2Thread1of1ForFork0_#t~ite24] because there is no mapped edge [2019-12-27 01:35:07,189 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [883] [883] L805-->L805-8: Formula: (let ((.cse1 (= (mod ~weak$$choice2~0_In1303266517 256) 0))) (or (and (= |P2Thread1of1ForFork0_#t~ite27_Out1303266517| |P2Thread1of1ForFork0_#t~ite26_Out1303266517|) (= ~a$w_buff0_used~0_In1303266517 |P2Thread1of1ForFork0_#t~ite26_Out1303266517|) (let ((.cse0 (= (mod ~a$r_buff0_thd3~0_In1303266517 256) 0))) (or (and .cse0 (= (mod ~a$r_buff1_thd3~0_In1303266517 256) 0)) (and (= 0 (mod ~a$w_buff1_used~0_In1303266517 256)) .cse0) (= 0 (mod ~a$w_buff0_used~0_In1303266517 256)))) .cse1) (and (= |P2Thread1of1ForFork0_#t~ite26_In1303266517| |P2Thread1of1ForFork0_#t~ite26_Out1303266517|) (= |P2Thread1of1ForFork0_#t~ite27_Out1303266517| ~a$w_buff0_used~0_In1303266517) (not .cse1)))) InVars {P2Thread1of1ForFork0_#t~ite26=|P2Thread1of1ForFork0_#t~ite26_In1303266517|, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In1303266517, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1303266517, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In1303266517, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1303266517, ~weak$$choice2~0=~weak$$choice2~0_In1303266517} OutVars{P2Thread1of1ForFork0_#t~ite26=|P2Thread1of1ForFork0_#t~ite26_Out1303266517|, P2Thread1of1ForFork0_#t~ite27=|P2Thread1of1ForFork0_#t~ite27_Out1303266517|, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In1303266517, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1303266517, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In1303266517, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1303266517, ~weak$$choice2~0=~weak$$choice2~0_In1303266517} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite26, P2Thread1of1ForFork0_#t~ite27] because there is no mapped edge [2019-12-27 01:35:07,192 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [768] [768] L807-->L808: Formula: (and (= v_~a$r_buff0_thd3~0_53 v_~a$r_buff0_thd3~0_52) (not (= 0 (mod v_~weak$$choice2~0_17 256)))) InVars {~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_53, ~weak$$choice2~0=v_~weak$$choice2~0_17} 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_52, P2Thread1of1ForFork0_#t~ite31=|v_P2Thread1of1ForFork0_#t~ite31_7|, ~weak$$choice2~0=v_~weak$$choice2~0_17} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite33, P2Thread1of1ForFork0_#t~ite32, ~a$r_buff0_thd3~0, P2Thread1of1ForFork0_#t~ite31] because there is no mapped edge [2019-12-27 01:35:07,194 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_16 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_16, ~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-27 01:35:07,195 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [849] [849] L814-2-->L814-4: Formula: (let ((.cse0 (= 0 (mod ~a$r_buff1_thd3~0_In-229369527 256))) (.cse1 (= 0 (mod ~a$w_buff1_used~0_In-229369527 256)))) (or (and (= ~a~0_In-229369527 |P2Thread1of1ForFork0_#t~ite38_Out-229369527|) (or .cse0 .cse1)) (and (not .cse0) (= ~a$w_buff1~0_In-229369527 |P2Thread1of1ForFork0_#t~ite38_Out-229369527|) (not .cse1)))) InVars {~a~0=~a~0_In-229369527, ~a$w_buff1~0=~a$w_buff1~0_In-229369527, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-229369527, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-229369527} OutVars{~a~0=~a~0_In-229369527, P2Thread1of1ForFork0_#t~ite38=|P2Thread1of1ForFork0_#t~ite38_Out-229369527|, ~a$w_buff1~0=~a$w_buff1~0_In-229369527, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-229369527, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-229369527} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite38] because there is no mapped edge [2019-12-27 01:35:07,196 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [783] [783] L814-4-->L815: Formula: (= v_~a~0_36 |v_P2Thread1of1ForFork0_#t~ite38_10|) InVars {P2Thread1of1ForFork0_#t~ite38=|v_P2Thread1of1ForFork0_#t~ite38_10|} OutVars{~a~0=v_~a~0_36, P2Thread1of1ForFork0_#t~ite39=|v_P2Thread1of1ForFork0_#t~ite39_13|, P2Thread1of1ForFork0_#t~ite38=|v_P2Thread1of1ForFork0_#t~ite38_9|} AuxVars[] AssignedVars[~a~0, P2Thread1of1ForFork0_#t~ite39, P2Thread1of1ForFork0_#t~ite38] because there is no mapped edge [2019-12-27 01:35:07,196 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [851] [851] L815-->L815-2: Formula: (let ((.cse1 (= (mod ~a$w_buff0_used~0_In318039473 256) 0)) (.cse0 (= 0 (mod ~a$r_buff0_thd3~0_In318039473 256)))) (or (and (or .cse0 .cse1) (= ~a$w_buff0_used~0_In318039473 |P2Thread1of1ForFork0_#t~ite40_Out318039473|)) (and (not .cse1) (= 0 |P2Thread1of1ForFork0_#t~ite40_Out318039473|) (not .cse0)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In318039473, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In318039473} OutVars{P2Thread1of1ForFork0_#t~ite40=|P2Thread1of1ForFork0_#t~ite40_Out318039473|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In318039473, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In318039473} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite40] because there is no mapped edge [2019-12-27 01:35:07,197 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [825] [825] L816-->L816-2: Formula: (let ((.cse2 (= 0 (mod ~a$w_buff0_used~0_In-1795510086 256))) (.cse3 (= (mod ~a$r_buff0_thd3~0_In-1795510086 256) 0)) (.cse0 (= 0 (mod ~a$w_buff1_used~0_In-1795510086 256))) (.cse1 (= 0 (mod ~a$r_buff1_thd3~0_In-1795510086 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P2Thread1of1ForFork0_#t~ite41_Out-1795510086|)) (and (= ~a$w_buff1_used~0_In-1795510086 |P2Thread1of1ForFork0_#t~ite41_Out-1795510086|) (or .cse2 .cse3) (or .cse0 .cse1)))) InVars {~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-1795510086, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1795510086, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-1795510086, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1795510086} OutVars{~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-1795510086, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1795510086, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-1795510086, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1795510086, P2Thread1of1ForFork0_#t~ite41=|P2Thread1of1ForFork0_#t~ite41_Out-1795510086|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite41] because there is no mapped edge [2019-12-27 01:35:07,198 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [844] [844] L817-->L817-2: Formula: (let ((.cse1 (= (mod ~a$r_buff0_thd3~0_In-970462600 256) 0)) (.cse0 (= 0 (mod ~a$w_buff0_used~0_In-970462600 256)))) (or (and (= ~a$r_buff0_thd3~0_In-970462600 |P2Thread1of1ForFork0_#t~ite42_Out-970462600|) (or .cse0 .cse1)) (and (not .cse1) (not .cse0) (= 0 |P2Thread1of1ForFork0_#t~ite42_Out-970462600|)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In-970462600, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-970462600} OutVars{~a$w_buff0_used~0=~a$w_buff0_used~0_In-970462600, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-970462600, P2Thread1of1ForFork0_#t~ite42=|P2Thread1of1ForFork0_#t~ite42_Out-970462600|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite42] because there is no mapped edge [2019-12-27 01:35:07,199 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [828] [828] L818-->L818-2: Formula: (let ((.cse0 (= (mod ~a$r_buff0_thd3~0_In-1345398142 256) 0)) (.cse1 (= (mod ~a$w_buff0_used~0_In-1345398142 256) 0)) (.cse3 (= (mod ~a$w_buff1_used~0_In-1345398142 256) 0)) (.cse2 (= 0 (mod ~a$r_buff1_thd3~0_In-1345398142 256)))) (or (and (or .cse0 .cse1) (= ~a$r_buff1_thd3~0_In-1345398142 |P2Thread1of1ForFork0_#t~ite43_Out-1345398142|) (or .cse2 .cse3)) (and (= |P2Thread1of1ForFork0_#t~ite43_Out-1345398142| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2)))))) InVars {~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-1345398142, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1345398142, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-1345398142, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1345398142} OutVars{P2Thread1of1ForFork0_#t~ite43=|P2Thread1of1ForFork0_#t~ite43_Out-1345398142|, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-1345398142, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1345398142, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-1345398142, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1345398142} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite43] because there is no mapped edge [2019-12-27 01:35:07,200 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [848] [848] L780-->L780-2: Formula: (let ((.cse3 (= 0 (mod ~a$r_buff1_thd2~0_In-1881275904 256))) (.cse2 (= (mod ~a$w_buff1_used~0_In-1881275904 256) 0)) (.cse0 (= 0 (mod ~a$w_buff0_used~0_In-1881275904 256))) (.cse1 (= 0 (mod ~a$r_buff0_thd2~0_In-1881275904 256)))) (or (and (= |P1Thread1of1ForFork2_#t~ite12_Out-1881275904| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= |P1Thread1of1ForFork2_#t~ite12_Out-1881275904| ~a$w_buff1_used~0_In-1881275904) (or .cse3 .cse2) (or .cse0 .cse1)))) InVars {~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In-1881275904, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-1881275904, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1881275904, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1881275904} OutVars{~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In-1881275904, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-1881275904, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1881275904, P1Thread1of1ForFork2_#t~ite12=|P1Thread1of1ForFork2_#t~ite12_Out-1881275904|, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1881275904} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite12] because there is no mapped edge [2019-12-27 01:35:07,202 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [838] [838] L781-->L781-2: Formula: (let ((.cse1 (= 0 (mod ~a$r_buff0_thd2~0_In-29709988 256))) (.cse0 (= (mod ~a$w_buff0_used~0_In-29709988 256) 0))) (or (and (or .cse0 .cse1) (= |P1Thread1of1ForFork2_#t~ite13_Out-29709988| ~a$r_buff0_thd2~0_In-29709988)) (and (= 0 |P1Thread1of1ForFork2_#t~ite13_Out-29709988|) (not .cse1) (not .cse0)))) InVars {~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-29709988, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-29709988} OutVars{~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-29709988, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-29709988, P1Thread1of1ForFork2_#t~ite13=|P1Thread1of1ForFork2_#t~ite13_Out-29709988|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite13] because there is no mapped edge [2019-12-27 01:35:07,203 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [837] [837] L782-->L782-2: Formula: (let ((.cse3 (= (mod ~a$w_buff0_used~0_In-1223764807 256) 0)) (.cse2 (= 0 (mod ~a$r_buff0_thd2~0_In-1223764807 256))) (.cse1 (= (mod ~a$r_buff1_thd2~0_In-1223764807 256) 0)) (.cse0 (= 0 (mod ~a$w_buff1_used~0_In-1223764807 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P1Thread1of1ForFork2_#t~ite14_Out-1223764807|)) (and (or .cse3 .cse2) (or .cse1 .cse0) (= ~a$r_buff1_thd2~0_In-1223764807 |P1Thread1of1ForFork2_#t~ite14_Out-1223764807|)))) InVars {~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In-1223764807, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-1223764807, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1223764807, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1223764807} OutVars{~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In-1223764807, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-1223764807, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1223764807, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1223764807, P1Thread1of1ForFork2_#t~ite14=|P1Thread1of1ForFork2_#t~ite14_Out-1223764807|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite14] because there is no mapped edge [2019-12-27 01:35:07,203 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [863] [863] L818-2-->P2EXIT: Formula: (and (= |v_P2Thread1of1ForFork0_#res.offset_5| 0) (= (+ v_~__unbuffered_cnt~0_56 1) v_~__unbuffered_cnt~0_55) (= v_~a$r_buff1_thd3~0_123 |v_P2Thread1of1ForFork0_#t~ite43_34|) (= |v_P2Thread1of1ForFork0_#res.base_5| 0)) InVars {P2Thread1of1ForFork0_#t~ite43=|v_P2Thread1of1ForFork0_#t~ite43_34|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_56} OutVars{P2Thread1of1ForFork0_#res.base=|v_P2Thread1of1ForFork0_#res.base_5|, P2Thread1of1ForFork0_#t~ite43=|v_P2Thread1of1ForFork0_#t~ite43_33|, ~a$r_buff1_thd3~0=v_~a$r_buff1_thd3~0_123, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_55, 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-27 01:35:07,203 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [879] [879] L782-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork2_#res.offset_5|) (= |v_P1Thread1of1ForFork2_#t~ite14_44| v_~a$r_buff1_thd2~0_99) (= (+ v_~__unbuffered_cnt~0_83 1) v_~__unbuffered_cnt~0_82) (= 0 |v_P1Thread1of1ForFork2_#res.base_5|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_83, P1Thread1of1ForFork2_#t~ite14=|v_P1Thread1of1ForFork2_#t~ite14_44|} OutVars{P1Thread1of1ForFork2_#res.offset=|v_P1Thread1of1ForFork2_#res.offset_5|, ~a$r_buff1_thd2~0=v_~a$r_buff1_thd2~0_99, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_82, P1Thread1of1ForFork2_#t~ite14=|v_P1Thread1of1ForFork2_#t~ite14_43|, 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-27 01:35:07,203 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [799] [799] L841-1-->L847: Formula: (and (= v_~main$tmp_guard0~0_9 1) (= 3 v_~__unbuffered_cnt~0_36)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_36} OutVars{ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_36, ~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-27 01:35:07,204 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [832] [832] L847-2-->L847-4: Formula: (let ((.cse0 (= (mod ~a$w_buff1_used~0_In-2115243638 256) 0)) (.cse1 (= (mod ~a$r_buff1_thd0~0_In-2115243638 256) 0))) (or (and (not .cse0) (= ~a$w_buff1~0_In-2115243638 |ULTIMATE.start_main_#t~ite47_Out-2115243638|) (not .cse1)) (and (or .cse0 .cse1) (= ~a~0_In-2115243638 |ULTIMATE.start_main_#t~ite47_Out-2115243638|)))) InVars {~a~0=~a~0_In-2115243638, ~a$w_buff1~0=~a$w_buff1~0_In-2115243638, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In-2115243638, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-2115243638} OutVars{~a~0=~a~0_In-2115243638, ~a$w_buff1~0=~a$w_buff1~0_In-2115243638, ULTIMATE.start_main_#t~ite47=|ULTIMATE.start_main_#t~ite47_Out-2115243638|, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In-2115243638, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-2115243638} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite47] because there is no mapped edge [2019-12-27 01:35:07,205 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [796] [796] L847-4-->L848: Formula: (= v_~a~0_44 |v_ULTIMATE.start_main_#t~ite47_19|) InVars {ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_19|} OutVars{~a~0=v_~a~0_44, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_18|, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_16|} AuxVars[] AssignedVars[~a~0, ULTIMATE.start_main_#t~ite47, ULTIMATE.start_main_#t~ite48] because there is no mapped edge [2019-12-27 01:35:07,205 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [826] [826] L848-->L848-2: Formula: (let ((.cse1 (= (mod ~a$r_buff0_thd0~0_In171258570 256) 0)) (.cse0 (= (mod ~a$w_buff0_used~0_In171258570 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite49_Out171258570| ~a$w_buff0_used~0_In171258570) (or .cse0 .cse1)) (and (not .cse1) (not .cse0) (= |ULTIMATE.start_main_#t~ite49_Out171258570| 0)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In171258570, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In171258570} OutVars{~a$w_buff0_used~0=~a$w_buff0_used~0_In171258570, ULTIMATE.start_main_#t~ite49=|ULTIMATE.start_main_#t~ite49_Out171258570|, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In171258570} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite49] because there is no mapped edge [2019-12-27 01:35:07,206 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [831] [831] L849-->L849-2: Formula: (let ((.cse0 (= (mod ~a$w_buff0_used~0_In-1058675588 256) 0)) (.cse1 (= 0 (mod ~a$r_buff0_thd0~0_In-1058675588 256))) (.cse2 (= 0 (mod ~a$r_buff1_thd0~0_In-1058675588 256))) (.cse3 (= 0 (mod ~a$w_buff1_used~0_In-1058675588 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite50_Out-1058675588| 0)) (and (= ~a$w_buff1_used~0_In-1058675588 |ULTIMATE.start_main_#t~ite50_Out-1058675588|) (or .cse0 .cse1) (or .cse2 .cse3)))) InVars {~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In-1058675588, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1058675588, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-1058675588, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1058675588} OutVars{ULTIMATE.start_main_#t~ite50=|ULTIMATE.start_main_#t~ite50_Out-1058675588|, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In-1058675588, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1058675588, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-1058675588, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1058675588} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite50] because there is no mapped edge [2019-12-27 01:35:07,207 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [830] [830] L850-->L850-2: Formula: (let ((.cse0 (= (mod ~a$r_buff0_thd0~0_In-825834920 256) 0)) (.cse1 (= 0 (mod ~a$w_buff0_used~0_In-825834920 256)))) (or (and (= |ULTIMATE.start_main_#t~ite51_Out-825834920| ~a$r_buff0_thd0~0_In-825834920) (or .cse0 .cse1)) (and (not .cse0) (= |ULTIMATE.start_main_#t~ite51_Out-825834920| 0) (not .cse1)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In-825834920, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-825834920} OutVars{ULTIMATE.start_main_#t~ite51=|ULTIMATE.start_main_#t~ite51_Out-825834920|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-825834920, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-825834920} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite51] because there is no mapped edge [2019-12-27 01:35:07,208 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [841] [841] L851-->L851-2: Formula: (let ((.cse2 (= (mod ~a$r_buff1_thd0~0_In-436371462 256) 0)) (.cse3 (= 0 (mod ~a$w_buff1_used~0_In-436371462 256))) (.cse0 (= 0 (mod ~a$r_buff0_thd0~0_In-436371462 256))) (.cse1 (= (mod ~a$w_buff0_used~0_In-436371462 256) 0))) (or (and (or .cse0 .cse1) (= ~a$r_buff1_thd0~0_In-436371462 |ULTIMATE.start_main_#t~ite52_Out-436371462|) (or .cse2 .cse3)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1))) (= 0 |ULTIMATE.start_main_#t~ite52_Out-436371462|)))) InVars {~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In-436371462, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-436371462, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-436371462, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-436371462} OutVars{ULTIMATE.start_main_#t~ite52=|ULTIMATE.start_main_#t~ite52_Out-436371462|, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In-436371462, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-436371462, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-436371462, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-436371462} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52] because there is no mapped edge [2019-12-27 01:35:07,209 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [899] [899] L851-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_~a$r_buff1_thd0~0_125 |v_ULTIMATE.start_main_#t~ite52_55|) (= (mod v_~main$tmp_guard1~0_29 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_16|) (= v_~__unbuffered_p2_EBX~0_29 0) (= 0 v_~__unbuffered_p1_EAX~0_28) (= 1 v_~__unbuffered_p2_EAX~0_26) (= v_~__unbuffered_p0_EBX~0_85 0) (= v_~main$tmp_guard1~0_29 0) (= v_ULTIMATE.start___VERIFIER_assert_~expression_22 0) (= 1 v_~__unbuffered_p0_EAX~0_85)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_85, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_55|, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_85, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_29, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_28, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_26} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_85, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_54|, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_22, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_85, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_29, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_28, ~a$r_buff1_thd0~0=v_~a$r_buff1_thd0~0_125, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_29, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_26, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_16|} 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-27 01:35:07,291 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 01:35:07 BasicIcfg [2019-12-27 01:35:07,291 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 01:35:07,292 INFO L168 Benchmark]: Toolchain (without parser) took 122101.43 ms. Allocated memory was 138.4 MB in the beginning and 2.9 GB in the end (delta: 2.7 GB). Free memory was 101.2 MB in the beginning and 2.0 GB in the end (delta: -1.9 GB). Peak memory consumption was 879.2 MB. Max. memory is 7.1 GB. [2019-12-27 01:35:07,293 INFO L168 Benchmark]: CDTParser took 0.41 ms. Allocated memory is still 138.4 MB. Free memory was 121.6 MB in the beginning and 121.4 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. [2019-12-27 01:35:07,293 INFO L168 Benchmark]: CACSL2BoogieTranslator took 851.82 ms. Allocated memory was 138.4 MB in the beginning and 203.4 MB in the end (delta: 65.0 MB). Free memory was 100.8 MB in the beginning and 156.5 MB in the end (delta: -55.7 MB). Peak memory consumption was 25.8 MB. Max. memory is 7.1 GB. [2019-12-27 01:35:07,293 INFO L168 Benchmark]: Boogie Procedure Inliner took 63.80 ms. Allocated memory is still 203.4 MB. Free memory was 156.5 MB in the beginning and 153.8 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-27 01:35:07,294 INFO L168 Benchmark]: Boogie Preprocessor took 61.78 ms. Allocated memory is still 203.4 MB. Free memory was 153.8 MB in the beginning and 151.8 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2019-12-27 01:35:07,294 INFO L168 Benchmark]: RCFGBuilder took 861.01 ms. Allocated memory is still 203.4 MB. Free memory was 151.1 MB in the beginning and 100.7 MB in the end (delta: 50.4 MB). Peak memory consumption was 50.4 MB. Max. memory is 7.1 GB. [2019-12-27 01:35:07,295 INFO L168 Benchmark]: TraceAbstraction took 120251.68 ms. Allocated memory was 203.4 MB in the beginning and 2.9 GB in the end (delta: 2.7 GB). Free memory was 100.1 MB in the beginning and 2.0 GB in the end (delta: -1.9 GB). Peak memory consumption was 813.1 MB. Max. memory is 7.1 GB. [2019-12-27 01:35:07,297 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.41 ms. Allocated memory is still 138.4 MB. Free memory was 121.6 MB in the beginning and 121.4 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 851.82 ms. Allocated memory was 138.4 MB in the beginning and 203.4 MB in the end (delta: 65.0 MB). Free memory was 100.8 MB in the beginning and 156.5 MB in the end (delta: -55.7 MB). Peak memory consumption was 25.8 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 63.80 ms. Allocated memory is still 203.4 MB. Free memory was 156.5 MB in the beginning and 153.8 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 61.78 ms. Allocated memory is still 203.4 MB. Free memory was 153.8 MB in the beginning and 151.8 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 861.01 ms. Allocated memory is still 203.4 MB. Free memory was 151.1 MB in the beginning and 100.7 MB in the end (delta: 50.4 MB). Peak memory consumption was 50.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 120251.68 ms. Allocated memory was 203.4 MB in the beginning and 2.9 GB in the end (delta: 2.7 GB). Free memory was 100.1 MB in the beginning and 2.0 GB in the end (delta: -1.9 GB). Peak memory consumption was 813.1 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 5.8s, 179 ProgramPointsBefore, 94 ProgramPointsAfterwards, 216 TransitionsBefore, 102 TransitionsAfterwards, 19004 CoEnabledTransitionPairs, 7 FixpointIterations, 36 TrivialSequentialCompositions, 48 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 32 ConcurrentYvCompositions, 33 ChoiceCompositions, 7151 VarBasedMoverChecksPositive, 221 VarBasedMoverChecksNegative, 29 SemBasedMoverChecksPositive, 258 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.7s, 0 MoverChecksTotal, 80759 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(&t397, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=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] [L839] FCALL, FORK 0 pthread_create(&t398, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=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, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L841] FCALL, FORK 0 pthread_create(&t399, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=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, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L737] 1 a$w_buff1 = a$w_buff0 [L738] 1 a$w_buff0 = 1 [L739] 1 a$w_buff1_used = a$w_buff0_used [L740] 1 a$w_buff0_used = (_Bool)1 [L758] 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=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=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=0, z=0] [L772] 2 y = 1 [L775] 2 __unbuffered_p1_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=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=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=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=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=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_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=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=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_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] [L758] 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) [L759] 1 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L760] 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] 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=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=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=0, 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=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=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=0, 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=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=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=0, 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$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=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=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=0, 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] [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 [L817] 3 a$r_buff0_thd3 = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3 [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 [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=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=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_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: 119.9s, OverallIterations: 40, TraceHistogramMax: 1, AutomataDifference: 44.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 8882 SDtfs, 14962 SDslu, 31052 SDs, 0 SdLazy, 19024 SolverSat, 945 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 17.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 631 GetRequests, 79 SyntacticMatches, 22 SemanticMatches, 530 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3149 ImplicationChecksByTransitivity, 12.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=156295occurred 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: 42.1s AutomataMinimizationTime, 39 MinimizatonAttempts, 288252 StatesRemovedByMinimization, 35 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 6.5s InterpolantComputationTime, 1875 NumberOfCodeBlocks, 1875 NumberOfCodeBlocksAsserted, 40 NumberOfCheckSat, 1769 ConstructedInterpolants, 0 QuantifiedInterpolants, 425994 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 39 InterpolantComputations, 39 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...