/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/safe021_pso.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-fae578e [2019-12-18 18:48:12,915 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-18 18:48:12,918 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-18 18:48:12,932 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-18 18:48:12,932 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-18 18:48:12,934 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-18 18:48:12,936 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-18 18:48:12,945 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-18 18:48:12,947 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-18 18:48:12,947 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-18 18:48:12,948 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-18 18:48:12,950 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-18 18:48:12,951 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-18 18:48:12,953 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-18 18:48:12,954 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-18 18:48:12,955 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-18 18:48:12,956 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-18 18:48:12,957 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-18 18:48:12,958 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-18 18:48:12,960 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-18 18:48:12,961 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-18 18:48:12,962 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-18 18:48:12,963 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-18 18:48:12,964 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-18 18:48:12,966 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-18 18:48:12,966 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-18 18:48:12,966 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-18 18:48:12,967 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-18 18:48:12,967 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-18 18:48:12,968 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-18 18:48:12,968 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-18 18:48:12,969 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-18 18:48:12,970 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-18 18:48:12,971 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-18 18:48:12,971 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-18 18:48:12,972 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-18 18:48:12,972 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-18 18:48:12,972 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-18 18:48:12,973 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-18 18:48:12,973 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-18 18:48:12,974 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-18 18:48:12,975 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-18 18:48:12,993 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-18 18:48:12,996 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-18 18:48:12,997 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-18 18:48:12,997 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-18 18:48:12,997 INFO L138 SettingsManager]: * Use SBE=true [2019-12-18 18:48:12,998 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-18 18:48:12,998 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-18 18:48:12,998 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-18 18:48:12,998 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-18 18:48:12,998 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-18 18:48:13,002 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-18 18:48:13,002 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-18 18:48:13,002 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-18 18:48:13,002 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-18 18:48:13,003 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-18 18:48:13,003 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-18 18:48:13,003 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-18 18:48:13,003 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-18 18:48:13,003 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-18 18:48:13,004 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-18 18:48:13,005 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-18 18:48:13,006 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 18:48:13,006 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-18 18:48:13,006 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-18 18:48:13,006 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-18 18:48:13,006 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-18 18:48:13,007 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-18 18:48:13,007 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-18 18:48:13,007 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-18 18:48:13,268 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-18 18:48:13,285 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-18 18:48:13,289 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-18 18:48:13,291 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-18 18:48:13,291 INFO L275 PluginConnector]: CDTParser initialized [2019-12-18 18:48:13,292 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe021_pso.oepc.i [2019-12-18 18:48:13,366 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4b832d164/6fa7a10514954215a8e5c7f885e71a81/FLAG5e93029bd [2019-12-18 18:48:13,956 INFO L306 CDTParser]: Found 1 translation units. [2019-12-18 18:48:13,957 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe021_pso.oepc.i [2019-12-18 18:48:13,981 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4b832d164/6fa7a10514954215a8e5c7f885e71a81/FLAG5e93029bd [2019-12-18 18:48:14,202 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4b832d164/6fa7a10514954215a8e5c7f885e71a81 [2019-12-18 18:48:14,210 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-18 18:48:14,212 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-18 18:48:14,213 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-18 18:48:14,213 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-18 18:48:14,221 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-18 18:48:14,222 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 06:48:14" (1/1) ... [2019-12-18 18:48:14,224 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@36df0124 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 06:48:14, skipping insertion in model container [2019-12-18 18:48:14,224 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 06:48:14" (1/1) ... [2019-12-18 18:48:14,231 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-18 18:48:14,280 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-18 18:48:14,879 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 18:48:14,894 INFO L203 MainTranslator]: Completed pre-run [2019-12-18 18:48:14,963 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 18:48:15,046 INFO L208 MainTranslator]: Completed translation [2019-12-18 18:48:15,046 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 06:48:15 WrapperNode [2019-12-18 18:48:15,046 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-18 18:48:15,047 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-18 18:48:15,047 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-18 18:48:15,048 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-18 18:48:15,056 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 06:48:15" (1/1) ... [2019-12-18 18:48:15,078 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 06:48:15" (1/1) ... [2019-12-18 18:48:15,110 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-18 18:48:15,110 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-18 18:48:15,111 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-18 18:48:15,111 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-18 18:48:15,119 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 06:48:15" (1/1) ... [2019-12-18 18:48:15,120 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 06:48:15" (1/1) ... [2019-12-18 18:48:15,125 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 06:48:15" (1/1) ... [2019-12-18 18:48:15,125 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 06:48:15" (1/1) ... [2019-12-18 18:48:15,140 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 06:48:15" (1/1) ... [2019-12-18 18:48:15,146 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 06:48:15" (1/1) ... [2019-12-18 18:48:15,149 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 06:48:15" (1/1) ... [2019-12-18 18:48:15,154 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-18 18:48:15,155 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-18 18:48:15,155 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-18 18:48:15,155 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-18 18:48:15,156 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 06:48:15" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 18:48:15,225 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-18 18:48:15,225 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-18 18:48:15,225 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-18 18:48:15,225 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-18 18:48:15,226 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-18 18:48:15,226 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-18 18:48:15,226 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-18 18:48:15,226 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-18 18:48:15,226 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-18 18:48:15,227 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-18 18:48:15,227 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-18 18:48:15,227 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-18 18:48:15,227 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-18 18:48:15,229 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-18 18:48:15,981 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-18 18:48:15,982 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-18 18:48:15,983 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 06:48:15 BoogieIcfgContainer [2019-12-18 18:48:15,983 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-18 18:48:15,984 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-18 18:48:15,985 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-18 18:48:15,988 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-18 18:48:15,988 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 06:48:14" (1/3) ... [2019-12-18 18:48:15,989 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@10c2ffb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 06:48:15, skipping insertion in model container [2019-12-18 18:48:15,989 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 06:48:15" (2/3) ... [2019-12-18 18:48:15,990 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@10c2ffb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 06:48:15, skipping insertion in model container [2019-12-18 18:48:15,990 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 06:48:15" (3/3) ... [2019-12-18 18:48:15,992 INFO L109 eAbstractionObserver]: Analyzing ICFG safe021_pso.oepc.i [2019-12-18 18:48:16,003 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-18 18:48:16,003 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-18 18:48:16,012 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-18 18:48:16,013 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-18 18:48:16,059 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:16,059 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:16,060 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:16,060 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:16,060 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:16,060 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:16,061 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:16,061 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:16,062 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:16,062 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:16,062 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:16,062 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:16,063 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:16,063 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:16,063 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:16,064 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:16,064 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:16,064 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:16,081 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:16,081 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:16,081 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:16,082 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:16,082 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:16,083 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:16,083 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:16,083 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:16,083 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:16,084 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:16,084 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:16,084 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:16,084 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:16,084 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:16,086 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:16,086 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:16,089 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:16,089 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:16,089 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:16,090 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:16,091 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:16,091 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:16,092 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:16,093 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:16,093 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:16,094 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:16,094 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:16,094 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:16,094 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:16,095 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:16,095 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:16,095 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:16,095 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:16,095 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:16,096 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:16,096 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:16,096 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:16,096 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:16,097 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:16,097 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:16,097 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:16,097 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:16,097 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:16,098 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:16,098 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:16,098 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:16,104 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:16,105 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:16,105 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:16,105 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:16,106 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:16,106 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:16,106 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:16,106 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:16,106 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:16,108 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:16,108 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:16,108 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:16,108 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:16,109 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:16,109 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:16,109 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:16,109 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:16,109 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:16,110 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:16,110 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:16,110 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:16,110 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:16,111 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:16,112 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:16,112 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:16,112 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:16,112 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:16,112 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:16,113 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:16,113 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:16,113 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:16,113 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:16,113 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:16,114 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:16,114 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:16,114 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:16,114 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:16,114 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:16,115 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:16,119 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:16,119 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:16,119 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:16,119 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:16,127 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:16,128 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:16,128 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:16,128 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:16,129 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:16,129 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:16,129 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:16,130 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:16,130 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:16,130 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:16,130 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:16,130 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:16,131 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:16,131 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:16,131 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:16,131 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:16,131 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:16,132 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:16,132 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:16,132 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:16,132 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:16,132 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:16,133 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:16,133 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:16,133 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:16,133 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:16,133 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:16,134 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:16,134 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:16,134 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:16,134 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:16,134 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:16,135 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:16,135 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:16,135 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:16,135 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:16,135 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:16,135 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:16,136 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:16,136 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:16,136 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:16,136 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:16,136 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:16,137 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:16,137 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:16,137 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:16,137 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:16,137 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:16,138 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:16,138 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:16,138 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:16,138 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:16,138 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:16,139 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:16,139 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:16,139 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:16,139 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:16,139 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:16,139 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:16,140 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:16,140 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:16,141 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:16,141 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:16,141 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:16,143 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:16,143 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:16,143 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:16,144 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:16,144 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:16,144 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:16,144 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:16,146 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:16,149 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:16,150 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:16,150 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:16,153 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:16,154 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:16,154 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:16,154 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:16,156 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:16,156 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:16,156 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:16,156 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:16,158 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:16,159 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:16,159 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:16,159 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:16,162 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:16,163 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:16,163 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:16,163 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:16,163 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:16,163 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:16,163 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:16,164 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:16,164 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:16,164 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:16,166 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:16,166 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:16,166 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:16,166 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:16,167 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:16,167 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:16,167 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:16,167 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:16,167 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:16,168 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:16,168 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:16,168 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:16,168 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:16,168 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:16,169 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:16,175 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:16,176 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:16,176 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:16,176 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:16,176 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:16,176 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:16,176 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:16,177 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:16,177 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:16,177 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:16,177 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:16,178 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:16,178 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:16,178 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:16,178 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:16,178 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:16,179 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:16,179 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:16,198 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-18 18:48:16,220 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-18 18:48:16,220 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-18 18:48:16,220 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-18 18:48:16,220 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-18 18:48:16,221 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-18 18:48:16,221 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-18 18:48:16,221 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-18 18:48:16,221 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-18 18:48:16,236 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 175 places, 212 transitions [2019-12-18 18:48:16,238 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 175 places, 212 transitions [2019-12-18 18:48:16,329 INFO L126 PetriNetUnfolder]: 47/209 cut-off events. [2019-12-18 18:48:16,329 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 18:48:16,351 INFO L76 FinitePrefix]: Finished finitePrefix Result has 219 conditions, 209 events. 47/209 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 437 event pairs. 9/169 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-18 18:48:16,380 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 175 places, 212 transitions [2019-12-18 18:48:16,429 INFO L126 PetriNetUnfolder]: 47/209 cut-off events. [2019-12-18 18:48:16,429 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 18:48:16,440 INFO L76 FinitePrefix]: Finished finitePrefix Result has 219 conditions, 209 events. 47/209 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 437 event pairs. 9/169 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-18 18:48:16,467 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 19004 [2019-12-18 18:48:16,468 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-18 18:48:22,129 WARN L192 SmtUtils]: Spent 236.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 87 [2019-12-18 18:48:22,260 WARN L192 SmtUtils]: Spent 125.00 ms on a formula simplification that was a NOOP. DAG size: 85 [2019-12-18 18:48:22,648 INFO L206 etLargeBlockEncoding]: Checked pairs total: 125946 [2019-12-18 18:48:22,648 INFO L214 etLargeBlockEncoding]: Total number of compositions: 121 [2019-12-18 18:48:22,652 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 92 places, 102 transitions [2019-12-18 18:48:40,851 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 111572 states. [2019-12-18 18:48:40,853 INFO L276 IsEmpty]: Start isEmpty. Operand 111572 states. [2019-12-18 18:48:40,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-18 18:48:40,858 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:48:40,858 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-18 18:48:40,859 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:48:40,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:48:40,863 INFO L82 PathProgramCache]: Analyzing trace with hash 912834, now seen corresponding path program 1 times [2019-12-18 18:48:40,870 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:48:40,871 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [924056494] [2019-12-18 18:48:40,871 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:48:41,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:48:41,112 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 18:48:41,112 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [924056494] [2019-12-18 18:48:41,114 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:48:41,114 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 18:48:41,115 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1052690477] [2019-12-18 18:48:41,120 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 18:48:41,120 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:48:41,135 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 18:48:41,136 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 18:48:41,138 INFO L87 Difference]: Start difference. First operand 111572 states. Second operand 3 states. [2019-12-18 18:48:42,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:48:42,318 INFO L93 Difference]: Finished difference Result 110910 states and 474711 transitions. [2019-12-18 18:48:42,318 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 18:48:42,319 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-18 18:48:42,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:48:46,047 INFO L225 Difference]: With dead ends: 110910 [2019-12-18 18:48:46,047 INFO L226 Difference]: Without dead ends: 98066 [2019-12-18 18:48:46,049 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 18:48:49,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98066 states. [2019-12-18 18:48:52,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98066 to 98066. [2019-12-18 18:48:52,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98066 states. [2019-12-18 18:48:52,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98066 states to 98066 states and 418629 transitions. [2019-12-18 18:48:52,553 INFO L78 Accepts]: Start accepts. Automaton has 98066 states and 418629 transitions. Word has length 3 [2019-12-18 18:48:52,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:48:52,554 INFO L462 AbstractCegarLoop]: Abstraction has 98066 states and 418629 transitions. [2019-12-18 18:48:52,554 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 18:48:52,554 INFO L276 IsEmpty]: Start isEmpty. Operand 98066 states and 418629 transitions. [2019-12-18 18:48:52,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-18 18:48:52,558 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:48:52,558 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 18:48:52,559 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:48:52,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:48:52,559 INFO L82 PathProgramCache]: Analyzing trace with hash 1027484309, now seen corresponding path program 1 times [2019-12-18 18:48:52,559 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:48:52,560 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [701086296] [2019-12-18 18:48:52,560 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:48:52,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:48:52,654 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 18:48:52,655 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [701086296] [2019-12-18 18:48:52,655 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:48:52,655 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 18:48:52,655 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [947517250] [2019-12-18 18:48:52,657 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 18:48:52,658 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:48:52,658 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 18:48:52,658 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 18:48:52,658 INFO L87 Difference]: Start difference. First operand 98066 states and 418629 transitions. Second operand 4 states. [2019-12-18 18:48:57,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:48:57,712 INFO L93 Difference]: Finished difference Result 156656 states and 639635 transitions. [2019-12-18 18:48:57,715 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 18:48:57,715 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-18 18:48:57,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:48:58,161 INFO L225 Difference]: With dead ends: 156656 [2019-12-18 18:48:58,161 INFO L226 Difference]: Without dead ends: 156558 [2019-12-18 18:48:58,162 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 18:49:02,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156558 states. [2019-12-18 18:49:05,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156558 to 142946. [2019-12-18 18:49:05,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142946 states. [2019-12-18 18:49:13,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142946 states to 142946 states and 591329 transitions. [2019-12-18 18:49:13,172 INFO L78 Accepts]: Start accepts. Automaton has 142946 states and 591329 transitions. Word has length 11 [2019-12-18 18:49:13,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:49:13,173 INFO L462 AbstractCegarLoop]: Abstraction has 142946 states and 591329 transitions. [2019-12-18 18:49:13,173 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 18:49:13,173 INFO L276 IsEmpty]: Start isEmpty. Operand 142946 states and 591329 transitions. [2019-12-18 18:49:13,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-18 18:49:13,180 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:49:13,180 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 18:49:13,180 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:49:13,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:49:13,180 INFO L82 PathProgramCache]: Analyzing trace with hash 1461043352, now seen corresponding path program 1 times [2019-12-18 18:49:13,181 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:49:13,181 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [880636165] [2019-12-18 18:49:13,181 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:49:13,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:49:13,249 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 18:49:13,250 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [880636165] [2019-12-18 18:49:13,250 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:49:13,250 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 18:49:13,250 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [149355417] [2019-12-18 18:49:13,251 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 18:49:13,251 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:49:13,251 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 18:49:13,251 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 18:49:13,252 INFO L87 Difference]: Start difference. First operand 142946 states and 591329 transitions. Second operand 3 states. [2019-12-18 18:49:13,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:49:13,375 INFO L93 Difference]: Finished difference Result 31386 states and 102018 transitions. [2019-12-18 18:49:13,375 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 18:49:13,375 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-18 18:49:13,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:49:13,481 INFO L225 Difference]: With dead ends: 31386 [2019-12-18 18:49:13,481 INFO L226 Difference]: Without dead ends: 31386 [2019-12-18 18:49:13,481 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 18:49:13,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31386 states. [2019-12-18 18:49:14,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31386 to 31386. [2019-12-18 18:49:14,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31386 states. [2019-12-18 18:49:14,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31386 states to 31386 states and 102018 transitions. [2019-12-18 18:49:14,201 INFO L78 Accepts]: Start accepts. Automaton has 31386 states and 102018 transitions. Word has length 13 [2019-12-18 18:49:14,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:49:14,202 INFO L462 AbstractCegarLoop]: Abstraction has 31386 states and 102018 transitions. [2019-12-18 18:49:14,202 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 18:49:14,202 INFO L276 IsEmpty]: Start isEmpty. Operand 31386 states and 102018 transitions. [2019-12-18 18:49:14,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-18 18:49:14,205 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:49:14,205 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 18:49:14,205 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:49:14,206 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:49:14,206 INFO L82 PathProgramCache]: Analyzing trace with hash -876468662, now seen corresponding path program 1 times [2019-12-18 18:49:14,206 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:49:14,206 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [968577874] [2019-12-18 18:49:14,206 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:49:14,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:49:14,309 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 18:49:14,309 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [968577874] [2019-12-18 18:49:14,309 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:49:14,309 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 18:49:14,310 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [703701069] [2019-12-18 18:49:14,310 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 18:49:14,310 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:49:14,310 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 18:49:14,311 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-18 18:49:14,311 INFO L87 Difference]: Start difference. First operand 31386 states and 102018 transitions. Second operand 5 states. [2019-12-18 18:49:14,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:49:14,836 INFO L93 Difference]: Finished difference Result 43205 states and 138515 transitions. [2019-12-18 18:49:14,837 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 18:49:14,837 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2019-12-18 18:49:14,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:49:14,917 INFO L225 Difference]: With dead ends: 43205 [2019-12-18 18:49:14,917 INFO L226 Difference]: Without dead ends: 43205 [2019-12-18 18:49:14,918 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-18 18:49:15,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43205 states. [2019-12-18 18:49:16,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43205 to 36470. [2019-12-18 18:49:16,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36470 states. [2019-12-18 18:49:17,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36470 states to 36470 states and 117941 transitions. [2019-12-18 18:49:17,031 INFO L78 Accepts]: Start accepts. Automaton has 36470 states and 117941 transitions. Word has length 16 [2019-12-18 18:49:17,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:49:17,032 INFO L462 AbstractCegarLoop]: Abstraction has 36470 states and 117941 transitions. [2019-12-18 18:49:17,032 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 18:49:17,032 INFO L276 IsEmpty]: Start isEmpty. Operand 36470 states and 117941 transitions. [2019-12-18 18:49:17,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-18 18:49:17,042 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:49:17,042 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 18:49:17,042 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:49:17,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:49:17,043 INFO L82 PathProgramCache]: Analyzing trace with hash -1783143627, now seen corresponding path program 1 times [2019-12-18 18:49:17,043 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:49:17,043 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [272774246] [2019-12-18 18:49:17,043 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:49:17,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:49:17,166 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 18:49:17,167 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [272774246] [2019-12-18 18:49:17,167 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:49:17,167 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 18:49:17,168 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1070478000] [2019-12-18 18:49:17,168 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 18:49:17,168 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:49:17,169 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 18:49:17,169 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-18 18:49:17,169 INFO L87 Difference]: Start difference. First operand 36470 states and 117941 transitions. Second operand 6 states. [2019-12-18 18:49:18,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:49:18,136 INFO L93 Difference]: Finished difference Result 56051 states and 176371 transitions. [2019-12-18 18:49:18,138 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 18:49:18,138 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2019-12-18 18:49:18,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:49:18,261 INFO L225 Difference]: With dead ends: 56051 [2019-12-18 18:49:18,262 INFO L226 Difference]: Without dead ends: 56037 [2019-12-18 18:49:18,262 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2019-12-18 18:49:18,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56037 states. [2019-12-18 18:49:21,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56037 to 37420. [2019-12-18 18:49:21,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37420 states. [2019-12-18 18:49:21,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37420 states to 37420 states and 120221 transitions. [2019-12-18 18:49:21,495 INFO L78 Accepts]: Start accepts. Automaton has 37420 states and 120221 transitions. Word has length 22 [2019-12-18 18:49:21,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:49:21,496 INFO L462 AbstractCegarLoop]: Abstraction has 37420 states and 120221 transitions. [2019-12-18 18:49:21,496 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 18:49:21,496 INFO L276 IsEmpty]: Start isEmpty. Operand 37420 states and 120221 transitions. [2019-12-18 18:49:21,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 18:49:21,510 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:49:21,510 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 18:49:21,511 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:49:21,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:49:21,511 INFO L82 PathProgramCache]: Analyzing trace with hash 1148876988, now seen corresponding path program 1 times [2019-12-18 18:49:21,511 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:49:21,511 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1324558676] [2019-12-18 18:49:21,512 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:49:21,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:49:21,571 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 18:49:21,572 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1324558676] [2019-12-18 18:49:21,572 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:49:21,573 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 18:49:21,573 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1966503485] [2019-12-18 18:49:21,573 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 18:49:21,573 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:49:21,574 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 18:49:21,574 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 18:49:21,574 INFO L87 Difference]: Start difference. First operand 37420 states and 120221 transitions. Second operand 4 states. [2019-12-18 18:49:21,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:49:21,648 INFO L93 Difference]: Finished difference Result 15281 states and 46378 transitions. [2019-12-18 18:49:21,648 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 18:49:21,649 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2019-12-18 18:49:21,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:49:21,670 INFO L225 Difference]: With dead ends: 15281 [2019-12-18 18:49:21,670 INFO L226 Difference]: Without dead ends: 15281 [2019-12-18 18:49:21,670 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 18:49:21,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15281 states. [2019-12-18 18:49:21,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15281 to 15023. [2019-12-18 18:49:21,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15023 states. [2019-12-18 18:49:21,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15023 states to 15023 states and 45642 transitions. [2019-12-18 18:49:21,900 INFO L78 Accepts]: Start accepts. Automaton has 15023 states and 45642 transitions. Word has length 25 [2019-12-18 18:49:21,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:49:21,900 INFO L462 AbstractCegarLoop]: Abstraction has 15023 states and 45642 transitions. [2019-12-18 18:49:21,901 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 18:49:21,901 INFO L276 IsEmpty]: Start isEmpty. Operand 15023 states and 45642 transitions. [2019-12-18 18:49:21,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-18 18:49:21,911 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:49:21,912 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 18:49:21,912 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:49:21,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:49:21,912 INFO L82 PathProgramCache]: Analyzing trace with hash -1026533913, now seen corresponding path program 1 times [2019-12-18 18:49:21,912 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:49:21,913 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [704397258] [2019-12-18 18:49:21,913 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:49:21,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:49:22,013 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 18:49:22,014 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [704397258] [2019-12-18 18:49:22,014 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:49:22,014 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 18:49:22,014 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1553754346] [2019-12-18 18:49:22,015 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 18:49:22,015 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:49:22,015 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 18:49:22,015 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-18 18:49:22,016 INFO L87 Difference]: Start difference. First operand 15023 states and 45642 transitions. Second operand 6 states. [2019-12-18 18:49:22,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:49:22,558 INFO L93 Difference]: Finished difference Result 21679 states and 63968 transitions. [2019-12-18 18:49:22,558 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-18 18:49:22,558 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2019-12-18 18:49:22,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:49:22,588 INFO L225 Difference]: With dead ends: 21679 [2019-12-18 18:49:22,589 INFO L226 Difference]: Without dead ends: 21679 [2019-12-18 18:49:22,589 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-12-18 18:49:22,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21679 states. [2019-12-18 18:49:22,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21679 to 17339. [2019-12-18 18:49:22,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17339 states. [2019-12-18 18:49:22,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17339 states to 17339 states and 52223 transitions. [2019-12-18 18:49:22,880 INFO L78 Accepts]: Start accepts. Automaton has 17339 states and 52223 transitions. Word has length 27 [2019-12-18 18:49:22,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:49:22,880 INFO L462 AbstractCegarLoop]: Abstraction has 17339 states and 52223 transitions. [2019-12-18 18:49:22,880 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 18:49:22,881 INFO L276 IsEmpty]: Start isEmpty. Operand 17339 states and 52223 transitions. [2019-12-18 18:49:22,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-18 18:49:22,898 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:49:22,898 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 18:49:22,898 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:49:22,898 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:49:22,898 INFO L82 PathProgramCache]: Analyzing trace with hash 1079552274, now seen corresponding path program 1 times [2019-12-18 18:49:22,898 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:49:22,899 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [778530228] [2019-12-18 18:49:22,899 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:49:22,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:49:23,012 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 18:49:23,012 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [778530228] [2019-12-18 18:49:23,012 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:49:23,012 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 18:49:23,013 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [988187532] [2019-12-18 18:49:23,013 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 18:49:23,013 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:49:23,014 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 18:49:23,014 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-18 18:49:23,014 INFO L87 Difference]: Start difference. First operand 17339 states and 52223 transitions. Second operand 7 states. [2019-12-18 18:49:24,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:49:24,250 INFO L93 Difference]: Finished difference Result 24589 states and 72044 transitions. [2019-12-18 18:49:24,250 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-18 18:49:24,250 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 33 [2019-12-18 18:49:24,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:49:24,285 INFO L225 Difference]: With dead ends: 24589 [2019-12-18 18:49:24,285 INFO L226 Difference]: Without dead ends: 24589 [2019-12-18 18:49:24,286 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=90, Invalid=252, Unknown=0, NotChecked=0, Total=342 [2019-12-18 18:49:24,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24589 states. [2019-12-18 18:49:24,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24589 to 16666. [2019-12-18 18:49:24,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16666 states. [2019-12-18 18:49:24,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16666 states to 16666 states and 50150 transitions. [2019-12-18 18:49:24,798 INFO L78 Accepts]: Start accepts. Automaton has 16666 states and 50150 transitions. Word has length 33 [2019-12-18 18:49:24,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:49:24,799 INFO L462 AbstractCegarLoop]: Abstraction has 16666 states and 50150 transitions. [2019-12-18 18:49:24,799 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 18:49:24,799 INFO L276 IsEmpty]: Start isEmpty. Operand 16666 states and 50150 transitions. [2019-12-18 18:49:24,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-18 18:49:24,820 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:49:24,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, 1, 1, 1, 1, 1] [2019-12-18 18:49:24,820 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:49:24,821 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:49:24,821 INFO L82 PathProgramCache]: Analyzing trace with hash 1641373212, now seen corresponding path program 1 times [2019-12-18 18:49:24,821 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:49:24,821 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1249175474] [2019-12-18 18:49:24,822 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:49:24,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:49:24,892 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 18:49:24,893 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1249175474] [2019-12-18 18:49:24,893 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:49:24,893 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 18:49:24,894 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1318152038] [2019-12-18 18:49:24,894 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 18:49:24,894 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:49:24,894 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 18:49:24,895 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 18:49:24,895 INFO L87 Difference]: Start difference. First operand 16666 states and 50150 transitions. Second operand 3 states. [2019-12-18 18:49:24,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:49:24,945 INFO L93 Difference]: Finished difference Result 16665 states and 50148 transitions. [2019-12-18 18:49:24,945 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 18:49:24,945 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2019-12-18 18:49:24,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:49:24,967 INFO L225 Difference]: With dead ends: 16665 [2019-12-18 18:49:24,967 INFO L226 Difference]: Without dead ends: 16665 [2019-12-18 18:49:24,968 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 18:49:25,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16665 states. [2019-12-18 18:49:25,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16665 to 16665. [2019-12-18 18:49:25,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16665 states. [2019-12-18 18:49:25,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16665 states to 16665 states and 50148 transitions. [2019-12-18 18:49:25,201 INFO L78 Accepts]: Start accepts. Automaton has 16665 states and 50148 transitions. Word has length 39 [2019-12-18 18:49:25,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:49:25,201 INFO L462 AbstractCegarLoop]: Abstraction has 16665 states and 50148 transitions. [2019-12-18 18:49:25,201 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 18:49:25,201 INFO L276 IsEmpty]: Start isEmpty. Operand 16665 states and 50148 transitions. [2019-12-18 18:49:25,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-18 18:49:25,220 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:49:25,221 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 18:49:25,221 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:49:25,221 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:49:25,221 INFO L82 PathProgramCache]: Analyzing trace with hash 1450973103, now seen corresponding path program 1 times [2019-12-18 18:49:25,221 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:49:25,221 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [448549163] [2019-12-18 18:49:25,221 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:49:25,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:49:25,286 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 18:49:25,286 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [448549163] [2019-12-18 18:49:25,286 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:49:25,287 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 18:49:25,287 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1666753032] [2019-12-18 18:49:25,287 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 18:49:25,287 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:49:25,287 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 18:49:25,288 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 18:49:25,288 INFO L87 Difference]: Start difference. First operand 16665 states and 50148 transitions. Second operand 4 states. [2019-12-18 18:49:25,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:49:25,425 INFO L93 Difference]: Finished difference Result 31503 states and 94864 transitions. [2019-12-18 18:49:25,425 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 18:49:25,425 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 40 [2019-12-18 18:49:25,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:49:25,460 INFO L225 Difference]: With dead ends: 31503 [2019-12-18 18:49:25,460 INFO L226 Difference]: Without dead ends: 16332 [2019-12-18 18:49:25,461 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 18:49:25,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16332 states. [2019-12-18 18:49:25,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16332 to 16328. [2019-12-18 18:49:25,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16328 states. [2019-12-18 18:49:25,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16328 states to 16328 states and 48458 transitions. [2019-12-18 18:49:25,803 INFO L78 Accepts]: Start accepts. Automaton has 16328 states and 48458 transitions. Word has length 40 [2019-12-18 18:49:25,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:49:25,803 INFO L462 AbstractCegarLoop]: Abstraction has 16328 states and 48458 transitions. [2019-12-18 18:49:25,803 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 18:49:25,803 INFO L276 IsEmpty]: Start isEmpty. Operand 16328 states and 48458 transitions. [2019-12-18 18:49:25,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-18 18:49:25,822 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:49:25,822 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 18:49:25,823 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:49:25,823 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:49:25,823 INFO L82 PathProgramCache]: Analyzing trace with hash -1753570543, now seen corresponding path program 2 times [2019-12-18 18:49:25,823 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:49:25,823 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [119257541] [2019-12-18 18:49:25,824 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:49:25,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:49:25,914 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 18:49:25,914 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [119257541] [2019-12-18 18:49:25,914 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:49:25,914 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 18:49:25,915 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [331324984] [2019-12-18 18:49:25,915 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 18:49:25,915 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:49:25,916 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 18:49:25,916 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 18:49:25,916 INFO L87 Difference]: Start difference. First operand 16328 states and 48458 transitions. Second operand 5 states. [2019-12-18 18:49:26,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:49:26,542 INFO L93 Difference]: Finished difference Result 22499 states and 66522 transitions. [2019-12-18 18:49:26,542 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 18:49:26,542 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 40 [2019-12-18 18:49:26,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:49:26,573 INFO L225 Difference]: With dead ends: 22499 [2019-12-18 18:49:26,574 INFO L226 Difference]: Without dead ends: 22499 [2019-12-18 18:49:26,574 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-18 18:49:26,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22499 states. [2019-12-18 18:49:27,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22499 to 21006. [2019-12-18 18:49:27,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21006 states. [2019-12-18 18:49:27,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21006 states to 21006 states and 62454 transitions. [2019-12-18 18:49:27,098 INFO L78 Accepts]: Start accepts. Automaton has 21006 states and 62454 transitions. Word has length 40 [2019-12-18 18:49:27,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:49:27,099 INFO L462 AbstractCegarLoop]: Abstraction has 21006 states and 62454 transitions. [2019-12-18 18:49:27,099 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 18:49:27,099 INFO L276 IsEmpty]: Start isEmpty. Operand 21006 states and 62454 transitions. [2019-12-18 18:49:27,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-18 18:49:27,118 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:49:27,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] [2019-12-18 18:49:27,118 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:49:27,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:49:27,118 INFO L82 PathProgramCache]: Analyzing trace with hash 1960596885, now seen corresponding path program 3 times [2019-12-18 18:49:27,118 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:49:27,119 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1214159200] [2019-12-18 18:49:27,119 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:49:27,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:49:27,180 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 18:49:27,181 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1214159200] [2019-12-18 18:49:27,181 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:49:27,181 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 18:49:27,181 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1969099349] [2019-12-18 18:49:27,182 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 18:49:27,182 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:49:27,182 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 18:49:27,182 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-18 18:49:27,182 INFO L87 Difference]: Start difference. First operand 21006 states and 62454 transitions. Second operand 5 states. [2019-12-18 18:49:27,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:49:27,281 INFO L93 Difference]: Finished difference Result 19781 states and 59627 transitions. [2019-12-18 18:49:27,282 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 18:49:27,282 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 40 [2019-12-18 18:49:27,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:49:27,314 INFO L225 Difference]: With dead ends: 19781 [2019-12-18 18:49:27,314 INFO L226 Difference]: Without dead ends: 19287 [2019-12-18 18:49:27,315 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-18 18:49:27,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19287 states. [2019-12-18 18:49:27,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19287 to 18447. [2019-12-18 18:49:27,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18447 states. [2019-12-18 18:49:27,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18447 states to 18447 states and 56396 transitions. [2019-12-18 18:49:27,594 INFO L78 Accepts]: Start accepts. Automaton has 18447 states and 56396 transitions. Word has length 40 [2019-12-18 18:49:27,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:49:27,595 INFO L462 AbstractCegarLoop]: Abstraction has 18447 states and 56396 transitions. [2019-12-18 18:49:27,595 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 18:49:27,595 INFO L276 IsEmpty]: Start isEmpty. Operand 18447 states and 56396 transitions. [2019-12-18 18:49:27,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-18 18:49:27,617 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:49:27,618 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 18:49:27,618 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:49:27,618 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:49:27,618 INFO L82 PathProgramCache]: Analyzing trace with hash -48564843, now seen corresponding path program 1 times [2019-12-18 18:49:27,618 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:49:27,619 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [983405261] [2019-12-18 18:49:27,619 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:49:27,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:49:27,674 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 18:49:27,674 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [983405261] [2019-12-18 18:49:27,674 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:49:27,675 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 18:49:27,675 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [718316160] [2019-12-18 18:49:27,675 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 18:49:27,675 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:49:27,676 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 18:49:27,676 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 18:49:27,676 INFO L87 Difference]: Start difference. First operand 18447 states and 56396 transitions. Second operand 3 states. [2019-12-18 18:49:27,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:49:27,821 INFO L93 Difference]: Finished difference Result 27408 states and 83933 transitions. [2019-12-18 18:49:27,822 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 18:49:27,822 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 64 [2019-12-18 18:49:27,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:49:27,870 INFO L225 Difference]: With dead ends: 27408 [2019-12-18 18:49:27,870 INFO L226 Difference]: Without dead ends: 27408 [2019-12-18 18:49:27,875 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 18:49:27,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27408 states. [2019-12-18 18:49:28,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27408 to 20833. [2019-12-18 18:49:28,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20833 states. [2019-12-18 18:49:28,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20833 states to 20833 states and 64483 transitions. [2019-12-18 18:49:28,251 INFO L78 Accepts]: Start accepts. Automaton has 20833 states and 64483 transitions. Word has length 64 [2019-12-18 18:49:28,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:49:28,251 INFO L462 AbstractCegarLoop]: Abstraction has 20833 states and 64483 transitions. [2019-12-18 18:49:28,251 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 18:49:28,252 INFO L276 IsEmpty]: Start isEmpty. Operand 20833 states and 64483 transitions. [2019-12-18 18:49:28,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-18 18:49:28,281 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:49:28,281 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 18:49:28,281 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:49:28,281 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:49:28,281 INFO L82 PathProgramCache]: Analyzing trace with hash -1559426519, now seen corresponding path program 1 times [2019-12-18 18:49:28,282 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:49:28,282 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2093363496] [2019-12-18 18:49:28,282 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:49:28,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:49:28,364 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 18:49:28,365 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2093363496] [2019-12-18 18:49:28,365 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:49:28,365 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 18:49:28,365 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [373291227] [2019-12-18 18:49:28,365 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 18:49:28,366 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:49:28,366 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 18:49:28,366 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-18 18:49:28,366 INFO L87 Difference]: Start difference. First operand 20833 states and 64483 transitions. Second operand 7 states. [2019-12-18 18:49:28,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:49:28,903 INFO L93 Difference]: Finished difference Result 61323 states and 187457 transitions. [2019-12-18 18:49:28,904 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 18:49:28,904 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 64 [2019-12-18 18:49:28,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:49:28,979 INFO L225 Difference]: With dead ends: 61323 [2019-12-18 18:49:28,979 INFO L226 Difference]: Without dead ends: 42147 [2019-12-18 18:49:28,979 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2019-12-18 18:49:29,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42147 states. [2019-12-18 18:49:29,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42147 to 23713. [2019-12-18 18:49:29,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23713 states. [2019-12-18 18:49:29,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23713 states to 23713 states and 73274 transitions. [2019-12-18 18:49:29,689 INFO L78 Accepts]: Start accepts. Automaton has 23713 states and 73274 transitions. Word has length 64 [2019-12-18 18:49:29,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:49:29,689 INFO L462 AbstractCegarLoop]: Abstraction has 23713 states and 73274 transitions. [2019-12-18 18:49:29,689 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 18:49:29,689 INFO L276 IsEmpty]: Start isEmpty. Operand 23713 states and 73274 transitions. [2019-12-18 18:49:29,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-18 18:49:29,715 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:49:29,715 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 18:49:29,715 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:49:29,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:49:29,715 INFO L82 PathProgramCache]: Analyzing trace with hash 1388462743, now seen corresponding path program 2 times [2019-12-18 18:49:29,716 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:49:29,716 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [352390008] [2019-12-18 18:49:29,716 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:49:29,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:49:29,804 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 18:49:29,805 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [352390008] [2019-12-18 18:49:29,805 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:49:29,805 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 18:49:29,805 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1629334428] [2019-12-18 18:49:29,806 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 18:49:29,806 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:49:29,806 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 18:49:29,806 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-18 18:49:29,807 INFO L87 Difference]: Start difference. First operand 23713 states and 73274 transitions. Second operand 7 states. [2019-12-18 18:49:30,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:49:30,438 INFO L93 Difference]: Finished difference Result 68574 states and 211095 transitions. [2019-12-18 18:49:30,439 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-18 18:49:30,439 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 64 [2019-12-18 18:49:30,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:49:30,551 INFO L225 Difference]: With dead ends: 68574 [2019-12-18 18:49:30,551 INFO L226 Difference]: Without dead ends: 51641 [2019-12-18 18:49:30,554 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=53, Invalid=157, Unknown=0, NotChecked=0, Total=210 [2019-12-18 18:49:30,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51641 states. [2019-12-18 18:49:31,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51641 to 27716. [2019-12-18 18:49:31,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27716 states. [2019-12-18 18:49:31,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27716 states to 27716 states and 86140 transitions. [2019-12-18 18:49:31,206 INFO L78 Accepts]: Start accepts. Automaton has 27716 states and 86140 transitions. Word has length 64 [2019-12-18 18:49:31,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:49:31,206 INFO L462 AbstractCegarLoop]: Abstraction has 27716 states and 86140 transitions. [2019-12-18 18:49:31,206 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 18:49:31,206 INFO L276 IsEmpty]: Start isEmpty. Operand 27716 states and 86140 transitions. [2019-12-18 18:49:31,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-18 18:49:31,240 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:49:31,240 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 18:49:31,240 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:49:31,241 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:49:31,241 INFO L82 PathProgramCache]: Analyzing trace with hash -317627445, now seen corresponding path program 3 times [2019-12-18 18:49:31,241 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:49:31,241 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1952811667] [2019-12-18 18:49:31,241 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:49:31,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:49:31,324 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 18:49:31,325 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1952811667] [2019-12-18 18:49:31,325 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:49:31,325 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 18:49:31,326 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [671022095] [2019-12-18 18:49:31,326 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 18:49:31,326 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:49:31,326 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 18:49:31,326 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-18 18:49:31,327 INFO L87 Difference]: Start difference. First operand 27716 states and 86140 transitions. Second operand 7 states. [2019-12-18 18:49:32,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:49:32,084 INFO L93 Difference]: Finished difference Result 58876 states and 180784 transitions. [2019-12-18 18:49:32,085 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-18 18:49:32,085 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 64 [2019-12-18 18:49:32,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:49:32,156 INFO L225 Difference]: With dead ends: 58876 [2019-12-18 18:49:32,156 INFO L226 Difference]: Without dead ends: 51661 [2019-12-18 18:49:32,157 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 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-18 18:49:32,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51661 states. [2019-12-18 18:49:32,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51661 to 28024. [2019-12-18 18:49:32,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28024 states. [2019-12-18 18:49:32,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28024 states to 28024 states and 87091 transitions. [2019-12-18 18:49:32,741 INFO L78 Accepts]: Start accepts. Automaton has 28024 states and 87091 transitions. Word has length 64 [2019-12-18 18:49:32,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:49:32,741 INFO L462 AbstractCegarLoop]: Abstraction has 28024 states and 87091 transitions. [2019-12-18 18:49:32,741 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 18:49:32,741 INFO L276 IsEmpty]: Start isEmpty. Operand 28024 states and 87091 transitions. [2019-12-18 18:49:32,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-18 18:49:32,771 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:49:32,771 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 18:49:32,771 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:49:32,771 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:49:32,771 INFO L82 PathProgramCache]: Analyzing trace with hash -1087297877, now seen corresponding path program 4 times [2019-12-18 18:49:32,772 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:49:32,772 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2052939136] [2019-12-18 18:49:32,772 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:49:32,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:49:32,826 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 18:49:32,826 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2052939136] [2019-12-18 18:49:32,827 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:49:32,827 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 18:49:32,827 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [193280736] [2019-12-18 18:49:32,827 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 18:49:32,828 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:49:32,828 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 18:49:32,828 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 18:49:32,828 INFO L87 Difference]: Start difference. First operand 28024 states and 87091 transitions. Second operand 3 states. [2019-12-18 18:49:33,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:49:33,003 INFO L93 Difference]: Finished difference Result 33789 states and 104171 transitions. [2019-12-18 18:49:33,003 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 18:49:33,003 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 64 [2019-12-18 18:49:33,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:49:33,055 INFO L225 Difference]: With dead ends: 33789 [2019-12-18 18:49:33,055 INFO L226 Difference]: Without dead ends: 33789 [2019-12-18 18:49:33,056 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 18:49:33,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33789 states. [2019-12-18 18:49:33,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33789 to 29603. [2019-12-18 18:49:33,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29603 states. [2019-12-18 18:49:33,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29603 states to 29603 states and 91943 transitions. [2019-12-18 18:49:33,589 INFO L78 Accepts]: Start accepts. Automaton has 29603 states and 91943 transitions. Word has length 64 [2019-12-18 18:49:33,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:49:33,589 INFO L462 AbstractCegarLoop]: Abstraction has 29603 states and 91943 transitions. [2019-12-18 18:49:33,589 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 18:49:33,589 INFO L276 IsEmpty]: Start isEmpty. Operand 29603 states and 91943 transitions. [2019-12-18 18:49:33,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 18:49:33,627 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:49:33,627 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 18:49:33,627 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:49:33,627 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:49:33,627 INFO L82 PathProgramCache]: Analyzing trace with hash -181535548, now seen corresponding path program 1 times [2019-12-18 18:49:33,628 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:49:33,628 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1636071981] [2019-12-18 18:49:33,628 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:49:33,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:49:33,685 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 18:49:33,686 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1636071981] [2019-12-18 18:49:33,686 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:49:33,686 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 18:49:33,687 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1414920931] [2019-12-18 18:49:33,687 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 18:49:33,687 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:49:33,687 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 18:49:33,688 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 18:49:33,688 INFO L87 Difference]: Start difference. First operand 29603 states and 91943 transitions. Second operand 4 states. [2019-12-18 18:49:34,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:49:34,064 INFO L93 Difference]: Finished difference Result 45817 states and 143094 transitions. [2019-12-18 18:49:34,064 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 18:49:34,065 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 65 [2019-12-18 18:49:34,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:49:34,136 INFO L225 Difference]: With dead ends: 45817 [2019-12-18 18:49:34,136 INFO L226 Difference]: Without dead ends: 45817 [2019-12-18 18:49:34,137 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 18:49:34,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45817 states. [2019-12-18 18:49:34,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45817 to 31959. [2019-12-18 18:49:34,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31959 states. [2019-12-18 18:49:34,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31959 states to 31959 states and 100397 transitions. [2019-12-18 18:49:34,939 INFO L78 Accepts]: Start accepts. Automaton has 31959 states and 100397 transitions. Word has length 65 [2019-12-18 18:49:34,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:49:34,939 INFO L462 AbstractCegarLoop]: Abstraction has 31959 states and 100397 transitions. [2019-12-18 18:49:34,939 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 18:49:34,939 INFO L276 IsEmpty]: Start isEmpty. Operand 31959 states and 100397 transitions. [2019-12-18 18:49:34,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 18:49:34,974 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:49:34,974 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 18:49:34,974 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:49:34,974 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:49:34,975 INFO L82 PathProgramCache]: Analyzing trace with hash -701292531, now seen corresponding path program 1 times [2019-12-18 18:49:34,975 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:49:34,975 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1108088070] [2019-12-18 18:49:34,975 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:49:34,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:49:35,056 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 18:49:35,056 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1108088070] [2019-12-18 18:49:35,056 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:49:35,057 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 18:49:35,057 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [822254590] [2019-12-18 18:49:35,057 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 18:49:35,057 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:49:35,058 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 18:49:35,058 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-18 18:49:35,058 INFO L87 Difference]: Start difference. First operand 31959 states and 100397 transitions. Second operand 7 states. [2019-12-18 18:49:35,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:49:35,630 INFO L93 Difference]: Finished difference Result 69632 states and 216004 transitions. [2019-12-18 18:49:35,630 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-18 18:49:35,631 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 65 [2019-12-18 18:49:35,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:49:35,761 INFO L225 Difference]: With dead ends: 69632 [2019-12-18 18:49:35,761 INFO L226 Difference]: Without dead ends: 63631 [2019-12-18 18:49:35,761 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2019-12-18 18:49:35,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63631 states. [2019-12-18 18:49:36,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63631 to 31991. [2019-12-18 18:49:36,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31991 states. [2019-12-18 18:49:36,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31991 states to 31991 states and 100515 transitions. [2019-12-18 18:49:36,537 INFO L78 Accepts]: Start accepts. Automaton has 31991 states and 100515 transitions. Word has length 65 [2019-12-18 18:49:36,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:49:36,537 INFO L462 AbstractCegarLoop]: Abstraction has 31991 states and 100515 transitions. [2019-12-18 18:49:36,537 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 18:49:36,537 INFO L276 IsEmpty]: Start isEmpty. Operand 31991 states and 100515 transitions. [2019-12-18 18:49:36,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 18:49:36,576 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:49:36,576 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 18:49:36,576 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:49:36,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:49:36,576 INFO L82 PathProgramCache]: Analyzing trace with hash -1336640005, now seen corresponding path program 2 times [2019-12-18 18:49:36,577 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:49:36,577 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [345429319] [2019-12-18 18:49:36,577 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:49:36,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:49:36,709 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 18:49:36,709 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [345429319] [2019-12-18 18:49:36,709 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:49:36,710 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 18:49:36,710 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1224622134] [2019-12-18 18:49:36,710 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 18:49:36,710 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:49:36,711 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 18:49:36,711 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-12-18 18:49:36,711 INFO L87 Difference]: Start difference. First operand 31991 states and 100515 transitions. Second operand 7 states. [2019-12-18 18:49:37,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:49:37,844 INFO L93 Difference]: Finished difference Result 44848 states and 139960 transitions. [2019-12-18 18:49:37,845 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-18 18:49:37,845 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 65 [2019-12-18 18:49:37,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:49:37,908 INFO L225 Difference]: With dead ends: 44848 [2019-12-18 18:49:37,909 INFO L226 Difference]: Without dead ends: 44844 [2019-12-18 18:49:37,909 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2019-12-18 18:49:38,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44844 states. [2019-12-18 18:49:38,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44844 to 32249. [2019-12-18 18:49:38,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32249 states. [2019-12-18 18:49:38,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32249 states to 32249 states and 99750 transitions. [2019-12-18 18:49:38,499 INFO L78 Accepts]: Start accepts. Automaton has 32249 states and 99750 transitions. Word has length 65 [2019-12-18 18:49:38,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:49:38,499 INFO L462 AbstractCegarLoop]: Abstraction has 32249 states and 99750 transitions. [2019-12-18 18:49:38,499 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 18:49:38,499 INFO L276 IsEmpty]: Start isEmpty. Operand 32249 states and 99750 transitions. [2019-12-18 18:49:38,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 18:49:38,534 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:49:38,534 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 18:49:38,534 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:49:38,534 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:49:38,534 INFO L82 PathProgramCache]: Analyzing trace with hash -152741241, now seen corresponding path program 1 times [2019-12-18 18:49:38,534 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:49:38,534 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [540996081] [2019-12-18 18:49:38,535 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:49:38,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:49:38,574 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 18:49:38,575 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [540996081] [2019-12-18 18:49:38,575 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:49:38,575 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 18:49:38,575 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [269542362] [2019-12-18 18:49:38,576 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 18:49:38,576 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:49:38,576 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 18:49:38,576 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 18:49:38,576 INFO L87 Difference]: Start difference. First operand 32249 states and 99750 transitions. Second operand 3 states. [2019-12-18 18:49:38,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:49:38,823 INFO L93 Difference]: Finished difference Result 43160 states and 132643 transitions. [2019-12-18 18:49:38,824 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 18:49:38,824 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-18 18:49:38,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:49:38,883 INFO L225 Difference]: With dead ends: 43160 [2019-12-18 18:49:38,883 INFO L226 Difference]: Without dead ends: 43160 [2019-12-18 18:49:38,883 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 18:49:39,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43160 states. [2019-12-18 18:49:39,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43160 to 32489. [2019-12-18 18:49:39,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32489 states. [2019-12-18 18:49:39,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32489 states to 32489 states and 100545 transitions. [2019-12-18 18:49:39,446 INFO L78 Accepts]: Start accepts. Automaton has 32489 states and 100545 transitions. Word has length 65 [2019-12-18 18:49:39,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:49:39,446 INFO L462 AbstractCegarLoop]: Abstraction has 32489 states and 100545 transitions. [2019-12-18 18:49:39,446 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 18:49:39,446 INFO L276 IsEmpty]: Start isEmpty. Operand 32489 states and 100545 transitions. [2019-12-18 18:49:39,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 18:49:39,492 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:49:39,492 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 18:49:39,492 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:49:39,493 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:49:39,493 INFO L82 PathProgramCache]: Analyzing trace with hash -422803263, now seen corresponding path program 2 times [2019-12-18 18:49:39,493 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:49:39,493 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2039842698] [2019-12-18 18:49:39,493 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:49:39,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:49:39,602 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 18:49:39,602 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2039842698] [2019-12-18 18:49:39,603 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:49:39,603 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 18:49:39,603 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [521565685] [2019-12-18 18:49:39,603 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 18:49:39,604 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:49:39,604 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 18:49:39,605 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-18 18:49:39,606 INFO L87 Difference]: Start difference. First operand 32489 states and 100545 transitions. Second operand 7 states. [2019-12-18 18:49:40,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:49:40,453 INFO L93 Difference]: Finished difference Result 52071 states and 162140 transitions. [2019-12-18 18:49:40,454 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-18 18:49:40,454 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 65 [2019-12-18 18:49:40,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:49:40,530 INFO L225 Difference]: With dead ends: 52071 [2019-12-18 18:49:40,531 INFO L226 Difference]: Without dead ends: 52071 [2019-12-18 18:49:40,531 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2019-12-18 18:49:40,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52071 states. [2019-12-18 18:49:41,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52071 to 33507. [2019-12-18 18:49:41,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33507 states. [2019-12-18 18:49:41,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33507 states to 33507 states and 103713 transitions. [2019-12-18 18:49:41,185 INFO L78 Accepts]: Start accepts. Automaton has 33507 states and 103713 transitions. Word has length 65 [2019-12-18 18:49:41,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:49:41,185 INFO L462 AbstractCegarLoop]: Abstraction has 33507 states and 103713 transitions. [2019-12-18 18:49:41,185 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 18:49:41,185 INFO L276 IsEmpty]: Start isEmpty. Operand 33507 states and 103713 transitions. [2019-12-18 18:49:41,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 18:49:41,220 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:49:41,220 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 18:49:41,220 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:49:41,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:49:41,220 INFO L82 PathProgramCache]: Analyzing trace with hash 1008271868, now seen corresponding path program 1 times [2019-12-18 18:49:41,220 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:49:41,221 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1995510486] [2019-12-18 18:49:41,221 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:49:41,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:49:41,288 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 18:49:41,289 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1995510486] [2019-12-18 18:49:41,289 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:49:41,289 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 18:49:41,289 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [559695481] [2019-12-18 18:49:41,290 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 18:49:41,290 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:49:41,290 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 18:49:41,290 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 18:49:41,290 INFO L87 Difference]: Start difference. First operand 33507 states and 103713 transitions. Second operand 4 states. [2019-12-18 18:49:41,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:49:41,486 INFO L93 Difference]: Finished difference Result 33507 states and 103505 transitions. [2019-12-18 18:49:41,486 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 18:49:41,486 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 65 [2019-12-18 18:49:41,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:49:41,536 INFO L225 Difference]: With dead ends: 33507 [2019-12-18 18:49:41,537 INFO L226 Difference]: Without dead ends: 33507 [2019-12-18 18:49:41,537 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 18:49:41,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33507 states. [2019-12-18 18:49:41,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33507 to 28069. [2019-12-18 18:49:41,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28069 states. [2019-12-18 18:49:41,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28069 states to 28069 states and 85930 transitions. [2019-12-18 18:49:41,991 INFO L78 Accepts]: Start accepts. Automaton has 28069 states and 85930 transitions. Word has length 65 [2019-12-18 18:49:41,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:49:41,991 INFO L462 AbstractCegarLoop]: Abstraction has 28069 states and 85930 transitions. [2019-12-18 18:49:41,991 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 18:49:41,991 INFO L276 IsEmpty]: Start isEmpty. Operand 28069 states and 85930 transitions. [2019-12-18 18:49:42,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 18:49:42,021 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:49:42,021 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 18:49:42,021 INFO L410 AbstractCegarLoop]: === Iteration 24 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:49:42,021 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:49:42,021 INFO L82 PathProgramCache]: Analyzing trace with hash 148182117, now seen corresponding path program 1 times [2019-12-18 18:49:42,022 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:49:42,022 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [95666199] [2019-12-18 18:49:42,022 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:49:42,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:49:42,087 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 18:49:42,087 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [95666199] [2019-12-18 18:49:42,087 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:49:42,087 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 18:49:42,088 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1374823200] [2019-12-18 18:49:42,088 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 18:49:42,088 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:49:42,088 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 18:49:42,089 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 18:49:42,089 INFO L87 Difference]: Start difference. First operand 28069 states and 85930 transitions. Second operand 5 states. [2019-12-18 18:49:42,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:49:42,757 INFO L93 Difference]: Finished difference Result 40500 states and 121827 transitions. [2019-12-18 18:49:42,758 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 18:49:42,758 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 65 [2019-12-18 18:49:42,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:49:42,850 INFO L225 Difference]: With dead ends: 40500 [2019-12-18 18:49:42,850 INFO L226 Difference]: Without dead ends: 40276 [2019-12-18 18:49:42,851 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-18 18:49:43,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40276 states. [2019-12-18 18:49:44,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40276 to 32300. [2019-12-18 18:49:44,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32300 states. [2019-12-18 18:49:44,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32300 states to 32300 states and 98642 transitions. [2019-12-18 18:49:44,140 INFO L78 Accepts]: Start accepts. Automaton has 32300 states and 98642 transitions. Word has length 65 [2019-12-18 18:49:44,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:49:44,141 INFO L462 AbstractCegarLoop]: Abstraction has 32300 states and 98642 transitions. [2019-12-18 18:49:44,141 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 18:49:44,141 INFO L276 IsEmpty]: Start isEmpty. Operand 32300 states and 98642 transitions. [2019-12-18 18:49:44,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 18:49:44,192 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:49:44,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] [2019-12-18 18:49:44,193 INFO L410 AbstractCegarLoop]: === Iteration 25 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:49:44,193 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:49:44,193 INFO L82 PathProgramCache]: Analyzing trace with hash -272998531, now seen corresponding path program 2 times [2019-12-18 18:49:44,193 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:49:44,194 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1835258084] [2019-12-18 18:49:44,194 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:49:44,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:49:44,435 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 18:49:44,435 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1835258084] [2019-12-18 18:49:44,436 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:49:44,436 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-18 18:49:44,436 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [330473279] [2019-12-18 18:49:44,437 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 18:49:44,437 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:49:44,437 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 18:49:44,438 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-12-18 18:49:44,438 INFO L87 Difference]: Start difference. First operand 32300 states and 98642 transitions. Second operand 9 states. [2019-12-18 18:49:46,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:49:46,117 INFO L93 Difference]: Finished difference Result 49096 states and 148270 transitions. [2019-12-18 18:49:46,118 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-18 18:49:46,118 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 65 [2019-12-18 18:49:46,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:49:46,196 INFO L225 Difference]: With dead ends: 49096 [2019-12-18 18:49:46,196 INFO L226 Difference]: Without dead ends: 49000 [2019-12-18 18:49:46,196 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 3 SyntacticMatches, 4 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=74, Invalid=198, Unknown=0, NotChecked=0, Total=272 [2019-12-18 18:49:46,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49000 states. [2019-12-18 18:49:46,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49000 to 33469. [2019-12-18 18:49:46,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33469 states. [2019-12-18 18:49:46,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33469 states to 33469 states and 102034 transitions. [2019-12-18 18:49:46,869 INFO L78 Accepts]: Start accepts. Automaton has 33469 states and 102034 transitions. Word has length 65 [2019-12-18 18:49:46,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:49:46,869 INFO L462 AbstractCegarLoop]: Abstraction has 33469 states and 102034 transitions. [2019-12-18 18:49:46,869 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 18:49:46,869 INFO L276 IsEmpty]: Start isEmpty. Operand 33469 states and 102034 transitions. [2019-12-18 18:49:46,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 18:49:46,908 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:49:46,909 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 18:49:46,909 INFO L410 AbstractCegarLoop]: === Iteration 26 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:49:46,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:49:46,909 INFO L82 PathProgramCache]: Analyzing trace with hash 312846933, now seen corresponding path program 3 times [2019-12-18 18:49:46,909 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:49:46,909 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [670368749] [2019-12-18 18:49:46,909 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:49:46,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:49:47,087 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 18:49:47,087 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [670368749] [2019-12-18 18:49:47,088 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:49:47,088 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-18 18:49:47,088 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [757116703] [2019-12-18 18:49:47,088 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-18 18:49:47,088 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:49:47,089 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-18 18:49:47,089 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2019-12-18 18:49:47,089 INFO L87 Difference]: Start difference. First operand 33469 states and 102034 transitions. Second operand 11 states. [2019-12-18 18:49:50,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:49:50,096 INFO L93 Difference]: Finished difference Result 51780 states and 155567 transitions. [2019-12-18 18:49:50,096 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-12-18 18:49:50,096 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 65 [2019-12-18 18:49:50,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:49:50,170 INFO L225 Difference]: With dead ends: 51780 [2019-12-18 18:49:50,170 INFO L226 Difference]: Without dead ends: 51472 [2019-12-18 18:49:50,170 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 4 SyntacticMatches, 3 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 246 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=230, Invalid=892, Unknown=0, NotChecked=0, Total=1122 [2019-12-18 18:49:50,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51472 states. [2019-12-18 18:49:50,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51472 to 36360. [2019-12-18 18:49:50,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36360 states. [2019-12-18 18:49:50,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36360 states to 36360 states and 110560 transitions. [2019-12-18 18:49:50,830 INFO L78 Accepts]: Start accepts. Automaton has 36360 states and 110560 transitions. Word has length 65 [2019-12-18 18:49:50,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:49:50,830 INFO L462 AbstractCegarLoop]: Abstraction has 36360 states and 110560 transitions. [2019-12-18 18:49:50,830 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-18 18:49:50,830 INFO L276 IsEmpty]: Start isEmpty. Operand 36360 states and 110560 transitions. [2019-12-18 18:49:50,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 18:49:50,866 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:49:50,866 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 18:49:50,867 INFO L410 AbstractCegarLoop]: === Iteration 27 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:49:50,867 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:49:50,867 INFO L82 PathProgramCache]: Analyzing trace with hash -1178106421, now seen corresponding path program 4 times [2019-12-18 18:49:50,867 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:49:50,867 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1909964603] [2019-12-18 18:49:50,867 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:49:50,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:49:50,933 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 18:49:50,934 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1909964603] [2019-12-18 18:49:50,934 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:49:50,934 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 18:49:50,934 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1183831981] [2019-12-18 18:49:50,934 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 18:49:50,935 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:49:50,935 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 18:49:50,935 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 18:49:50,935 INFO L87 Difference]: Start difference. First operand 36360 states and 110560 transitions. Second operand 3 states. [2019-12-18 18:49:51,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:49:51,083 INFO L93 Difference]: Finished difference Result 36360 states and 110559 transitions. [2019-12-18 18:49:51,084 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 18:49:51,084 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-18 18:49:51,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:49:51,156 INFO L225 Difference]: With dead ends: 36360 [2019-12-18 18:49:51,156 INFO L226 Difference]: Without dead ends: 36360 [2019-12-18 18:49:51,156 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 18:49:51,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36360 states. [2019-12-18 18:49:51,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36360 to 29373. [2019-12-18 18:49:51,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29373 states. [2019-12-18 18:49:51,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29373 states to 29373 states and 91197 transitions. [2019-12-18 18:49:51,689 INFO L78 Accepts]: Start accepts. Automaton has 29373 states and 91197 transitions. Word has length 65 [2019-12-18 18:49:51,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:49:51,689 INFO L462 AbstractCegarLoop]: Abstraction has 29373 states and 91197 transitions. [2019-12-18 18:49:51,689 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 18:49:51,689 INFO L276 IsEmpty]: Start isEmpty. Operand 29373 states and 91197 transitions. [2019-12-18 18:49:51,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 18:49:51,722 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:49:51,722 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 18:49:51,723 INFO L410 AbstractCegarLoop]: === Iteration 28 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:49:51,723 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:49:51,723 INFO L82 PathProgramCache]: Analyzing trace with hash 1560089001, now seen corresponding path program 1 times [2019-12-18 18:49:51,723 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:49:51,723 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2109825911] [2019-12-18 18:49:51,723 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:49:51,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:49:51,921 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 18:49:51,922 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2109825911] [2019-12-18 18:49:51,922 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:49:51,922 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-18 18:49:51,923 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1538037732] [2019-12-18 18:49:51,923 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-18 18:49:51,923 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:49:51,923 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-18 18:49:51,923 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2019-12-18 18:49:51,924 INFO L87 Difference]: Start difference. First operand 29373 states and 91197 transitions. Second operand 11 states. [2019-12-18 18:49:54,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:49:54,038 INFO L93 Difference]: Finished difference Result 46019 states and 140289 transitions. [2019-12-18 18:49:54,038 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-18 18:49:54,038 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 66 [2019-12-18 18:49:54,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:49:54,106 INFO L225 Difference]: With dead ends: 46019 [2019-12-18 18:49:54,107 INFO L226 Difference]: Without dead ends: 46019 [2019-12-18 18:49:54,107 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 2 SyntacticMatches, 4 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=123, Invalid=429, Unknown=0, NotChecked=0, Total=552 [2019-12-18 18:49:54,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46019 states. [2019-12-18 18:49:54,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46019 to 29884. [2019-12-18 18:49:54,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29884 states. [2019-12-18 18:49:54,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29884 states to 29884 states and 92931 transitions. [2019-12-18 18:49:54,716 INFO L78 Accepts]: Start accepts. Automaton has 29884 states and 92931 transitions. Word has length 66 [2019-12-18 18:49:54,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:49:54,717 INFO L462 AbstractCegarLoop]: Abstraction has 29884 states and 92931 transitions. [2019-12-18 18:49:54,717 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-18 18:49:54,717 INFO L276 IsEmpty]: Start isEmpty. Operand 29884 states and 92931 transitions. [2019-12-18 18:49:54,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 18:49:54,750 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:49:54,750 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 18:49:54,750 INFO L410 AbstractCegarLoop]: === Iteration 29 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:49:54,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:49:54,750 INFO L82 PathProgramCache]: Analyzing trace with hash -353775189, now seen corresponding path program 2 times [2019-12-18 18:49:54,751 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:49:54,751 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [415298504] [2019-12-18 18:49:54,751 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:49:54,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:49:54,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-18 18:49:54,812 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [415298504] [2019-12-18 18:49:54,812 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:49:54,813 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 18:49:54,813 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1816951117] [2019-12-18 18:49:54,813 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 18:49:54,813 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:49:54,813 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 18:49:54,814 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 18:49:54,814 INFO L87 Difference]: Start difference. First operand 29884 states and 92931 transitions. Second operand 3 states. [2019-12-18 18:49:54,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:49:54,917 INFO L93 Difference]: Finished difference Result 23659 states and 72294 transitions. [2019-12-18 18:49:54,918 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 18:49:54,918 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-12-18 18:49:54,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:49:54,961 INFO L225 Difference]: With dead ends: 23659 [2019-12-18 18:49:54,962 INFO L226 Difference]: Without dead ends: 23659 [2019-12-18 18:49:54,962 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 18:49:55,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23659 states. [2019-12-18 18:49:55,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23659 to 22516. [2019-12-18 18:49:55,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22516 states. [2019-12-18 18:49:55,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22516 states to 22516 states and 68726 transitions. [2019-12-18 18:49:55,310 INFO L78 Accepts]: Start accepts. Automaton has 22516 states and 68726 transitions. Word has length 66 [2019-12-18 18:49:55,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:49:55,310 INFO L462 AbstractCegarLoop]: Abstraction has 22516 states and 68726 transitions. [2019-12-18 18:49:55,310 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 18:49:55,311 INFO L276 IsEmpty]: Start isEmpty. Operand 22516 states and 68726 transitions. [2019-12-18 18:49:55,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 18:49:55,332 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:49:55,332 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 18:49:55,332 INFO L410 AbstractCegarLoop]: === Iteration 30 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:49:55,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:49:55,332 INFO L82 PathProgramCache]: Analyzing trace with hash -2007326845, now seen corresponding path program 1 times [2019-12-18 18:49:55,332 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:49:55,332 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2086745264] [2019-12-18 18:49:55,333 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:49:55,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:49:55,807 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 18:49:55,807 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2086745264] [2019-12-18 18:49:55,807 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:49:55,807 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-18 18:49:55,808 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [674541719] [2019-12-18 18:49:55,808 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-18 18:49:55,808 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:49:55,808 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-18 18:49:55,809 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=195, Unknown=0, NotChecked=0, Total=240 [2019-12-18 18:49:55,809 INFO L87 Difference]: Start difference. First operand 22516 states and 68726 transitions. Second operand 16 states. [2019-12-18 18:49:59,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:49:59,375 INFO L93 Difference]: Finished difference Result 35330 states and 106275 transitions. [2019-12-18 18:49:59,376 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2019-12-18 18:49:59,376 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 67 [2019-12-18 18:49:59,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:49:59,415 INFO L225 Difference]: With dead ends: 35330 [2019-12-18 18:49:59,416 INFO L226 Difference]: Without dead ends: 30036 [2019-12-18 18:49:59,417 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 0 SyntacticMatches, 3 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 669 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=461, Invalid=1989, Unknown=0, NotChecked=0, Total=2450 [2019-12-18 18:49:59,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30036 states. [2019-12-18 18:49:59,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30036 to 23232. [2019-12-18 18:49:59,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23232 states. [2019-12-18 18:49:59,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23232 states to 23232 states and 70547 transitions. [2019-12-18 18:49:59,789 INFO L78 Accepts]: Start accepts. Automaton has 23232 states and 70547 transitions. Word has length 67 [2019-12-18 18:49:59,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:49:59,789 INFO L462 AbstractCegarLoop]: Abstraction has 23232 states and 70547 transitions. [2019-12-18 18:49:59,790 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-18 18:49:59,790 INFO L276 IsEmpty]: Start isEmpty. Operand 23232 states and 70547 transitions. [2019-12-18 18:49:59,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 18:49:59,816 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:49:59,816 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 18:49:59,817 INFO L410 AbstractCegarLoop]: === Iteration 31 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:49:59,817 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:49:59,817 INFO L82 PathProgramCache]: Analyzing trace with hash -1473001563, now seen corresponding path program 2 times [2019-12-18 18:49:59,817 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:49:59,817 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1308457462] [2019-12-18 18:49:59,817 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:49:59,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:50:00,288 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 18:50:00,288 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1308457462] [2019-12-18 18:50:00,288 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:50:00,289 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-18 18:50:00,289 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1944309454] [2019-12-18 18:50:00,289 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-18 18:50:00,289 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:50:00,289 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-18 18:50:00,290 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=199, Unknown=0, NotChecked=0, Total=240 [2019-12-18 18:50:00,290 INFO L87 Difference]: Start difference. First operand 23232 states and 70547 transitions. Second operand 16 states. [2019-12-18 18:50:03,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:50:03,080 INFO L93 Difference]: Finished difference Result 32155 states and 96267 transitions. [2019-12-18 18:50:03,080 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2019-12-18 18:50:03,080 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 67 [2019-12-18 18:50:03,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:50:03,124 INFO L225 Difference]: With dead ends: 32155 [2019-12-18 18:50:03,124 INFO L226 Difference]: Without dead ends: 29618 [2019-12-18 18:50:03,125 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 0 SyntacticMatches, 3 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 615 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=436, Invalid=1820, Unknown=0, NotChecked=0, Total=2256 [2019-12-18 18:50:03,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29618 states. [2019-12-18 18:50:03,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29618 to 23112. [2019-12-18 18:50:03,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23112 states. [2019-12-18 18:50:03,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23112 states to 23112 states and 70207 transitions. [2019-12-18 18:50:03,503 INFO L78 Accepts]: Start accepts. Automaton has 23112 states and 70207 transitions. Word has length 67 [2019-12-18 18:50:03,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:50:03,503 INFO L462 AbstractCegarLoop]: Abstraction has 23112 states and 70207 transitions. [2019-12-18 18:50:03,503 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-18 18:50:03,503 INFO L276 IsEmpty]: Start isEmpty. Operand 23112 states and 70207 transitions. [2019-12-18 18:50:03,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 18:50:03,529 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:50:03,530 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 18:50:03,530 INFO L410 AbstractCegarLoop]: === Iteration 32 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:50:03,530 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:50:03,530 INFO L82 PathProgramCache]: Analyzing trace with hash -1816499453, now seen corresponding path program 3 times [2019-12-18 18:50:03,530 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:50:03,530 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [158311535] [2019-12-18 18:50:03,531 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:50:03,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:50:03,943 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 18:50:03,944 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [158311535] [2019-12-18 18:50:03,944 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:50:03,944 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-18 18:50:03,944 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1939644264] [2019-12-18 18:50:03,945 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-18 18:50:03,945 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:50:03,946 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-18 18:50:03,947 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2019-12-18 18:50:03,947 INFO L87 Difference]: Start difference. First operand 23112 states and 70207 transitions. Second operand 15 states. [2019-12-18 18:50:06,292 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2019-12-18 18:50:09,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:50:09,143 INFO L93 Difference]: Finished difference Result 55261 states and 167705 transitions. [2019-12-18 18:50:09,146 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2019-12-18 18:50:09,146 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 67 [2019-12-18 18:50:09,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:50:09,224 INFO L225 Difference]: With dead ends: 55261 [2019-12-18 18:50:09,224 INFO L226 Difference]: Without dead ends: 53046 [2019-12-18 18:50:09,225 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1185 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=576, Invalid=3456, Unknown=0, NotChecked=0, Total=4032 [2019-12-18 18:50:09,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53046 states. [2019-12-18 18:50:09,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53046 to 28724. [2019-12-18 18:50:09,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28724 states. [2019-12-18 18:50:09,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28724 states to 28724 states and 87825 transitions. [2019-12-18 18:50:09,813 INFO L78 Accepts]: Start accepts. Automaton has 28724 states and 87825 transitions. Word has length 67 [2019-12-18 18:50:09,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:50:09,814 INFO L462 AbstractCegarLoop]: Abstraction has 28724 states and 87825 transitions. [2019-12-18 18:50:09,814 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-18 18:50:09,814 INFO L276 IsEmpty]: Start isEmpty. Operand 28724 states and 87825 transitions. [2019-12-18 18:50:09,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 18:50:09,844 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:50:09,844 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 18:50:09,844 INFO L410 AbstractCegarLoop]: === Iteration 33 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:50:09,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:50:09,845 INFO L82 PathProgramCache]: Analyzing trace with hash 1315765029, now seen corresponding path program 4 times [2019-12-18 18:50:09,845 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:50:09,845 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2050839643] [2019-12-18 18:50:09,845 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:50:09,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:50:10,436 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 18:50:10,437 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2050839643] [2019-12-18 18:50:10,437 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:50:10,437 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-18 18:50:10,437 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [688076320] [2019-12-18 18:50:10,438 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-18 18:50:10,438 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:50:10,438 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-18 18:50:10,438 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=194, Unknown=0, NotChecked=0, Total=240 [2019-12-18 18:50:10,438 INFO L87 Difference]: Start difference. First operand 28724 states and 87825 transitions. Second operand 16 states. [2019-12-18 18:50:13,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:50:13,807 INFO L93 Difference]: Finished difference Result 41925 states and 126248 transitions. [2019-12-18 18:50:13,807 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-12-18 18:50:13,808 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 67 [2019-12-18 18:50:13,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:50:13,860 INFO L225 Difference]: With dead ends: 41925 [2019-12-18 18:50:13,860 INFO L226 Difference]: Without dead ends: 35208 [2019-12-18 18:50:13,861 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 532 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=364, Invalid=1616, Unknown=0, NotChecked=0, Total=1980 [2019-12-18 18:50:13,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35208 states. [2019-12-18 18:50:14,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35208 to 27126. [2019-12-18 18:50:14,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27126 states. [2019-12-18 18:50:14,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27126 states to 27126 states and 82507 transitions. [2019-12-18 18:50:14,489 INFO L78 Accepts]: Start accepts. Automaton has 27126 states and 82507 transitions. Word has length 67 [2019-12-18 18:50:14,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:50:14,490 INFO L462 AbstractCegarLoop]: Abstraction has 27126 states and 82507 transitions. [2019-12-18 18:50:14,490 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-18 18:50:14,490 INFO L276 IsEmpty]: Start isEmpty. Operand 27126 states and 82507 transitions. [2019-12-18 18:50:14,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 18:50:14,521 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:50:14,522 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 18:50:14,522 INFO L410 AbstractCegarLoop]: === Iteration 34 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:50:14,522 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:50:14,522 INFO L82 PathProgramCache]: Analyzing trace with hash 1554321141, now seen corresponding path program 5 times [2019-12-18 18:50:14,522 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:50:14,522 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1564936956] [2019-12-18 18:50:14,522 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:50:14,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:50:14,922 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 18:50:14,923 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1564936956] [2019-12-18 18:50:14,923 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:50:14,923 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-18 18:50:14,923 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1809373519] [2019-12-18 18:50:14,923 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-18 18:50:14,923 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:50:14,924 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-18 18:50:14,924 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=197, Unknown=0, NotChecked=0, Total=240 [2019-12-18 18:50:14,924 INFO L87 Difference]: Start difference. First operand 27126 states and 82507 transitions. Second operand 16 states. [2019-12-18 18:50:17,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:50:17,987 INFO L93 Difference]: Finished difference Result 38775 states and 116105 transitions. [2019-12-18 18:50:17,988 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2019-12-18 18:50:17,988 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 67 [2019-12-18 18:50:17,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:50:18,038 INFO L225 Difference]: With dead ends: 38775 [2019-12-18 18:50:18,038 INFO L226 Difference]: Without dead ends: 34567 [2019-12-18 18:50:18,039 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 666 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=404, Invalid=1948, Unknown=0, NotChecked=0, Total=2352 [2019-12-18 18:50:18,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34567 states. [2019-12-18 18:50:18,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34567 to 26453. [2019-12-18 18:50:18,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26453 states. [2019-12-18 18:50:18,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26453 states to 26453 states and 80264 transitions. [2019-12-18 18:50:18,470 INFO L78 Accepts]: Start accepts. Automaton has 26453 states and 80264 transitions. Word has length 67 [2019-12-18 18:50:18,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:50:18,470 INFO L462 AbstractCegarLoop]: Abstraction has 26453 states and 80264 transitions. [2019-12-18 18:50:18,470 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-18 18:50:18,470 INFO L276 IsEmpty]: Start isEmpty. Operand 26453 states and 80264 transitions. [2019-12-18 18:50:18,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 18:50:18,497 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:50:18,497 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 18:50:18,497 INFO L410 AbstractCegarLoop]: === Iteration 35 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:50:18,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:50:18,498 INFO L82 PathProgramCache]: Analyzing trace with hash 1885964539, now seen corresponding path program 6 times [2019-12-18 18:50:18,498 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:50:18,498 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [639738923] [2019-12-18 18:50:18,498 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:50:18,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:50:18,972 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 18:50:18,973 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [639738923] [2019-12-18 18:50:18,973 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:50:18,973 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-12-18 18:50:18,973 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2078704270] [2019-12-18 18:50:18,973 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-12-18 18:50:18,973 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:50:18,973 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-12-18 18:50:18,974 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=223, Unknown=0, NotChecked=0, Total=272 [2019-12-18 18:50:18,974 INFO L87 Difference]: Start difference. First operand 26453 states and 80264 transitions. Second operand 17 states. [2019-12-18 18:50:22,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:50:22,271 INFO L93 Difference]: Finished difference Result 37079 states and 110929 transitions. [2019-12-18 18:50:22,271 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-12-18 18:50:22,271 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 67 [2019-12-18 18:50:22,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:50:22,321 INFO L225 Difference]: With dead ends: 37079 [2019-12-18 18:50:22,321 INFO L226 Difference]: Without dead ends: 34124 [2019-12-18 18:50:22,322 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 0 SyntacticMatches, 3 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 448 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=350, Invalid=1456, Unknown=0, NotChecked=0, Total=1806 [2019-12-18 18:50:22,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34124 states. [2019-12-18 18:50:22,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34124 to 26807. [2019-12-18 18:50:22,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26807 states. [2019-12-18 18:50:22,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26807 states to 26807 states and 81196 transitions. [2019-12-18 18:50:22,763 INFO L78 Accepts]: Start accepts. Automaton has 26807 states and 81196 transitions. Word has length 67 [2019-12-18 18:50:22,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:50:22,764 INFO L462 AbstractCegarLoop]: Abstraction has 26807 states and 81196 transitions. [2019-12-18 18:50:22,764 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-12-18 18:50:22,764 INFO L276 IsEmpty]: Start isEmpty. Operand 26807 states and 81196 transitions. [2019-12-18 18:50:22,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 18:50:22,795 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:50:22,795 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 18:50:22,795 INFO L410 AbstractCegarLoop]: === Iteration 36 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:50:22,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:50:22,795 INFO L82 PathProgramCache]: Analyzing trace with hash -1956255013, now seen corresponding path program 7 times [2019-12-18 18:50:22,796 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:50:22,796 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1130377029] [2019-12-18 18:50:22,796 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:50:22,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:50:23,380 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 18:50:23,381 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1130377029] [2019-12-18 18:50:23,381 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:50:23,381 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-12-18 18:50:23,381 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [102919986] [2019-12-18 18:50:23,383 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-12-18 18:50:23,383 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:50:23,383 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-12-18 18:50:23,383 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=226, Unknown=0, NotChecked=0, Total=272 [2019-12-18 18:50:23,383 INFO L87 Difference]: Start difference. First operand 26807 states and 81196 transitions. Second operand 17 states. [2019-12-18 18:50:25,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:50:25,917 INFO L93 Difference]: Finished difference Result 37552 states and 112024 transitions. [2019-12-18 18:50:25,917 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-12-18 18:50:25,917 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 67 [2019-12-18 18:50:25,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:50:25,966 INFO L225 Difference]: With dead ends: 37552 [2019-12-18 18:50:25,966 INFO L226 Difference]: Without dead ends: 35159 [2019-12-18 18:50:25,967 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 0 SyntacticMatches, 3 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 545 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=369, Invalid=1701, Unknown=0, NotChecked=0, Total=2070 [2019-12-18 18:50:26,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35159 states. [2019-12-18 18:50:26,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35159 to 26741. [2019-12-18 18:50:26,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26741 states. [2019-12-18 18:50:26,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26741 states to 26741 states and 81003 transitions. [2019-12-18 18:50:26,412 INFO L78 Accepts]: Start accepts. Automaton has 26741 states and 81003 transitions. Word has length 67 [2019-12-18 18:50:26,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:50:26,412 INFO L462 AbstractCegarLoop]: Abstraction has 26741 states and 81003 transitions. [2019-12-18 18:50:26,412 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-12-18 18:50:26,412 INFO L276 IsEmpty]: Start isEmpty. Operand 26741 states and 81003 transitions. [2019-12-18 18:50:26,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 18:50:26,440 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:50:26,440 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 18:50:26,440 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-18 18:50:26,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:50:26,440 INFO L82 PathProgramCache]: Analyzing trace with hash 906207195, now seen corresponding path program 8 times [2019-12-18 18:50:26,440 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:50:26,440 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [913904799] [2019-12-18 18:50:26,441 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:50:26,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:50:26,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-18 18:50:26,812 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [913904799] [2019-12-18 18:50:26,812 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:50:26,813 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-18 18:50:26,813 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [608420186] [2019-12-18 18:50:26,813 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-18 18:50:26,814 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:50:26,814 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-18 18:50:26,814 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=176, Unknown=0, NotChecked=0, Total=210 [2019-12-18 18:50:26,814 INFO L87 Difference]: Start difference. First operand 26741 states and 81003 transitions. Second operand 15 states. [2019-12-18 18:50:31,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:50:31,037 INFO L93 Difference]: Finished difference Result 50113 states and 151149 transitions. [2019-12-18 18:50:31,038 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2019-12-18 18:50:31,038 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 67 [2019-12-18 18:50:31,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:50:31,110 INFO L225 Difference]: With dead ends: 50113 [2019-12-18 18:50:31,110 INFO L226 Difference]: Without dead ends: 49346 [2019-12-18 18:50:31,111 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 0 SyntacticMatches, 4 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 874 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=505, Invalid=2687, Unknown=0, NotChecked=0, Total=3192 [2019-12-18 18:50:31,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49346 states. [2019-12-18 18:50:31,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49346 to 27125. [2019-12-18 18:50:31,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27125 states. [2019-12-18 18:50:31,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27125 states to 27125 states and 82153 transitions. [2019-12-18 18:50:31,681 INFO L78 Accepts]: Start accepts. Automaton has 27125 states and 82153 transitions. Word has length 67 [2019-12-18 18:50:31,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:50:31,681 INFO L462 AbstractCegarLoop]: Abstraction has 27125 states and 82153 transitions. [2019-12-18 18:50:31,681 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-18 18:50:31,681 INFO L276 IsEmpty]: Start isEmpty. Operand 27125 states and 82153 transitions. [2019-12-18 18:50:31,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 18:50:31,713 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:50:31,713 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 18:50:31,713 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-18 18:50:31,713 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:50:31,713 INFO L82 PathProgramCache]: Analyzing trace with hash -470687251, now seen corresponding path program 9 times [2019-12-18 18:50:31,713 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:50:31,713 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1335703220] [2019-12-18 18:50:31,714 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:50:31,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:50:32,113 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 18:50:32,114 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1335703220] [2019-12-18 18:50:32,114 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:50:32,114 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-18 18:50:32,114 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2115964177] [2019-12-18 18:50:32,115 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-18 18:50:32,115 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:50:32,115 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-18 18:50:32,115 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2019-12-18 18:50:32,116 INFO L87 Difference]: Start difference. First operand 27125 states and 82153 transitions. Second operand 15 states. [2019-12-18 18:50:37,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:50:37,022 INFO L93 Difference]: Finished difference Result 48871 states and 146740 transitions. [2019-12-18 18:50:37,022 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2019-12-18 18:50:37,022 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 67 [2019-12-18 18:50:37,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:50:37,080 INFO L225 Difference]: With dead ends: 48871 [2019-12-18 18:50:37,080 INFO L226 Difference]: Without dead ends: 40866 [2019-12-18 18:50:37,081 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 0 SyntacticMatches, 4 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 793 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=526, Invalid=2444, Unknown=0, NotChecked=0, Total=2970 [2019-12-18 18:50:37,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40866 states. [2019-12-18 18:50:37,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40866 to 22754. [2019-12-18 18:50:37,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22754 states. [2019-12-18 18:50:37,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22754 states to 22754 states and 68970 transitions. [2019-12-18 18:50:37,727 INFO L78 Accepts]: Start accepts. Automaton has 22754 states and 68970 transitions. Word has length 67 [2019-12-18 18:50:37,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:50:37,727 INFO L462 AbstractCegarLoop]: Abstraction has 22754 states and 68970 transitions. [2019-12-18 18:50:37,727 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-18 18:50:37,728 INFO L276 IsEmpty]: Start isEmpty. Operand 22754 states and 68970 transitions. [2019-12-18 18:50:37,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 18:50:37,749 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:50:37,750 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 18:50:37,750 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-18 18:50:37,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:50:37,750 INFO L82 PathProgramCache]: Analyzing trace with hash -413434747, now seen corresponding path program 10 times [2019-12-18 18:50:37,750 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:50:37,750 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [845488478] [2019-12-18 18:50:37,750 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:50:37,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:50:37,861 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 18:50:37,861 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [845488478] [2019-12-18 18:50:37,861 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:50:37,861 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 18:50:37,862 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1786101966] [2019-12-18 18:50:37,862 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 18:50:37,862 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:50:37,862 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 18:50:37,862 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-12-18 18:50:37,863 INFO L87 Difference]: Start difference. First operand 22754 states and 68970 transitions. Second operand 9 states. [2019-12-18 18:50:39,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:50:39,126 INFO L93 Difference]: Finished difference Result 36285 states and 109179 transitions. [2019-12-18 18:50:39,127 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-18 18:50:39,127 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 67 [2019-12-18 18:50:39,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:50:39,170 INFO L225 Difference]: With dead ends: 36285 [2019-12-18 18:50:39,170 INFO L226 Difference]: Without dead ends: 30194 [2019-12-18 18:50:39,170 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=241, Unknown=0, NotChecked=0, Total=306 [2019-12-18 18:50:39,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30194 states. [2019-12-18 18:50:39,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30194 to 22604. [2019-12-18 18:50:39,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22604 states. [2019-12-18 18:50:39,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22604 states to 22604 states and 68470 transitions. [2019-12-18 18:50:39,566 INFO L78 Accepts]: Start accepts. Automaton has 22604 states and 68470 transitions. Word has length 67 [2019-12-18 18:50:39,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:50:39,567 INFO L462 AbstractCegarLoop]: Abstraction has 22604 states and 68470 transitions. [2019-12-18 18:50:39,567 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 18:50:39,567 INFO L276 IsEmpty]: Start isEmpty. Operand 22604 states and 68470 transitions. [2019-12-18 18:50:39,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 18:50:39,590 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:50:39,590 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 18:50:39,590 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-18 18:50:39,591 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:50:39,591 INFO L82 PathProgramCache]: Analyzing trace with hash 1770318001, now seen corresponding path program 11 times [2019-12-18 18:50:39,591 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:50:39,591 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [792162196] [2019-12-18 18:50:39,591 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:50:39,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:50:39,738 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 18:50:39,739 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [792162196] [2019-12-18 18:50:39,739 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:50:39,739 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-18 18:50:39,739 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [481432174] [2019-12-18 18:50:39,740 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-18 18:50:39,740 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:50:39,740 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-18 18:50:39,740 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-18 18:50:39,740 INFO L87 Difference]: Start difference. First operand 22604 states and 68470 transitions. Second operand 11 states. [2019-12-18 18:50:40,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:50:40,774 INFO L93 Difference]: Finished difference Result 41008 states and 125013 transitions. [2019-12-18 18:50:40,774 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-12-18 18:50:40,774 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 67 [2019-12-18 18:50:40,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:50:40,828 INFO L225 Difference]: With dead ends: 41008 [2019-12-18 18:50:40,829 INFO L226 Difference]: Without dead ends: 39093 [2019-12-18 18:50:40,829 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 173 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=165, Invalid=705, Unknown=0, NotChecked=0, Total=870 [2019-12-18 18:50:40,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39093 states. [2019-12-18 18:50:41,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39093 to 24846. [2019-12-18 18:50:41,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24846 states. [2019-12-18 18:50:41,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24846 states to 24846 states and 75544 transitions. [2019-12-18 18:50:41,307 INFO L78 Accepts]: Start accepts. Automaton has 24846 states and 75544 transitions. Word has length 67 [2019-12-18 18:50:41,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:50:41,307 INFO L462 AbstractCegarLoop]: Abstraction has 24846 states and 75544 transitions. [2019-12-18 18:50:41,307 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-18 18:50:41,308 INFO L276 IsEmpty]: Start isEmpty. Operand 24846 states and 75544 transitions. [2019-12-18 18:50:41,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 18:50:41,337 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:50:41,337 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 18:50:41,337 INFO L410 AbstractCegarLoop]: === Iteration 41 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:50:41,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:50:41,337 INFO L82 PathProgramCache]: Analyzing trace with hash 607615187, now seen corresponding path program 12 times [2019-12-18 18:50:41,337 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:50:41,337 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [526448065] [2019-12-18 18:50:41,337 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:50:41,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:50:41,491 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 18:50:41,491 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [526448065] [2019-12-18 18:50:41,491 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:50:41,491 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-18 18:50:41,491 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [335175520] [2019-12-18 18:50:41,492 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-18 18:50:41,492 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:50:41,493 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-18 18:50:41,493 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-18 18:50:41,493 INFO L87 Difference]: Start difference. First operand 24846 states and 75544 transitions. Second operand 11 states. [2019-12-18 18:50:42,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:50:42,606 INFO L93 Difference]: Finished difference Result 39671 states and 120407 transitions. [2019-12-18 18:50:42,607 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-12-18 18:50:42,607 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 67 [2019-12-18 18:50:42,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:50:42,652 INFO L225 Difference]: With dead ends: 39671 [2019-12-18 18:50:42,652 INFO L226 Difference]: Without dead ends: 34519 [2019-12-18 18:50:42,652 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=438, Unknown=0, NotChecked=0, Total=552 [2019-12-18 18:50:42,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34519 states. [2019-12-18 18:50:43,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34519 to 21770. [2019-12-18 18:50:43,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21770 states. [2019-12-18 18:50:43,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21770 states to 21770 states and 66005 transitions. [2019-12-18 18:50:43,042 INFO L78 Accepts]: Start accepts. Automaton has 21770 states and 66005 transitions. Word has length 67 [2019-12-18 18:50:43,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:50:43,042 INFO L462 AbstractCegarLoop]: Abstraction has 21770 states and 66005 transitions. [2019-12-18 18:50:43,042 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-18 18:50:43,042 INFO L276 IsEmpty]: Start isEmpty. Operand 21770 states and 66005 transitions. [2019-12-18 18:50:43,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 18:50:43,062 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:50:43,062 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 18:50:43,062 INFO L410 AbstractCegarLoop]: === Iteration 42 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:50:43,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:50:43,063 INFO L82 PathProgramCache]: Analyzing trace with hash -2101838907, now seen corresponding path program 13 times [2019-12-18 18:50:43,063 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:50:43,063 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [149829535] [2019-12-18 18:50:43,063 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:50:43,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 18:50:43,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 18:50:43,163 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-18 18:50:43,164 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-18 18:50:43,168 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [894] [894] ULTIMATE.startENTRY-->L820: Formula: (let ((.cse0 (store |v_#valid_71| 0 0))) (and (= v_~z$w_buff0_used~0_958 0) (= v_~y~0_23 0) (= v_~z$r_buff0_thd2~0_111 0) (= v_~x~0_76 0) (= |v_#NULL.offset_6| 0) (= v_~z~0_178 0) (= 0 v_~__unbuffered_p2_EAX~0_45) (= v_~z$w_buff1_used~0_531 0) (= v_~z$r_buff0_thd1~0_132 0) (= v_~z$r_buff1_thd1~0_108 0) (= v_~z$read_delayed_var~0.offset_7 0) (= v_~main$tmp_guard1~0_43 0) (= v_~z$w_buff0~0_487 0) (< 0 |v_#StackHeapBarrier_18|) (= 0 v_~z$flush_delayed~0_28) (= v_~z$r_buff1_thd2~0_104 0) (= v_~z$mem_tmp~0_17 0) (= v_~z$w_buff1~0_307 0) (= 0 v_~z$r_buff1_thd3~0_237) (= 0 |v_#NULL.base_6|) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t2287~0.base_26|)) (= |v_#valid_69| (store .cse0 |v_ULTIMATE.start_main_~#t2287~0.base_26| 1)) (= v_~z$r_buff0_thd0~0_141 0) (= v_~z$read_delayed_var~0.base_7 0) (= v_~z$read_delayed~0_7 0) (< |v_#StackHeapBarrier_18| |v_ULTIMATE.start_main_~#t2287~0.base_26|) (= 0 v_~weak$$choice0~0_16) (= 0 v_~__unbuffered_cnt~0_91) (= v_~weak$$choice2~0_111 0) (= 0 v_~z$r_buff0_thd3~0_332) (= v_~main$tmp_guard0~0_26 0) (= v_~__unbuffered_p2_EBX~0_57 0) (= |v_#memory_int_21| (store |v_#memory_int_22| |v_ULTIMATE.start_main_~#t2287~0.base_26| (store (select |v_#memory_int_22| |v_ULTIMATE.start_main_~#t2287~0.base_26|) |v_ULTIMATE.start_main_~#t2287~0.offset_19| 0))) (= |v_#length_23| (store |v_#length_24| |v_ULTIMATE.start_main_~#t2287~0.base_26| 4)) (= 0 |v_ULTIMATE.start_main_~#t2287~0.offset_19|) (= v_~z$r_buff1_thd0~0_133 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_18|, #valid=|v_#valid_71|, #memory_int=|v_#memory_int_22|, #length=|v_#length_24|} OutVars{~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_104, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_31|, ULTIMATE.start_main_~#t2289~0.offset=|v_ULTIMATE.start_main_~#t2289~0.offset_12|, #NULL.offset=|v_#NULL.offset_6|, ULTIMATE.start_main_#t~ite49=|v_ULTIMATE.start_main_#t~ite49_287|, ULTIMATE.start_main_#t~ite50=|v_ULTIMATE.start_main_#t~ite50_41|, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_93|, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_141, #length=|v_#length_23|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_45, ULTIMATE.start_main_~#t2289~0.base=|v_ULTIMATE.start_main_~#t2289~0.base_16|, ~z$mem_tmp~0=v_~z$mem_tmp~0_17, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_57, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_8|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_531, ~z$flush_delayed~0=v_~z$flush_delayed~0_28, ULTIMATE.start_main_~#t2287~0.base=|v_ULTIMATE.start_main_~#t2287~0.base_26|, ULTIMATE.start_main_~#t2288~0.base=|v_ULTIMATE.start_main_~#t2288~0.base_23|, ~weak$$choice0~0=v_~weak$$choice0~0_16, #StackHeapBarrier=|v_#StackHeapBarrier_18|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_108, ~z$read_delayed_var~0.base=v_~z$read_delayed_var~0.base_7, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_332, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_91, ~x~0=v_~x~0_76, ~z$read_delayed~0=v_~z$read_delayed~0_7, ~z$w_buff1~0=v_~z$w_buff1~0_307, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_43, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_35|, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_7, ULTIMATE.start_main_#t~ite51=|v_ULTIMATE.start_main_#t~ite51_35|, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_133, ~y~0=v_~y~0_23, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_111, ULTIMATE.start_main_~#t2288~0.offset=|v_ULTIMATE.start_main_~#t2288~0.offset_19|, ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_23|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_958, ~z$w_buff0~0=v_~z$w_buff0~0_487, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_7|, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_237, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_26, #NULL.base=|v_#NULL.base_6|, ULTIMATE.start_main_~#t2287~0.offset=|v_ULTIMATE.start_main_~#t2287~0.offset_19|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_24|, #valid=|v_#valid_69|, #memory_int=|v_#memory_int_21|, ~z~0=v_~z~0_178, ~weak$$choice2~0=v_~weak$$choice2~0_111, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_132} AuxVars[] AssignedVars[~z$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite47, ~z$read_delayed~0, ULTIMATE.start_main_~#t2289~0.offset, #NULL.offset, ~z$w_buff1~0, ULTIMATE.start_main_#t~ite49, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite48, ~z$read_delayed_var~0.offset, ULTIMATE.start_main_#t~ite50, ULTIMATE.start_main_#t~ite52, ~z$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite51, ~z$r_buff1_thd0~0, #length, ~__unbuffered_p2_EAX~0, ~y~0, ~z$r_buff0_thd2~0, ULTIMATE.start_main_~#t2288~0.offset, ULTIMATE.start_main_~#t2289~0.base, ~z$mem_tmp~0, ~__unbuffered_p2_EBX~0, ULTIMATE.start_main_#t~nondet46, ~z$w_buff0_used~0, ~z$w_buff0~0, ULTIMATE.start_main_#t~nondet44, ~z$r_buff1_thd3~0, ULTIMATE.start_main_#t~nondet45, ~z$w_buff1_used~0, ~z$flush_delayed~0, ~main$tmp_guard0~0, ULTIMATE.start_main_~#t2287~0.base, #NULL.base, ULTIMATE.start_main_~#t2287~0.offset, ULTIMATE.start_main_~#t2288~0.base, ~weak$$choice0~0, ULTIMATE.start_main_#res, ~z$r_buff1_thd1~0, #valid, #memory_int, ~z$read_delayed_var~0.base, ~z$r_buff0_thd3~0, ~__unbuffered_cnt~0, ~z~0, ~weak$$choice2~0, ~z$r_buff0_thd1~0, ~x~0] because there is no mapped edge [2019-12-18 18:50:43,169 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [850] [850] L820-1-->L822: Formula: (and (not (= |v_ULTIMATE.start_main_~#t2288~0.base_9| 0)) (= |v_#length_13| (store |v_#length_14| |v_ULTIMATE.start_main_~#t2288~0.base_9| 4)) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t2288~0.base_9| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t2288~0.base_9|) |v_ULTIMATE.start_main_~#t2288~0.offset_8| 1)) |v_#memory_int_11|) (= 0 (select |v_#valid_34| |v_ULTIMATE.start_main_~#t2288~0.base_9|)) (= |v_#valid_33| (store |v_#valid_34| |v_ULTIMATE.start_main_~#t2288~0.base_9| 1)) (= 0 |v_ULTIMATE.start_main_~#t2288~0.offset_8|) (< |v_#StackHeapBarrier_10| |v_ULTIMATE.start_main_~#t2288~0.base_9|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_34|, #memory_int=|v_#memory_int_12|, #length=|v_#length_14|} OutVars{ULTIMATE.start_main_~#t2288~0.base=|v_ULTIMATE.start_main_~#t2288~0.base_9|, #StackHeapBarrier=|v_#StackHeapBarrier_10|, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_3|, #valid=|v_#valid_33|, #memory_int=|v_#memory_int_11|, #length=|v_#length_13|, ULTIMATE.start_main_~#t2288~0.offset=|v_ULTIMATE.start_main_~#t2288~0.offset_8|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2288~0.base, ULTIMATE.start_main_#t~nondet44, #valid, #memory_int, #length, ULTIMATE.start_main_~#t2288~0.offset] because there is no mapped edge [2019-12-18 18:50:43,169 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [874] [874] P0ENTRY-->L4-3: Formula: (and (= ~z$w_buff1~0_Out-1200219101 ~z$w_buff0~0_In-1200219101) (= P0Thread1of1ForFork0___VERIFIER_assert_~expression_Out-1200219101 |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_Out-1200219101|) (= 1 |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_Out-1200219101|) (= 1 ~z$w_buff0_used~0_Out-1200219101) (= ~z$w_buff0~0_Out-1200219101 1) (= (mod ~z$w_buff1_used~0_Out-1200219101 256) 0) (= |P0Thread1of1ForFork0_#in~arg.offset_In-1200219101| P0Thread1of1ForFork0_~arg.offset_Out-1200219101) (= ~z$w_buff1_used~0_Out-1200219101 ~z$w_buff0_used~0_In-1200219101) (= |P0Thread1of1ForFork0_#in~arg.base_In-1200219101| P0Thread1of1ForFork0_~arg.base_Out-1200219101)) InVars {P0Thread1of1ForFork0_#in~arg.offset=|P0Thread1of1ForFork0_#in~arg.offset_In-1200219101|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1200219101, ~z$w_buff0~0=~z$w_buff0~0_In-1200219101, P0Thread1of1ForFork0_#in~arg.base=|P0Thread1of1ForFork0_#in~arg.base_In-1200219101|} OutVars{P0Thread1of1ForFork0_#in~arg.offset=|P0Thread1of1ForFork0_#in~arg.offset_In-1200219101|, ~z$w_buff0_used~0=~z$w_buff0_used~0_Out-1200219101, ~z$w_buff0~0=~z$w_buff0~0_Out-1200219101, ~z$w_buff1_used~0=~z$w_buff1_used~0_Out-1200219101, P0Thread1of1ForFork0___VERIFIER_assert_~expression=P0Thread1of1ForFork0___VERIFIER_assert_~expression_Out-1200219101, P0Thread1of1ForFork0_#in~arg.base=|P0Thread1of1ForFork0_#in~arg.base_In-1200219101|, ~z$w_buff1~0=~z$w_buff1~0_Out-1200219101, P0Thread1of1ForFork0_~arg.base=P0Thread1of1ForFork0_~arg.base_Out-1200219101, P0Thread1of1ForFork0___VERIFIER_assert_#in~expression=|P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_Out-1200219101|, P0Thread1of1ForFork0_~arg.offset=P0Thread1of1ForFork0_~arg.offset_Out-1200219101} AuxVars[] AssignedVars[~z$w_buff0_used~0, ~z$w_buff0~0, ~z$w_buff1_used~0, P0Thread1of1ForFork0___VERIFIER_assert_~expression, ~z$w_buff1~0, P0Thread1of1ForFork0_~arg.base, P0Thread1of1ForFork0___VERIFIER_assert_#in~expression, P0Thread1of1ForFork0_~arg.offset] because there is no mapped edge [2019-12-18 18:50:43,171 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [872] [872] L822-1-->L824: Formula: (and (= |v_#valid_40| (store |v_#valid_41| |v_ULTIMATE.start_main_~#t2289~0.base_11| 1)) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t2289~0.base_11| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t2289~0.base_11|) |v_ULTIMATE.start_main_~#t2289~0.offset_9| 2)) |v_#memory_int_15|) (= 0 (select |v_#valid_41| |v_ULTIMATE.start_main_~#t2289~0.base_11|)) (= 0 |v_ULTIMATE.start_main_~#t2289~0.offset_9|) (not (= 0 |v_ULTIMATE.start_main_~#t2289~0.base_11|)) (= (store |v_#length_18| |v_ULTIMATE.start_main_~#t2289~0.base_11| 4) |v_#length_17|) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t2289~0.base_11|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_41|, #memory_int=|v_#memory_int_16|, #length=|v_#length_18|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_40|, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_5|, #memory_int=|v_#memory_int_15|, ULTIMATE.start_main_~#t2289~0.offset=|v_ULTIMATE.start_main_~#t2289~0.offset_9|, #length=|v_#length_17|, ULTIMATE.start_main_~#t2289~0.base=|v_ULTIMATE.start_main_~#t2289~0.base_11|} AuxVars[] AssignedVars[#valid, ULTIMATE.start_main_#t~nondet45, #memory_int, ULTIMATE.start_main_~#t2289~0.offset, #length, ULTIMATE.start_main_~#t2289~0.base] because there is no mapped edge [2019-12-18 18:50:43,173 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [817] [817] L764-2-->L764-5: Formula: (let ((.cse0 (= |P1Thread1of1ForFork1_#t~ite10_Out1767903753| |P1Thread1of1ForFork1_#t~ite9_Out1767903753|)) (.cse2 (= 0 (mod ~z$r_buff1_thd2~0_In1767903753 256))) (.cse1 (= 0 (mod ~z$w_buff1_used~0_In1767903753 256)))) (or (and (= ~z$w_buff1~0_In1767903753 |P1Thread1of1ForFork1_#t~ite9_Out1767903753|) .cse0 (not .cse1) (not .cse2)) (and (= ~z~0_In1767903753 |P1Thread1of1ForFork1_#t~ite9_Out1767903753|) .cse0 (or .cse2 .cse1)))) InVars {~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In1767903753, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1767903753, ~z$w_buff1~0=~z$w_buff1~0_In1767903753, ~z~0=~z~0_In1767903753} OutVars{P1Thread1of1ForFork1_#t~ite9=|P1Thread1of1ForFork1_#t~ite9_Out1767903753|, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In1767903753, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1767903753, P1Thread1of1ForFork1_#t~ite10=|P1Thread1of1ForFork1_#t~ite10_Out1767903753|, ~z$w_buff1~0=~z$w_buff1~0_In1767903753, ~z~0=~z~0_In1767903753} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite9, P1Thread1of1ForFork1_#t~ite10] because there is no mapped edge [2019-12-18 18:50:43,174 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [836] [836] L765-->L765-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In-1420067537 256))) (.cse1 (= 0 (mod ~z$r_buff0_thd2~0_In-1420067537 256)))) (or (and (not .cse0) (= |P1Thread1of1ForFork1_#t~ite11_Out-1420067537| 0) (not .cse1)) (and (or .cse0 .cse1) (= |P1Thread1of1ForFork1_#t~ite11_Out-1420067537| ~z$w_buff0_used~0_In-1420067537)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1420067537, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1420067537} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1420067537, P1Thread1of1ForFork1_#t~ite11=|P1Thread1of1ForFork1_#t~ite11_Out-1420067537|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1420067537} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite11] because there is no mapped edge [2019-12-18 18:50:43,176 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [828] [828] L766-->L766-2: Formula: (let ((.cse3 (= 0 (mod ~z$r_buff0_thd2~0_In1554747328 256))) (.cse2 (= (mod ~z$w_buff0_used~0_In1554747328 256) 0)) (.cse0 (= 0 (mod ~z$w_buff1_used~0_In1554747328 256))) (.cse1 (= 0 (mod ~z$r_buff1_thd2~0_In1554747328 256)))) (or (and (or .cse0 .cse1) (= ~z$w_buff1_used~0_In1554747328 |P1Thread1of1ForFork1_#t~ite12_Out1554747328|) (or .cse2 .cse3)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1))) (= 0 |P1Thread1of1ForFork1_#t~ite12_Out1554747328|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1554747328, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In1554747328, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1554747328, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1554747328} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1554747328, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In1554747328, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1554747328, P1Thread1of1ForFork1_#t~ite12=|P1Thread1of1ForFork1_#t~ite12_Out1554747328|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1554747328} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite12] because there is no mapped edge [2019-12-18 18:50:43,177 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [841] [841] L767-->L767-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In-65164050 256))) (.cse1 (= 0 (mod ~z$r_buff0_thd2~0_In-65164050 256)))) (or (and (= |P1Thread1of1ForFork1_#t~ite13_Out-65164050| 0) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= |P1Thread1of1ForFork1_#t~ite13_Out-65164050| ~z$r_buff0_thd2~0_In-65164050)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-65164050, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-65164050} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-65164050, P1Thread1of1ForFork1_#t~ite13=|P1Thread1of1ForFork1_#t~ite13_Out-65164050|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-65164050} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite13] because there is no mapped edge [2019-12-18 18:50:43,177 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [873] [873] L787-->L787-8: Formula: (let ((.cse1 (= 0 (mod ~weak$$choice2~0_In-594955301 256)))) (or (and (let ((.cse0 (= 0 (mod ~z$r_buff0_thd3~0_In-594955301 256)))) (or (= 0 (mod ~z$w_buff0_used~0_In-594955301 256)) (and (= 0 (mod ~z$r_buff1_thd3~0_In-594955301 256)) .cse0) (and (= 0 (mod ~z$w_buff1_used~0_In-594955301 256)) .cse0))) (= ~z$w_buff1~0_In-594955301 |P2Thread1of1ForFork2_#t~ite23_Out-594955301|) (= |P2Thread1of1ForFork2_#t~ite24_Out-594955301| |P2Thread1of1ForFork2_#t~ite23_Out-594955301|) .cse1) (and (= |P2Thread1of1ForFork2_#t~ite23_In-594955301| |P2Thread1of1ForFork2_#t~ite23_Out-594955301|) (= |P2Thread1of1ForFork2_#t~ite24_Out-594955301| ~z$w_buff1~0_In-594955301) (not .cse1)))) InVars {P2Thread1of1ForFork2_#t~ite23=|P2Thread1of1ForFork2_#t~ite23_In-594955301|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-594955301, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-594955301, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-594955301, ~z$w_buff1~0=~z$w_buff1~0_In-594955301, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-594955301, ~weak$$choice2~0=~weak$$choice2~0_In-594955301} OutVars{P2Thread1of1ForFork2_#t~ite23=|P2Thread1of1ForFork2_#t~ite23_Out-594955301|, P2Thread1of1ForFork2_#t~ite24=|P2Thread1of1ForFork2_#t~ite24_Out-594955301|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-594955301, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-594955301, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-594955301, ~z$w_buff1~0=~z$w_buff1~0_In-594955301, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-594955301, ~weak$$choice2~0=~weak$$choice2~0_In-594955301} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite23, P2Thread1of1ForFork2_#t~ite24] because there is no mapped edge [2019-12-18 18:50:43,178 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [875] [875] L788-->L788-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-106005188 256)))) (or (and (= |P2Thread1of1ForFork2_#t~ite27_Out-106005188| ~z$w_buff0_used~0_In-106005188) (= |P2Thread1of1ForFork2_#t~ite26_In-106005188| |P2Thread1of1ForFork2_#t~ite26_Out-106005188|) (not .cse0)) (and (= |P2Thread1of1ForFork2_#t~ite26_Out-106005188| |P2Thread1of1ForFork2_#t~ite27_Out-106005188|) .cse0 (= |P2Thread1of1ForFork2_#t~ite26_Out-106005188| ~z$w_buff0_used~0_In-106005188) (let ((.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In-106005188 256)))) (or (and .cse1 (= 0 (mod ~z$r_buff1_thd3~0_In-106005188 256))) (= (mod ~z$w_buff0_used~0_In-106005188 256) 0) (and (= (mod ~z$w_buff1_used~0_In-106005188 256) 0) .cse1)))))) InVars {P2Thread1of1ForFork2_#t~ite26=|P2Thread1of1ForFork2_#t~ite26_In-106005188|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-106005188, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-106005188, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-106005188, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-106005188, ~weak$$choice2~0=~weak$$choice2~0_In-106005188} OutVars{P2Thread1of1ForFork2_#t~ite26=|P2Thread1of1ForFork2_#t~ite26_Out-106005188|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-106005188, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-106005188, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-106005188, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-106005188, ~weak$$choice2~0=~weak$$choice2~0_In-106005188, P2Thread1of1ForFork2_#t~ite27=|P2Thread1of1ForFork2_#t~ite27_Out-106005188|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite26, P2Thread1of1ForFork2_#t~ite27] because there is no mapped edge [2019-12-18 18:50:43,179 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [827] [827] L768-->L768-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff0_thd2~0_In-1045200080 256))) (.cse1 (= (mod ~z$w_buff0_used~0_In-1045200080 256) 0)) (.cse2 (= (mod ~z$w_buff1_used~0_In-1045200080 256) 0)) (.cse3 (= 0 (mod ~z$r_buff1_thd2~0_In-1045200080 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P1Thread1of1ForFork1_#t~ite14_Out-1045200080| 0)) (and (or .cse0 .cse1) (= ~z$r_buff1_thd2~0_In-1045200080 |P1Thread1of1ForFork1_#t~ite14_Out-1045200080|) (or .cse2 .cse3)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1045200080, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-1045200080, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1045200080, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1045200080} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1045200080, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-1045200080, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1045200080, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_Out-1045200080|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1045200080} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite14] because there is no mapped edge [2019-12-18 18:50:43,179 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [848] [848] L768-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork1_#res.base_5|) (= |v_P1Thread1of1ForFork1_#t~ite14_28| v_~z$r_buff1_thd2~0_55) (= |v_P1Thread1of1ForFork1_#res.offset_5| 0) (= (+ v_~__unbuffered_cnt~0_40 1) v_~__unbuffered_cnt~0_39)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_40, P1Thread1of1ForFork1_#t~ite14=|v_P1Thread1of1ForFork1_#t~ite14_28|} OutVars{P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_5|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_55, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_39, P1Thread1of1ForFork1_#t~ite14=|v_P1Thread1of1ForFork1_#t~ite14_27|, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#res.offset, ~z$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#t~ite14, P1Thread1of1ForFork1_#res.base] because there is no mapped edge [2019-12-18 18:50:43,180 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [876] [876] L789-->L789-8: Formula: (let ((.cse1 (= 0 (mod ~weak$$choice2~0_In1220838153 256)))) (or (and (let ((.cse0 (= (mod ~z$r_buff0_thd3~0_In1220838153 256) 0))) (or (= 0 (mod ~z$w_buff0_used~0_In1220838153 256)) (and (= (mod ~z$r_buff1_thd3~0_In1220838153 256) 0) .cse0) (and .cse0 (= 0 (mod ~z$w_buff1_used~0_In1220838153 256))))) (= |P2Thread1of1ForFork2_#t~ite29_Out1220838153| ~z$w_buff1_used~0_In1220838153) (= |P2Thread1of1ForFork2_#t~ite30_Out1220838153| |P2Thread1of1ForFork2_#t~ite29_Out1220838153|) .cse1) (and (= |P2Thread1of1ForFork2_#t~ite30_Out1220838153| ~z$w_buff1_used~0_In1220838153) (not .cse1) (= |P2Thread1of1ForFork2_#t~ite29_In1220838153| |P2Thread1of1ForFork2_#t~ite29_Out1220838153|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1220838153, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1220838153, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1220838153, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1220838153, ~weak$$choice2~0=~weak$$choice2~0_In1220838153, P2Thread1of1ForFork2_#t~ite29=|P2Thread1of1ForFork2_#t~ite29_In1220838153|} OutVars{P2Thread1of1ForFork2_#t~ite30=|P2Thread1of1ForFork2_#t~ite30_Out1220838153|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1220838153, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1220838153, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1220838153, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1220838153, ~weak$$choice2~0=~weak$$choice2~0_In1220838153, P2Thread1of1ForFork2_#t~ite29=|P2Thread1of1ForFork2_#t~ite29_Out1220838153|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite30, P2Thread1of1ForFork2_#t~ite29] because there is no mapped edge [2019-12-18 18:50:43,180 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [779] [779] L790-->L791: Formula: (and (= v_~z$r_buff0_thd3~0_68 v_~z$r_buff0_thd3~0_67) (not (= 0 (mod v_~weak$$choice2~0_15 256)))) InVars {~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_68, ~weak$$choice2~0=v_~weak$$choice2~0_15} OutVars{P2Thread1of1ForFork2_#t~ite31=|v_P2Thread1of1ForFork2_#t~ite31_8|, P2Thread1of1ForFork2_#t~ite33=|v_P2Thread1of1ForFork2_#t~ite33_9|, P2Thread1of1ForFork2_#t~ite32=|v_P2Thread1of1ForFork2_#t~ite32_9|, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_67, ~weak$$choice2~0=v_~weak$$choice2~0_15} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite31, P2Thread1of1ForFork2_#t~ite33, P2Thread1of1ForFork2_#t~ite32, ~z$r_buff0_thd3~0] because there is no mapped edge [2019-12-18 18:50:43,182 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [761] [761] L793-->L797: Formula: (and (= 0 v_~z$flush_delayed~0_6) (= v_~z~0_25 v_~z$mem_tmp~0_5) (not (= 0 (mod v_~z$flush_delayed~0_7 256)))) InVars {~z$mem_tmp~0=v_~z$mem_tmp~0_5, ~z$flush_delayed~0=v_~z$flush_delayed~0_7} OutVars{~z$mem_tmp~0=v_~z$mem_tmp~0_5, P2Thread1of1ForFork2_#t~ite37=|v_P2Thread1of1ForFork2_#t~ite37_7|, ~z$flush_delayed~0=v_~z$flush_delayed~0_6, ~z~0=v_~z~0_25} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite37, ~z$flush_delayed~0, ~z~0] because there is no mapped edge [2019-12-18 18:50:43,183 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [839] [839] L745-->L745-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd1~0_In116629440 256))) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In116629440 256)))) (or (and (= |P0Thread1of1ForFork0_#t~ite5_Out116629440| ~z$w_buff0_used~0_In116629440) (or .cse0 .cse1)) (and (not .cse1) (not .cse0) (= |P0Thread1of1ForFork0_#t~ite5_Out116629440| 0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In116629440, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In116629440} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out116629440|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In116629440, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In116629440} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-18 18:50:43,183 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [818] [818] L746-->L746-2: Formula: (let ((.cse3 (= (mod ~z$w_buff1_used~0_In-1086996601 256) 0)) (.cse2 (= 0 (mod ~z$r_buff1_thd1~0_In-1086996601 256))) (.cse0 (= (mod ~z$w_buff0_used~0_In-1086996601 256) 0)) (.cse1 (= (mod ~z$r_buff0_thd1~0_In-1086996601 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P0Thread1of1ForFork0_#t~ite6_Out-1086996601| ~z$w_buff1_used~0_In-1086996601)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1))) (= 0 |P0Thread1of1ForFork0_#t~ite6_Out-1086996601|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1086996601, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In-1086996601, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1086996601, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-1086996601} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out-1086996601|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1086996601, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In-1086996601, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1086996601, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-1086996601} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-18 18:50:43,184 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [837] [837] L747-->L748: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd1~0_In1586468260 256))) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In1586468260 256)))) (or (and (= ~z$r_buff0_thd1~0_Out1586468260 ~z$r_buff0_thd1~0_In1586468260) (or .cse0 .cse1)) (and (= ~z$r_buff0_thd1~0_Out1586468260 0) (not .cse1) (not .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1586468260, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In1586468260} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1586468260, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out1586468260|, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_Out1586468260} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-18 18:50:43,184 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [838] [838] L748-->L748-2: Formula: (let ((.cse3 (= (mod ~z$r_buff0_thd1~0_In1897369208 256) 0)) (.cse2 (= (mod ~z$w_buff0_used~0_In1897369208 256) 0)) (.cse1 (= 0 (mod ~z$r_buff1_thd1~0_In1897369208 256))) (.cse0 (= 0 (mod ~z$w_buff1_used~0_In1897369208 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P0Thread1of1ForFork0_#t~ite8_Out1897369208| ~z$r_buff1_thd1~0_In1897369208)) (and (= |P0Thread1of1ForFork0_#t~ite8_Out1897369208| 0) (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0)))))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1897369208, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In1897369208, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1897369208, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In1897369208} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1897369208, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out1897369208|, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In1897369208, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1897369208, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In1897369208} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-18 18:50:43,184 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [861] [861] L748-2-->P0EXIT: Formula: (and (= v_~__unbuffered_cnt~0_73 (+ v_~__unbuffered_cnt~0_74 1)) (= 0 |v_P0Thread1of1ForFork0_#res.base_5|) (= v_~z$r_buff1_thd1~0_68 |v_P0Thread1of1ForFork0_#t~ite8_44|) (= |v_P0Thread1of1ForFork0_#res.offset_5| 0)) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_44|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_74} OutVars{P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_5|, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_43|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_68, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_73} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#t~ite8, ~z$r_buff1_thd1~0, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-18 18:50:43,185 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [829] [829] L797-2-->L797-5: Formula: (let ((.cse0 (= |P2Thread1of1ForFork2_#t~ite38_Out1861248417| |P2Thread1of1ForFork2_#t~ite39_Out1861248417|)) (.cse1 (= 0 (mod ~z$w_buff1_used~0_In1861248417 256))) (.cse2 (= (mod ~z$r_buff1_thd3~0_In1861248417 256) 0))) (or (and .cse0 (not .cse1) (not .cse2) (= |P2Thread1of1ForFork2_#t~ite38_Out1861248417| ~z$w_buff1~0_In1861248417)) (and .cse0 (= |P2Thread1of1ForFork2_#t~ite38_Out1861248417| ~z~0_In1861248417) (or .cse1 .cse2)))) InVars {~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1861248417, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1861248417, ~z$w_buff1~0=~z$w_buff1~0_In1861248417, ~z~0=~z~0_In1861248417} OutVars{~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1861248417, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1861248417, ~z$w_buff1~0=~z$w_buff1~0_In1861248417, ~z~0=~z~0_In1861248417, P2Thread1of1ForFork2_#t~ite39=|P2Thread1of1ForFork2_#t~ite39_Out1861248417|, P2Thread1of1ForFork2_#t~ite38=|P2Thread1of1ForFork2_#t~ite38_Out1861248417|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite39, P2Thread1of1ForFork2_#t~ite38] because there is no mapped edge [2019-12-18 18:50:43,185 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [832] [832] L798-->L798-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In468604983 256))) (.cse0 (= (mod ~z$r_buff0_thd3~0_In468604983 256) 0))) (or (and (not .cse0) (= |P2Thread1of1ForFork2_#t~ite40_Out468604983| 0) (not .cse1)) (and (or .cse1 .cse0) (= |P2Thread1of1ForFork2_#t~ite40_Out468604983| ~z$w_buff0_used~0_In468604983)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In468604983, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In468604983} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In468604983, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In468604983, P2Thread1of1ForFork2_#t~ite40=|P2Thread1of1ForFork2_#t~ite40_Out468604983|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite40] because there is no mapped edge [2019-12-18 18:50:43,186 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [819] [819] L799-->L799-2: Formula: (let ((.cse3 (= 0 (mod ~z$w_buff1_used~0_In1814545197 256))) (.cse2 (= 0 (mod ~z$r_buff1_thd3~0_In1814545197 256))) (.cse1 (= (mod ~z$w_buff0_used~0_In1814545197 256) 0)) (.cse0 (= (mod ~z$r_buff0_thd3~0_In1814545197 256) 0))) (or (and (= |P2Thread1of1ForFork2_#t~ite41_Out1814545197| ~z$w_buff1_used~0_In1814545197) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0))) (= |P2Thread1of1ForFork2_#t~ite41_Out1814545197| 0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1814545197, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1814545197, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1814545197, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1814545197} OutVars{P2Thread1of1ForFork2_#t~ite41=|P2Thread1of1ForFork2_#t~ite41_Out1814545197|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1814545197, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1814545197, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1814545197, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1814545197} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite41] because there is no mapped edge [2019-12-18 18:50:43,187 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [815] [815] L800-->L800-2: Formula: (let ((.cse1 (= (mod ~z$r_buff0_thd3~0_In1179563948 256) 0)) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In1179563948 256)))) (or (and (= ~z$r_buff0_thd3~0_In1179563948 |P2Thread1of1ForFork2_#t~ite42_Out1179563948|) (or .cse0 .cse1)) (and (not .cse1) (= 0 |P2Thread1of1ForFork2_#t~ite42_Out1179563948|) (not .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1179563948, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1179563948} OutVars{P2Thread1of1ForFork2_#t~ite42=|P2Thread1of1ForFork2_#t~ite42_Out1179563948|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1179563948, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1179563948} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite42] because there is no mapped edge [2019-12-18 18:50:43,187 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [834] [834] L801-->L801-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In2146800853 256))) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In2146800853 256))) (.cse3 (= (mod ~z$w_buff1_used~0_In2146800853 256) 0)) (.cse2 (= (mod ~z$r_buff1_thd3~0_In2146800853 256) 0))) (or (and (= ~z$r_buff1_thd3~0_In2146800853 |P2Thread1of1ForFork2_#t~ite43_Out2146800853|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2))) (= |P2Thread1of1ForFork2_#t~ite43_Out2146800853| 0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In2146800853, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In2146800853, ~z$w_buff1_used~0=~z$w_buff1_used~0_In2146800853, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In2146800853} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In2146800853, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In2146800853, P2Thread1of1ForFork2_#t~ite43=|P2Thread1of1ForFork2_#t~ite43_Out2146800853|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In2146800853, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In2146800853} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite43] because there is no mapped edge [2019-12-18 18:50:43,188 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [859] [859] L801-2-->P2EXIT: Formula: (and (= 0 |v_P2Thread1of1ForFork2_#res.base_5|) (= v_~z$r_buff1_thd3~0_136 |v_P2Thread1of1ForFork2_#t~ite43_30|) (= |v_P2Thread1of1ForFork2_#res.offset_5| 0) (= (+ v_~__unbuffered_cnt~0_56 1) v_~__unbuffered_cnt~0_55)) InVars {P2Thread1of1ForFork2_#t~ite43=|v_P2Thread1of1ForFork2_#t~ite43_30|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_56} OutVars{~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_136, P2Thread1of1ForFork2_#t~ite43=|v_P2Thread1of1ForFork2_#t~ite43_29|, P2Thread1of1ForFork2_#res.base=|v_P2Thread1of1ForFork2_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_55, P2Thread1of1ForFork2_#res.offset=|v_P2Thread1of1ForFork2_#res.offset_5|} AuxVars[] AssignedVars[~z$r_buff1_thd3~0, P2Thread1of1ForFork2_#t~ite43, P2Thread1of1ForFork2_#res.base, ~__unbuffered_cnt~0, P2Thread1of1ForFork2_#res.offset] because there is no mapped edge [2019-12-18 18:50:43,188 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [781] [781] L824-1-->L830: Formula: (and (= v_~main$tmp_guard0~0_7 1) (= 3 v_~__unbuffered_cnt~0_13)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_13} OutVars{ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_13, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet46, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-18 18:50:43,188 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [825] [825] L830-2-->L830-5: Formula: (let ((.cse0 (= |ULTIMATE.start_main_#t~ite47_Out-142791522| |ULTIMATE.start_main_#t~ite48_Out-142791522|)) (.cse1 (= 0 (mod ~z$w_buff1_used~0_In-142791522 256))) (.cse2 (= (mod ~z$r_buff1_thd0~0_In-142791522 256) 0))) (or (and .cse0 (or .cse1 .cse2) (= ~z~0_In-142791522 |ULTIMATE.start_main_#t~ite47_Out-142791522|)) (and .cse0 (= |ULTIMATE.start_main_#t~ite47_Out-142791522| ~z$w_buff1~0_In-142791522) (not .cse1) (not .cse2)))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-142791522, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-142791522, ~z$w_buff1~0=~z$w_buff1~0_In-142791522, ~z~0=~z~0_In-142791522} OutVars{~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-142791522, ULTIMATE.start_main_#t~ite47=|ULTIMATE.start_main_#t~ite47_Out-142791522|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-142791522, ~z$w_buff1~0=~z$w_buff1~0_In-142791522, ULTIMATE.start_main_#t~ite48=|ULTIMATE.start_main_#t~ite48_Out-142791522|, ~z~0=~z~0_In-142791522} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite47, ULTIMATE.start_main_#t~ite48] because there is no mapped edge [2019-12-18 18:50:43,189 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [821] [821] L831-->L831-2: Formula: (let ((.cse1 (= (mod ~z$r_buff0_thd0~0_In-1997082009 256) 0)) (.cse0 (= (mod ~z$w_buff0_used~0_In-1997082009 256) 0))) (or (and (= ~z$w_buff0_used~0_In-1997082009 |ULTIMATE.start_main_#t~ite49_Out-1997082009|) (or .cse0 .cse1)) (and (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite49_Out-1997082009|) (not .cse0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1997082009, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1997082009} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1997082009, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1997082009, ULTIMATE.start_main_#t~ite49=|ULTIMATE.start_main_#t~ite49_Out-1997082009|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite49] because there is no mapped edge [2019-12-18 18:50:43,190 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [840] [840] L832-->L832-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff1_used~0_In1261466938 256))) (.cse0 (= 0 (mod ~z$r_buff1_thd0~0_In1261466938 256))) (.cse3 (= (mod ~z$r_buff0_thd0~0_In1261466938 256) 0)) (.cse2 (= (mod ~z$w_buff0_used~0_In1261466938 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~z$w_buff1_used~0_In1261466938 |ULTIMATE.start_main_#t~ite50_Out1261466938|)) (and (= 0 |ULTIMATE.start_main_#t~ite50_Out1261466938|) (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2)))))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1261466938, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1261466938, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1261466938, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1261466938} OutVars{ULTIMATE.start_main_#t~ite50=|ULTIMATE.start_main_#t~ite50_Out1261466938|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1261466938, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1261466938, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1261466938, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1261466938} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite50] because there is no mapped edge [2019-12-18 18:50:43,190 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [831] [831] L833-->L833-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff0_thd0~0_In1534888802 256))) (.cse1 (= (mod ~z$w_buff0_used~0_In1534888802 256) 0))) (or (and (or .cse0 .cse1) (= ~z$r_buff0_thd0~0_In1534888802 |ULTIMATE.start_main_#t~ite51_Out1534888802|)) (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite51_Out1534888802| 0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1534888802, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1534888802} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1534888802, ULTIMATE.start_main_#t~ite51=|ULTIMATE.start_main_#t~ite51_Out1534888802|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1534888802} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite51] because there is no mapped edge [2019-12-18 18:50:43,191 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [820] [820] L834-->L834-2: Formula: (let ((.cse1 (= (mod ~z$r_buff1_thd0~0_In-1585872093 256) 0)) (.cse0 (= 0 (mod ~z$w_buff1_used~0_In-1585872093 256))) (.cse2 (= (mod ~z$w_buff0_used~0_In-1585872093 256) 0)) (.cse3 (= (mod ~z$r_buff0_thd0~0_In-1585872093 256) 0))) (or (and (= 0 |ULTIMATE.start_main_#t~ite52_Out-1585872093|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= ~z$r_buff1_thd0~0_In-1585872093 |ULTIMATE.start_main_#t~ite52_Out-1585872093|) (or .cse1 .cse0) (or .cse2 .cse3)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1585872093, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1585872093, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1585872093, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1585872093} OutVars{ULTIMATE.start_main_#t~ite52=|ULTIMATE.start_main_#t~ite52_Out-1585872093|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1585872093, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1585872093, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1585872093, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1585872093} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52] because there is no mapped edge [2019-12-18 18:50:43,191 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [883] [883] L834-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_10| (mod v_~main$tmp_guard1~0_23 256)) (= |v_ULTIMATE.start_main_#t~ite52_54| v_~z$r_buff1_thd0~0_96) (= v_~x~0_49 2) (= v_ULTIMATE.start___VERIFIER_assert_~expression_15 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_10|) (= v_~main$tmp_guard1~0_23 0) (= v_~__unbuffered_p2_EBX~0_30 0) (= 1 v_~__unbuffered_p2_EAX~0_25)) InVars {ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_54|, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_30, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_25, ~x~0=v_~x~0_49} OutVars{ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_53|, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_15, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_30, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_96, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_23, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_25, ~x~0=v_~x~0_49, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52, ULTIMATE.start___VERIFIER_assert_~expression, ~z$r_buff1_thd0~0, ~main$tmp_guard1~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-18 18:50:43,278 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.12 06:50:43 BasicIcfg [2019-12-18 18:50:43,278 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-18 18:50:43,280 INFO L168 Benchmark]: Toolchain (without parser) took 149068.05 ms. Allocated memory was 138.9 MB in the beginning and 3.1 GB in the end (delta: 3.0 GB). Free memory was 101.7 MB in the beginning and 2.1 GB in the end (delta: -2.0 GB). Peak memory consumption was 1.0 GB. Max. memory is 7.1 GB. [2019-12-18 18:50:43,280 INFO L168 Benchmark]: CDTParser took 0.41 ms. Allocated memory is still 138.9 MB. Free memory was 122.1 MB in the beginning and 121.9 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-12-18 18:50:43,280 INFO L168 Benchmark]: CACSL2BoogieTranslator took 833.78 ms. Allocated memory was 138.9 MB in the beginning and 202.9 MB in the end (delta: 64.0 MB). Free memory was 101.5 MB in the beginning and 154.4 MB in the end (delta: -52.9 MB). Peak memory consumption was 24.4 MB. Max. memory is 7.1 GB. [2019-12-18 18:50:43,281 INFO L168 Benchmark]: Boogie Procedure Inliner took 63.02 ms. Allocated memory is still 202.9 MB. Free memory was 154.4 MB in the beginning and 151.6 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. [2019-12-18 18:50:43,281 INFO L168 Benchmark]: Boogie Preprocessor took 44.23 ms. Allocated memory is still 202.9 MB. Free memory was 151.6 MB in the beginning and 149.6 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2019-12-18 18:50:43,282 INFO L168 Benchmark]: RCFGBuilder took 828.45 ms. Allocated memory is still 202.9 MB. Free memory was 149.6 MB in the beginning and 99.4 MB in the end (delta: 50.2 MB). Peak memory consumption was 50.2 MB. Max. memory is 7.1 GB. [2019-12-18 18:50:43,282 INFO L168 Benchmark]: TraceAbstraction took 147293.88 ms. Allocated memory was 202.9 MB in the beginning and 3.1 GB in the end (delta: 2.9 GB). Free memory was 98.7 MB in the beginning and 2.1 GB in the end (delta: -2.0 GB). Peak memory consumption was 950.8 MB. Max. memory is 7.1 GB. [2019-12-18 18:50:43,284 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.9 MB. Free memory was 122.1 MB in the beginning and 121.9 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 833.78 ms. Allocated memory was 138.9 MB in the beginning and 202.9 MB in the end (delta: 64.0 MB). Free memory was 101.5 MB in the beginning and 154.4 MB in the end (delta: -52.9 MB). Peak memory consumption was 24.4 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 63.02 ms. Allocated memory is still 202.9 MB. Free memory was 154.4 MB in the beginning and 151.6 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 44.23 ms. Allocated memory is still 202.9 MB. Free memory was 151.6 MB in the beginning and 149.6 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 828.45 ms. Allocated memory is still 202.9 MB. Free memory was 149.6 MB in the beginning and 99.4 MB in the end (delta: 50.2 MB). Peak memory consumption was 50.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 147293.88 ms. Allocated memory was 202.9 MB in the beginning and 3.1 GB in the end (delta: 2.9 GB). Free memory was 98.7 MB in the beginning and 2.1 GB in the end (delta: -2.0 GB). Peak memory consumption was 950.8 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 6.4s, 175 ProgramPointsBefore, 92 ProgramPointsAfterwards, 212 TransitionsBefore, 102 TransitionsAfterwards, 19004 CoEnabledTransitionPairs, 12 FixpointIterations, 32 TrivialSequentialCompositions, 54 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 35 ConcurrentYvCompositions, 31 ChoiceCompositions, 7185 VarBasedMoverChecksPositive, 382 VarBasedMoverChecksNegative, 188 SemBasedMoverChecksPositive, 288 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 2.1s, 0 MoverChecksTotal, 125946 CheckedPairsTotal, 121 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L820] FCALL, FORK 0 pthread_create(&t2287, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L734] 1 z$r_buff1_thd0 = z$r_buff0_thd0 [L735] 1 z$r_buff1_thd1 = z$r_buff0_thd1 [L736] 1 z$r_buff1_thd2 = z$r_buff0_thd2 [L737] 1 z$r_buff1_thd3 = z$r_buff0_thd3 [L738] 1 z$r_buff0_thd1 = (_Bool)1 [L741] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L744] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L822] FCALL, FORK 0 pthread_create(&t2288, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L824] FCALL, FORK 0 pthread_create(&t2289, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L758] 2 x = 2 [L761] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=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=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L764] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=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=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L764] 2 z = z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L778] 3 __unbuffered_p2_EAX = y [L781] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L782] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L783] 3 z$flush_delayed = weak$$choice2 [L784] 3 z$mem_tmp = z VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=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=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L785] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) VAL [!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=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=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L785] 3 z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L765] 2 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L786] EXPR 3 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=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 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0))=1, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L766] 2 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L786] 3 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L787] 3 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L767] 2 z$r_buff0_thd2 = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L788] 3 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L789] 3 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L791] EXPR 3 weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=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 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))=0, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L791] 3 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L792] 3 __unbuffered_p2_EBX = z VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=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=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L797] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=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=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L744] 1 z = z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L745] 1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L746] 1 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L797] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L798] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L799] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L800] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L830] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=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=2, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L830] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L831] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L832] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L833] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 166 locations, 2 error locations. Result: UNSAFE, OverallTime: 146.9s, OverallIterations: 42, TraceHistogramMax: 1, AutomataDifference: 66.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 10665 SDtfs, 15432 SDslu, 43068 SDs, 0 SdLazy, 38370 SolverSat, 943 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 32.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 827 GetRequests, 62 SyntacticMatches, 53 SemanticMatches, 712 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7174 ImplicationChecksByTransitivity, 13.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=142946occurred 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: 46.5s AutomataMinimizationTime, 41 MinimizatonAttempts, 430711 StatesRemovedByMinimization, 38 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 6.3s InterpolantComputationTime, 2282 NumberOfCodeBlocks, 2282 NumberOfCodeBlocksAsserted, 42 NumberOfCheckSat, 2174 ConstructedInterpolants, 0 QuantifiedInterpolants, 614340 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 41 InterpolantComputations, 41 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...