/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix024_tso.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-26 21:59:18,482 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-26 21:59:18,485 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-26 21:59:18,503 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-26 21:59:18,504 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-26 21:59:18,506 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-26 21:59:18,508 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-26 21:59:18,517 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-26 21:59:18,521 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-26 21:59:18,524 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-26 21:59:18,526 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-26 21:59:18,527 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-26 21:59:18,528 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-26 21:59:18,529 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-26 21:59:18,532 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-26 21:59:18,533 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-26 21:59:18,535 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-26 21:59:18,536 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-26 21:59:18,537 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-26 21:59:18,542 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-26 21:59:18,546 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-26 21:59:18,551 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-26 21:59:18,552 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-26 21:59:18,553 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-26 21:59:18,555 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-26 21:59:18,555 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-26 21:59:18,555 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-26 21:59:18,557 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-26 21:59:18,558 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-26 21:59:18,559 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-26 21:59:18,560 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-26 21:59:18,561 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-26 21:59:18,561 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-26 21:59:18,562 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-26 21:59:18,564 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-26 21:59:18,564 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-26 21:59:18,564 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-26 21:59:18,565 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-26 21:59:18,565 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-26 21:59:18,566 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-26 21:59:18,567 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-26 21:59:18,568 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-26 21:59:18,600 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-26 21:59:18,603 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-26 21:59:18,604 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-26 21:59:18,604 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-26 21:59:18,605 INFO L138 SettingsManager]: * Use SBE=true [2019-12-26 21:59:18,607 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-26 21:59:18,607 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-26 21:59:18,607 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-26 21:59:18,607 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-26 21:59:18,607 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-26 21:59:18,608 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-26 21:59:18,608 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-26 21:59:18,608 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-26 21:59:18,608 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-26 21:59:18,608 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-26 21:59:18,609 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-26 21:59:18,609 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-26 21:59:18,609 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-26 21:59:18,609 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-26 21:59:18,609 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-26 21:59:18,611 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-26 21:59:18,611 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-26 21:59:18,611 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-26 21:59:18,612 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-26 21:59:18,612 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-26 21:59:18,612 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-26 21:59:18,612 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-26 21:59:18,612 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-26 21:59:18,613 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-26 21:59:18,613 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-26 21:59:18,893 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-26 21:59:18,912 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-26 21:59:18,917 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-26 21:59:18,918 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-26 21:59:18,919 INFO L275 PluginConnector]: CDTParser initialized [2019-12-26 21:59:18,920 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix024_tso.oepc.i [2019-12-26 21:59:18,995 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/84a589b0d/5ed8274c69f4474cb8753a5a93449a66/FLAG79a29b151 [2019-12-26 21:59:19,636 INFO L306 CDTParser]: Found 1 translation units. [2019-12-26 21:59:19,637 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix024_tso.oepc.i [2019-12-26 21:59:19,651 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/84a589b0d/5ed8274c69f4474cb8753a5a93449a66/FLAG79a29b151 [2019-12-26 21:59:19,917 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/84a589b0d/5ed8274c69f4474cb8753a5a93449a66 [2019-12-26 21:59:19,927 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-26 21:59:19,929 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-26 21:59:19,930 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-26 21:59:19,930 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-26 21:59:19,933 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-26 21:59:19,934 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.12 09:59:19" (1/1) ... [2019-12-26 21:59:19,936 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1a53435a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 09:59:19, skipping insertion in model container [2019-12-26 21:59:19,936 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.12 09:59:19" (1/1) ... [2019-12-26 21:59:19,943 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-26 21:59:20,001 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-26 21:59:20,613 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-26 21:59:20,626 INFO L203 MainTranslator]: Completed pre-run [2019-12-26 21:59:20,720 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-26 21:59:20,796 INFO L208 MainTranslator]: Completed translation [2019-12-26 21:59:20,797 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 09:59:20 WrapperNode [2019-12-26 21:59:20,797 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-26 21:59:20,798 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-26 21:59:20,798 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-26 21:59:20,798 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-26 21:59:20,807 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 09:59:20" (1/1) ... [2019-12-26 21:59:20,833 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 09:59:20" (1/1) ... [2019-12-26 21:59:20,864 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-26 21:59:20,864 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-26 21:59:20,864 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-26 21:59:20,865 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-26 21:59:20,874 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 09:59:20" (1/1) ... [2019-12-26 21:59:20,875 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 09:59:20" (1/1) ... [2019-12-26 21:59:20,880 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 09:59:20" (1/1) ... [2019-12-26 21:59:20,880 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 09:59:20" (1/1) ... [2019-12-26 21:59:20,894 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 09:59:20" (1/1) ... [2019-12-26 21:59:20,900 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 09:59:20" (1/1) ... [2019-12-26 21:59:20,904 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 09:59:20" (1/1) ... [2019-12-26 21:59:20,910 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-26 21:59:20,910 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-26 21:59:20,910 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-26 21:59:20,911 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-26 21:59:20,912 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 09:59:20" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-26 21:59:21,013 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-26 21:59:21,014 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-26 21:59:21,014 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-26 21:59:21,014 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-26 21:59:21,015 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-26 21:59:21,016 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-26 21:59:21,016 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-26 21:59:21,017 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-26 21:59:21,017 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-26 21:59:21,018 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-26 21:59:21,019 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-26 21:59:21,019 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-26 21:59:21,019 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-26 21:59:21,022 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-26 21:59:21,874 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-26 21:59:21,875 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-26 21:59:21,876 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.12 09:59:21 BoogieIcfgContainer [2019-12-26 21:59:21,876 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-26 21:59:21,878 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-26 21:59:21,878 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-26 21:59:21,881 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-26 21:59:21,881 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.12 09:59:19" (1/3) ... [2019-12-26 21:59:21,882 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@35ed182f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.12 09:59:21, skipping insertion in model container [2019-12-26 21:59:21,883 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 09:59:20" (2/3) ... [2019-12-26 21:59:21,883 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@35ed182f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.12 09:59:21, skipping insertion in model container [2019-12-26 21:59:21,883 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.12 09:59:21" (3/3) ... [2019-12-26 21:59:21,885 INFO L109 eAbstractionObserver]: Analyzing ICFG mix024_tso.oepc.i [2019-12-26 21:59:21,895 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-26 21:59:21,895 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-26 21:59:21,902 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-26 21:59:21,903 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-26 21:59:21,957 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:59:21,958 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:59:21,958 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:59:21,958 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:59:21,958 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:59:21,958 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:59:21,959 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:59:21,959 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:59:21,961 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:59:21,961 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:59:21,962 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:59:21,962 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:59:21,962 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:59:21,962 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:59:21,963 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:59:21,963 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:59:21,963 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:59:21,963 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:59:21,964 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:59:21,964 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:59:21,964 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:59:21,964 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:59:21,965 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:59:21,965 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:59:21,965 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:59:21,965 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:59:21,966 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:59:21,966 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:59:21,966 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:59:21,967 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:59:21,968 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:59:21,968 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:59:21,968 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:59:21,968 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:59:21,970 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:59:21,970 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:59:21,971 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:59:21,971 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:59:21,972 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:59:21,973 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:59:21,973 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:59:21,973 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:59:21,973 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:59:21,974 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:59:21,974 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:59:21,974 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:59:21,990 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:59:21,991 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:59:21,991 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:59:21,991 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:59:21,991 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:59:21,992 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:59:21,992 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:59:21,992 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:59:21,992 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:59:21,993 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:59:21,993 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:59:21,993 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:59:21,993 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:59:21,994 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:59:21,995 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:59:21,996 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:59:21,996 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:59:21,996 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:59:22,003 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:59:22,004 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:59:22,004 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:59:22,004 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:59:22,004 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:59:22,004 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:59:22,004 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:59:22,005 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:59:22,005 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:59:22,005 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:59:22,005 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:59:22,006 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:59:22,006 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:59:22,006 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:59:22,006 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:59:22,006 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:59:22,007 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:59:22,008 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:59:22,008 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:59:22,008 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:59:22,008 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:59:22,009 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:59:22,011 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:59:22,011 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:59:22,011 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:59:22,012 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:59:22,012 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:59:22,012 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:59:22,012 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:59:22,012 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:59:22,013 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:59:22,013 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:59:22,013 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:59:22,013 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:59:22,013 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:59:22,014 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:59:22,014 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:59:22,015 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:59:22,018 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:59:22,019 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:59:22,019 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:59:22,019 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:59:22,026 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:59:22,027 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:59:22,028 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:59:22,028 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:59:22,028 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:59:22,028 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:59:22,029 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:59:22,029 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:59:22,029 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:59:22,029 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:59:22,029 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:59:22,030 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:59:22,030 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:59:22,030 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:59:22,030 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:59:22,032 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:59:22,033 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:59:22,033 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:59:22,033 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:59:22,033 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:59:22,034 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:59:22,035 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:59:22,035 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:59:22,035 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:59:22,035 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:59:22,035 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:59:22,036 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:59:22,036 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:59:22,036 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:59:22,036 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:59:22,036 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:59:22,036 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:59:22,039 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:59:22,039 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:59:22,040 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:59:22,040 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:59:22,040 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:59:22,040 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:59:22,041 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:59:22,041 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:59:22,041 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:59:22,041 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:59:22,041 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:59:22,041 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:59:22,042 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:59:22,042 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:59:22,042 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:59:22,042 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:59:22,042 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:59:22,043 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:59:22,043 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:59:22,043 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:59:22,045 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:59:22,045 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:59:22,045 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:59:22,045 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:59:22,045 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:59:22,046 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:59:22,046 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:59:22,046 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:59:22,046 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:59:22,047 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:59:22,047 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:59:22,047 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:59:22,047 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:59:22,047 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:59:22,048 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:59:22,048 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:59:22,049 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:59:22,049 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:59:22,049 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:59:22,049 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:59:22,049 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:59:22,050 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:59:22,050 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:59:22,050 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:59:22,054 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:59:22,055 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:59:22,056 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:59:22,056 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:59:22,056 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:59:22,056 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:59:22,056 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:59:22,057 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:59:22,057 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:59:22,057 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:59:22,057 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:59:22,057 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:59:22,059 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:59:22,059 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:59:22,059 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:59:22,060 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:59:22,060 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:59:22,060 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:59:22,060 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:59:22,060 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:59:22,060 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:59:22,061 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:59:22,061 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:59:22,061 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:59:22,061 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:59:22,061 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:59:22,061 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:59:22,062 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:59:22,062 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:59:22,062 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:59:22,062 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:59:22,063 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:59:22,063 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:59:22,066 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:59:22,067 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:59:22,067 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:59:22,067 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:59:22,073 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:59:22,074 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:59:22,074 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:59:22,074 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:59:22,074 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:59:22,075 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:59:22,075 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:59:22,075 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:59:22,078 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:59:22,078 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:59:22,079 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:59:22,079 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:59:22,079 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:59:22,079 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:59:22,079 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:59:22,079 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:59:22,084 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:59:22,084 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:59:22,099 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-26 21:59:22,120 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-26 21:59:22,120 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-26 21:59:22,120 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-26 21:59:22,120 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-26 21:59:22,120 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-26 21:59:22,120 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-26 21:59:22,121 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-26 21:59:22,121 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-26 21:59:22,141 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 178 places, 215 transitions [2019-12-26 21:59:22,143 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 178 places, 215 transitions [2019-12-26 21:59:22,248 INFO L132 PetriNetUnfolder]: 47/212 cut-off events. [2019-12-26 21:59:22,248 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-26 21:59:22,266 INFO L76 FinitePrefix]: Finished finitePrefix Result has 222 conditions, 212 events. 47/212 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 431 event pairs. 0/163 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-26 21:59:22,296 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 178 places, 215 transitions [2019-12-26 21:59:22,351 INFO L132 PetriNetUnfolder]: 47/212 cut-off events. [2019-12-26 21:59:22,351 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-26 21:59:22,360 INFO L76 FinitePrefix]: Finished finitePrefix Result has 222 conditions, 212 events. 47/212 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 431 event pairs. 0/163 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-26 21:59:22,381 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 19004 [2019-12-26 21:59:22,382 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-26 21:59:27,378 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 45 [2019-12-26 21:59:27,799 WARN L192 SmtUtils]: Spent 271.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 93 [2019-12-26 21:59:27,948 WARN L192 SmtUtils]: Spent 145.00 ms on a formula simplification that was a NOOP. DAG size: 91 [2019-12-26 21:59:27,971 INFO L206 etLargeBlockEncoding]: Checked pairs total: 78858 [2019-12-26 21:59:27,972 INFO L214 etLargeBlockEncoding]: Total number of compositions: 113 [2019-12-26 21:59:27,975 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 93 places, 102 transitions [2019-12-26 21:59:47,045 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 115112 states. [2019-12-26 21:59:47,047 INFO L276 IsEmpty]: Start isEmpty. Operand 115112 states. [2019-12-26 21:59:47,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-26 21:59:47,052 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:59:47,053 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-26 21:59:47,053 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 21:59:47,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:59:47,058 INFO L82 PathProgramCache]: Analyzing trace with hash 917918, now seen corresponding path program 1 times [2019-12-26 21:59:47,066 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:59:47,066 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1845408825] [2019-12-26 21:59:47,066 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:59:47,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:59:47,267 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 21:59:47,268 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1845408825] [2019-12-26 21:59:47,269 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:59:47,269 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-26 21:59:47,270 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1041280583] [2019-12-26 21:59:47,275 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 21:59:47,275 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:59:47,296 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 21:59:47,297 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 21:59:47,299 INFO L87 Difference]: Start difference. First operand 115112 states. Second operand 3 states. [2019-12-26 21:59:48,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:59:48,637 INFO L93 Difference]: Finished difference Result 114110 states and 484570 transitions. [2019-12-26 21:59:48,637 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 21:59:48,638 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-26 21:59:48,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:59:49,471 INFO L225 Difference]: With dead ends: 114110 [2019-12-26 21:59:49,472 INFO L226 Difference]: Without dead ends: 107012 [2019-12-26 21:59:49,473 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 21:59:56,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107012 states. [2019-12-26 21:59:59,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107012 to 107012. [2019-12-26 21:59:59,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107012 states. [2019-12-26 21:59:59,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107012 states to 107012 states and 453812 transitions. [2019-12-26 21:59:59,982 INFO L78 Accepts]: Start accepts. Automaton has 107012 states and 453812 transitions. Word has length 3 [2019-12-26 21:59:59,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:59:59,982 INFO L462 AbstractCegarLoop]: Abstraction has 107012 states and 453812 transitions. [2019-12-26 21:59:59,982 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 21:59:59,982 INFO L276 IsEmpty]: Start isEmpty. Operand 107012 states and 453812 transitions. [2019-12-26 21:59:59,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-26 21:59:59,986 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:59:59,987 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 21:59:59,987 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 21:59:59,987 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:59:59,988 INFO L82 PathProgramCache]: Analyzing trace with hash -1578322365, now seen corresponding path program 1 times [2019-12-26 21:59:59,988 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:59:59,988 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [31678097] [2019-12-26 21:59:59,988 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:00:00,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:00:00,104 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 22:00:00,105 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [31678097] [2019-12-26 22:00:00,105 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:00:00,105 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 22:00:00,105 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1879590523] [2019-12-26 22:00:00,107 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-26 22:00:00,107 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:00:00,107 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-26 22:00:00,107 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-26 22:00:00,107 INFO L87 Difference]: Start difference. First operand 107012 states and 453812 transitions. Second operand 4 states. [2019-12-26 22:00:04,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:00:04,788 INFO L93 Difference]: Finished difference Result 166210 states and 677236 transitions. [2019-12-26 22:00:04,788 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-26 22:00:04,788 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-26 22:00:04,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:00:05,923 INFO L225 Difference]: With dead ends: 166210 [2019-12-26 22:00:05,924 INFO L226 Difference]: Without dead ends: 166161 [2019-12-26 22:00:05,925 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-26 22:00:15,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166161 states. [2019-12-26 22:00:19,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166161 to 151748. [2019-12-26 22:00:19,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151748 states. [2019-12-26 22:00:19,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151748 states to 151748 states and 626089 transitions. [2019-12-26 22:00:19,971 INFO L78 Accepts]: Start accepts. Automaton has 151748 states and 626089 transitions. Word has length 11 [2019-12-26 22:00:19,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:00:19,971 INFO L462 AbstractCegarLoop]: Abstraction has 151748 states and 626089 transitions. [2019-12-26 22:00:19,971 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-26 22:00:19,971 INFO L276 IsEmpty]: Start isEmpty. Operand 151748 states and 626089 transitions. [2019-12-26 22:00:19,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-26 22:00:19,979 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:00:19,979 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 22:00:19,979 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:00:19,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:00:19,980 INFO L82 PathProgramCache]: Analyzing trace with hash 608601994, now seen corresponding path program 1 times [2019-12-26 22:00:19,980 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:00:19,980 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [25830797] [2019-12-26 22:00:19,980 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:00:20,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:00:20,042 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 22:00:20,043 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [25830797] [2019-12-26 22:00:20,044 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:00:20,044 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 22:00:20,044 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [392797786] [2019-12-26 22:00:20,045 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 22:00:20,045 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:00:20,045 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 22:00:20,045 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 22:00:20,045 INFO L87 Difference]: Start difference. First operand 151748 states and 626089 transitions. Second operand 3 states. [2019-12-26 22:00:20,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:00:20,174 INFO L93 Difference]: Finished difference Result 33068 states and 106908 transitions. [2019-12-26 22:00:20,174 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 22:00:20,174 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-26 22:00:20,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:00:20,284 INFO L225 Difference]: With dead ends: 33068 [2019-12-26 22:00:20,284 INFO L226 Difference]: Without dead ends: 33068 [2019-12-26 22:00:20,285 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 22:00:20,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33068 states. [2019-12-26 22:00:25,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33068 to 33068. [2019-12-26 22:00:25,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33068 states. [2019-12-26 22:00:25,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33068 states to 33068 states and 106908 transitions. [2019-12-26 22:00:25,660 INFO L78 Accepts]: Start accepts. Automaton has 33068 states and 106908 transitions. Word has length 13 [2019-12-26 22:00:25,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:00:25,660 INFO L462 AbstractCegarLoop]: Abstraction has 33068 states and 106908 transitions. [2019-12-26 22:00:25,660 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 22:00:25,660 INFO L276 IsEmpty]: Start isEmpty. Operand 33068 states and 106908 transitions. [2019-12-26 22:00:25,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-26 22:00:25,664 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:00:25,664 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 22:00:25,664 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:00:25,665 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:00:25,665 INFO L82 PathProgramCache]: Analyzing trace with hash -1174763718, now seen corresponding path program 1 times [2019-12-26 22:00:25,665 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:00:25,665 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [558178393] [2019-12-26 22:00:25,665 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:00:25,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:00:25,774 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 22:00:25,774 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [558178393] [2019-12-26 22:00:25,775 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:00:25,775 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 22:00:25,775 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1470139637] [2019-12-26 22:00:25,775 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-26 22:00:25,776 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:00:25,776 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-26 22:00:25,776 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-26 22:00:25,776 INFO L87 Difference]: Start difference. First operand 33068 states and 106908 transitions. Second operand 5 states. [2019-12-26 22:00:26,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:00:26,253 INFO L93 Difference]: Finished difference Result 45410 states and 145082 transitions. [2019-12-26 22:00:26,254 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-26 22:00:26,254 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2019-12-26 22:00:26,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:00:26,346 INFO L225 Difference]: With dead ends: 45410 [2019-12-26 22:00:26,346 INFO L226 Difference]: Without dead ends: 45410 [2019-12-26 22:00:26,346 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-26 22:00:26,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45410 states. [2019-12-26 22:00:27,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45410 to 38207. [2019-12-26 22:00:27,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38207 states. [2019-12-26 22:00:27,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38207 states to 38207 states and 123094 transitions. [2019-12-26 22:00:27,417 INFO L78 Accepts]: Start accepts. Automaton has 38207 states and 123094 transitions. Word has length 16 [2019-12-26 22:00:27,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:00:27,418 INFO L462 AbstractCegarLoop]: Abstraction has 38207 states and 123094 transitions. [2019-12-26 22:00:27,419 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-26 22:00:27,419 INFO L276 IsEmpty]: Start isEmpty. Operand 38207 states and 123094 transitions. [2019-12-26 22:00:27,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-26 22:00:27,428 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:00:27,428 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 22:00:27,429 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:00:27,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:00:27,429 INFO L82 PathProgramCache]: Analyzing trace with hash -219431606, now seen corresponding path program 1 times [2019-12-26 22:00:27,429 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:00:27,430 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1031251831] [2019-12-26 22:00:27,430 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:00:27,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:00:27,523 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 22:00:27,523 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1031251831] [2019-12-26 22:00:27,523 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:00:27,523 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-26 22:00:27,524 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [608648101] [2019-12-26 22:00:27,524 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-26 22:00:27,524 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:00:27,524 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-26 22:00:27,525 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-26 22:00:27,525 INFO L87 Difference]: Start difference. First operand 38207 states and 123094 transitions. Second operand 6 states. [2019-12-26 22:00:28,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:00:28,529 INFO L93 Difference]: Finished difference Result 56872 states and 178934 transitions. [2019-12-26 22:00:28,530 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-26 22:00:28,530 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2019-12-26 22:00:28,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:00:28,621 INFO L225 Difference]: With dead ends: 56872 [2019-12-26 22:00:28,622 INFO L226 Difference]: Without dead ends: 56865 [2019-12-26 22:00:28,622 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2019-12-26 22:00:28,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56865 states. [2019-12-26 22:00:29,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56865 to 38602. [2019-12-26 22:00:29,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38602 states. [2019-12-26 22:00:29,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38602 states to 38602 states and 123793 transitions. [2019-12-26 22:00:29,858 INFO L78 Accepts]: Start accepts. Automaton has 38602 states and 123793 transitions. Word has length 22 [2019-12-26 22:00:29,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:00:29,859 INFO L462 AbstractCegarLoop]: Abstraction has 38602 states and 123793 transitions. [2019-12-26 22:00:29,859 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-26 22:00:29,859 INFO L276 IsEmpty]: Start isEmpty. Operand 38602 states and 123793 transitions. [2019-12-26 22:00:29,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-26 22:00:29,872 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:00:29,872 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 22:00:29,872 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:00:29,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:00:29,873 INFO L82 PathProgramCache]: Analyzing trace with hash -2132778958, now seen corresponding path program 1 times [2019-12-26 22:00:29,873 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:00:29,873 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [961261778] [2019-12-26 22:00:29,873 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:00:29,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:00:29,931 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 22:00:29,932 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [961261778] [2019-12-26 22:00:29,933 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:00:29,933 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 22:00:29,933 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [95107964] [2019-12-26 22:00:29,934 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-26 22:00:29,935 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:00:29,935 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-26 22:00:29,935 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-26 22:00:29,936 INFO L87 Difference]: Start difference. First operand 38602 states and 123793 transitions. Second operand 4 states. [2019-12-26 22:00:29,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:00:29,996 INFO L93 Difference]: Finished difference Result 16014 states and 48574 transitions. [2019-12-26 22:00:29,996 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-26 22:00:29,997 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2019-12-26 22:00:29,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:00:30,018 INFO L225 Difference]: With dead ends: 16014 [2019-12-26 22:00:30,018 INFO L226 Difference]: Without dead ends: 16014 [2019-12-26 22:00:30,019 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-26 22:00:30,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16014 states. [2019-12-26 22:00:30,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16014 to 15686. [2019-12-26 22:00:30,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15686 states. [2019-12-26 22:00:30,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15686 states to 15686 states and 47638 transitions. [2019-12-26 22:00:30,260 INFO L78 Accepts]: Start accepts. Automaton has 15686 states and 47638 transitions. Word has length 25 [2019-12-26 22:00:30,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:00:30,261 INFO L462 AbstractCegarLoop]: Abstraction has 15686 states and 47638 transitions. [2019-12-26 22:00:30,261 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-26 22:00:30,261 INFO L276 IsEmpty]: Start isEmpty. Operand 15686 states and 47638 transitions. [2019-12-26 22:00:30,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-26 22:00:30,276 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:00:30,276 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 22:00:30,276 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:00:30,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:00:30,276 INFO L82 PathProgramCache]: Analyzing trace with hash 1790545903, now seen corresponding path program 1 times [2019-12-26 22:00:30,277 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:00:30,277 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [415174585] [2019-12-26 22:00:30,277 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:00:30,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:00:30,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-26 22:00:30,364 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [415174585] [2019-12-26 22:00:30,364 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:00:30,364 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-26 22:00:30,365 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [228413061] [2019-12-26 22:00:30,365 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-26 22:00:30,365 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:00:30,366 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-26 22:00:30,366 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-26 22:00:30,366 INFO L87 Difference]: Start difference. First operand 15686 states and 47638 transitions. Second operand 6 states. [2019-12-26 22:00:30,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:00:30,968 INFO L93 Difference]: Finished difference Result 22624 states and 66983 transitions. [2019-12-26 22:00:30,969 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-26 22:00:30,969 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2019-12-26 22:00:30,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:00:31,012 INFO L225 Difference]: With dead ends: 22624 [2019-12-26 22:00:31,013 INFO L226 Difference]: Without dead ends: 22624 [2019-12-26 22:00:31,013 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-12-26 22:00:31,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22624 states. [2019-12-26 22:00:31,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22624 to 18003. [2019-12-26 22:00:31,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18003 states. [2019-12-26 22:00:31,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18003 states to 18003 states and 54460 transitions. [2019-12-26 22:00:31,537 INFO L78 Accepts]: Start accepts. Automaton has 18003 states and 54460 transitions. Word has length 27 [2019-12-26 22:00:31,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:00:31,538 INFO L462 AbstractCegarLoop]: Abstraction has 18003 states and 54460 transitions. [2019-12-26 22:00:31,538 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-26 22:00:31,538 INFO L276 IsEmpty]: Start isEmpty. Operand 18003 states and 54460 transitions. [2019-12-26 22:00:31,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-26 22:00:31,565 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:00:31,565 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 22:00:31,565 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:00:31,566 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:00:31,566 INFO L82 PathProgramCache]: Analyzing trace with hash -718999585, now seen corresponding path program 1 times [2019-12-26 22:00:31,566 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:00:31,566 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1897493871] [2019-12-26 22:00:31,566 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:00:31,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:00:31,710 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 22:00:31,711 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1897493871] [2019-12-26 22:00:31,711 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:00:31,711 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-26 22:00:31,712 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [675384483] [2019-12-26 22:00:31,712 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-26 22:00:31,712 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:00:31,712 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-26 22:00:31,713 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-26 22:00:31,713 INFO L87 Difference]: Start difference. First operand 18003 states and 54460 transitions. Second operand 7 states. [2019-12-26 22:00:33,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:00:33,137 INFO L93 Difference]: Finished difference Result 24689 states and 72792 transitions. [2019-12-26 22:00:33,137 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-26 22:00:33,137 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 33 [2019-12-26 22:00:33,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:00:33,170 INFO L225 Difference]: With dead ends: 24689 [2019-12-26 22:00:33,170 INFO L226 Difference]: Without dead ends: 24689 [2019-12-26 22:00:33,171 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=90, Invalid=252, Unknown=0, NotChecked=0, Total=342 [2019-12-26 22:00:33,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24689 states. [2019-12-26 22:00:33,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24689 to 16556. [2019-12-26 22:00:33,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16556 states. [2019-12-26 22:00:33,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16556 states to 16556 states and 50149 transitions. [2019-12-26 22:00:33,473 INFO L78 Accepts]: Start accepts. Automaton has 16556 states and 50149 transitions. Word has length 33 [2019-12-26 22:00:33,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:00:33,474 INFO L462 AbstractCegarLoop]: Abstraction has 16556 states and 50149 transitions. [2019-12-26 22:00:33,474 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-26 22:00:33,474 INFO L276 IsEmpty]: Start isEmpty. Operand 16556 states and 50149 transitions. [2019-12-26 22:00:33,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-26 22:00:33,496 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:00:33,496 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 22:00:33,497 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:00:33,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:00:33,497 INFO L82 PathProgramCache]: Analyzing trace with hash -1488715022, now seen corresponding path program 1 times [2019-12-26 22:00:33,497 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:00:33,497 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1217606734] [2019-12-26 22:00:33,498 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:00:33,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:00:33,563 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 22:00:33,563 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1217606734] [2019-12-26 22:00:33,563 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:00:33,564 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 22:00:33,564 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2013489225] [2019-12-26 22:00:33,564 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 22:00:33,564 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:00:33,565 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 22:00:33,567 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 22:00:33,567 INFO L87 Difference]: Start difference. First operand 16556 states and 50149 transitions. Second operand 3 states. [2019-12-26 22:00:33,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:00:33,719 INFO L93 Difference]: Finished difference Result 31245 states and 94721 transitions. [2019-12-26 22:00:33,719 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 22:00:33,720 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2019-12-26 22:00:33,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:00:33,756 INFO L225 Difference]: With dead ends: 31245 [2019-12-26 22:00:33,757 INFO L226 Difference]: Without dead ends: 17019 [2019-12-26 22:00:33,757 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 22:00:33,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17019 states. [2019-12-26 22:00:34,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17019 to 16954. [2019-12-26 22:00:34,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16954 states. [2019-12-26 22:00:34,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16954 states to 16954 states and 50123 transitions. [2019-12-26 22:00:34,101 INFO L78 Accepts]: Start accepts. Automaton has 16954 states and 50123 transitions. Word has length 39 [2019-12-26 22:00:34,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:00:34,102 INFO L462 AbstractCegarLoop]: Abstraction has 16954 states and 50123 transitions. [2019-12-26 22:00:34,102 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 22:00:34,102 INFO L276 IsEmpty]: Start isEmpty. Operand 16954 states and 50123 transitions. [2019-12-26 22:00:34,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-26 22:00:34,123 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:00:34,123 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 22:00:34,123 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:00:34,123 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:00:34,123 INFO L82 PathProgramCache]: Analyzing trace with hash 1258899919, now seen corresponding path program 1 times [2019-12-26 22:00:34,124 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:00:34,124 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1743798991] [2019-12-26 22:00:34,124 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:00:34,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:00:34,210 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 22:00:34,210 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1743798991] [2019-12-26 22:00:34,210 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:00:34,211 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 22:00:34,211 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [577612495] [2019-12-26 22:00:34,211 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-26 22:00:34,211 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:00:34,212 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-26 22:00:34,212 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-26 22:00:34,212 INFO L87 Difference]: Start difference. First operand 16954 states and 50123 transitions. Second operand 4 states. [2019-12-26 22:00:34,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:00:34,328 INFO L93 Difference]: Finished difference Result 24032 states and 72414 transitions. [2019-12-26 22:00:34,328 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-26 22:00:34,328 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 40 [2019-12-26 22:00:34,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:00:34,351 INFO L225 Difference]: With dead ends: 24032 [2019-12-26 22:00:34,352 INFO L226 Difference]: Without dead ends: 10093 [2019-12-26 22:00:34,352 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-26 22:00:34,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10093 states. [2019-12-26 22:00:34,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10093 to 10019. [2019-12-26 22:00:34,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10019 states. [2019-12-26 22:00:34,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10019 states to 10019 states and 28985 transitions. [2019-12-26 22:00:34,647 INFO L78 Accepts]: Start accepts. Automaton has 10019 states and 28985 transitions. Word has length 40 [2019-12-26 22:00:34,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:00:34,647 INFO L462 AbstractCegarLoop]: Abstraction has 10019 states and 28985 transitions. [2019-12-26 22:00:34,648 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-26 22:00:34,648 INFO L276 IsEmpty]: Start isEmpty. Operand 10019 states and 28985 transitions. [2019-12-26 22:00:34,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-26 22:00:34,670 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:00:34,670 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 22:00:34,671 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:00:34,671 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:00:34,671 INFO L82 PathProgramCache]: Analyzing trace with hash -328554267, now seen corresponding path program 2 times [2019-12-26 22:00:34,671 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:00:34,672 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1975951563] [2019-12-26 22:00:34,672 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:00:34,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:00:34,781 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 22:00:34,781 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1975951563] [2019-12-26 22:00:34,781 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:00:34,782 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-26 22:00:34,782 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [335464361] [2019-12-26 22:00:34,782 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-26 22:00:34,783 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:00:34,783 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-26 22:00:34,783 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-26 22:00:34,783 INFO L87 Difference]: Start difference. First operand 10019 states and 28985 transitions. Second operand 5 states. [2019-12-26 22:00:34,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:00:34,840 INFO L93 Difference]: Finished difference Result 9224 states and 27210 transitions. [2019-12-26 22:00:34,840 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-26 22:00:34,840 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 40 [2019-12-26 22:00:34,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:00:34,855 INFO L225 Difference]: With dead ends: 9224 [2019-12-26 22:00:34,855 INFO L226 Difference]: Without dead ends: 6480 [2019-12-26 22:00:34,856 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-26 22:00:34,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6480 states. [2019-12-26 22:00:35,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6480 to 6480. [2019-12-26 22:00:35,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6480 states. [2019-12-26 22:00:35,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6480 states to 6480 states and 20925 transitions. [2019-12-26 22:00:35,162 INFO L78 Accepts]: Start accepts. Automaton has 6480 states and 20925 transitions. Word has length 40 [2019-12-26 22:00:35,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:00:35,162 INFO L462 AbstractCegarLoop]: Abstraction has 6480 states and 20925 transitions. [2019-12-26 22:00:35,163 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-26 22:00:35,163 INFO L276 IsEmpty]: Start isEmpty. Operand 6480 states and 20925 transitions. [2019-12-26 22:00:35,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-26 22:00:35,170 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:00:35,170 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 22:00:35,171 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:00:35,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:00:35,171 INFO L82 PathProgramCache]: Analyzing trace with hash -195559637, now seen corresponding path program 1 times [2019-12-26 22:00:35,171 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:00:35,171 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1061298098] [2019-12-26 22:00:35,171 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:00:35,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:00:35,225 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 22:00:35,225 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1061298098] [2019-12-26 22:00:35,225 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:00:35,226 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 22:00:35,226 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1553056695] [2019-12-26 22:00:35,226 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 22:00:35,227 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:00:35,227 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 22:00:35,227 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 22:00:35,227 INFO L87 Difference]: Start difference. First operand 6480 states and 20925 transitions. Second operand 3 states. [2019-12-26 22:00:35,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:00:35,296 INFO L93 Difference]: Finished difference Result 9612 states and 30454 transitions. [2019-12-26 22:00:35,296 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 22:00:35,296 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 64 [2019-12-26 22:00:35,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:00:35,313 INFO L225 Difference]: With dead ends: 9612 [2019-12-26 22:00:35,314 INFO L226 Difference]: Without dead ends: 9612 [2019-12-26 22:00:35,314 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 22:00:35,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9612 states. [2019-12-26 22:00:35,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9612 to 7416. [2019-12-26 22:00:35,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7416 states. [2019-12-26 22:00:35,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7416 states to 7416 states and 23733 transitions. [2019-12-26 22:00:35,504 INFO L78 Accepts]: Start accepts. Automaton has 7416 states and 23733 transitions. Word has length 64 [2019-12-26 22:00:35,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:00:35,504 INFO L462 AbstractCegarLoop]: Abstraction has 7416 states and 23733 transitions. [2019-12-26 22:00:35,504 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 22:00:35,504 INFO L276 IsEmpty]: Start isEmpty. Operand 7416 states and 23733 transitions. [2019-12-26 22:00:35,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-26 22:00:35,513 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:00:35,513 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 22:00:35,513 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:00:35,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:00:35,513 INFO L82 PathProgramCache]: Analyzing trace with hash 1426110435, now seen corresponding path program 1 times [2019-12-26 22:00:35,513 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:00:35,513 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1574737102] [2019-12-26 22:00:35,514 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:00:35,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:00:35,604 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 22:00:35,605 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1574737102] [2019-12-26 22:00:35,605 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:00:35,605 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-26 22:00:35,606 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1322992351] [2019-12-26 22:00:35,606 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-26 22:00:35,606 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:00:35,606 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-26 22:00:35,607 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-26 22:00:35,607 INFO L87 Difference]: Start difference. First operand 7416 states and 23733 transitions. Second operand 7 states. [2019-12-26 22:00:35,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:00:35,889 INFO L93 Difference]: Finished difference Result 14786 states and 46379 transitions. [2019-12-26 22:00:35,889 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-26 22:00:35,889 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 64 [2019-12-26 22:00:35,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:00:35,907 INFO L225 Difference]: With dead ends: 14786 [2019-12-26 22:00:35,907 INFO L226 Difference]: Without dead ends: 11103 [2019-12-26 22:00:35,907 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2019-12-26 22:00:35,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11103 states. [2019-12-26 22:00:36,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11103 to 9096. [2019-12-26 22:00:36,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9096 states. [2019-12-26 22:00:36,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9096 states to 9096 states and 28970 transitions. [2019-12-26 22:00:36,079 INFO L78 Accepts]: Start accepts. Automaton has 9096 states and 28970 transitions. Word has length 64 [2019-12-26 22:00:36,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:00:36,079 INFO L462 AbstractCegarLoop]: Abstraction has 9096 states and 28970 transitions. [2019-12-26 22:00:36,079 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-26 22:00:36,079 INFO L276 IsEmpty]: Start isEmpty. Operand 9096 states and 28970 transitions. [2019-12-26 22:00:36,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-26 22:00:36,089 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:00:36,089 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 22:00:36,090 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:00:36,090 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:00:36,090 INFO L82 PathProgramCache]: Analyzing trace with hash -1226826331, now seen corresponding path program 2 times [2019-12-26 22:00:36,090 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:00:36,090 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1294677509] [2019-12-26 22:00:36,090 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:00:36,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:00:36,181 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 22:00:36,182 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1294677509] [2019-12-26 22:00:36,182 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:00:36,182 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-26 22:00:36,182 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2010324726] [2019-12-26 22:00:36,183 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-26 22:00:36,183 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:00:36,183 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-26 22:00:36,183 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-26 22:00:36,183 INFO L87 Difference]: Start difference. First operand 9096 states and 28970 transitions. Second operand 7 states. [2019-12-26 22:00:36,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:00:36,444 INFO L93 Difference]: Finished difference Result 16709 states and 52072 transitions. [2019-12-26 22:00:36,444 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-26 22:00:36,445 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 64 [2019-12-26 22:00:36,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:00:36,463 INFO L225 Difference]: With dead ends: 16709 [2019-12-26 22:00:36,463 INFO L226 Difference]: Without dead ends: 12623 [2019-12-26 22:00:36,463 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2019-12-26 22:00:36,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12623 states. [2019-12-26 22:00:36,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12623 to 10382. [2019-12-26 22:00:36,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10382 states. [2019-12-26 22:00:36,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10382 states to 10382 states and 32866 transitions. [2019-12-26 22:00:36,650 INFO L78 Accepts]: Start accepts. Automaton has 10382 states and 32866 transitions. Word has length 64 [2019-12-26 22:00:36,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:00:36,650 INFO L462 AbstractCegarLoop]: Abstraction has 10382 states and 32866 transitions. [2019-12-26 22:00:36,650 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-26 22:00:36,650 INFO L276 IsEmpty]: Start isEmpty. Operand 10382 states and 32866 transitions. [2019-12-26 22:00:36,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-26 22:00:36,661 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:00:36,661 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 22:00:36,661 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:00:36,662 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:00:36,662 INFO L82 PathProgramCache]: Analyzing trace with hash -2098893209, now seen corresponding path program 3 times [2019-12-26 22:00:36,662 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:00:36,662 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1064741979] [2019-12-26 22:00:36,662 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:00:36,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:00:36,794 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 22:00:36,795 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1064741979] [2019-12-26 22:00:36,795 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:00:36,795 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-26 22:00:36,796 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [86792437] [2019-12-26 22:00:36,796 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-26 22:00:36,796 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:00:36,796 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-26 22:00:36,797 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-26 22:00:36,797 INFO L87 Difference]: Start difference. First operand 10382 states and 32866 transitions. Second operand 9 states. [2019-12-26 22:00:37,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:00:37,933 INFO L93 Difference]: Finished difference Result 36233 states and 111090 transitions. [2019-12-26 22:00:37,933 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-12-26 22:00:37,933 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 64 [2019-12-26 22:00:37,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:00:37,995 INFO L225 Difference]: With dead ends: 36233 [2019-12-26 22:00:37,995 INFO L226 Difference]: Without dead ends: 32009 [2019-12-26 22:00:37,998 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 219 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=229, Invalid=701, Unknown=0, NotChecked=0, Total=930 [2019-12-26 22:00:38,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32009 states. [2019-12-26 22:00:38,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32009 to 10214. [2019-12-26 22:00:38,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10214 states. [2019-12-26 22:00:38,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10214 states to 10214 states and 32290 transitions. [2019-12-26 22:00:38,587 INFO L78 Accepts]: Start accepts. Automaton has 10214 states and 32290 transitions. Word has length 64 [2019-12-26 22:00:38,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:00:38,588 INFO L462 AbstractCegarLoop]: Abstraction has 10214 states and 32290 transitions. [2019-12-26 22:00:38,588 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-26 22:00:38,588 INFO L276 IsEmpty]: Start isEmpty. Operand 10214 states and 32290 transitions. [2019-12-26 22:00:38,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-26 22:00:38,603 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:00:38,603 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 22:00:38,603 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:00:38,603 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:00:38,604 INFO L82 PathProgramCache]: Analyzing trace with hash 1900940369, now seen corresponding path program 1 times [2019-12-26 22:00:38,604 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:00:38,604 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1134333289] [2019-12-26 22:00:38,604 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:00:38,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:00:38,647 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 22:00:38,647 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1134333289] [2019-12-26 22:00:38,648 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:00:38,648 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 22:00:38,648 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [764765880] [2019-12-26 22:00:38,648 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 22:00:38,649 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:00:38,651 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 22:00:38,652 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 22:00:38,652 INFO L87 Difference]: Start difference. First operand 10214 states and 32290 transitions. Second operand 3 states. [2019-12-26 22:00:38,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:00:38,718 INFO L93 Difference]: Finished difference Result 12867 states and 40113 transitions. [2019-12-26 22:00:38,719 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 22:00:38,719 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 64 [2019-12-26 22:00:38,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:00:38,736 INFO L225 Difference]: With dead ends: 12867 [2019-12-26 22:00:38,736 INFO L226 Difference]: Without dead ends: 12867 [2019-12-26 22:00:38,736 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 22:00:38,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12867 states. [2019-12-26 22:00:38,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12867 to 10671. [2019-12-26 22:00:38,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10671 states. [2019-12-26 22:00:38,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10671 states to 10671 states and 33392 transitions. [2019-12-26 22:00:38,927 INFO L78 Accepts]: Start accepts. Automaton has 10671 states and 33392 transitions. Word has length 64 [2019-12-26 22:00:38,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:00:38,928 INFO L462 AbstractCegarLoop]: Abstraction has 10671 states and 33392 transitions. [2019-12-26 22:00:38,928 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 22:00:38,928 INFO L276 IsEmpty]: Start isEmpty. Operand 10671 states and 33392 transitions. [2019-12-26 22:00:38,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-26 22:00:38,945 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:00:38,945 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 22:00:38,945 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:00:38,945 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:00:38,945 INFO L82 PathProgramCache]: Analyzing trace with hash -612356637, now seen corresponding path program 4 times [2019-12-26 22:00:38,946 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:00:38,946 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [414037935] [2019-12-26 22:00:38,946 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:00:38,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:00:39,055 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 22:00:39,056 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [414037935] [2019-12-26 22:00:39,056 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:00:39,056 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-26 22:00:39,056 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [772530514] [2019-12-26 22:00:39,056 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-26 22:00:39,057 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:00:39,057 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-26 22:00:39,057 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-26 22:00:39,057 INFO L87 Difference]: Start difference. First operand 10671 states and 33392 transitions. Second operand 9 states. [2019-12-26 22:00:40,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:00:40,026 INFO L93 Difference]: Finished difference Result 28791 states and 88355 transitions. [2019-12-26 22:00:40,027 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-26 22:00:40,027 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 64 [2019-12-26 22:00:40,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:00:40,067 INFO L225 Difference]: With dead ends: 28791 [2019-12-26 22:00:40,067 INFO L226 Difference]: Without dead ends: 26476 [2019-12-26 22:00:40,068 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 143 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=157, Invalid=493, Unknown=0, NotChecked=0, Total=650 [2019-12-26 22:00:40,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26476 states. [2019-12-26 22:00:40,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26476 to 10699. [2019-12-26 22:00:40,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10699 states. [2019-12-26 22:00:40,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10699 states to 10699 states and 33546 transitions. [2019-12-26 22:00:40,345 INFO L78 Accepts]: Start accepts. Automaton has 10699 states and 33546 transitions. Word has length 64 [2019-12-26 22:00:40,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:00:40,346 INFO L462 AbstractCegarLoop]: Abstraction has 10699 states and 33546 transitions. [2019-12-26 22:00:40,346 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-26 22:00:40,346 INFO L276 IsEmpty]: Start isEmpty. Operand 10699 states and 33546 transitions. [2019-12-26 22:00:40,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-26 22:00:40,356 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:00:40,356 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 22:00:40,356 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:00:40,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:00:40,357 INFO L82 PathProgramCache]: Analyzing trace with hash 1413769055, now seen corresponding path program 5 times [2019-12-26 22:00:40,357 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:00:40,357 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [215216399] [2019-12-26 22:00:40,357 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:00:40,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:00:40,431 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 22:00:40,431 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [215216399] [2019-12-26 22:00:40,432 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:00:40,432 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-26 22:00:40,432 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1909547036] [2019-12-26 22:00:40,432 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-26 22:00:40,433 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:00:40,433 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-26 22:00:40,433 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-26 22:00:40,433 INFO L87 Difference]: Start difference. First operand 10699 states and 33546 transitions. Second operand 5 states. [2019-12-26 22:00:40,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:00:40,742 INFO L93 Difference]: Finished difference Result 12384 states and 38249 transitions. [2019-12-26 22:00:40,743 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-26 22:00:40,743 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 64 [2019-12-26 22:00:40,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:00:40,761 INFO L225 Difference]: With dead ends: 12384 [2019-12-26 22:00:40,761 INFO L226 Difference]: Without dead ends: 12384 [2019-12-26 22:00:40,762 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-26 22:00:40,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12384 states. [2019-12-26 22:00:40,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12384 to 11630. [2019-12-26 22:00:40,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11630 states. [2019-12-26 22:00:40,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11630 states to 11630 states and 36167 transitions. [2019-12-26 22:00:40,955 INFO L78 Accepts]: Start accepts. Automaton has 11630 states and 36167 transitions. Word has length 64 [2019-12-26 22:00:40,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:00:40,955 INFO L462 AbstractCegarLoop]: Abstraction has 11630 states and 36167 transitions. [2019-12-26 22:00:40,955 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-26 22:00:40,955 INFO L276 IsEmpty]: Start isEmpty. Operand 11630 states and 36167 transitions. [2019-12-26 22:00:40,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-26 22:00:40,968 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:00:40,968 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 22:00:40,968 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:00:40,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:00:40,968 INFO L82 PathProgramCache]: Analyzing trace with hash -1714079827, now seen corresponding path program 6 times [2019-12-26 22:00:40,969 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:00:40,969 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [694999638] [2019-12-26 22:00:40,969 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:00:40,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:00:41,273 WARN L192 SmtUtils]: Spent 222.00 ms on a formula simplification that was a NOOP. DAG size: 10 [2019-12-26 22:00:41,293 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 22:00:41,293 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [694999638] [2019-12-26 22:00:41,294 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:00:41,294 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-26 22:00:41,294 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1306836225] [2019-12-26 22:00:41,295 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-26 22:00:41,295 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:00:41,295 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-26 22:00:41,295 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-26 22:00:41,295 INFO L87 Difference]: Start difference. First operand 11630 states and 36167 transitions. Second operand 7 states. [2019-12-26 22:00:42,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:00:42,221 INFO L93 Difference]: Finished difference Result 20495 states and 61153 transitions. [2019-12-26 22:00:42,221 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-26 22:00:42,221 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 64 [2019-12-26 22:00:42,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:00:42,248 INFO L225 Difference]: With dead ends: 20495 [2019-12-26 22:00:42,249 INFO L226 Difference]: Without dead ends: 20327 [2019-12-26 22:00:42,249 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2019-12-26 22:00:42,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20327 states. [2019-12-26 22:00:42,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20327 to 17055. [2019-12-26 22:00:42,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17055 states. [2019-12-26 22:00:42,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17055 states to 17055 states and 51675 transitions. [2019-12-26 22:00:42,542 INFO L78 Accepts]: Start accepts. Automaton has 17055 states and 51675 transitions. Word has length 64 [2019-12-26 22:00:42,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:00:42,542 INFO L462 AbstractCegarLoop]: Abstraction has 17055 states and 51675 transitions. [2019-12-26 22:00:42,542 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-26 22:00:42,542 INFO L276 IsEmpty]: Start isEmpty. Operand 17055 states and 51675 transitions. [2019-12-26 22:00:42,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-26 22:00:42,559 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:00:42,559 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 22:00:42,559 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:00:42,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:00:42,560 INFO L82 PathProgramCache]: Analyzing trace with hash 768567647, now seen corresponding path program 7 times [2019-12-26 22:00:42,560 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:00:42,560 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1080046460] [2019-12-26 22:00:42,560 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:00:42,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:00:42,647 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 22:00:42,647 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1080046460] [2019-12-26 22:00:42,647 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:00:42,648 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-26 22:00:42,648 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [433106200] [2019-12-26 22:00:42,648 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-26 22:00:42,649 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:00:42,649 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-26 22:00:42,649 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-26 22:00:42,649 INFO L87 Difference]: Start difference. First operand 17055 states and 51675 transitions. Second operand 6 states. [2019-12-26 22:00:43,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:00:43,359 INFO L93 Difference]: Finished difference Result 30832 states and 92113 transitions. [2019-12-26 22:00:43,359 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-26 22:00:43,360 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 64 [2019-12-26 22:00:43,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:00:43,403 INFO L225 Difference]: With dead ends: 30832 [2019-12-26 22:00:43,403 INFO L226 Difference]: Without dead ends: 30612 [2019-12-26 22:00:43,404 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2019-12-26 22:00:43,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30612 states. [2019-12-26 22:00:43,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30612 to 22076. [2019-12-26 22:00:43,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22076 states. [2019-12-26 22:00:43,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22076 states to 22076 states and 66013 transitions. [2019-12-26 22:00:43,835 INFO L78 Accepts]: Start accepts. Automaton has 22076 states and 66013 transitions. Word has length 64 [2019-12-26 22:00:43,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:00:43,836 INFO L462 AbstractCegarLoop]: Abstraction has 22076 states and 66013 transitions. [2019-12-26 22:00:43,836 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-26 22:00:43,836 INFO L276 IsEmpty]: Start isEmpty. Operand 22076 states and 66013 transitions. [2019-12-26 22:00:43,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-26 22:00:43,859 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:00:43,859 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 22:00:43,860 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:00:43,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:00:43,860 INFO L82 PathProgramCache]: Analyzing trace with hash 908702963, now seen corresponding path program 8 times [2019-12-26 22:00:43,860 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:00:43,860 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [843686168] [2019-12-26 22:00:43,860 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:00:43,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:00:43,963 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 22:00:43,963 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [843686168] [2019-12-26 22:00:43,965 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:00:43,966 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-26 22:00:43,966 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1186554856] [2019-12-26 22:00:43,966 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-26 22:00:43,966 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:00:43,967 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-26 22:00:43,967 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-26 22:00:43,967 INFO L87 Difference]: Start difference. First operand 22076 states and 66013 transitions. Second operand 6 states. [2019-12-26 22:00:44,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:00:44,609 INFO L93 Difference]: Finished difference Result 26232 states and 77397 transitions. [2019-12-26 22:00:44,609 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-26 22:00:44,609 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 64 [2019-12-26 22:00:44,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:00:44,646 INFO L225 Difference]: With dead ends: 26232 [2019-12-26 22:00:44,646 INFO L226 Difference]: Without dead ends: 26232 [2019-12-26 22:00:44,646 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-12-26 22:00:45,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26232 states. [2019-12-26 22:00:45,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26232 to 23702. [2019-12-26 22:00:45,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23702 states. [2019-12-26 22:00:45,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23702 states to 23702 states and 70494 transitions. [2019-12-26 22:00:45,307 INFO L78 Accepts]: Start accepts. Automaton has 23702 states and 70494 transitions. Word has length 64 [2019-12-26 22:00:45,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:00:45,308 INFO L462 AbstractCegarLoop]: Abstraction has 23702 states and 70494 transitions. [2019-12-26 22:00:45,308 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-26 22:00:45,308 INFO L276 IsEmpty]: Start isEmpty. Operand 23702 states and 70494 transitions. [2019-12-26 22:00:45,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-26 22:00:45,333 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:00:45,333 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 22:00:45,334 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:00:45,334 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:00:45,334 INFO L82 PathProgramCache]: Analyzing trace with hash -1398237635, now seen corresponding path program 9 times [2019-12-26 22:00:45,334 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:00:45,334 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1600391008] [2019-12-26 22:00:45,335 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:00:45,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:00:45,433 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 22:00:45,434 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1600391008] [2019-12-26 22:00:45,437 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:00:45,438 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-26 22:00:45,440 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1445994868] [2019-12-26 22:00:45,440 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-26 22:00:45,440 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:00:45,440 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-26 22:00:45,441 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-26 22:00:45,441 INFO L87 Difference]: Start difference. First operand 23702 states and 70494 transitions. Second operand 7 states. [2019-12-26 22:00:46,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:00:46,284 INFO L93 Difference]: Finished difference Result 32787 states and 97475 transitions. [2019-12-26 22:00:46,284 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-26 22:00:46,285 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 64 [2019-12-26 22:00:46,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:00:46,328 INFO L225 Difference]: With dead ends: 32787 [2019-12-26 22:00:46,328 INFO L226 Difference]: Without dead ends: 32787 [2019-12-26 22:00:46,329 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2019-12-26 22:00:46,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32787 states. [2019-12-26 22:00:46,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32787 to 23660. [2019-12-26 22:00:46,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23660 states. [2019-12-26 22:00:46,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23660 states to 23660 states and 70388 transitions. [2019-12-26 22:00:46,772 INFO L78 Accepts]: Start accepts. Automaton has 23660 states and 70388 transitions. Word has length 64 [2019-12-26 22:00:46,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:00:46,772 INFO L462 AbstractCegarLoop]: Abstraction has 23660 states and 70388 transitions. [2019-12-26 22:00:46,772 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-26 22:00:46,772 INFO L276 IsEmpty]: Start isEmpty. Operand 23660 states and 70388 transitions. [2019-12-26 22:00:46,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-26 22:00:46,796 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:00:46,796 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 22:00:46,796 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:00:46,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:00:46,797 INFO L82 PathProgramCache]: Analyzing trace with hash 130546237, now seen corresponding path program 10 times [2019-12-26 22:00:46,797 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:00:46,797 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [122022179] [2019-12-26 22:00:46,797 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:00:46,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:00:46,898 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 22:00:46,898 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [122022179] [2019-12-26 22:00:46,899 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:00:46,899 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-26 22:00:46,899 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1769026567] [2019-12-26 22:00:46,899 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-26 22:00:46,900 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:00:46,900 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-26 22:00:46,900 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-26 22:00:46,900 INFO L87 Difference]: Start difference. First operand 23660 states and 70388 transitions. Second operand 6 states. [2019-12-26 22:00:47,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:00:47,566 INFO L93 Difference]: Finished difference Result 39906 states and 117393 transitions. [2019-12-26 22:00:47,566 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-26 22:00:47,566 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 64 [2019-12-26 22:00:47,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:00:47,619 INFO L225 Difference]: With dead ends: 39906 [2019-12-26 22:00:47,619 INFO L226 Difference]: Without dead ends: 39906 [2019-12-26 22:00:47,619 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2019-12-26 22:00:47,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39906 states. [2019-12-26 22:00:48,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39906 to 25943. [2019-12-26 22:00:48,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25943 states. [2019-12-26 22:00:48,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25943 states to 25943 states and 77260 transitions. [2019-12-26 22:00:48,381 INFO L78 Accepts]: Start accepts. Automaton has 25943 states and 77260 transitions. Word has length 64 [2019-12-26 22:00:48,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:00:48,382 INFO L462 AbstractCegarLoop]: Abstraction has 25943 states and 77260 transitions. [2019-12-26 22:00:48,382 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-26 22:00:48,382 INFO L276 IsEmpty]: Start isEmpty. Operand 25943 states and 77260 transitions. [2019-12-26 22:00:48,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-26 22:00:48,406 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:00:48,406 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 22:00:48,406 INFO L410 AbstractCegarLoop]: === Iteration 24 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:00:48,406 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:00:48,406 INFO L82 PathProgramCache]: Analyzing trace with hash -789321411, now seen corresponding path program 11 times [2019-12-26 22:00:48,406 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:00:48,407 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [331049228] [2019-12-26 22:00:48,407 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:00:48,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:00:48,512 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 22:00:48,512 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [331049228] [2019-12-26 22:00:48,512 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:00:48,512 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-26 22:00:48,513 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2012462704] [2019-12-26 22:00:48,513 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-26 22:00:48,513 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:00:48,513 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-26 22:00:48,514 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-26 22:00:48,514 INFO L87 Difference]: Start difference. First operand 25943 states and 77260 transitions. Second operand 7 states. [2019-12-26 22:00:49,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:00:49,279 INFO L93 Difference]: Finished difference Result 39554 states and 116390 transitions. [2019-12-26 22:00:49,280 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-26 22:00:49,280 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 64 [2019-12-26 22:00:49,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:00:49,335 INFO L225 Difference]: With dead ends: 39554 [2019-12-26 22:00:49,335 INFO L226 Difference]: Without dead ends: 39554 [2019-12-26 22:00:49,336 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 6 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2019-12-26 22:00:49,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39554 states. [2019-12-26 22:00:49,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39554 to 24422. [2019-12-26 22:00:49,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24422 states. [2019-12-26 22:00:49,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24422 states to 24422 states and 72832 transitions. [2019-12-26 22:00:49,849 INFO L78 Accepts]: Start accepts. Automaton has 24422 states and 72832 transitions. Word has length 64 [2019-12-26 22:00:49,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:00:49,849 INFO L462 AbstractCegarLoop]: Abstraction has 24422 states and 72832 transitions. [2019-12-26 22:00:49,849 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-26 22:00:49,849 INFO L276 IsEmpty]: Start isEmpty. Operand 24422 states and 72832 transitions. [2019-12-26 22:00:49,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-26 22:00:49,875 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:00:49,875 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 22:00:49,875 INFO L410 AbstractCegarLoop]: === Iteration 25 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:00:49,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:00:49,875 INFO L82 PathProgramCache]: Analyzing trace with hash 1935640731, now seen corresponding path program 12 times [2019-12-26 22:00:49,876 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:00:49,876 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [513072231] [2019-12-26 22:00:49,876 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:00:49,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:00:49,935 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 22:00:49,935 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [513072231] [2019-12-26 22:00:49,936 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:00:49,936 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 22:00:49,936 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [924936848] [2019-12-26 22:00:49,936 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 22:00:49,936 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:00:49,937 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 22:00:49,937 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 22:00:49,937 INFO L87 Difference]: Start difference. First operand 24422 states and 72832 transitions. Second operand 3 states. [2019-12-26 22:00:50,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:00:50,038 INFO L93 Difference]: Finished difference Result 24422 states and 72831 transitions. [2019-12-26 22:00:50,038 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 22:00:50,038 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 64 [2019-12-26 22:00:50,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:00:50,088 INFO L225 Difference]: With dead ends: 24422 [2019-12-26 22:00:50,088 INFO L226 Difference]: Without dead ends: 24422 [2019-12-26 22:00:50,089 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 22:00:50,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24422 states. [2019-12-26 22:00:50,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24422 to 20757. [2019-12-26 22:00:50,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20757 states. [2019-12-26 22:00:50,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20757 states to 20757 states and 62530 transitions. [2019-12-26 22:00:50,772 INFO L78 Accepts]: Start accepts. Automaton has 20757 states and 62530 transitions. Word has length 64 [2019-12-26 22:00:50,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:00:50,772 INFO L462 AbstractCegarLoop]: Abstraction has 20757 states and 62530 transitions. [2019-12-26 22:00:50,772 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 22:00:50,772 INFO L276 IsEmpty]: Start isEmpty. Operand 20757 states and 62530 transitions. [2019-12-26 22:00:50,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-26 22:00:50,793 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:00:50,793 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 22:00:50,793 INFO L410 AbstractCegarLoop]: === Iteration 26 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:00:50,793 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:00:50,793 INFO L82 PathProgramCache]: Analyzing trace with hash -1480180120, now seen corresponding path program 1 times [2019-12-26 22:00:50,794 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:00:50,794 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [482243392] [2019-12-26 22:00:50,794 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:00:50,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:00:50,894 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 22:00:50,894 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [482243392] [2019-12-26 22:00:50,895 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:00:50,895 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-26 22:00:50,895 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1923275363] [2019-12-26 22:00:50,895 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-26 22:00:50,895 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:00:50,896 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-26 22:00:50,896 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-12-26 22:00:50,896 INFO L87 Difference]: Start difference. First operand 20757 states and 62530 transitions. Second operand 7 states. [2019-12-26 22:00:51,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:00:51,533 INFO L93 Difference]: Finished difference Result 26720 states and 78976 transitions. [2019-12-26 22:00:51,534 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-26 22:00:51,534 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 65 [2019-12-26 22:00:51,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:00:51,569 INFO L225 Difference]: With dead ends: 26720 [2019-12-26 22:00:51,569 INFO L226 Difference]: Without dead ends: 26480 [2019-12-26 22:00:51,569 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-12-26 22:00:51,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26480 states. [2019-12-26 22:00:51,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26480 to 21405. [2019-12-26 22:00:51,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21405 states. [2019-12-26 22:00:51,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21405 states to 21405 states and 64282 transitions. [2019-12-26 22:00:51,963 INFO L78 Accepts]: Start accepts. Automaton has 21405 states and 64282 transitions. Word has length 65 [2019-12-26 22:00:51,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:00:51,963 INFO L462 AbstractCegarLoop]: Abstraction has 21405 states and 64282 transitions. [2019-12-26 22:00:51,963 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-26 22:00:51,963 INFO L276 IsEmpty]: Start isEmpty. Operand 21405 states and 64282 transitions. [2019-12-26 22:00:51,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-26 22:00:51,986 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:00:51,986 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 22:00:51,986 INFO L410 AbstractCegarLoop]: === Iteration 27 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:00:51,986 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:00:51,986 INFO L82 PathProgramCache]: Analyzing trace with hash -2117464962, now seen corresponding path program 2 times [2019-12-26 22:00:51,986 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:00:51,986 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [578036892] [2019-12-26 22:00:51,987 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:00:52,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:00:52,050 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 22:00:52,050 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [578036892] [2019-12-26 22:00:52,050 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:00:52,050 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 22:00:52,050 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1075979688] [2019-12-26 22:00:52,051 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 22:00:52,051 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:00:52,051 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 22:00:52,051 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 22:00:52,051 INFO L87 Difference]: Start difference. First operand 21405 states and 64282 transitions. Second operand 3 states. [2019-12-26 22:00:52,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:00:52,119 INFO L93 Difference]: Finished difference Result 14552 states and 43201 transitions. [2019-12-26 22:00:52,119 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 22:00:52,120 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-26 22:00:52,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:00:52,143 INFO L225 Difference]: With dead ends: 14552 [2019-12-26 22:00:52,143 INFO L226 Difference]: Without dead ends: 14552 [2019-12-26 22:00:52,144 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 22:00:52,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14552 states. [2019-12-26 22:00:52,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14552 to 14345. [2019-12-26 22:00:52,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14345 states. [2019-12-26 22:00:52,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14345 states to 14345 states and 42613 transitions. [2019-12-26 22:00:52,363 INFO L78 Accepts]: Start accepts. Automaton has 14345 states and 42613 transitions. Word has length 65 [2019-12-26 22:00:52,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:00:52,363 INFO L462 AbstractCegarLoop]: Abstraction has 14345 states and 42613 transitions. [2019-12-26 22:00:52,363 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 22:00:52,364 INFO L276 IsEmpty]: Start isEmpty. Operand 14345 states and 42613 transitions. [2019-12-26 22:00:52,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-26 22:00:52,377 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:00:52,377 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 22:00:52,378 INFO L410 AbstractCegarLoop]: === Iteration 28 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:00:52,378 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:00:52,378 INFO L82 PathProgramCache]: Analyzing trace with hash 1338482558, now seen corresponding path program 1 times [2019-12-26 22:00:52,378 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:00:52,378 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [765110978] [2019-12-26 22:00:52,378 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:00:52,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:00:52,469 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 22:00:52,469 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [765110978] [2019-12-26 22:00:52,469 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:00:52,469 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-26 22:00:52,469 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1305759919] [2019-12-26 22:00:52,470 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-26 22:00:52,470 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:00:52,470 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-26 22:00:52,470 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-12-26 22:00:52,470 INFO L87 Difference]: Start difference. First operand 14345 states and 42613 transitions. Second operand 8 states. [2019-12-26 22:00:53,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:00:53,220 INFO L93 Difference]: Finished difference Result 25482 states and 74721 transitions. [2019-12-26 22:00:53,220 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-26 22:00:53,221 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 66 [2019-12-26 22:00:53,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:00:53,246 INFO L225 Difference]: With dead ends: 25482 [2019-12-26 22:00:53,246 INFO L226 Difference]: Without dead ends: 18758 [2019-12-26 22:00:53,246 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=159, Unknown=0, NotChecked=0, Total=210 [2019-12-26 22:00:53,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18758 states. [2019-12-26 22:00:53,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18758 to 15008. [2019-12-26 22:00:53,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15008 states. [2019-12-26 22:00:53,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15008 states to 15008 states and 44099 transitions. [2019-12-26 22:00:53,486 INFO L78 Accepts]: Start accepts. Automaton has 15008 states and 44099 transitions. Word has length 66 [2019-12-26 22:00:53,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:00:53,486 INFO L462 AbstractCegarLoop]: Abstraction has 15008 states and 44099 transitions. [2019-12-26 22:00:53,486 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-26 22:00:53,487 INFO L276 IsEmpty]: Start isEmpty. Operand 15008 states and 44099 transitions. [2019-12-26 22:00:53,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-26 22:00:53,500 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:00:53,501 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 22:00:53,501 INFO L410 AbstractCegarLoop]: === Iteration 29 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:00:53,501 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:00:53,501 INFO L82 PathProgramCache]: Analyzing trace with hash 1029826500, now seen corresponding path program 2 times [2019-12-26 22:00:53,501 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:00:53,501 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1878414323] [2019-12-26 22:00:53,501 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:00:53,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:00:53,625 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 22:00:53,625 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1878414323] [2019-12-26 22:00:53,625 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:00:53,625 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-26 22:00:53,626 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [703391055] [2019-12-26 22:00:53,626 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-26 22:00:53,626 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:00:53,626 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-26 22:00:53,626 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-12-26 22:00:53,627 INFO L87 Difference]: Start difference. First operand 15008 states and 44099 transitions. Second operand 9 states. [2019-12-26 22:00:54,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:00:54,686 INFO L93 Difference]: Finished difference Result 24021 states and 69932 transitions. [2019-12-26 22:00:54,686 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-26 22:00:54,687 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 66 [2019-12-26 22:00:54,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:00:54,709 INFO L225 Difference]: With dead ends: 24021 [2019-12-26 22:00:54,710 INFO L226 Difference]: Without dead ends: 17577 [2019-12-26 22:00:54,710 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 6 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-26 22:00:54,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17577 states. [2019-12-26 22:00:54,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17577 to 14770. [2019-12-26 22:00:54,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14770 states. [2019-12-26 22:00:54,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14770 states to 14770 states and 43349 transitions. [2019-12-26 22:00:54,947 INFO L78 Accepts]: Start accepts. Automaton has 14770 states and 43349 transitions. Word has length 66 [2019-12-26 22:00:54,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:00:54,947 INFO L462 AbstractCegarLoop]: Abstraction has 14770 states and 43349 transitions. [2019-12-26 22:00:54,947 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-26 22:00:54,947 INFO L276 IsEmpty]: Start isEmpty. Operand 14770 states and 43349 transitions. [2019-12-26 22:00:54,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-26 22:00:54,960 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:00:54,960 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 22:00:54,960 INFO L410 AbstractCegarLoop]: === Iteration 30 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:00:54,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:00:54,961 INFO L82 PathProgramCache]: Analyzing trace with hash 1662390436, now seen corresponding path program 3 times [2019-12-26 22:00:54,961 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:00:54,961 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1249437286] [2019-12-26 22:00:54,961 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:00:54,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:00:55,122 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 22:00:55,122 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1249437286] [2019-12-26 22:00:55,122 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:00:55,122 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-26 22:00:55,123 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1851383830] [2019-12-26 22:00:55,123 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-26 22:00:55,123 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:00:55,123 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-26 22:00:55,124 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-12-26 22:00:55,124 INFO L87 Difference]: Start difference. First operand 14770 states and 43349 transitions. Second operand 10 states. [2019-12-26 22:00:56,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:00:56,920 INFO L93 Difference]: Finished difference Result 25274 states and 72784 transitions. [2019-12-26 22:00:56,921 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-26 22:00:56,921 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 66 [2019-12-26 22:00:56,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:00:56,954 INFO L225 Difference]: With dead ends: 25274 [2019-12-26 22:00:56,954 INFO L226 Difference]: Without dead ends: 25274 [2019-12-26 22:00:56,955 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=70, Invalid=202, Unknown=0, NotChecked=0, Total=272 [2019-12-26 22:00:57,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25274 states. [2019-12-26 22:00:57,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25274 to 16246. [2019-12-26 22:00:57,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16246 states. [2019-12-26 22:00:57,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16246 states to 16246 states and 47556 transitions. [2019-12-26 22:00:57,261 INFO L78 Accepts]: Start accepts. Automaton has 16246 states and 47556 transitions. Word has length 66 [2019-12-26 22:00:57,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:00:57,261 INFO L462 AbstractCegarLoop]: Abstraction has 16246 states and 47556 transitions. [2019-12-26 22:00:57,261 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-26 22:00:57,261 INFO L276 IsEmpty]: Start isEmpty. Operand 16246 states and 47556 transitions. [2019-12-26 22:00:57,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-26 22:00:57,276 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:00:57,276 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 22:00:57,276 INFO L410 AbstractCegarLoop]: === Iteration 31 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:00:57,277 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:00:57,277 INFO L82 PathProgramCache]: Analyzing trace with hash -848717318, now seen corresponding path program 4 times [2019-12-26 22:00:57,277 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:00:57,277 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [246586728] [2019-12-26 22:00:57,277 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:00:57,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:00:57,449 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 22:00:57,449 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [246586728] [2019-12-26 22:00:57,449 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:00:57,450 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-26 22:00:57,450 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [902563550] [2019-12-26 22:00:57,450 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-26 22:00:57,451 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:00:57,451 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-26 22:00:57,451 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2019-12-26 22:00:57,452 INFO L87 Difference]: Start difference. First operand 16246 states and 47556 transitions. Second operand 11 states. [2019-12-26 22:00:59,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:00:59,322 INFO L93 Difference]: Finished difference Result 24229 states and 69793 transitions. [2019-12-26 22:00:59,323 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-26 22:00:59,323 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 66 [2019-12-26 22:00:59,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:00:59,353 INFO L225 Difference]: With dead ends: 24229 [2019-12-26 22:00:59,353 INFO L226 Difference]: Without dead ends: 24229 [2019-12-26 22:00:59,353 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=76, Invalid=230, Unknown=0, NotChecked=0, Total=306 [2019-12-26 22:00:59,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24229 states. [2019-12-26 22:00:59,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24229 to 16318. [2019-12-26 22:00:59,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16318 states. [2019-12-26 22:00:59,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16318 states to 16318 states and 47756 transitions. [2019-12-26 22:00:59,878 INFO L78 Accepts]: Start accepts. Automaton has 16318 states and 47756 transitions. Word has length 66 [2019-12-26 22:00:59,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:00:59,878 INFO L462 AbstractCegarLoop]: Abstraction has 16318 states and 47756 transitions. [2019-12-26 22:00:59,878 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-26 22:00:59,878 INFO L276 IsEmpty]: Start isEmpty. Operand 16318 states and 47756 transitions. [2019-12-26 22:00:59,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-26 22:00:59,894 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:00:59,894 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 22:00:59,894 INFO L410 AbstractCegarLoop]: === Iteration 32 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:00:59,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:00:59,895 INFO L82 PathProgramCache]: Analyzing trace with hash 150910970, now seen corresponding path program 5 times [2019-12-26 22:00:59,895 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:00:59,895 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [379553815] [2019-12-26 22:00:59,895 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:00:59,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:01:00,081 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 22:01:00,081 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [379553815] [2019-12-26 22:01:00,082 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:01:00,082 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-26 22:01:00,082 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [350938892] [2019-12-26 22:01:00,083 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-26 22:01:00,083 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:01:00,083 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-26 22:01:00,083 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2019-12-26 22:01:00,084 INFO L87 Difference]: Start difference. First operand 16318 states and 47756 transitions. Second operand 11 states. [2019-12-26 22:01:02,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:01:02,165 INFO L93 Difference]: Finished difference Result 25237 states and 72487 transitions. [2019-12-26 22:01:02,170 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-26 22:01:02,170 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 66 [2019-12-26 22:01:02,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:01:02,206 INFO L225 Difference]: With dead ends: 25237 [2019-12-26 22:01:02,206 INFO L226 Difference]: Without dead ends: 25237 [2019-12-26 22:01:02,207 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=98, Invalid=322, Unknown=0, NotChecked=0, Total=420 [2019-12-26 22:01:02,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25237 states. [2019-12-26 22:01:02,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25237 to 15766. [2019-12-26 22:01:02,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15766 states. [2019-12-26 22:01:02,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15766 states to 15766 states and 46172 transitions. [2019-12-26 22:01:02,526 INFO L78 Accepts]: Start accepts. Automaton has 15766 states and 46172 transitions. Word has length 66 [2019-12-26 22:01:02,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:01:02,527 INFO L462 AbstractCegarLoop]: Abstraction has 15766 states and 46172 transitions. [2019-12-26 22:01:02,527 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-26 22:01:02,527 INFO L276 IsEmpty]: Start isEmpty. Operand 15766 states and 46172 transitions. [2019-12-26 22:01:02,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-26 22:01:02,543 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:01:02,543 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 22:01:02,543 INFO L410 AbstractCegarLoop]: === Iteration 33 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:01:02,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:01:02,543 INFO L82 PathProgramCache]: Analyzing trace with hash 312790614, now seen corresponding path program 6 times [2019-12-26 22:01:02,544 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:01:02,544 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1142739259] [2019-12-26 22:01:02,544 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:01:02,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:01:02,708 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 22:01:02,708 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1142739259] [2019-12-26 22:01:02,709 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:01:02,709 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-26 22:01:02,709 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1192286398] [2019-12-26 22:01:02,709 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-26 22:01:02,709 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:01:02,710 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-26 22:01:02,710 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2019-12-26 22:01:02,710 INFO L87 Difference]: Start difference. First operand 15766 states and 46172 transitions. Second operand 12 states. [2019-12-26 22:01:04,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:01:04,026 INFO L93 Difference]: Finished difference Result 20899 states and 60570 transitions. [2019-12-26 22:01:04,026 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-12-26 22:01:04,026 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 66 [2019-12-26 22:01:04,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:01:04,052 INFO L225 Difference]: With dead ends: 20899 [2019-12-26 22:01:04,052 INFO L226 Difference]: Without dead ends: 17669 [2019-12-26 22:01:04,053 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=96, Invalid=456, Unknown=0, NotChecked=0, Total=552 [2019-12-26 22:01:04,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17669 states. [2019-12-26 22:01:04,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17669 to 15994. [2019-12-26 22:01:04,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15994 states. [2019-12-26 22:01:04,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15994 states to 15994 states and 46693 transitions. [2019-12-26 22:01:04,317 INFO L78 Accepts]: Start accepts. Automaton has 15994 states and 46693 transitions. Word has length 66 [2019-12-26 22:01:04,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:01:04,318 INFO L462 AbstractCegarLoop]: Abstraction has 15994 states and 46693 transitions. [2019-12-26 22:01:04,318 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-26 22:01:04,318 INFO L276 IsEmpty]: Start isEmpty. Operand 15994 states and 46693 transitions. [2019-12-26 22:01:04,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-26 22:01:04,335 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:01:04,335 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 22:01:04,336 INFO L410 AbstractCegarLoop]: === Iteration 34 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:01:04,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:01:04,336 INFO L82 PathProgramCache]: Analyzing trace with hash -667839678, now seen corresponding path program 7 times [2019-12-26 22:01:04,336 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:01:04,336 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1327196009] [2019-12-26 22:01:04,337 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:01:04,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:01:04,492 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 22:01:04,493 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1327196009] [2019-12-26 22:01:04,493 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:01:04,493 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-26 22:01:04,493 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [439986634] [2019-12-26 22:01:04,494 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-26 22:01:04,494 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:01:04,494 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-26 22:01:04,494 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-26 22:01:04,494 INFO L87 Difference]: Start difference. First operand 15994 states and 46693 transitions. Second operand 11 states. [2019-12-26 22:01:05,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:01:05,543 INFO L93 Difference]: Finished difference Result 23245 states and 67100 transitions. [2019-12-26 22:01:05,544 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-12-26 22:01:05,544 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 66 [2019-12-26 22:01:05,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:01:05,572 INFO L225 Difference]: With dead ends: 23245 [2019-12-26 22:01:05,573 INFO L226 Difference]: Without dead ends: 18005 [2019-12-26 22:01:05,573 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 158 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=161, Invalid=651, Unknown=0, NotChecked=0, Total=812 [2019-12-26 22:01:05,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18005 states. [2019-12-26 22:01:05,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18005 to 15208. [2019-12-26 22:01:05,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15208 states. [2019-12-26 22:01:05,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15208 states to 15208 states and 44534 transitions. [2019-12-26 22:01:05,821 INFO L78 Accepts]: Start accepts. Automaton has 15208 states and 44534 transitions. Word has length 66 [2019-12-26 22:01:05,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:01:05,821 INFO L462 AbstractCegarLoop]: Abstraction has 15208 states and 44534 transitions. [2019-12-26 22:01:05,821 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-26 22:01:05,821 INFO L276 IsEmpty]: Start isEmpty. Operand 15208 states and 44534 transitions. [2019-12-26 22:01:05,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-26 22:01:05,835 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:01:05,836 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 22:01:05,836 INFO L410 AbstractCegarLoop]: === Iteration 35 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:01:05,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:01:05,836 INFO L82 PathProgramCache]: Analyzing trace with hash 777925054, now seen corresponding path program 8 times [2019-12-26 22:01:05,836 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:01:05,837 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1715184024] [2019-12-26 22:01:05,837 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:01:05,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:01:05,966 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 22:01:05,967 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1715184024] [2019-12-26 22:01:05,967 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:01:05,967 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-26 22:01:05,967 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [900385541] [2019-12-26 22:01:05,968 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-26 22:01:05,968 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:01:05,968 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-26 22:01:05,968 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-12-26 22:01:05,968 INFO L87 Difference]: Start difference. First operand 15208 states and 44534 transitions. Second operand 10 states. [2019-12-26 22:01:08,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:01:08,406 INFO L93 Difference]: Finished difference Result 28214 states and 80972 transitions. [2019-12-26 22:01:08,406 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-12-26 22:01:08,406 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 66 [2019-12-26 22:01:08,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:01:08,441 INFO L225 Difference]: With dead ends: 28214 [2019-12-26 22:01:08,441 INFO L226 Difference]: Without dead ends: 28214 [2019-12-26 22:01:08,442 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 7 SyntacticMatches, 2 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=139, Invalid=511, Unknown=0, NotChecked=0, Total=650 [2019-12-26 22:01:08,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28214 states. [2019-12-26 22:01:08,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28214 to 13004. [2019-12-26 22:01:08,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13004 states. [2019-12-26 22:01:08,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13004 states to 13004 states and 38434 transitions. [2019-12-26 22:01:08,734 INFO L78 Accepts]: Start accepts. Automaton has 13004 states and 38434 transitions. Word has length 66 [2019-12-26 22:01:08,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:01:08,734 INFO L462 AbstractCegarLoop]: Abstraction has 13004 states and 38434 transitions. [2019-12-26 22:01:08,734 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-26 22:01:08,734 INFO L276 IsEmpty]: Start isEmpty. Operand 13004 states and 38434 transitions. [2019-12-26 22:01:08,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-26 22:01:08,746 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:01:08,746 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 22:01:08,747 INFO L410 AbstractCegarLoop]: === Iteration 36 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:01:08,747 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:01:08,747 INFO L82 PathProgramCache]: Analyzing trace with hash -124195356, now seen corresponding path program 9 times [2019-12-26 22:01:08,747 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:01:08,747 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [897615158] [2019-12-26 22:01:08,747 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:01:08,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:01:08,883 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 22:01:08,883 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [897615158] [2019-12-26 22:01:08,884 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:01:08,884 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 22:01:08,884 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [41974999] [2019-12-26 22:01:08,884 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-26 22:01:08,884 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:01:08,885 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-26 22:01:08,885 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-26 22:01:08,885 INFO L87 Difference]: Start difference. First operand 13004 states and 38434 transitions. Second operand 4 states. [2019-12-26 22:01:08,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:01:08,968 INFO L93 Difference]: Finished difference Result 14948 states and 44329 transitions. [2019-12-26 22:01:08,969 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 22:01:08,969 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 66 [2019-12-26 22:01:08,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:01:08,988 INFO L225 Difference]: With dead ends: 14948 [2019-12-26 22:01:08,988 INFO L226 Difference]: Without dead ends: 14948 [2019-12-26 22:01:08,989 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-26 22:01:09,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14948 states. [2019-12-26 22:01:09,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14948 to 12181. [2019-12-26 22:01:09,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12181 states. [2019-12-26 22:01:09,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12181 states to 12181 states and 36301 transitions. [2019-12-26 22:01:09,197 INFO L78 Accepts]: Start accepts. Automaton has 12181 states and 36301 transitions. Word has length 66 [2019-12-26 22:01:09,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:01:09,197 INFO L462 AbstractCegarLoop]: Abstraction has 12181 states and 36301 transitions. [2019-12-26 22:01:09,197 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-26 22:01:09,197 INFO L276 IsEmpty]: Start isEmpty. Operand 12181 states and 36301 transitions. [2019-12-26 22:01:09,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-26 22:01:09,209 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:01:09,210 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 22:01:09,210 INFO L410 AbstractCegarLoop]: === Iteration 37 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:01:09,210 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:01:09,210 INFO L82 PathProgramCache]: Analyzing trace with hash 8609018, now seen corresponding path program 1 times [2019-12-26 22:01:09,210 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:01:09,210 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [238587152] [2019-12-26 22:01:09,210 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:01:09,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:01:09,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-26 22:01:09,364 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [238587152] [2019-12-26 22:01:09,364 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:01:09,364 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-26 22:01:09,365 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [945796237] [2019-12-26 22:01:09,365 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-26 22:01:09,365 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:01:09,365 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-26 22:01:09,366 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2019-12-26 22:01:09,366 INFO L87 Difference]: Start difference. First operand 12181 states and 36301 transitions. Second operand 12 states. [2019-12-26 22:01:10,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:01:10,100 INFO L93 Difference]: Finished difference Result 14914 states and 44027 transitions. [2019-12-26 22:01:10,100 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-26 22:01:10,100 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 67 [2019-12-26 22:01:10,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:01:10,120 INFO L225 Difference]: With dead ends: 14914 [2019-12-26 22:01:10,120 INFO L226 Difference]: Without dead ends: 14493 [2019-12-26 22:01:10,121 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=133, Invalid=569, Unknown=0, NotChecked=0, Total=702 [2019-12-26 22:01:10,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14493 states. [2019-12-26 22:01:10,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14493 to 11927. [2019-12-26 22:01:10,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11927 states. [2019-12-26 22:01:10,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11927 states to 11927 states and 35657 transitions. [2019-12-26 22:01:10,514 INFO L78 Accepts]: Start accepts. Automaton has 11927 states and 35657 transitions. Word has length 67 [2019-12-26 22:01:10,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:01:10,514 INFO L462 AbstractCegarLoop]: Abstraction has 11927 states and 35657 transitions. [2019-12-26 22:01:10,514 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-26 22:01:10,514 INFO L276 IsEmpty]: Start isEmpty. Operand 11927 states and 35657 transitions. [2019-12-26 22:01:10,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-26 22:01:10,526 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:01:10,526 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 22:01:10,526 INFO L410 AbstractCegarLoop]: === Iteration 38 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:01:10,526 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:01:10,526 INFO L82 PathProgramCache]: Analyzing trace with hash -919262302, now seen corresponding path program 2 times [2019-12-26 22:01:10,527 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:01:10,527 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [648465068] [2019-12-26 22:01:10,527 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:01:10,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-26 22:01:10,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-26 22:01:10,658 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-26 22:01:10,659 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-26 22:01:10,663 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [899] [899] ULTIMATE.startENTRY-->L835: Formula: (let ((.cse0 (store |v_#valid_65| 0 0))) (and (= 0 v_~a$w_buff1~0_266) (= 0 v_~__unbuffered_p2_EAX~0_32) (= (store |v_#memory_int_22| |v_ULTIMATE.start_main_~#t651~0.base_24| (store (select |v_#memory_int_22| |v_ULTIMATE.start_main_~#t651~0.base_24|) |v_ULTIMATE.start_main_~#t651~0.offset_19| 0)) |v_#memory_int_21|) (= 0 v_~weak$$choice0~0_14) (= |v_#NULL.offset_6| 0) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t651~0.base_24|)) (= 0 v_~a$w_buff0_used~0_826) (= v_~main$tmp_guard0~0_29 0) (= 0 v_~a$r_buff0_thd2~0_102) (< 0 |v_#StackHeapBarrier_17|) (= v_~a$r_buff0_thd0~0_110 0) (= v_~__unbuffered_cnt~0_102 0) (= v_~main$tmp_guard1~0_29 0) (= v_~a$w_buff0~0_397 0) (= v_~a$flush_delayed~0_27 0) (< |v_#StackHeapBarrier_17| |v_ULTIMATE.start_main_~#t651~0.base_24|) (= 0 |v_#NULL.base_6|) (= v_~y~0_39 0) (= v_~a$mem_tmp~0_16 0) (= v_~__unbuffered_p2_EBX~0_42 0) (= 0 v_~a$r_buff1_thd1~0_142) (= v_~a~0_178 0) (= v_~weak$$choice2~0_137 0) (= |v_ULTIMATE.start_main_~#t651~0.offset_19| 0) (= 0 v_~__unbuffered_p0_EAX~0_105) (= |v_#valid_63| (store .cse0 |v_ULTIMATE.start_main_~#t651~0.base_24| 1)) (= v_~z~0_40 0) (= 0 v_~a$w_buff1_used~0_523) (= 0 v_~a$r_buff1_thd2~0_138) (= v_~a$r_buff1_thd3~0_297 0) (= |v_#length_25| (store |v_#length_26| |v_ULTIMATE.start_main_~#t651~0.base_24| 4)) (= v_~a$r_buff0_thd3~0_334 0) (= v_~a$r_buff1_thd0~0_145 0) (= v_~__unbuffered_p0_EBX~0_105 0) (= 0 v_~a$r_buff0_thd1~0_183) (= 0 v_~a$read_delayed~0_6) (= v_~a$read_delayed_var~0.offset_6 0) (= 0 v_~a$read_delayed_var~0.base_6) (= v_~x~0_88 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_17|, #valid=|v_#valid_65|, #memory_int=|v_#memory_int_22|, #length=|v_#length_26|} OutVars{~a$r_buff1_thd2~0=v_~a$r_buff1_thd2~0_138, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_75|, #NULL.offset=|v_#NULL.offset_6|, ULTIMATE.start_main_#t~ite49=|v_ULTIMATE.start_main_#t~ite49_47|, ULTIMATE.start_main_~#t653~0.base=|v_ULTIMATE.start_main_~#t653~0.base_27|, ~a$r_buff0_thd0~0=v_~a$r_buff0_thd0~0_110, ULTIMATE.start_main_#t~ite50=|v_ULTIMATE.start_main_#t~ite50_137|, ~a~0=v_~a~0_178, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_59|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_105, #length=|v_#length_25|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_32, ULTIMATE.start_main_~#t652~0.base=|v_ULTIMATE.start_main_~#t652~0.base_26|, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_42, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_105, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_10|, ~a$r_buff1_thd3~0=v_~a$r_buff1_thd3~0_297, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_826, ~a$r_buff0_thd1~0=v_~a$r_buff0_thd1~0_183, ~weak$$choice0~0=v_~weak$$choice0~0_14, #StackHeapBarrier=|v_#StackHeapBarrier_17|, ~a$read_delayed_var~0.offset=v_~a$read_delayed_var~0.offset_6, ~a$w_buff0~0=v_~a$w_buff0~0_397, ~a$r_buff1_thd0~0=v_~a$r_buff1_thd0~0_145, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_102, ~x~0=v_~x~0_88, ULTIMATE.start_main_~#t651~0.offset=|v_ULTIMATE.start_main_~#t651~0.offset_19|, ~a$read_delayed~0=v_~a$read_delayed~0_6, ~a$r_buff0_thd2~0=v_~a$r_buff0_thd2~0_102, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_29, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_129|, ~a$mem_tmp~0=v_~a$mem_tmp~0_16, ULTIMATE.start_main_#t~ite51=|v_ULTIMATE.start_main_#t~ite51_33|, ULTIMATE.start_main_~#t651~0.base=|v_ULTIMATE.start_main_~#t651~0.base_24|, ~a$w_buff1~0=v_~a$w_buff1~0_266, ~y~0=v_~y~0_39, ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_29|, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_9|, ~a$r_buff1_thd1~0=v_~a$r_buff1_thd1~0_142, ULTIMATE.start_main_~#t653~0.offset=|v_ULTIMATE.start_main_~#t653~0.offset_20|, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_334, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_29, #NULL.base=|v_#NULL.base_6|, ~a$flush_delayed~0=v_~a$flush_delayed~0_27, ULTIMATE.start_main_~#t652~0.offset=|v_ULTIMATE.start_main_~#t652~0.offset_19|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_19|, #valid=|v_#valid_63|, #memory_int=|v_#memory_int_21|, ~z~0=v_~z~0_40, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_523, ~weak$$choice2~0=v_~weak$$choice2~0_137, ~a$read_delayed_var~0.base=v_~a$read_delayed_var~0.base_6} AuxVars[] AssignedVars[~a$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite47, #NULL.offset, ULTIMATE.start_main_#t~ite49, ULTIMATE.start_main_~#t653~0.base, ~a$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite50, ~a~0, ULTIMATE.start_main_#t~ite52, ~__unbuffered_p0_EAX~0, #length, ~__unbuffered_p2_EAX~0, ULTIMATE.start_main_~#t652~0.base, ~__unbuffered_p2_EBX~0, ~__unbuffered_p0_EBX~0, ULTIMATE.start_main_#t~nondet45, ~a$r_buff1_thd3~0, ~a$w_buff0_used~0, ~a$r_buff0_thd1~0, ~weak$$choice0~0, ~a$read_delayed_var~0.offset, ~a$w_buff0~0, ~a$r_buff1_thd0~0, ~__unbuffered_cnt~0, ~x~0, ULTIMATE.start_main_~#t651~0.offset, ~a$read_delayed~0, ~a$r_buff0_thd2~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite48, ~a$mem_tmp~0, ULTIMATE.start_main_#t~ite51, ULTIMATE.start_main_~#t651~0.base, ~a$w_buff1~0, ~y~0, ULTIMATE.start_main_#t~nondet46, ULTIMATE.start_main_#t~nondet44, ~a$r_buff1_thd1~0, ULTIMATE.start_main_~#t653~0.offset, ~a$r_buff0_thd3~0, ~main$tmp_guard0~0, #NULL.base, ~a$flush_delayed~0, ULTIMATE.start_main_~#t652~0.offset, ULTIMATE.start_main_#res, #valid, #memory_int, ~z~0, ~a$w_buff1_used~0, ~weak$$choice2~0, ~a$read_delayed_var~0.base] because there is no mapped edge [2019-12-26 22:01:10,664 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [873] [873] L835-1-->L837: Formula: (and (= (store |v_#length_18| |v_ULTIMATE.start_main_~#t652~0.base_10| 4) |v_#length_17|) (not (= |v_ULTIMATE.start_main_~#t652~0.base_10| 0)) (< |v_#StackHeapBarrier_10| |v_ULTIMATE.start_main_~#t652~0.base_10|) (= 0 (select |v_#valid_34| |v_ULTIMATE.start_main_~#t652~0.base_10|)) (= |v_#valid_33| (store |v_#valid_34| |v_ULTIMATE.start_main_~#t652~0.base_10| 1)) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t652~0.base_10| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t652~0.base_10|) |v_ULTIMATE.start_main_~#t652~0.offset_9| 1)) |v_#memory_int_13|) (= 0 |v_ULTIMATE.start_main_~#t652~0.offset_9|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_34|, #memory_int=|v_#memory_int_14|, #length=|v_#length_18|} OutVars{ULTIMATE.start_main_~#t652~0.base=|v_ULTIMATE.start_main_~#t652~0.base_10|, #StackHeapBarrier=|v_#StackHeapBarrier_10|, ULTIMATE.start_main_~#t652~0.offset=|v_ULTIMATE.start_main_~#t652~0.offset_9|, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_5|, #valid=|v_#valid_33|, #memory_int=|v_#memory_int_13|, #length=|v_#length_17|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t652~0.base, ULTIMATE.start_main_~#t652~0.offset, ULTIMATE.start_main_#t~nondet44, #valid, #memory_int, #length] because there is no mapped edge [2019-12-26 22:01:10,665 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [869] [869] L837-1-->L839: Formula: (and (= (store |v_#valid_32| |v_ULTIMATE.start_main_~#t653~0.base_13| 1) |v_#valid_31|) (< |v_#StackHeapBarrier_9| |v_ULTIMATE.start_main_~#t653~0.base_13|) (= (store |v_#length_16| |v_ULTIMATE.start_main_~#t653~0.base_13| 4) |v_#length_15|) (not (= 0 |v_ULTIMATE.start_main_~#t653~0.base_13|)) (= |v_ULTIMATE.start_main_~#t653~0.offset_11| 0) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t653~0.base_13| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t653~0.base_13|) |v_ULTIMATE.start_main_~#t653~0.offset_11| 2)) |v_#memory_int_11|) (= 0 (select |v_#valid_32| |v_ULTIMATE.start_main_~#t653~0.base_13|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_32|, #memory_int=|v_#memory_int_12|, #length=|v_#length_16|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_9|, ULTIMATE.start_main_~#t653~0.offset=|v_ULTIMATE.start_main_~#t653~0.offset_11|, #valid=|v_#valid_31|, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_6|, #memory_int=|v_#memory_int_11|, #length=|v_#length_15|, ULTIMATE.start_main_~#t653~0.base=|v_ULTIMATE.start_main_~#t653~0.base_13|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t653~0.offset, #valid, ULTIMATE.start_main_#t~nondet45, #memory_int, #length, ULTIMATE.start_main_~#t653~0.base] because there is no mapped edge [2019-12-26 22:01:10,665 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [797] [797] P0ENTRY-->L4-3: Formula: (and (= v_P0Thread1of1ForFork1_~arg.offset_30 |v_P0Thread1of1ForFork1_#in~arg.offset_30|) (= v_~a$w_buff0_used~0_232 v_~a$w_buff1_used~0_149) (= 1 v_~a$w_buff0_used~0_231) (= v_P0Thread1of1ForFork1___VERIFIER_assert_~expression_34 |v_P0Thread1of1ForFork1___VERIFIER_assert_#in~expression_30|) (= v_~a$w_buff0~0_80 v_~a$w_buff1~0_62) (= 1 |v_P0Thread1of1ForFork1___VERIFIER_assert_#in~expression_30|) (= 1 v_~a$w_buff0~0_79) (= |v_P0Thread1of1ForFork1_#in~arg.base_30| v_P0Thread1of1ForFork1_~arg.base_30) (= (mod v_~a$w_buff1_used~0_149 256) 0)) InVars {P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_30|, ~a$w_buff0~0=v_~a$w_buff0~0_80, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_232, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_30|} OutVars{~a$w_buff1~0=v_~a$w_buff1~0_62, P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_30|, ~a$w_buff0~0=v_~a$w_buff0~0_79, P0Thread1of1ForFork1___VERIFIER_assert_~expression=v_P0Thread1of1ForFork1___VERIFIER_assert_~expression_34, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_231, P0Thread1of1ForFork1_~arg.offset=v_P0Thread1of1ForFork1_~arg.offset_30, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_149, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_30|, P0Thread1of1ForFork1___VERIFIER_assert_#in~expression=|v_P0Thread1of1ForFork1___VERIFIER_assert_#in~expression_30|, P0Thread1of1ForFork1_~arg.base=v_P0Thread1of1ForFork1_~arg.base_30} AuxVars[] AssignedVars[~a$w_buff1~0, ~a$w_buff0~0, P0Thread1of1ForFork1___VERIFIER_assert_~expression, ~a$w_buff0_used~0, P0Thread1of1ForFork1_~arg.offset, ~a$w_buff1_used~0, P0Thread1of1ForFork1___VERIFIER_assert_#in~expression, P0Thread1of1ForFork1_~arg.base] because there is no mapped edge [2019-12-26 22:01:10,669 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [832] [832] L776-2-->L776-4: Formula: (let ((.cse0 (= (mod ~a$r_buff1_thd2~0_In382941199 256) 0)) (.cse1 (= 0 (mod ~a$w_buff1_used~0_In382941199 256)))) (or (and (= |P1Thread1of1ForFork2_#t~ite9_Out382941199| ~a$w_buff1~0_In382941199) (not .cse0) (not .cse1)) (and (= |P1Thread1of1ForFork2_#t~ite9_Out382941199| ~a~0_In382941199) (or .cse0 .cse1)))) InVars {~a~0=~a~0_In382941199, ~a$w_buff1~0=~a$w_buff1~0_In382941199, ~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In382941199, ~a$w_buff1_used~0=~a$w_buff1_used~0_In382941199} OutVars{~a~0=~a~0_In382941199, P1Thread1of1ForFork2_#t~ite9=|P1Thread1of1ForFork2_#t~ite9_Out382941199|, ~a$w_buff1~0=~a$w_buff1~0_In382941199, ~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In382941199, ~a$w_buff1_used~0=~a$w_buff1_used~0_In382941199} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite9] because there is no mapped edge [2019-12-26 22:01:10,669 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [838] [838] L757-->L757-2: Formula: (let ((.cse1 (= (mod ~a$r_buff0_thd1~0_In711576965 256) 0)) (.cse0 (= (mod ~a$w_buff0_used~0_In711576965 256) 0))) (or (and (or .cse0 .cse1) (= |P0Thread1of1ForFork1_#t~ite5_Out711576965| ~a$w_buff0_used~0_In711576965)) (and (not .cse1) (not .cse0) (= |P0Thread1of1ForFork1_#t~ite5_Out711576965| 0)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In711576965, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In711576965} OutVars{P0Thread1of1ForFork1_#t~ite5=|P0Thread1of1ForFork1_#t~ite5_Out711576965|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In711576965, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In711576965} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite5] because there is no mapped edge [2019-12-26 22:01:10,671 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [843] [843] L758-->L758-2: Formula: (let ((.cse2 (= (mod ~a$r_buff0_thd1~0_In-133049075 256) 0)) (.cse3 (= 0 (mod ~a$w_buff0_used~0_In-133049075 256))) (.cse1 (= 0 (mod ~a$w_buff1_used~0_In-133049075 256))) (.cse0 (= (mod ~a$r_buff1_thd1~0_In-133049075 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~a$w_buff1_used~0_In-133049075 |P0Thread1of1ForFork1_#t~ite6_Out-133049075|)) (and (= 0 |P0Thread1of1ForFork1_#t~ite6_Out-133049075|) (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0)))))) InVars {~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In-133049075, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-133049075, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In-133049075, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-133049075} OutVars{P0Thread1of1ForFork1_#t~ite6=|P0Thread1of1ForFork1_#t~ite6_Out-133049075|, ~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In-133049075, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-133049075, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In-133049075, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-133049075} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite6] because there is no mapped edge [2019-12-26 22:01:10,672 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [848] [848] L759-->L760: Formula: (let ((.cse0 (= 0 (mod ~a$w_buff0_used~0_In-1710124203 256))) (.cse1 (= 0 (mod ~a$r_buff0_thd1~0_In-1710124203 256)))) (or (and (or .cse0 .cse1) (= ~a$r_buff0_thd1~0_In-1710124203 ~a$r_buff0_thd1~0_Out-1710124203)) (and (not .cse0) (not .cse1) (= ~a$r_buff0_thd1~0_Out-1710124203 0)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In-1710124203, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In-1710124203} OutVars{P0Thread1of1ForFork1_#t~ite7=|P0Thread1of1ForFork1_#t~ite7_Out-1710124203|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1710124203, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_Out-1710124203} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite7, ~a$r_buff0_thd1~0] because there is no mapped edge [2019-12-26 22:01:10,672 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [841] [841] L760-->L760-2: Formula: (let ((.cse1 (= (mod ~a$w_buff0_used~0_In-430585608 256) 0)) (.cse0 (= 0 (mod ~a$r_buff0_thd1~0_In-430585608 256))) (.cse2 (= (mod ~a$w_buff1_used~0_In-430585608 256) 0)) (.cse3 (= (mod ~a$r_buff1_thd1~0_In-430585608 256) 0))) (or (and (= |P0Thread1of1ForFork1_#t~ite8_Out-430585608| ~a$r_buff1_thd1~0_In-430585608) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3))) (= 0 |P0Thread1of1ForFork1_#t~ite8_Out-430585608|)))) InVars {~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In-430585608, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-430585608, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In-430585608, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-430585608} OutVars{P0Thread1of1ForFork1_#t~ite8=|P0Thread1of1ForFork1_#t~ite8_Out-430585608|, ~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In-430585608, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-430585608, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In-430585608, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-430585608} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite8] because there is no mapped edge [2019-12-26 22:01:10,672 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [875] [875] L760-2-->P0EXIT: Formula: (and (= 0 |v_P0Thread1of1ForFork1_#res.offset_5|) (= v_~a$r_buff1_thd1~0_80 |v_P0Thread1of1ForFork1_#t~ite8_52|) (= v_~__unbuffered_cnt~0_78 (+ v_~__unbuffered_cnt~0_79 1)) (= 0 |v_P0Thread1of1ForFork1_#res.base_5|)) InVars {P0Thread1of1ForFork1_#t~ite8=|v_P0Thread1of1ForFork1_#t~ite8_52|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_79} OutVars{P0Thread1of1ForFork1_#t~ite8=|v_P0Thread1of1ForFork1_#t~ite8_51|, P0Thread1of1ForFork1_#res.offset=|v_P0Thread1of1ForFork1_#res.offset_5|, ~a$r_buff1_thd1~0=v_~a$r_buff1_thd1~0_80, P0Thread1of1ForFork1_#res.base=|v_P0Thread1of1ForFork1_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_78} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite8, P0Thread1of1ForFork1_#res.offset, ~a$r_buff1_thd1~0, P0Thread1of1ForFork1_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-26 22:01:10,673 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [882] [882] L801-->L801-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-1568659912 256)))) (or (and .cse0 (= |P2Thread1of1ForFork0_#t~ite21_Out-1568659912| |P2Thread1of1ForFork0_#t~ite20_Out-1568659912|) (let ((.cse1 (= (mod ~a$r_buff0_thd3~0_In-1568659912 256) 0))) (or (= (mod ~a$w_buff0_used~0_In-1568659912 256) 0) (and (= 0 (mod ~a$r_buff1_thd3~0_In-1568659912 256)) .cse1) (and (= (mod ~a$w_buff1_used~0_In-1568659912 256) 0) .cse1))) (= |P2Thread1of1ForFork0_#t~ite20_Out-1568659912| ~a$w_buff0~0_In-1568659912)) (and (= |P2Thread1of1ForFork0_#t~ite20_In-1568659912| |P2Thread1of1ForFork0_#t~ite20_Out-1568659912|) (not .cse0) (= |P2Thread1of1ForFork0_#t~ite21_Out-1568659912| ~a$w_buff0~0_In-1568659912)))) InVars {~a$w_buff0~0=~a$w_buff0~0_In-1568659912, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-1568659912, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1568659912, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-1568659912, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1568659912, P2Thread1of1ForFork0_#t~ite20=|P2Thread1of1ForFork0_#t~ite20_In-1568659912|, ~weak$$choice2~0=~weak$$choice2~0_In-1568659912} OutVars{P2Thread1of1ForFork0_#t~ite21=|P2Thread1of1ForFork0_#t~ite21_Out-1568659912|, ~a$w_buff0~0=~a$w_buff0~0_In-1568659912, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-1568659912, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1568659912, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-1568659912, P2Thread1of1ForFork0_#t~ite20=|P2Thread1of1ForFork0_#t~ite20_Out-1568659912|, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1568659912, ~weak$$choice2~0=~weak$$choice2~0_In-1568659912} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite21, P2Thread1of1ForFork0_#t~ite20] because there is no mapped edge [2019-12-26 22:01:10,675 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [881] [881] L803-->L803-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In-46144599 256) 0))) (or (and .cse0 (= |P2Thread1of1ForFork0_#t~ite26_Out-46144599| ~a$w_buff0_used~0_In-46144599) (= |P2Thread1of1ForFork0_#t~ite27_Out-46144599| |P2Thread1of1ForFork0_#t~ite26_Out-46144599|) (let ((.cse1 (= (mod ~a$r_buff0_thd3~0_In-46144599 256) 0))) (or (= (mod ~a$w_buff0_used~0_In-46144599 256) 0) (and (= (mod ~a$w_buff1_used~0_In-46144599 256) 0) .cse1) (and (= (mod ~a$r_buff1_thd3~0_In-46144599 256) 0) .cse1)))) (and (= |P2Thread1of1ForFork0_#t~ite26_In-46144599| |P2Thread1of1ForFork0_#t~ite26_Out-46144599|) (not .cse0) (= |P2Thread1of1ForFork0_#t~ite27_Out-46144599| ~a$w_buff0_used~0_In-46144599)))) InVars {P2Thread1of1ForFork0_#t~ite26=|P2Thread1of1ForFork0_#t~ite26_In-46144599|, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-46144599, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-46144599, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-46144599, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-46144599, ~weak$$choice2~0=~weak$$choice2~0_In-46144599} OutVars{P2Thread1of1ForFork0_#t~ite26=|P2Thread1of1ForFork0_#t~ite26_Out-46144599|, P2Thread1of1ForFork0_#t~ite27=|P2Thread1of1ForFork0_#t~ite27_Out-46144599|, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-46144599, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-46144599, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-46144599, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-46144599, ~weak$$choice2~0=~weak$$choice2~0_In-46144599} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite26, P2Thread1of1ForFork0_#t~ite27] because there is no mapped edge [2019-12-26 22:01:10,675 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [883] [883] L804-->L804-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-2060771251 256)))) (or (and .cse0 (= |P2Thread1of1ForFork0_#t~ite29_Out-2060771251| |P2Thread1of1ForFork0_#t~ite30_Out-2060771251|) (= |P2Thread1of1ForFork0_#t~ite29_Out-2060771251| ~a$w_buff1_used~0_In-2060771251) (let ((.cse1 (= (mod ~a$r_buff0_thd3~0_In-2060771251 256) 0))) (or (= 0 (mod ~a$w_buff0_used~0_In-2060771251 256)) (and (= (mod ~a$r_buff1_thd3~0_In-2060771251 256) 0) .cse1) (and (= (mod ~a$w_buff1_used~0_In-2060771251 256) 0) .cse1)))) (and (not .cse0) (= |P2Thread1of1ForFork0_#t~ite29_In-2060771251| |P2Thread1of1ForFork0_#t~ite29_Out-2060771251|) (= |P2Thread1of1ForFork0_#t~ite30_Out-2060771251| ~a$w_buff1_used~0_In-2060771251)))) InVars {~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-2060771251, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-2060771251, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-2060771251, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-2060771251, ~weak$$choice2~0=~weak$$choice2~0_In-2060771251, P2Thread1of1ForFork0_#t~ite29=|P2Thread1of1ForFork0_#t~ite29_In-2060771251|} OutVars{~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-2060771251, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-2060771251, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-2060771251, P2Thread1of1ForFork0_#t~ite30=|P2Thread1of1ForFork0_#t~ite30_Out-2060771251|, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-2060771251, P2Thread1of1ForFork0_#t~ite29=|P2Thread1of1ForFork0_#t~ite29_Out-2060771251|, ~weak$$choice2~0=~weak$$choice2~0_In-2060771251} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite30, P2Thread1of1ForFork0_#t~ite29] because there is no mapped edge [2019-12-26 22:01:10,676 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [769] [769] L805-->L806: Formula: (and (= v_~a$r_buff0_thd3~0_59 v_~a$r_buff0_thd3~0_60) (not (= 0 (mod v_~weak$$choice2~0_17 256)))) InVars {~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_60, ~weak$$choice2~0=v_~weak$$choice2~0_17} OutVars{P2Thread1of1ForFork0_#t~ite33=|v_P2Thread1of1ForFork0_#t~ite33_7|, P2Thread1of1ForFork0_#t~ite32=|v_P2Thread1of1ForFork0_#t~ite32_7|, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_59, P2Thread1of1ForFork0_#t~ite31=|v_P2Thread1of1ForFork0_#t~ite31_7|, ~weak$$choice2~0=v_~weak$$choice2~0_17} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite33, P2Thread1of1ForFork0_#t~ite32, ~a$r_buff0_thd3~0, P2Thread1of1ForFork0_#t~ite31] because there is no mapped edge [2019-12-26 22:01:10,677 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [796] [796] L776-4-->L777: Formula: (= |v_P1Thread1of1ForFork2_#t~ite9_20| v_~a~0_46) InVars {P1Thread1of1ForFork2_#t~ite9=|v_P1Thread1of1ForFork2_#t~ite9_20|} OutVars{~a~0=v_~a~0_46, P1Thread1of1ForFork2_#t~ite9=|v_P1Thread1of1ForFork2_#t~ite9_19|, P1Thread1of1ForFork2_#t~ite10=|v_P1Thread1of1ForFork2_#t~ite10_25|} AuxVars[] AssignedVars[~a~0, P1Thread1of1ForFork2_#t~ite9, P1Thread1of1ForFork2_#t~ite10] because there is no mapped edge [2019-12-26 22:01:10,677 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [825] [825] L777-->L777-2: Formula: (let ((.cse0 (= 0 (mod ~a$r_buff0_thd2~0_In-1077110258 256))) (.cse1 (= (mod ~a$w_buff0_used~0_In-1077110258 256) 0))) (or (and (or .cse0 .cse1) (= ~a$w_buff0_used~0_In-1077110258 |P1Thread1of1ForFork2_#t~ite11_Out-1077110258|)) (and (= 0 |P1Thread1of1ForFork2_#t~ite11_Out-1077110258|) (not .cse0) (not .cse1)))) InVars {~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-1077110258, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1077110258} OutVars{~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-1077110258, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1077110258, P1Thread1of1ForFork2_#t~ite11=|P1Thread1of1ForFork2_#t~ite11_Out-1077110258|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite11] because there is no mapped edge [2019-12-26 22:01:10,679 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [833] [833] L778-->L778-2: Formula: (let ((.cse1 (= (mod ~a$r_buff1_thd2~0_In-489629571 256) 0)) (.cse0 (= (mod ~a$w_buff1_used~0_In-489629571 256) 0)) (.cse3 (= (mod ~a$r_buff0_thd2~0_In-489629571 256) 0)) (.cse2 (= (mod ~a$w_buff0_used~0_In-489629571 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~a$w_buff1_used~0_In-489629571 |P1Thread1of1ForFork2_#t~ite12_Out-489629571|)) (and (= 0 |P1Thread1of1ForFork2_#t~ite12_Out-489629571|) (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2)))))) InVars {~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In-489629571, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-489629571, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-489629571, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-489629571} OutVars{~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In-489629571, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-489629571, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-489629571, P1Thread1of1ForFork2_#t~ite12=|P1Thread1of1ForFork2_#t~ite12_Out-489629571|, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-489629571} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite12] because there is no mapped edge [2019-12-26 22:01:10,680 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [826] [826] L779-->L779-2: Formula: (let ((.cse0 (= (mod ~a$r_buff0_thd2~0_In-1881579423 256) 0)) (.cse1 (= 0 (mod ~a$w_buff0_used~0_In-1881579423 256)))) (or (and (not .cse0) (= |P1Thread1of1ForFork2_#t~ite13_Out-1881579423| 0) (not .cse1)) (and (or .cse0 .cse1) (= |P1Thread1of1ForFork2_#t~ite13_Out-1881579423| ~a$r_buff0_thd2~0_In-1881579423)))) InVars {~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-1881579423, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1881579423} OutVars{~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-1881579423, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1881579423, P1Thread1of1ForFork2_#t~ite13=|P1Thread1of1ForFork2_#t~ite13_Out-1881579423|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite13] because there is no mapped edge [2019-12-26 22:01:10,680 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [822] [822] L780-->L780-2: Formula: (let ((.cse0 (= (mod ~a$w_buff1_used~0_In389586317 256) 0)) (.cse1 (= (mod ~a$r_buff1_thd2~0_In389586317 256) 0)) (.cse2 (= (mod ~a$w_buff0_used~0_In389586317 256) 0)) (.cse3 (= (mod ~a$r_buff0_thd2~0_In389586317 256) 0))) (or (and (or .cse0 .cse1) (= |P1Thread1of1ForFork2_#t~ite14_Out389586317| ~a$r_buff1_thd2~0_In389586317) (or .cse2 .cse3)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P1Thread1of1ForFork2_#t~ite14_Out389586317| 0)))) InVars {~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In389586317, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In389586317, ~a$w_buff0_used~0=~a$w_buff0_used~0_In389586317, ~a$w_buff1_used~0=~a$w_buff1_used~0_In389586317} OutVars{~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In389586317, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In389586317, ~a$w_buff0_used~0=~a$w_buff0_used~0_In389586317, ~a$w_buff1_used~0=~a$w_buff1_used~0_In389586317, P1Thread1of1ForFork2_#t~ite14=|P1Thread1of1ForFork2_#t~ite14_Out389586317|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite14] because there is no mapped edge [2019-12-26 22:01:10,681 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [870] [870] L780-2-->P1EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_66 1) v_~__unbuffered_cnt~0_65) (= 0 |v_P1Thread1of1ForFork2_#res.offset_5|) (= |v_P1Thread1of1ForFork2_#t~ite14_30| v_~a$r_buff1_thd2~0_61) (= 0 |v_P1Thread1of1ForFork2_#res.base_5|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_66, P1Thread1of1ForFork2_#t~ite14=|v_P1Thread1of1ForFork2_#t~ite14_30|} OutVars{P1Thread1of1ForFork2_#res.offset=|v_P1Thread1of1ForFork2_#res.offset_5|, ~a$r_buff1_thd2~0=v_~a$r_buff1_thd2~0_61, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_65, P1Thread1of1ForFork2_#t~ite14=|v_P1Thread1of1ForFork2_#t~ite14_29|, P1Thread1of1ForFork2_#res.base=|v_P1Thread1of1ForFork2_#res.base_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#res.offset, ~a$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork2_#t~ite14, P1Thread1of1ForFork2_#res.base] because there is no mapped edge [2019-12-26 22:01:10,681 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [805] [805] L808-->L812: Formula: (and (= v_~a$flush_delayed~0_8 0) (= v_~a~0_52 v_~a$mem_tmp~0_6) (not (= (mod v_~a$flush_delayed~0_9 256) 0))) InVars {~a$mem_tmp~0=v_~a$mem_tmp~0_6, ~a$flush_delayed~0=v_~a$flush_delayed~0_9} OutVars{P2Thread1of1ForFork0_#t~ite37=|v_P2Thread1of1ForFork0_#t~ite37_7|, ~a~0=v_~a~0_52, ~a$mem_tmp~0=v_~a$mem_tmp~0_6, ~a$flush_delayed~0=v_~a$flush_delayed~0_8} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite37, ~a~0, ~a$flush_delayed~0] because there is no mapped edge [2019-12-26 22:01:10,682 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [827] [827] L812-2-->L812-5: Formula: (let ((.cse1 (= |P2Thread1of1ForFork0_#t~ite39_Out1628068631| |P2Thread1of1ForFork0_#t~ite38_Out1628068631|)) (.cse0 (= (mod ~a$r_buff1_thd3~0_In1628068631 256) 0)) (.cse2 (= (mod ~a$w_buff1_used~0_In1628068631 256) 0))) (or (and (not .cse0) .cse1 (not .cse2) (= ~a$w_buff1~0_In1628068631 |P2Thread1of1ForFork0_#t~ite38_Out1628068631|)) (and .cse1 (or .cse0 .cse2) (= ~a~0_In1628068631 |P2Thread1of1ForFork0_#t~ite38_Out1628068631|)))) InVars {~a~0=~a~0_In1628068631, ~a$w_buff1~0=~a$w_buff1~0_In1628068631, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In1628068631, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1628068631} OutVars{~a~0=~a~0_In1628068631, P2Thread1of1ForFork0_#t~ite39=|P2Thread1of1ForFork0_#t~ite39_Out1628068631|, P2Thread1of1ForFork0_#t~ite38=|P2Thread1of1ForFork0_#t~ite38_Out1628068631|, ~a$w_buff1~0=~a$w_buff1~0_In1628068631, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In1628068631, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1628068631} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite39, P2Thread1of1ForFork0_#t~ite38] because there is no mapped edge [2019-12-26 22:01:10,683 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [836] [836] L813-->L813-2: Formula: (let ((.cse1 (= (mod ~a$w_buff0_used~0_In1734547426 256) 0)) (.cse0 (= 0 (mod ~a$r_buff0_thd3~0_In1734547426 256)))) (or (and (= |P2Thread1of1ForFork0_#t~ite40_Out1734547426| 0) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= |P2Thread1of1ForFork0_#t~ite40_Out1734547426| ~a$w_buff0_used~0_In1734547426)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In1734547426, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In1734547426} OutVars{P2Thread1of1ForFork0_#t~ite40=|P2Thread1of1ForFork0_#t~ite40_Out1734547426|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1734547426, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In1734547426} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite40] because there is no mapped edge [2019-12-26 22:01:10,684 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [835] [835] L814-->L814-2: Formula: (let ((.cse3 (= 0 (mod ~a$r_buff1_thd3~0_In1478034332 256))) (.cse2 (= 0 (mod ~a$w_buff1_used~0_In1478034332 256))) (.cse1 (= (mod ~a$w_buff0_used~0_In1478034332 256) 0)) (.cse0 (= 0 (mod ~a$r_buff0_thd3~0_In1478034332 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P2Thread1of1ForFork0_#t~ite41_Out1478034332| ~a$w_buff1_used~0_In1478034332)) (and (= |P2Thread1of1ForFork0_#t~ite41_Out1478034332| 0) (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0)))))) InVars {~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In1478034332, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1478034332, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In1478034332, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1478034332} OutVars{~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In1478034332, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1478034332, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In1478034332, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1478034332, P2Thread1of1ForFork0_#t~ite41=|P2Thread1of1ForFork0_#t~ite41_Out1478034332|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite41] because there is no mapped edge [2019-12-26 22:01:10,684 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [847] [847] L815-->L815-2: Formula: (let ((.cse1 (= 0 (mod ~a$r_buff0_thd3~0_In1520239143 256))) (.cse0 (= (mod ~a$w_buff0_used~0_In1520239143 256) 0))) (or (and (or .cse0 .cse1) (= |P2Thread1of1ForFork0_#t~ite42_Out1520239143| ~a$r_buff0_thd3~0_In1520239143)) (and (not .cse1) (not .cse0) (= |P2Thread1of1ForFork0_#t~ite42_Out1520239143| 0)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In1520239143, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In1520239143} OutVars{~a$w_buff0_used~0=~a$w_buff0_used~0_In1520239143, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In1520239143, P2Thread1of1ForFork0_#t~ite42=|P2Thread1of1ForFork0_#t~ite42_Out1520239143|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite42] because there is no mapped edge [2019-12-26 22:01:10,685 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [845] [845] L816-->L816-2: Formula: (let ((.cse0 (= 0 (mod ~a$w_buff1_used~0_In640236180 256))) (.cse1 (= (mod ~a$r_buff1_thd3~0_In640236180 256) 0)) (.cse3 (= 0 (mod ~a$r_buff0_thd3~0_In640236180 256))) (.cse2 (= (mod ~a$w_buff0_used~0_In640236180 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~a$r_buff1_thd3~0_In640236180 |P2Thread1of1ForFork0_#t~ite43_Out640236180|)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2))) (= 0 |P2Thread1of1ForFork0_#t~ite43_Out640236180|)))) InVars {~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In640236180, ~a$w_buff0_used~0=~a$w_buff0_used~0_In640236180, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In640236180, ~a$w_buff1_used~0=~a$w_buff1_used~0_In640236180} OutVars{P2Thread1of1ForFork0_#t~ite43=|P2Thread1of1ForFork0_#t~ite43_Out640236180|, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In640236180, ~a$w_buff0_used~0=~a$w_buff0_used~0_In640236180, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In640236180, ~a$w_buff1_used~0=~a$w_buff1_used~0_In640236180} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite43] because there is no mapped edge [2019-12-26 22:01:10,685 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [858] [858] L816-2-->P2EXIT: Formula: (and (= |v_P2Thread1of1ForFork0_#res.offset_5| 0) (= v_~a$r_buff1_thd3~0_127 |v_P2Thread1of1ForFork0_#t~ite43_38|) (= v_~__unbuffered_cnt~0_59 (+ v_~__unbuffered_cnt~0_60 1)) (= |v_P2Thread1of1ForFork0_#res.base_5| 0)) InVars {P2Thread1of1ForFork0_#t~ite43=|v_P2Thread1of1ForFork0_#t~ite43_38|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_60} OutVars{P2Thread1of1ForFork0_#res.base=|v_P2Thread1of1ForFork0_#res.base_5|, P2Thread1of1ForFork0_#t~ite43=|v_P2Thread1of1ForFork0_#t~ite43_37|, ~a$r_buff1_thd3~0=v_~a$r_buff1_thd3~0_127, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_59, P2Thread1of1ForFork0_#res.offset=|v_P2Thread1of1ForFork0_#res.offset_5|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#res.base, P2Thread1of1ForFork0_#t~ite43, ~a$r_buff1_thd3~0, ~__unbuffered_cnt~0, P2Thread1of1ForFork0_#res.offset] because there is no mapped edge [2019-12-26 22:01:10,685 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [776] [776] L839-1-->L845: Formula: (and (= 3 v_~__unbuffered_cnt~0_14) (= v_~main$tmp_guard0~0_6 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_14} OutVars{ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_6|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_14, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_6} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet46, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-26 22:01:10,686 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [840] [840] L845-2-->L845-5: Formula: (let ((.cse1 (= 0 (mod ~a$r_buff1_thd0~0_In-518996439 256))) (.cse2 (= |ULTIMATE.start_main_#t~ite48_Out-518996439| |ULTIMATE.start_main_#t~ite47_Out-518996439|)) (.cse0 (= (mod ~a$w_buff1_used~0_In-518996439 256) 0))) (or (and (or .cse0 .cse1) (= ~a~0_In-518996439 |ULTIMATE.start_main_#t~ite47_Out-518996439|) .cse2) (and (not .cse1) .cse2 (= ~a$w_buff1~0_In-518996439 |ULTIMATE.start_main_#t~ite47_Out-518996439|) (not .cse0)))) InVars {~a~0=~a~0_In-518996439, ~a$w_buff1~0=~a$w_buff1~0_In-518996439, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In-518996439, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-518996439} OutVars{~a~0=~a~0_In-518996439, ~a$w_buff1~0=~a$w_buff1~0_In-518996439, ULTIMATE.start_main_#t~ite47=|ULTIMATE.start_main_#t~ite47_Out-518996439|, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In-518996439, ULTIMATE.start_main_#t~ite48=|ULTIMATE.start_main_#t~ite48_Out-518996439|, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-518996439} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite47, ULTIMATE.start_main_#t~ite48] because there is no mapped edge [2019-12-26 22:01:10,687 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [834] [834] L846-->L846-2: Formula: (let ((.cse0 (= (mod ~a$r_buff0_thd0~0_In-1004639527 256) 0)) (.cse1 (= (mod ~a$w_buff0_used~0_In-1004639527 256) 0))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite49_Out-1004639527| ~a$w_buff0_used~0_In-1004639527)) (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite49_Out-1004639527| 0)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In-1004639527, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-1004639527} OutVars{~a$w_buff0_used~0=~a$w_buff0_used~0_In-1004639527, ULTIMATE.start_main_#t~ite49=|ULTIMATE.start_main_#t~ite49_Out-1004639527|, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-1004639527} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite49] because there is no mapped edge [2019-12-26 22:01:10,688 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [831] [831] L847-->L847-2: Formula: (let ((.cse1 (= 0 (mod ~a$w_buff0_used~0_In1474336366 256))) (.cse0 (= (mod ~a$r_buff0_thd0~0_In1474336366 256) 0)) (.cse2 (= (mod ~a$w_buff1_used~0_In1474336366 256) 0)) (.cse3 (= 0 (mod ~a$r_buff1_thd0~0_In1474336366 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite50_Out1474336366| 0)) (and (= |ULTIMATE.start_main_#t~ite50_Out1474336366| ~a$w_buff1_used~0_In1474336366) (or .cse1 .cse0) (or .cse2 .cse3)))) InVars {~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In1474336366, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1474336366, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In1474336366, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1474336366} OutVars{ULTIMATE.start_main_#t~ite50=|ULTIMATE.start_main_#t~ite50_Out1474336366|, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In1474336366, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1474336366, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In1474336366, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1474336366} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite50] because there is no mapped edge [2019-12-26 22:01:10,689 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [829] [829] L848-->L848-2: Formula: (let ((.cse1 (= 0 (mod ~a$w_buff0_used~0_In-989050542 256))) (.cse0 (= 0 (mod ~a$r_buff0_thd0~0_In-989050542 256)))) (or (and (not .cse0) (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite51_Out-989050542|)) (and (= ~a$r_buff0_thd0~0_In-989050542 |ULTIMATE.start_main_#t~ite51_Out-989050542|) (or .cse1 .cse0)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In-989050542, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-989050542} OutVars{ULTIMATE.start_main_#t~ite51=|ULTIMATE.start_main_#t~ite51_Out-989050542|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-989050542, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-989050542} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite51] because there is no mapped edge [2019-12-26 22:01:10,689 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [837] [837] L849-->L849-2: Formula: (let ((.cse0 (= (mod ~a$w_buff0_used~0_In-1011259150 256) 0)) (.cse1 (= 0 (mod ~a$r_buff0_thd0~0_In-1011259150 256))) (.cse3 (= (mod ~a$w_buff1_used~0_In-1011259150 256) 0)) (.cse2 (= (mod ~a$r_buff1_thd0~0_In-1011259150 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite52_Out-1011259150| 0)) (and (= |ULTIMATE.start_main_#t~ite52_Out-1011259150| ~a$r_buff1_thd0~0_In-1011259150) (or .cse0 .cse1) (or .cse3 .cse2)))) InVars {~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In-1011259150, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1011259150, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-1011259150, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1011259150} OutVars{ULTIMATE.start_main_#t~ite52=|ULTIMATE.start_main_#t~ite52_Out-1011259150|, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In-1011259150, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1011259150, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-1011259150, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1011259150} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52] because there is no mapped edge [2019-12-26 22:01:10,690 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [889] [889] L849-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= (mod v_~main$tmp_guard1~0_17 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_15|) (= v_~main$tmp_guard1~0_17 0) (= 1 v_~__unbuffered_p0_EAX~0_40) (= 2 v_~__unbuffered_p2_EAX~0_20) (= |v_ULTIMATE.start_main_#t~ite52_35| v_~a$r_buff1_thd0~0_75) (= v_~__unbuffered_p2_EBX~0_26 0) (= v_ULTIMATE.start___VERIFIER_assert_~expression_17 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_15|) (= v_~__unbuffered_p0_EBX~0_40 0) (= v_~z~0_25 2)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_40, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_35|, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_40, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_26, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_20, ~z~0=v_~z~0_25} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_40, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_34|, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_17, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_40, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_26, ~a$r_buff1_thd0~0=v_~a$r_buff1_thd0~0_75, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_17, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_20, ~z~0=v_~z~0_25, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_15|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52, ULTIMATE.start___VERIFIER_assert_~expression, ~a$r_buff1_thd0~0, ~main$tmp_guard1~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-26 22:01:10,784 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.12 10:01:10 BasicIcfg [2019-12-26 22:01:10,785 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-26 22:01:10,787 INFO L168 Benchmark]: Toolchain (without parser) took 110858.09 ms. Allocated memory was 145.2 MB in the beginning and 3.2 GB in the end (delta: 3.1 GB). Free memory was 101.3 MB in the beginning and 1.9 GB in the end (delta: -1.8 GB). Peak memory consumption was 1.2 GB. Max. memory is 7.1 GB. [2019-12-26 22:01:10,787 INFO L168 Benchmark]: CDTParser took 0.52 ms. Allocated memory is still 145.2 MB. Free memory was 121.6 MB in the beginning and 121.4 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-12-26 22:01:10,787 INFO L168 Benchmark]: CACSL2BoogieTranslator took 867.74 ms. Allocated memory was 145.2 MB in the beginning and 202.9 MB in the end (delta: 57.7 MB). Free memory was 100.9 MB in the beginning and 155.8 MB in the end (delta: -54.9 MB). Peak memory consumption was 22.2 MB. Max. memory is 7.1 GB. [2019-12-26 22:01:10,788 INFO L168 Benchmark]: Boogie Procedure Inliner took 66.26 ms. Allocated memory is still 202.9 MB. Free memory was 155.8 MB in the beginning and 153.1 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-26 22:01:10,788 INFO L168 Benchmark]: Boogie Preprocessor took 45.64 ms. Allocated memory is still 202.9 MB. Free memory was 153.1 MB in the beginning and 151.1 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. [2019-12-26 22:01:10,789 INFO L168 Benchmark]: RCFGBuilder took 966.18 ms. Allocated memory is still 202.9 MB. Free memory was 150.5 MB in the beginning and 100.3 MB in the end (delta: 50.2 MB). Peak memory consumption was 50.2 MB. Max. memory is 7.1 GB. [2019-12-26 22:01:10,789 INFO L168 Benchmark]: TraceAbstraction took 108907.09 ms. Allocated memory was 202.9 MB in the beginning and 3.2 GB in the end (delta: 3.0 GB). Free memory was 99.7 MB in the beginning and 1.9 GB in the end (delta: -1.8 GB). Peak memory consumption was 1.2 GB. Max. memory is 7.1 GB. [2019-12-26 22:01:10,791 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.52 ms. Allocated memory is still 145.2 MB. Free memory was 121.6 MB in the beginning and 121.4 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 867.74 ms. Allocated memory was 145.2 MB in the beginning and 202.9 MB in the end (delta: 57.7 MB). Free memory was 100.9 MB in the beginning and 155.8 MB in the end (delta: -54.9 MB). Peak memory consumption was 22.2 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 66.26 ms. Allocated memory is still 202.9 MB. Free memory was 155.8 MB in the beginning and 153.1 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 45.64 ms. Allocated memory is still 202.9 MB. Free memory was 153.1 MB in the beginning and 151.1 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. * RCFGBuilder took 966.18 ms. Allocated memory is still 202.9 MB. Free memory was 150.5 MB in the beginning and 100.3 MB in the end (delta: 50.2 MB). Peak memory consumption was 50.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 108907.09 ms. Allocated memory was 202.9 MB in the beginning and 3.2 GB in the end (delta: 3.0 GB). Free memory was 99.7 MB in the beginning and 1.9 GB in the end (delta: -1.8 GB). Peak memory consumption was 1.2 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 5.8s, 178 ProgramPointsBefore, 93 ProgramPointsAfterwards, 215 TransitionsBefore, 102 TransitionsAfterwards, 19004 CoEnabledTransitionPairs, 7 FixpointIterations, 35 TrivialSequentialCompositions, 48 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 30 ConcurrentYvCompositions, 32 ChoiceCompositions, 7050 VarBasedMoverChecksPositive, 251 VarBasedMoverChecksNegative, 63 SemBasedMoverChecksPositive, 249 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.7s, 0 MoverChecksTotal, 78858 CheckedPairsTotal, 113 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L835] FCALL, FORK 0 pthread_create(&t651, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L837] FCALL, FORK 0 pthread_create(&t652, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L839] FCALL, FORK 0 pthread_create(&t653, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L740] 1 a$r_buff1_thd0 = a$r_buff0_thd0 [L741] 1 a$r_buff1_thd1 = a$r_buff0_thd1 [L742] 1 a$r_buff1_thd2 = a$r_buff0_thd2 [L743] 1 a$r_buff1_thd3 = a$r_buff0_thd3 [L744] 1 a$r_buff0_thd1 = (_Bool)1 [L747] 1 x = 1 [L750] 1 __unbuffered_p0_EAX = x [L753] 1 __unbuffered_p0_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L756] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L770] 2 y = 1 [L773] 2 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=1] [L776] 2 a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=1] [L756] 1 a = a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) [L757] 1 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L790] 3 z = 2 [L793] 3 __unbuffered_p2_EAX = z [L796] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L797] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L798] 3 a$flush_delayed = weak$$choice2 [L799] 3 a$mem_tmp = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a=1, a$flush_delayed=1, a$mem_tmp=1, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=1, y=1, z=2] [L800] EXPR 3 !a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff1) VAL [!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff1)=1, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a=1, a$flush_delayed=1, a$mem_tmp=1, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=1, y=1, z=2] [L758] 1 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$w_buff1_used [L800] 3 a = !a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff1) [L801] 3 a$w_buff0 = weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff0)) [L802] EXPR 3 weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff1 : a$w_buff1)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a=1, a$flush_delayed=1, a$mem_tmp=1, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff1 : a$w_buff1))=0, x=1, y=1, z=2] [L802] 3 a$w_buff1 = weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff1 : a$w_buff1)) [L803] 3 a$w_buff0_used = weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used)) [L804] 3 a$w_buff1_used = weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L806] EXPR 3 weak$$choice2 ? a$r_buff1_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff1_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a=1, a$flush_delayed=1, a$mem_tmp=1, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, weak$$choice2 ? a$r_buff1_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff1_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))=0, x=1, y=1, z=2] [L777] 2 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L778] 2 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used [L779] 2 a$r_buff0_thd2 = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L806] 3 a$r_buff1_thd3 = weak$$choice2 ? a$r_buff1_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff1_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L807] 3 __unbuffered_p2_EBX = a VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=1, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=1, y=1, z=2] [L812] EXPR 3 a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=1, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=1, y=1, z=2] [L812] 3 a = a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) [L813] 3 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used [L814] 3 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$w_buff1_used [L815] 3 a$r_buff0_thd3 = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3 [L845] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=1, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=1, y=1, z=2] [L845] 0 a = a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L846] 0 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L847] 0 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$w_buff1_used [L848] 0 a$r_buff0_thd0 = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 169 locations, 2 error locations. Result: UNSAFE, OverallTime: 108.5s, OverallIterations: 38, TraceHistogramMax: 1, AutomataDifference: 35.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 8216 SDtfs, 11177 SDslu, 27733 SDs, 0 SdLazy, 18684 SolverSat, 502 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 16.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 505 GetRequests, 108 SyntacticMatches, 30 SemanticMatches, 367 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1156 ImplicationChecksByTransitivity, 4.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=151748occurred 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: 43.4s AutomataMinimizationTime, 37 MinimizatonAttempts, 219555 StatesRemovedByMinimization, 34 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 3.2s InterpolantComputationTime, 2023 NumberOfCodeBlocks, 2023 NumberOfCodeBlocksAsserted, 38 NumberOfCheckSat, 1919 ConstructedInterpolants, 0 QuantifiedInterpolants, 431150 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 37 InterpolantComputations, 37 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...