/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe.epf -i ../../../trunk/examples/svcomp/pthread-wmm/safe011_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 03:38:22,730 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 03:38:22,733 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 03:38:22,745 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 03:38:22,746 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 03:38:22,747 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 03:38:22,748 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 03:38:22,750 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 03:38:22,753 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 03:38:22,761 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 03:38:22,762 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 03:38:22,763 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 03:38:22,763 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 03:38:22,765 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 03:38:22,766 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 03:38:22,767 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 03:38:22,768 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 03:38:22,769 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 03:38:22,771 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 03:38:22,773 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 03:38:22,774 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 03:38:22,775 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 03:38:22,776 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 03:38:22,777 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 03:38:22,779 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 03:38:22,779 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 03:38:22,779 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 03:38:22,780 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 03:38:22,781 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 03:38:22,782 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 03:38:22,782 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 03:38:22,784 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 03:38:22,785 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 03:38:22,786 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 03:38:22,788 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 03:38:22,789 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 03:38:22,790 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 03:38:22,790 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 03:38:22,790 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 03:38:22,791 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 03:38:22,792 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 03:38:22,792 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe.epf [2019-12-27 03:38:22,824 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 03:38:22,825 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 03:38:22,826 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 03:38:22,826 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 03:38:22,826 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 03:38:22,827 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 03:38:22,828 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 03:38:22,828 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 03:38:22,828 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 03:38:22,828 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 03:38:22,828 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 03:38:22,829 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 03:38:22,829 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 03:38:22,829 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 03:38:22,829 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 03:38:22,829 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 03:38:22,829 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 03:38:22,830 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 03:38:22,830 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 03:38:22,830 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 03:38:22,830 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 03:38:22,830 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 03:38:22,831 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 03:38:22,831 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 03:38:22,831 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 03:38:22,831 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 03:38:22,831 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 03:38:22,832 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 03:38:22,832 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 03:38:23,161 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 03:38:23,181 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 03:38:23,185 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 03:38:23,186 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 03:38:23,187 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 03:38:23,188 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe011_rmo.opt.i [2019-12-27 03:38:23,265 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b1fe76795/3be57e3690344c8898f3657748d697be/FLAG63a39f044 [2019-12-27 03:38:23,805 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 03:38:23,806 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe011_rmo.opt.i [2019-12-27 03:38:23,832 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b1fe76795/3be57e3690344c8898f3657748d697be/FLAG63a39f044 [2019-12-27 03:38:24,074 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b1fe76795/3be57e3690344c8898f3657748d697be [2019-12-27 03:38:24,084 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 03:38:24,086 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 03:38:24,087 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 03:38:24,087 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 03:38:24,090 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 03:38:24,091 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 03:38:24" (1/1) ... [2019-12-27 03:38:24,094 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@32a7d1ad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:38:24, skipping insertion in model container [2019-12-27 03:38:24,095 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 03:38:24" (1/1) ... [2019-12-27 03:38:24,103 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 03:38:24,172 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 03:38:24,721 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 03:38:24,732 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 03:38:24,806 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 03:38:24,882 INFO L208 MainTranslator]: Completed translation [2019-12-27 03:38:24,882 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:38:24 WrapperNode [2019-12-27 03:38:24,882 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 03:38:24,883 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 03:38:24,883 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 03:38:24,883 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 03:38:24,891 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:38:24" (1/1) ... [2019-12-27 03:38:24,912 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:38:24" (1/1) ... [2019-12-27 03:38:24,946 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 03:38:24,947 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 03:38:24,947 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 03:38:24,947 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 03:38:24,958 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:38:24" (1/1) ... [2019-12-27 03:38:24,959 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:38:24" (1/1) ... [2019-12-27 03:38:24,966 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:38:24" (1/1) ... [2019-12-27 03:38:24,966 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:38:24" (1/1) ... [2019-12-27 03:38:24,977 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:38:24" (1/1) ... [2019-12-27 03:38:24,981 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:38:24" (1/1) ... [2019-12-27 03:38:24,985 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:38:24" (1/1) ... [2019-12-27 03:38:24,991 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 03:38:24,991 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 03:38:24,991 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 03:38:24,992 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 03:38:24,992 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:38:24" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 03:38:25,081 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 03:38:25,081 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 03:38:25,082 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 03:38:25,082 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 03:38:25,082 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 03:38:25,082 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 03:38:25,082 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 03:38:25,083 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 03:38:25,083 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-27 03:38:25,083 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-27 03:38:25,083 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 03:38:25,083 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 03:38:25,084 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 03:38:25,086 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-27 03:38:26,043 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 03:38:26,044 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 03:38:26,045 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 03:38:26 BoogieIcfgContainer [2019-12-27 03:38:26,046 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 03:38:26,047 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 03:38:26,047 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 03:38:26,050 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 03:38:26,051 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 03:38:24" (1/3) ... [2019-12-27 03:38:26,052 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6129ebcc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 03:38:26, skipping insertion in model container [2019-12-27 03:38:26,052 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:38:24" (2/3) ... [2019-12-27 03:38:26,052 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6129ebcc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 03:38:26, skipping insertion in model container [2019-12-27 03:38:26,053 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 03:38:26" (3/3) ... [2019-12-27 03:38:26,054 INFO L109 eAbstractionObserver]: Analyzing ICFG safe011_rmo.opt.i [2019-12-27 03:38:26,065 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 03:38:26,065 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 03:38:26,073 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 03:38:26,074 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 03:38:26,113 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:38:26,113 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:38:26,113 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:38:26,114 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:38:26,114 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:38:26,114 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:38:26,115 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:38:26,115 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:38:26,115 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:38:26,116 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:38:26,116 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:38:26,116 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:38:26,117 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:38:26,117 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:38:26,117 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:38:26,118 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:38:26,118 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:38:26,118 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:38:26,118 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:38:26,118 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:38:26,119 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:38:26,119 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:38:26,119 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:38:26,119 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:38:26,120 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:38:26,120 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:38:26,120 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:38:26,120 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:38:26,121 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:38:26,121 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:38:26,121 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:38:26,121 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:38:26,122 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:38:26,122 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:38:26,122 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:38:26,123 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:38:26,123 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:38:26,123 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:38:26,124 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:38:26,124 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:38:26,124 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:38:26,124 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:38:26,124 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:38:26,125 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:38:26,125 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:38:26,125 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:38:26,126 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:38:26,126 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:38:26,126 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:38:26,126 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:38:26,127 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:38:26,127 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:38:26,127 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:38:26,127 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:38:26,128 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:38:26,128 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:38:26,128 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:38:26,128 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:38:26,129 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:38:26,129 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:38:26,129 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:38:26,129 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:38:26,130 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:38:26,130 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:38:26,130 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:38:26,131 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:38:26,131 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:38:26,131 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:38:26,131 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:38:26,132 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:38:26,132 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:38:26,132 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:38:26,132 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:38:26,133 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:38:26,133 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:38:26,133 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:38:26,133 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:38:26,134 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:38:26,134 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:38:26,134 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:38:26,134 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:38:26,135 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:38:26,135 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:38:26,135 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:38:26,135 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:38:26,135 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:38:26,136 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:38:26,136 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:38:26,136 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:38:26,136 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:38:26,137 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:38:26,137 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:38:26,137 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:38:26,137 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:38:26,141 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:38:26,141 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:38:26,142 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:38:26,142 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:38:26,142 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:38:26,142 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:38:26,143 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:38:26,143 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:38:26,143 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:38:26,143 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:38:26,144 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:38:26,144 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:38:26,148 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:38:26,149 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:38:26,149 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:38:26,149 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:38:26,150 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:38:26,167 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:38:26,167 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:38:26,167 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:38:26,168 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:38:26,168 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:38:26,170 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:38:26,171 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:38:26,171 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:38:26,171 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:38:26,171 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:38:26,171 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:38:26,172 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:38:26,172 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:38:26,172 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:38:26,172 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:38:26,186 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-27 03:38:26,203 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 03:38:26,203 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 03:38:26,203 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 03:38:26,203 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-27 03:38:26,203 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 03:38:26,203 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 03:38:26,204 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 03:38:26,204 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 03:38:26,221 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 174 places, 211 transitions [2019-12-27 03:38:26,223 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 174 places, 211 transitions [2019-12-27 03:38:26,323 INFO L132 PetriNetUnfolder]: 47/208 cut-off events. [2019-12-27 03:38:26,323 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 03:38:26,339 INFO L76 FinitePrefix]: Finished finitePrefix Result has 218 conditions, 208 events. 47/208 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 335 event pairs. 0/159 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-27 03:38:26,361 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 174 places, 211 transitions [2019-12-27 03:38:26,415 INFO L132 PetriNetUnfolder]: 47/208 cut-off events. [2019-12-27 03:38:26,415 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 03:38:26,423 INFO L76 FinitePrefix]: Finished finitePrefix Result has 218 conditions, 208 events. 47/208 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 335 event pairs. 0/159 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-27 03:38:26,443 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 17114 [2019-12-27 03:38:26,445 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-27 03:38:31,662 WARN L192 SmtUtils]: Spent 231.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 85 [2019-12-27 03:38:31,775 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 83 [2019-12-27 03:38:31,833 INFO L206 etLargeBlockEncoding]: Checked pairs total: 86146 [2019-12-27 03:38:31,834 INFO L214 etLargeBlockEncoding]: Total number of compositions: 112 [2019-12-27 03:38:31,837 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 93 places, 104 transitions [2019-12-27 03:38:47,163 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 104862 states. [2019-12-27 03:38:47,165 INFO L276 IsEmpty]: Start isEmpty. Operand 104862 states. [2019-12-27 03:38:47,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-27 03:38:47,171 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:38:47,171 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-27 03:38:47,171 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:38:47,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:38:47,176 INFO L82 PathProgramCache]: Analyzing trace with hash 844471, now seen corresponding path program 1 times [2019-12-27 03:38:47,184 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:38:47,184 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [650788040] [2019-12-27 03:38:47,184 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:38:47,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:38:47,437 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 03:38:47,438 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [650788040] [2019-12-27 03:38:47,441 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:38:47,441 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 03:38:47,442 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1928867316] [2019-12-27 03:38:47,448 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 03:38:47,449 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:38:47,464 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 03:38:47,464 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 03:38:47,468 INFO L87 Difference]: Start difference. First operand 104862 states. Second operand 3 states. [2019-12-27 03:38:51,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:38:51,249 INFO L93 Difference]: Finished difference Result 104560 states and 448162 transitions. [2019-12-27 03:38:51,250 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 03:38:51,251 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-27 03:38:51,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:38:51,952 INFO L225 Difference]: With dead ends: 104560 [2019-12-27 03:38:51,952 INFO L226 Difference]: Without dead ends: 102376 [2019-12-27 03:38:51,953 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 03:38:55,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102376 states. [2019-12-27 03:38:58,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102376 to 102376. [2019-12-27 03:38:58,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102376 states. [2019-12-27 03:38:59,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102376 states to 102376 states and 439244 transitions. [2019-12-27 03:38:59,080 INFO L78 Accepts]: Start accepts. Automaton has 102376 states and 439244 transitions. Word has length 3 [2019-12-27 03:38:59,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:38:59,080 INFO L462 AbstractCegarLoop]: Abstraction has 102376 states and 439244 transitions. [2019-12-27 03:38:59,081 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 03:38:59,081 INFO L276 IsEmpty]: Start isEmpty. Operand 102376 states and 439244 transitions. [2019-12-27 03:38:59,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-27 03:38:59,085 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:38:59,085 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 03:38:59,085 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:38:59,086 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:38:59,086 INFO L82 PathProgramCache]: Analyzing trace with hash 205437058, now seen corresponding path program 1 times [2019-12-27 03:38:59,086 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:38:59,086 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [472070947] [2019-12-27 03:38:59,087 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:38:59,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:38:59,200 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 03:38:59,200 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [472070947] [2019-12-27 03:38:59,201 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:38:59,201 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 03:38:59,201 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [433807579] [2019-12-27 03:38:59,203 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 03:38:59,204 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:38:59,204 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 03:38:59,204 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 03:38:59,204 INFO L87 Difference]: Start difference. First operand 102376 states and 439244 transitions. Second operand 4 states. [2019-12-27 03:39:04,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:39:04,136 INFO L93 Difference]: Finished difference Result 164490 states and 678436 transitions. [2019-12-27 03:39:04,136 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 03:39:04,137 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-27 03:39:04,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:39:04,753 INFO L225 Difference]: With dead ends: 164490 [2019-12-27 03:39:04,754 INFO L226 Difference]: Without dead ends: 164441 [2019-12-27 03:39:04,755 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 03:39:13,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164441 states. [2019-12-27 03:39:16,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164441 to 148513. [2019-12-27 03:39:16,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148513 states. [2019-12-27 03:39:17,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148513 states to 148513 states and 619831 transitions. [2019-12-27 03:39:17,983 INFO L78 Accepts]: Start accepts. Automaton has 148513 states and 619831 transitions. Word has length 11 [2019-12-27 03:39:17,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:39:17,983 INFO L462 AbstractCegarLoop]: Abstraction has 148513 states and 619831 transitions. [2019-12-27 03:39:17,983 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 03:39:17,984 INFO L276 IsEmpty]: Start isEmpty. Operand 148513 states and 619831 transitions. [2019-12-27 03:39:17,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 03:39:17,991 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:39:17,991 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 03:39:17,991 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:39:17,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:39:17,992 INFO L82 PathProgramCache]: Analyzing trace with hash 1045519438, now seen corresponding path program 1 times [2019-12-27 03:39:17,992 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:39:17,992 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [88960713] [2019-12-27 03:39:17,993 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:39:18,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:39:18,102 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 03:39:18,103 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [88960713] [2019-12-27 03:39:18,103 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:39:18,104 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 03:39:18,104 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1589798386] [2019-12-27 03:39:18,105 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 03:39:18,105 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:39:18,105 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 03:39:18,105 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 03:39:18,106 INFO L87 Difference]: Start difference. First operand 148513 states and 619831 transitions. Second operand 4 states. [2019-12-27 03:39:26,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:39:26,033 INFO L93 Difference]: Finished difference Result 211896 states and 864765 transitions. [2019-12-27 03:39:26,033 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 03:39:26,033 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-27 03:39:26,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:39:26,677 INFO L225 Difference]: With dead ends: 211896 [2019-12-27 03:39:26,677 INFO L226 Difference]: Without dead ends: 211833 [2019-12-27 03:39:26,677 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 03:39:31,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211833 states. [2019-12-27 03:39:34,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211833 to 178183. [2019-12-27 03:39:34,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 178183 states. [2019-12-27 03:39:35,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178183 states to 178183 states and 738846 transitions. [2019-12-27 03:39:35,985 INFO L78 Accepts]: Start accepts. Automaton has 178183 states and 738846 transitions. Word has length 13 [2019-12-27 03:39:35,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:39:35,986 INFO L462 AbstractCegarLoop]: Abstraction has 178183 states and 738846 transitions. [2019-12-27 03:39:35,986 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 03:39:35,987 INFO L276 IsEmpty]: Start isEmpty. Operand 178183 states and 738846 transitions. [2019-12-27 03:39:35,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 03:39:35,990 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:39:35,990 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 03:39:35,990 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:39:35,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:39:35,990 INFO L82 PathProgramCache]: Analyzing trace with hash 31849685, now seen corresponding path program 1 times [2019-12-27 03:39:35,990 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:39:35,991 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1830423072] [2019-12-27 03:39:35,991 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:39:36,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:39:36,031 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 03:39:36,031 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1830423072] [2019-12-27 03:39:36,031 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:39:36,032 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 03:39:36,035 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1308657278] [2019-12-27 03:39:36,035 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 03:39:36,036 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:39:36,036 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 03:39:36,036 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 03:39:36,036 INFO L87 Difference]: Start difference. First operand 178183 states and 738846 transitions. Second operand 3 states. [2019-12-27 03:39:36,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:39:36,193 INFO L93 Difference]: Finished difference Result 36088 states and 117391 transitions. [2019-12-27 03:39:36,194 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 03:39:36,194 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-27 03:39:36,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:39:36,274 INFO L225 Difference]: With dead ends: 36088 [2019-12-27 03:39:36,275 INFO L226 Difference]: Without dead ends: 36088 [2019-12-27 03:39:36,275 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 03:39:36,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36088 states. [2019-12-27 03:39:36,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36088 to 36088. [2019-12-27 03:39:36,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36088 states. [2019-12-27 03:39:36,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36088 states to 36088 states and 117391 transitions. [2019-12-27 03:39:36,913 INFO L78 Accepts]: Start accepts. Automaton has 36088 states and 117391 transitions. Word has length 13 [2019-12-27 03:39:36,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:39:36,914 INFO L462 AbstractCegarLoop]: Abstraction has 36088 states and 117391 transitions. [2019-12-27 03:39:36,914 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 03:39:36,914 INFO L276 IsEmpty]: Start isEmpty. Operand 36088 states and 117391 transitions. [2019-12-27 03:39:36,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-27 03:39:36,918 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:39:36,918 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 03:39:36,918 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:39:36,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:39:36,919 INFO L82 PathProgramCache]: Analyzing trace with hash -1539749953, now seen corresponding path program 1 times [2019-12-27 03:39:36,919 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:39:36,919 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1285877720] [2019-12-27 03:39:36,919 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:39:36,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:39:38,272 WARN L192 SmtUtils]: Spent 1.28 s on a formula simplification that was a NOOP. DAG size: 3 [2019-12-27 03:39:38,273 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 03:39:38,274 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1285877720] [2019-12-27 03:39:38,274 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:39:38,274 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 03:39:38,274 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [192567607] [2019-12-27 03:39:38,275 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 03:39:38,275 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:39:38,275 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 03:39:38,275 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 03:39:38,276 INFO L87 Difference]: Start difference. First operand 36088 states and 117391 transitions. Second operand 5 states. [2019-12-27 03:39:39,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:39:39,037 INFO L93 Difference]: Finished difference Result 49088 states and 156546 transitions. [2019-12-27 03:39:39,038 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 03:39:39,038 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2019-12-27 03:39:39,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:39:39,117 INFO L225 Difference]: With dead ends: 49088 [2019-12-27 03:39:39,117 INFO L226 Difference]: Without dead ends: 49075 [2019-12-27 03:39:39,117 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-27 03:39:39,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49075 states. [2019-12-27 03:39:39,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49075 to 36431. [2019-12-27 03:39:39,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36431 states. [2019-12-27 03:39:39,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36431 states to 36431 states and 118357 transitions. [2019-12-27 03:39:39,837 INFO L78 Accepts]: Start accepts. Automaton has 36431 states and 118357 transitions. Word has length 19 [2019-12-27 03:39:39,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:39:39,837 INFO L462 AbstractCegarLoop]: Abstraction has 36431 states and 118357 transitions. [2019-12-27 03:39:39,837 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 03:39:39,837 INFO L276 IsEmpty]: Start isEmpty. Operand 36431 states and 118357 transitions. [2019-12-27 03:39:39,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 03:39:39,850 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:39:39,850 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 03:39:39,850 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:39:39,851 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:39:39,851 INFO L82 PathProgramCache]: Analyzing trace with hash 1129453691, now seen corresponding path program 1 times [2019-12-27 03:39:39,851 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:39:39,851 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1515794189] [2019-12-27 03:39:39,852 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:39:39,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:39:39,910 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 03:39:39,911 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1515794189] [2019-12-27 03:39:39,911 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:39:39,911 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 03:39:39,911 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1216221180] [2019-12-27 03:39:39,912 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 03:39:39,912 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:39:39,912 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 03:39:39,913 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 03:39:39,913 INFO L87 Difference]: Start difference. First operand 36431 states and 118357 transitions. Second operand 4 states. [2019-12-27 03:39:39,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:39:39,961 INFO L93 Difference]: Finished difference Result 7050 states and 19283 transitions. [2019-12-27 03:39:39,961 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 03:39:39,962 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2019-12-27 03:39:39,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:39:39,981 INFO L225 Difference]: With dead ends: 7050 [2019-12-27 03:39:39,982 INFO L226 Difference]: Without dead ends: 7050 [2019-12-27 03:39:39,983 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 03:39:40,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7050 states. [2019-12-27 03:39:40,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7050 to 6938. [2019-12-27 03:39:40,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6938 states. [2019-12-27 03:39:40,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6938 states to 6938 states and 18963 transitions. [2019-12-27 03:39:40,084 INFO L78 Accepts]: Start accepts. Automaton has 6938 states and 18963 transitions. Word has length 25 [2019-12-27 03:39:40,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:39:40,085 INFO L462 AbstractCegarLoop]: Abstraction has 6938 states and 18963 transitions. [2019-12-27 03:39:40,085 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 03:39:40,085 INFO L276 IsEmpty]: Start isEmpty. Operand 6938 states and 18963 transitions. [2019-12-27 03:39:40,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-12-27 03:39:40,096 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:39:40,096 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 03:39:40,096 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:39:40,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:39:40,097 INFO L82 PathProgramCache]: Analyzing trace with hash -1811341367, now seen corresponding path program 1 times [2019-12-27 03:39:40,097 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:39:40,097 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1523777582] [2019-12-27 03:39:40,097 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:39:40,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:39:40,167 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 03:39:40,167 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1523777582] [2019-12-27 03:39:40,167 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:39:40,168 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 03:39:40,168 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [94942584] [2019-12-27 03:39:40,169 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 03:39:40,169 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:39:40,169 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 03:39:40,169 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 03:39:40,169 INFO L87 Difference]: Start difference. First operand 6938 states and 18963 transitions. Second operand 5 states. [2019-12-27 03:39:40,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:39:40,207 INFO L93 Difference]: Finished difference Result 5023 states and 14421 transitions. [2019-12-27 03:39:40,207 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 03:39:40,207 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 37 [2019-12-27 03:39:40,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:39:40,215 INFO L225 Difference]: With dead ends: 5023 [2019-12-27 03:39:40,215 INFO L226 Difference]: Without dead ends: 5023 [2019-12-27 03:39:40,215 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 03:39:40,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5023 states. [2019-12-27 03:39:40,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5023 to 4659. [2019-12-27 03:39:40,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4659 states. [2019-12-27 03:39:40,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4659 states to 4659 states and 13437 transitions. [2019-12-27 03:39:40,282 INFO L78 Accepts]: Start accepts. Automaton has 4659 states and 13437 transitions. Word has length 37 [2019-12-27 03:39:40,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:39:40,283 INFO L462 AbstractCegarLoop]: Abstraction has 4659 states and 13437 transitions. [2019-12-27 03:39:40,283 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 03:39:40,283 INFO L276 IsEmpty]: Start isEmpty. Operand 4659 states and 13437 transitions. [2019-12-27 03:39:40,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 03:39:40,293 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:39:40,293 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 03:39:40,293 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:39:40,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:39:40,293 INFO L82 PathProgramCache]: Analyzing trace with hash 1876753934, now seen corresponding path program 1 times [2019-12-27 03:39:40,294 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:39:40,294 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [551677622] [2019-12-27 03:39:40,294 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:39:40,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:39:40,375 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 03:39:40,376 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [551677622] [2019-12-27 03:39:40,376 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:39:40,376 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 03:39:40,376 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [271608880] [2019-12-27 03:39:40,377 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 03:39:40,377 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:39:40,377 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 03:39:40,378 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 03:39:40,378 INFO L87 Difference]: Start difference. First operand 4659 states and 13437 transitions. Second operand 3 states. [2019-12-27 03:39:40,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:39:40,436 INFO L93 Difference]: Finished difference Result 4668 states and 13449 transitions. [2019-12-27 03:39:40,436 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 03:39:40,436 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-27 03:39:40,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:39:40,442 INFO L225 Difference]: With dead ends: 4668 [2019-12-27 03:39:40,443 INFO L226 Difference]: Without dead ends: 4668 [2019-12-27 03:39:40,443 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 03:39:40,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4668 states. [2019-12-27 03:39:40,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4668 to 4664. [2019-12-27 03:39:40,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4664 states. [2019-12-27 03:39:40,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4664 states to 4664 states and 13445 transitions. [2019-12-27 03:39:40,633 INFO L78 Accepts]: Start accepts. Automaton has 4664 states and 13445 transitions. Word has length 65 [2019-12-27 03:39:40,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:39:40,634 INFO L462 AbstractCegarLoop]: Abstraction has 4664 states and 13445 transitions. [2019-12-27 03:39:40,634 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 03:39:40,634 INFO L276 IsEmpty]: Start isEmpty. Operand 4664 states and 13445 transitions. [2019-12-27 03:39:40,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 03:39:40,640 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:39:40,640 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 03:39:40,641 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:39:40,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:39:40,641 INFO L82 PathProgramCache]: Analyzing trace with hash 1173172274, now seen corresponding path program 1 times [2019-12-27 03:39:40,641 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:39:40,641 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [205611640] [2019-12-27 03:39:40,641 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:39:40,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:39:40,768 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 03:39:40,769 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [205611640] [2019-12-27 03:39:40,769 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:39:40,769 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 03:39:40,770 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [436584865] [2019-12-27 03:39:40,770 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 03:39:40,770 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:39:40,770 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 03:39:40,771 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 03:39:40,771 INFO L87 Difference]: Start difference. First operand 4664 states and 13445 transitions. Second operand 3 states. [2019-12-27 03:39:40,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:39:40,830 INFO L93 Difference]: Finished difference Result 4668 states and 13441 transitions. [2019-12-27 03:39:40,831 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 03:39:40,831 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-27 03:39:40,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:39:40,840 INFO L225 Difference]: With dead ends: 4668 [2019-12-27 03:39:40,840 INFO L226 Difference]: Without dead ends: 4668 [2019-12-27 03:39:40,841 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 03:39:40,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4668 states. [2019-12-27 03:39:40,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4668 to 4664. [2019-12-27 03:39:40,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4664 states. [2019-12-27 03:39:40,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4664 states to 4664 states and 13437 transitions. [2019-12-27 03:39:40,936 INFO L78 Accepts]: Start accepts. Automaton has 4664 states and 13437 transitions. Word has length 65 [2019-12-27 03:39:40,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:39:40,936 INFO L462 AbstractCegarLoop]: Abstraction has 4664 states and 13437 transitions. [2019-12-27 03:39:40,937 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 03:39:40,937 INFO L276 IsEmpty]: Start isEmpty. Operand 4664 states and 13437 transitions. [2019-12-27 03:39:40,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 03:39:40,946 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:39:40,947 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 03:39:40,948 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:39:40,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:39:40,948 INFO L82 PathProgramCache]: Analyzing trace with hash 1163492121, now seen corresponding path program 1 times [2019-12-27 03:39:40,948 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:39:40,949 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [587653809] [2019-12-27 03:39:40,949 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:39:41,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:39:41,077 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 03:39:41,078 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [587653809] [2019-12-27 03:39:41,078 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:39:41,078 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 03:39:41,079 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2068002975] [2019-12-27 03:39:41,079 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 03:39:41,079 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:39:41,080 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 03:39:41,080 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 03:39:41,080 INFO L87 Difference]: Start difference. First operand 4664 states and 13437 transitions. Second operand 5 states. [2019-12-27 03:39:41,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:39:41,437 INFO L93 Difference]: Finished difference Result 7088 states and 20226 transitions. [2019-12-27 03:39:41,437 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 03:39:41,437 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 65 [2019-12-27 03:39:41,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:39:41,447 INFO L225 Difference]: With dead ends: 7088 [2019-12-27 03:39:41,447 INFO L226 Difference]: Without dead ends: 7088 [2019-12-27 03:39:41,448 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-27 03:39:41,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7088 states. [2019-12-27 03:39:41,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7088 to 5979. [2019-12-27 03:39:41,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5979 states. [2019-12-27 03:39:41,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5979 states to 5979 states and 17231 transitions. [2019-12-27 03:39:41,575 INFO L78 Accepts]: Start accepts. Automaton has 5979 states and 17231 transitions. Word has length 65 [2019-12-27 03:39:41,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:39:41,575 INFO L462 AbstractCegarLoop]: Abstraction has 5979 states and 17231 transitions. [2019-12-27 03:39:41,575 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 03:39:41,575 INFO L276 IsEmpty]: Start isEmpty. Operand 5979 states and 17231 transitions. [2019-12-27 03:39:41,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 03:39:41,583 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:39:41,583 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 03:39:41,583 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:39:41,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:39:41,583 INFO L82 PathProgramCache]: Analyzing trace with hash -2061317327, now seen corresponding path program 2 times [2019-12-27 03:39:41,584 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:39:41,584 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1676597933] [2019-12-27 03:39:41,584 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:39:41,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:39:41,678 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 03:39:41,678 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1676597933] [2019-12-27 03:39:41,678 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:39:41,679 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 03:39:41,679 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1193223408] [2019-12-27 03:39:41,679 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 03:39:41,680 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:39:41,680 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 03:39:41,680 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 03:39:41,681 INFO L87 Difference]: Start difference. First operand 5979 states and 17231 transitions. Second operand 5 states. [2019-12-27 03:39:42,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:39:42,017 INFO L93 Difference]: Finished difference Result 9067 states and 25836 transitions. [2019-12-27 03:39:42,017 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 03:39:42,017 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 65 [2019-12-27 03:39:42,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:39:42,030 INFO L225 Difference]: With dead ends: 9067 [2019-12-27 03:39:42,031 INFO L226 Difference]: Without dead ends: 9067 [2019-12-27 03:39:42,031 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-27 03:39:42,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9067 states. [2019-12-27 03:39:42,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9067 to 6731. [2019-12-27 03:39:42,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6731 states. [2019-12-27 03:39:42,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6731 states to 6731 states and 19498 transitions. [2019-12-27 03:39:42,196 INFO L78 Accepts]: Start accepts. Automaton has 6731 states and 19498 transitions. Word has length 65 [2019-12-27 03:39:42,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:39:42,197 INFO L462 AbstractCegarLoop]: Abstraction has 6731 states and 19498 transitions. [2019-12-27 03:39:42,197 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 03:39:42,197 INFO L276 IsEmpty]: Start isEmpty. Operand 6731 states and 19498 transitions. [2019-12-27 03:39:42,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 03:39:42,209 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:39:42,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] [2019-12-27 03:39:42,210 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:39:42,210 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:39:42,210 INFO L82 PathProgramCache]: Analyzing trace with hash -1650424373, now seen corresponding path program 3 times [2019-12-27 03:39:42,211 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:39:42,211 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1734013118] [2019-12-27 03:39:42,211 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:39:42,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:39:42,304 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 03:39:42,304 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1734013118] [2019-12-27 03:39:42,305 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:39:42,305 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 03:39:42,305 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1967420628] [2019-12-27 03:39:42,305 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 03:39:42,306 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:39:42,306 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 03:39:42,306 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 03:39:42,306 INFO L87 Difference]: Start difference. First operand 6731 states and 19498 transitions. Second operand 6 states. [2019-12-27 03:39:42,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:39:42,814 INFO L93 Difference]: Finished difference Result 10883 states and 31287 transitions. [2019-12-27 03:39:42,814 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 03:39:42,814 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 65 [2019-12-27 03:39:42,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:39:42,827 INFO L225 Difference]: With dead ends: 10883 [2019-12-27 03:39:42,828 INFO L226 Difference]: Without dead ends: 10883 [2019-12-27 03:39:42,828 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-12-27 03:39:42,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10883 states. [2019-12-27 03:39:42,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10883 to 7254. [2019-12-27 03:39:42,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7254 states. [2019-12-27 03:39:42,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7254 states to 7254 states and 21077 transitions. [2019-12-27 03:39:42,949 INFO L78 Accepts]: Start accepts. Automaton has 7254 states and 21077 transitions. Word has length 65 [2019-12-27 03:39:42,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:39:42,949 INFO L462 AbstractCegarLoop]: Abstraction has 7254 states and 21077 transitions. [2019-12-27 03:39:42,949 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 03:39:42,949 INFO L276 IsEmpty]: Start isEmpty. Operand 7254 states and 21077 transitions. [2019-12-27 03:39:42,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 03:39:42,959 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:39:42,959 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 03:39:42,959 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:39:42,959 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:39:42,959 INFO L82 PathProgramCache]: Analyzing trace with hash 2063456247, now seen corresponding path program 4 times [2019-12-27 03:39:42,959 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:39:42,960 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [126159834] [2019-12-27 03:39:42,960 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:39:42,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:39:43,098 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 03:39:43,099 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [126159834] [2019-12-27 03:39:43,099 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:39:43,099 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 03:39:43,100 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [760111516] [2019-12-27 03:39:43,100 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 03:39:43,100 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:39:43,100 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 03:39:43,101 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-27 03:39:43,101 INFO L87 Difference]: Start difference. First operand 7254 states and 21077 transitions. Second operand 7 states. [2019-12-27 03:39:44,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:39:44,035 INFO L93 Difference]: Finished difference Result 11106 states and 31910 transitions. [2019-12-27 03:39:44,036 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-27 03:39:44,036 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 65 [2019-12-27 03:39:44,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:39:44,050 INFO L225 Difference]: With dead ends: 11106 [2019-12-27 03:39:44,050 INFO L226 Difference]: Without dead ends: 11106 [2019-12-27 03:39:44,050 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 11 SyntacticMatches, 3 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=200, Unknown=0, NotChecked=0, Total=272 [2019-12-27 03:39:44,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11106 states. [2019-12-27 03:39:44,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11106 to 6997. [2019-12-27 03:39:44,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6997 states. [2019-12-27 03:39:44,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6997 states to 6997 states and 20313 transitions. [2019-12-27 03:39:44,173 INFO L78 Accepts]: Start accepts. Automaton has 6997 states and 20313 transitions. Word has length 65 [2019-12-27 03:39:44,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:39:44,173 INFO L462 AbstractCegarLoop]: Abstraction has 6997 states and 20313 transitions. [2019-12-27 03:39:44,173 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 03:39:44,173 INFO L276 IsEmpty]: Start isEmpty. Operand 6997 states and 20313 transitions. [2019-12-27 03:39:44,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 03:39:44,182 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:39:44,183 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 03:39:44,183 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:39:44,183 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:39:44,183 INFO L82 PathProgramCache]: Analyzing trace with hash 695487673, now seen corresponding path program 5 times [2019-12-27 03:39:44,183 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:39:44,183 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1956894150] [2019-12-27 03:39:44,183 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:39:44,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:39:44,327 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 03:39:44,329 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1956894150] [2019-12-27 03:39:44,329 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:39:44,329 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 03:39:44,330 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1240453157] [2019-12-27 03:39:44,330 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 03:39:44,330 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:39:44,330 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 03:39:44,330 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-27 03:39:44,331 INFO L87 Difference]: Start difference. First operand 6997 states and 20313 transitions. Second operand 7 states. [2019-12-27 03:39:44,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:39:44,526 INFO L93 Difference]: Finished difference Result 14297 states and 41924 transitions. [2019-12-27 03:39:44,526 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 03:39:44,526 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 65 [2019-12-27 03:39:44,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:39:44,540 INFO L225 Difference]: With dead ends: 14297 [2019-12-27 03:39:44,541 INFO L226 Difference]: Without dead ends: 8841 [2019-12-27 03:39:44,541 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2019-12-27 03:39:44,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8841 states. [2019-12-27 03:39:44,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8841 to 6579. [2019-12-27 03:39:44,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6579 states. [2019-12-27 03:39:44,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6579 states to 6579 states and 19079 transitions. [2019-12-27 03:39:44,649 INFO L78 Accepts]: Start accepts. Automaton has 6579 states and 19079 transitions. Word has length 65 [2019-12-27 03:39:44,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:39:44,649 INFO L462 AbstractCegarLoop]: Abstraction has 6579 states and 19079 transitions. [2019-12-27 03:39:44,649 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 03:39:44,649 INFO L276 IsEmpty]: Start isEmpty. Operand 6579 states and 19079 transitions. [2019-12-27 03:39:44,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 03:39:44,658 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:39:44,658 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 03:39:44,658 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:39:44,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:39:44,659 INFO L82 PathProgramCache]: Analyzing trace with hash 1304907827, now seen corresponding path program 6 times [2019-12-27 03:39:44,659 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:39:44,659 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1153004766] [2019-12-27 03:39:44,659 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:39:44,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:39:44,757 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 03:39:44,757 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1153004766] [2019-12-27 03:39:44,757 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:39:44,757 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 03:39:44,758 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [700344571] [2019-12-27 03:39:44,758 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 03:39:44,758 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:39:44,758 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 03:39:44,759 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-27 03:39:44,759 INFO L87 Difference]: Start difference. First operand 6579 states and 19079 transitions. Second operand 6 states. [2019-12-27 03:39:45,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:39:45,299 INFO L93 Difference]: Finished difference Result 9537 states and 27106 transitions. [2019-12-27 03:39:45,299 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-27 03:39:45,300 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 65 [2019-12-27 03:39:45,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:39:45,312 INFO L225 Difference]: With dead ends: 9537 [2019-12-27 03:39:45,312 INFO L226 Difference]: Without dead ends: 9537 [2019-12-27 03:39:45,313 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2019-12-27 03:39:45,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9537 states. [2019-12-27 03:39:45,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9537 to 6860. [2019-12-27 03:39:45,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6860 states. [2019-12-27 03:39:45,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6860 states to 6860 states and 19878 transitions. [2019-12-27 03:39:45,422 INFO L78 Accepts]: Start accepts. Automaton has 6860 states and 19878 transitions. Word has length 65 [2019-12-27 03:39:45,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:39:45,423 INFO L462 AbstractCegarLoop]: Abstraction has 6860 states and 19878 transitions. [2019-12-27 03:39:45,423 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 03:39:45,423 INFO L276 IsEmpty]: Start isEmpty. Operand 6860 states and 19878 transitions. [2019-12-27 03:39:45,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 03:39:45,431 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:39:45,432 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 03:39:45,432 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:39:45,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:39:45,432 INFO L82 PathProgramCache]: Analyzing trace with hash -338304105, now seen corresponding path program 7 times [2019-12-27 03:39:45,432 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:39:45,432 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [46569817] [2019-12-27 03:39:45,432 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:39:45,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:39:45,549 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 03:39:45,550 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [46569817] [2019-12-27 03:39:45,550 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:39:45,550 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 03:39:45,550 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1163103964] [2019-12-27 03:39:45,551 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 03:39:45,551 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:39:45,551 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 03:39:45,551 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-27 03:39:45,551 INFO L87 Difference]: Start difference. First operand 6860 states and 19878 transitions. Second operand 7 states. [2019-12-27 03:39:46,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:39:46,709 INFO L93 Difference]: Finished difference Result 10605 states and 30155 transitions. [2019-12-27 03:39:46,710 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-12-27 03:39:46,710 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 65 [2019-12-27 03:39:46,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:39:46,728 INFO L225 Difference]: With dead ends: 10605 [2019-12-27 03:39:46,728 INFO L226 Difference]: Without dead ends: 10605 [2019-12-27 03:39:46,729 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 8 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=110, Invalid=396, Unknown=0, NotChecked=0, Total=506 [2019-12-27 03:39:46,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10605 states. [2019-12-27 03:39:46,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10605 to 7315. [2019-12-27 03:39:46,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7315 states. [2019-12-27 03:39:46,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7315 states to 7315 states and 21208 transitions. [2019-12-27 03:39:46,923 INFO L78 Accepts]: Start accepts. Automaton has 7315 states and 21208 transitions. Word has length 65 [2019-12-27 03:39:46,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:39:46,923 INFO L462 AbstractCegarLoop]: Abstraction has 7315 states and 21208 transitions. [2019-12-27 03:39:46,923 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 03:39:46,924 INFO L276 IsEmpty]: Start isEmpty. Operand 7315 states and 21208 transitions. [2019-12-27 03:39:46,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 03:39:46,935 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:39:46,935 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 03:39:46,936 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:39:46,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:39:46,936 INFO L82 PathProgramCache]: Analyzing trace with hash 882387211, now seen corresponding path program 8 times [2019-12-27 03:39:46,936 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:39:46,937 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [626872024] [2019-12-27 03:39:46,937 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:39:46,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:39:47,105 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 03:39:47,105 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [626872024] [2019-12-27 03:39:47,105 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:39:47,106 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 03:39:47,106 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [714063913] [2019-12-27 03:39:47,108 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 03:39:47,108 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:39:47,108 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 03:39:47,108 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-12-27 03:39:47,109 INFO L87 Difference]: Start difference. First operand 7315 states and 21208 transitions. Second operand 8 states. [2019-12-27 03:39:48,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:39:48,107 INFO L93 Difference]: Finished difference Result 11968 states and 34206 transitions. [2019-12-27 03:39:48,107 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-27 03:39:48,108 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 65 [2019-12-27 03:39:48,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:39:48,123 INFO L225 Difference]: With dead ends: 11968 [2019-12-27 03:39:48,124 INFO L226 Difference]: Without dead ends: 11968 [2019-12-27 03:39:48,124 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=228, Unknown=0, NotChecked=0, Total=306 [2019-12-27 03:39:48,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11968 states. [2019-12-27 03:39:48,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11968 to 6995. [2019-12-27 03:39:48,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6995 states. [2019-12-27 03:39:48,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6995 states to 6995 states and 20314 transitions. [2019-12-27 03:39:48,249 INFO L78 Accepts]: Start accepts. Automaton has 6995 states and 20314 transitions. Word has length 65 [2019-12-27 03:39:48,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:39:48,250 INFO L462 AbstractCegarLoop]: Abstraction has 6995 states and 20314 transitions. [2019-12-27 03:39:48,250 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 03:39:48,250 INFO L276 IsEmpty]: Start isEmpty. Operand 6995 states and 20314 transitions. [2019-12-27 03:39:48,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 03:39:48,257 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:39:48,257 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 03:39:48,257 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:39:48,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:39:48,257 INFO L82 PathProgramCache]: Analyzing trace with hash -466619985, now seen corresponding path program 9 times [2019-12-27 03:39:48,257 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:39:48,258 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [535052824] [2019-12-27 03:39:48,258 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:39:48,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:39:48,392 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 03:39:48,392 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [535052824] [2019-12-27 03:39:48,393 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:39:48,393 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 03:39:48,393 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [827929632] [2019-12-27 03:39:48,393 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 03:39:48,394 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:39:48,394 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 03:39:48,394 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-27 03:39:48,394 INFO L87 Difference]: Start difference. First operand 6995 states and 20314 transitions. Second operand 9 states. [2019-12-27 03:39:49,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:39:49,677 INFO L93 Difference]: Finished difference Result 11870 states and 33943 transitions. [2019-12-27 03:39:49,677 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-27 03:39:49,678 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 65 [2019-12-27 03:39:49,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:39:49,696 INFO L225 Difference]: With dead ends: 11870 [2019-12-27 03:39:49,696 INFO L226 Difference]: Without dead ends: 11870 [2019-12-27 03:39:49,697 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 12 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=101, Invalid=361, Unknown=0, NotChecked=0, Total=462 [2019-12-27 03:39:49,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11870 states. [2019-12-27 03:39:49,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11870 to 6757. [2019-12-27 03:39:49,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6757 states. [2019-12-27 03:39:49,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6757 states to 6757 states and 19602 transitions. [2019-12-27 03:39:49,829 INFO L78 Accepts]: Start accepts. Automaton has 6757 states and 19602 transitions. Word has length 65 [2019-12-27 03:39:49,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:39:49,829 INFO L462 AbstractCegarLoop]: Abstraction has 6757 states and 19602 transitions. [2019-12-27 03:39:49,829 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 03:39:49,829 INFO L276 IsEmpty]: Start isEmpty. Operand 6757 states and 19602 transitions. [2019-12-27 03:39:49,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 03:39:49,836 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:39:49,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] [2019-12-27 03:39:49,837 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:39:49,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:39:49,837 INFO L82 PathProgramCache]: Analyzing trace with hash 794564457, now seen corresponding path program 10 times [2019-12-27 03:39:49,837 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:39:49,837 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1439805118] [2019-12-27 03:39:49,838 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:39:49,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:39:49,954 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 03:39:49,955 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1439805118] [2019-12-27 03:39:49,955 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:39:49,955 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 03:39:49,956 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1373013699] [2019-12-27 03:39:49,956 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 03:39:49,956 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:39:49,956 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 03:39:49,957 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-27 03:39:49,957 INFO L87 Difference]: Start difference. First operand 6757 states and 19602 transitions. Second operand 7 states. [2019-12-27 03:39:50,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:39:50,573 INFO L93 Difference]: Finished difference Result 11247 states and 32123 transitions. [2019-12-27 03:39:50,573 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-27 03:39:50,574 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 65 [2019-12-27 03:39:50,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:39:50,588 INFO L225 Difference]: With dead ends: 11247 [2019-12-27 03:39:50,588 INFO L226 Difference]: Without dead ends: 11247 [2019-12-27 03:39:50,589 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2019-12-27 03:39:50,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11247 states. [2019-12-27 03:39:50,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11247 to 6841. [2019-12-27 03:39:50,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6841 states. [2019-12-27 03:39:50,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6841 states to 6841 states and 19803 transitions. [2019-12-27 03:39:50,712 INFO L78 Accepts]: Start accepts. Automaton has 6841 states and 19803 transitions. Word has length 65 [2019-12-27 03:39:50,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:39:50,712 INFO L462 AbstractCegarLoop]: Abstraction has 6841 states and 19803 transitions. [2019-12-27 03:39:50,712 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 03:39:50,712 INFO L276 IsEmpty]: Start isEmpty. Operand 6841 states and 19803 transitions. [2019-12-27 03:39:50,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 03:39:50,719 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:39:50,719 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 03:39:50,720 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:39:50,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:39:50,720 INFO L82 PathProgramCache]: Analyzing trace with hash 1278916147, now seen corresponding path program 11 times [2019-12-27 03:39:50,720 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:39:50,720 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1243178145] [2019-12-27 03:39:50,721 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:39:50,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:39:50,858 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 03:39:50,859 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1243178145] [2019-12-27 03:39:50,859 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:39:50,859 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 03:39:50,859 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [311062059] [2019-12-27 03:39:50,860 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 03:39:50,860 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:39:50,860 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 03:39:50,860 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-12-27 03:39:50,860 INFO L87 Difference]: Start difference. First operand 6841 states and 19803 transitions. Second operand 9 states. [2019-12-27 03:39:52,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:39:52,154 INFO L93 Difference]: Finished difference Result 11902 states and 33986 transitions. [2019-12-27 03:39:52,154 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-27 03:39:52,155 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 65 [2019-12-27 03:39:52,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:39:52,169 INFO L225 Difference]: With dead ends: 11902 [2019-12-27 03:39:52,169 INFO L226 Difference]: Without dead ends: 11902 [2019-12-27 03:39:52,169 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 11 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=92, Invalid=328, Unknown=0, NotChecked=0, Total=420 [2019-12-27 03:39:52,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11902 states. [2019-12-27 03:39:52,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11902 to 6141. [2019-12-27 03:39:52,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6141 states. [2019-12-27 03:39:52,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6141 states to 6141 states and 17820 transitions. [2019-12-27 03:39:52,282 INFO L78 Accepts]: Start accepts. Automaton has 6141 states and 17820 transitions. Word has length 65 [2019-12-27 03:39:52,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:39:52,283 INFO L462 AbstractCegarLoop]: Abstraction has 6141 states and 17820 transitions. [2019-12-27 03:39:52,283 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 03:39:52,283 INFO L276 IsEmpty]: Start isEmpty. Operand 6141 states and 17820 transitions. [2019-12-27 03:39:52,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 03:39:52,289 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:39:52,289 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 03:39:52,289 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:39:52,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:39:52,289 INFO L82 PathProgramCache]: Analyzing trace with hash 662541241, now seen corresponding path program 1 times [2019-12-27 03:39:52,289 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:39:52,290 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [421147572] [2019-12-27 03:39:52,290 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:39:52,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:39:52,350 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 03:39:52,350 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [421147572] [2019-12-27 03:39:52,350 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:39:52,351 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 03:39:52,351 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [136403535] [2019-12-27 03:39:52,351 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 03:39:52,351 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:39:52,352 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 03:39:52,352 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 03:39:52,352 INFO L87 Difference]: Start difference. First operand 6141 states and 17820 transitions. Second operand 3 states. [2019-12-27 03:39:52,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:39:52,382 INFO L93 Difference]: Finished difference Result 5777 states and 16412 transitions. [2019-12-27 03:39:52,382 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 03:39:52,382 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-12-27 03:39:52,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:39:52,390 INFO L225 Difference]: With dead ends: 5777 [2019-12-27 03:39:52,391 INFO L226 Difference]: Without dead ends: 5777 [2019-12-27 03:39:52,391 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 03:39:52,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5777 states. [2019-12-27 03:39:52,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5777 to 5777. [2019-12-27 03:39:52,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5777 states. [2019-12-27 03:39:52,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5777 states to 5777 states and 16412 transitions. [2019-12-27 03:39:52,499 INFO L78 Accepts]: Start accepts. Automaton has 5777 states and 16412 transitions. Word has length 66 [2019-12-27 03:39:52,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:39:52,499 INFO L462 AbstractCegarLoop]: Abstraction has 5777 states and 16412 transitions. [2019-12-27 03:39:52,499 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 03:39:52,499 INFO L276 IsEmpty]: Start isEmpty. Operand 5777 states and 16412 transitions. [2019-12-27 03:39:52,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 03:39:52,507 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:39:52,508 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 03:39:52,508 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:39:52,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:39:52,508 INFO L82 PathProgramCache]: Analyzing trace with hash -1278364733, now seen corresponding path program 1 times [2019-12-27 03:39:52,508 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:39:52,509 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [293870773] [2019-12-27 03:39:52,509 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:39:52,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:39:52,572 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 03:39:52,573 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [293870773] [2019-12-27 03:39:52,573 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:39:52,573 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 03:39:52,574 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2082710591] [2019-12-27 03:39:52,574 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 03:39:52,576 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:39:52,577 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 03:39:52,577 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 03:39:52,577 INFO L87 Difference]: Start difference. First operand 5777 states and 16412 transitions. Second operand 3 states. [2019-12-27 03:39:52,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:39:52,635 INFO L93 Difference]: Finished difference Result 5777 states and 16411 transitions. [2019-12-27 03:39:52,635 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 03:39:52,636 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-12-27 03:39:52,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:39:52,644 INFO L225 Difference]: With dead ends: 5777 [2019-12-27 03:39:52,644 INFO L226 Difference]: Without dead ends: 5777 [2019-12-27 03:39:52,644 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 03:39:52,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5777 states. [2019-12-27 03:39:52,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5777 to 3708. [2019-12-27 03:39:52,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3708 states. [2019-12-27 03:39:52,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3708 states to 3708 states and 10669 transitions. [2019-12-27 03:39:52,798 INFO L78 Accepts]: Start accepts. Automaton has 3708 states and 10669 transitions. Word has length 66 [2019-12-27 03:39:52,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:39:52,798 INFO L462 AbstractCegarLoop]: Abstraction has 3708 states and 10669 transitions. [2019-12-27 03:39:52,799 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 03:39:52,799 INFO L276 IsEmpty]: Start isEmpty. Operand 3708 states and 10669 transitions. [2019-12-27 03:39:52,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 03:39:52,804 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:39:52,804 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 03:39:52,804 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:39:52,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:39:52,805 INFO L82 PathProgramCache]: Analyzing trace with hash 897051641, now seen corresponding path program 1 times [2019-12-27 03:39:52,805 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:39:52,808 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2001743681] [2019-12-27 03:39:52,809 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:39:52,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:39:52,901 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 03:39:52,901 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2001743681] [2019-12-27 03:39:52,901 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:39:52,901 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 03:39:52,902 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [789385987] [2019-12-27 03:39:52,902 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 03:39:52,902 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:39:52,902 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 03:39:52,902 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 03:39:52,904 INFO L87 Difference]: Start difference. First operand 3708 states and 10669 transitions. Second operand 3 states. [2019-12-27 03:39:52,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:39:52,936 INFO L93 Difference]: Finished difference Result 3508 states and 9871 transitions. [2019-12-27 03:39:52,937 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 03:39:52,937 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 67 [2019-12-27 03:39:52,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:39:52,943 INFO L225 Difference]: With dead ends: 3508 [2019-12-27 03:39:52,943 INFO L226 Difference]: Without dead ends: 3508 [2019-12-27 03:39:52,944 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 03:39:52,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3508 states. [2019-12-27 03:39:53,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3508 to 2815. [2019-12-27 03:39:53,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2815 states. [2019-12-27 03:39:53,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2815 states to 2815 states and 7936 transitions. [2019-12-27 03:39:53,026 INFO L78 Accepts]: Start accepts. Automaton has 2815 states and 7936 transitions. Word has length 67 [2019-12-27 03:39:53,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:39:53,027 INFO L462 AbstractCegarLoop]: Abstraction has 2815 states and 7936 transitions. [2019-12-27 03:39:53,027 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 03:39:53,027 INFO L276 IsEmpty]: Start isEmpty. Operand 2815 states and 7936 transitions. [2019-12-27 03:39:53,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-27 03:39:53,033 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:39:53,033 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, 1] [2019-12-27 03:39:53,033 INFO L410 AbstractCegarLoop]: === Iteration 24 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:39:53,033 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:39:53,034 INFO L82 PathProgramCache]: Analyzing trace with hash -829052917, now seen corresponding path program 1 times [2019-12-27 03:39:53,034 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:39:53,034 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2078725900] [2019-12-27 03:39:53,034 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:39:53,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:39:53,414 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 03:39:53,415 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2078725900] [2019-12-27 03:39:53,415 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:39:53,415 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-27 03:39:53,415 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [951871791] [2019-12-27 03:39:53,417 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-27 03:39:53,417 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:39:53,418 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-27 03:39:53,418 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=176, Unknown=0, NotChecked=0, Total=210 [2019-12-27 03:39:53,418 INFO L87 Difference]: Start difference. First operand 2815 states and 7936 transitions. Second operand 15 states. [2019-12-27 03:39:54,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:39:54,903 INFO L93 Difference]: Finished difference Result 5658 states and 15774 transitions. [2019-12-27 03:39:54,903 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-12-27 03:39:54,903 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 68 [2019-12-27 03:39:54,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:39:54,910 INFO L225 Difference]: With dead ends: 5658 [2019-12-27 03:39:54,911 INFO L226 Difference]: Without dead ends: 5628 [2019-12-27 03:39:54,911 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 374 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=358, Invalid=1364, Unknown=0, NotChecked=0, Total=1722 [2019-12-27 03:39:54,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5628 states. [2019-12-27 03:39:54,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5628 to 4139. [2019-12-27 03:39:54,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4139 states. [2019-12-27 03:39:54,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4139 states to 4139 states and 11571 transitions. [2019-12-27 03:39:54,973 INFO L78 Accepts]: Start accepts. Automaton has 4139 states and 11571 transitions. Word has length 68 [2019-12-27 03:39:54,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:39:54,973 INFO L462 AbstractCegarLoop]: Abstraction has 4139 states and 11571 transitions. [2019-12-27 03:39:54,974 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-27 03:39:54,974 INFO L276 IsEmpty]: Start isEmpty. Operand 4139 states and 11571 transitions. [2019-12-27 03:39:54,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-27 03:39:54,977 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:39:54,977 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, 1] [2019-12-27 03:39:54,977 INFO L410 AbstractCegarLoop]: === Iteration 25 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:39:54,978 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:39:54,978 INFO L82 PathProgramCache]: Analyzing trace with hash 226058755, now seen corresponding path program 2 times [2019-12-27 03:39:54,978 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:39:54,978 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [840556252] [2019-12-27 03:39:54,978 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:39:54,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:39:55,179 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 03:39:55,180 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [840556252] [2019-12-27 03:39:55,180 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:39:55,180 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-27 03:39:55,180 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1072138410] [2019-12-27 03:39:55,181 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-27 03:39:55,181 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:39:55,182 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-27 03:39:55,182 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2019-12-27 03:39:55,182 INFO L87 Difference]: Start difference. First operand 4139 states and 11571 transitions. Second operand 12 states. [2019-12-27 03:39:55,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:39:55,582 INFO L93 Difference]: Finished difference Result 6472 states and 17992 transitions. [2019-12-27 03:39:55,582 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-27 03:39:55,582 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 68 [2019-12-27 03:39:55,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:39:55,592 INFO L225 Difference]: With dead ends: 6472 [2019-12-27 03:39:55,593 INFO L226 Difference]: Without dead ends: 6442 [2019-12-27 03:39:55,593 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=93, Invalid=369, Unknown=0, NotChecked=0, Total=462 [2019-12-27 03:39:55,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6442 states. [2019-12-27 03:39:55,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6442 to 4466. [2019-12-27 03:39:55,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4466 states. [2019-12-27 03:39:55,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4466 states to 4466 states and 12510 transitions. [2019-12-27 03:39:55,696 INFO L78 Accepts]: Start accepts. Automaton has 4466 states and 12510 transitions. Word has length 68 [2019-12-27 03:39:55,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:39:55,696 INFO L462 AbstractCegarLoop]: Abstraction has 4466 states and 12510 transitions. [2019-12-27 03:39:55,696 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-27 03:39:55,696 INFO L276 IsEmpty]: Start isEmpty. Operand 4466 states and 12510 transitions. [2019-12-27 03:39:55,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-27 03:39:55,702 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:39:55,702 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, 1] [2019-12-27 03:39:55,703 INFO L410 AbstractCegarLoop]: === Iteration 26 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:39:55,703 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:39:55,703 INFO L82 PathProgramCache]: Analyzing trace with hash 1101405001, now seen corresponding path program 3 times [2019-12-27 03:39:55,703 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:39:55,703 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [189602457] [2019-12-27 03:39:55,703 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:39:55,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:39:55,933 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 03:39:55,934 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [189602457] [2019-12-27 03:39:55,934 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:39:55,934 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-12-27 03:39:55,934 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1989862406] [2019-12-27 03:39:55,934 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-27 03:39:55,935 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:39:55,935 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-27 03:39:55,935 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2019-12-27 03:39:55,935 INFO L87 Difference]: Start difference. First operand 4466 states and 12510 transitions. Second operand 14 states. [2019-12-27 03:39:56,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:39:56,745 INFO L93 Difference]: Finished difference Result 5491 states and 15200 transitions. [2019-12-27 03:39:56,745 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-12-27 03:39:56,745 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 68 [2019-12-27 03:39:56,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:39:56,754 INFO L225 Difference]: With dead ends: 5491 [2019-12-27 03:39:56,754 INFO L226 Difference]: Without dead ends: 5461 [2019-12-27 03:39:56,754 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 164 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=195, Invalid=735, Unknown=0, NotChecked=0, Total=930 [2019-12-27 03:39:56,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5461 states. [2019-12-27 03:39:56,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5461 to 4067. [2019-12-27 03:39:56,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4067 states. [2019-12-27 03:39:56,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4067 states to 4067 states and 11322 transitions. [2019-12-27 03:39:56,849 INFO L78 Accepts]: Start accepts. Automaton has 4067 states and 11322 transitions. Word has length 68 [2019-12-27 03:39:56,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:39:56,849 INFO L462 AbstractCegarLoop]: Abstraction has 4067 states and 11322 transitions. [2019-12-27 03:39:56,849 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-27 03:39:56,849 INFO L276 IsEmpty]: Start isEmpty. Operand 4067 states and 11322 transitions. [2019-12-27 03:39:56,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-27 03:39:56,855 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:39:56,855 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, 1] [2019-12-27 03:39:56,855 INFO L410 AbstractCegarLoop]: === Iteration 27 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:39:56,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:39:56,856 INFO L82 PathProgramCache]: Analyzing trace with hash 1851838847, now seen corresponding path program 4 times [2019-12-27 03:39:56,856 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:39:56,856 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [178346034] [2019-12-27 03:39:56,856 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:39:56,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 03:39:56,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 03:39:56,990 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 03:39:56,990 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 03:39:56,994 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [825] [825] ULTIMATE.startENTRY-->L805: Formula: (let ((.cse0 (store |v_#valid_55| 0 0))) (and (< |v_#StackHeapBarrier_18| |v_ULTIMATE.start_main_~#t2040~0.base_21|) (= v_~__unbuffered_cnt~0_140 0) (= 0 v_~z$flush_delayed~0_34) (= |v_#length_25| (store |v_#length_26| |v_ULTIMATE.start_main_~#t2040~0.base_21| 4)) (= v_~z$r_buff1_thd0~0_308 0) (= v_~z$w_buff1_used~0_516 0) (= v_~z$r_buff1_thd1~0_190 0) (= v_~z$read_delayed~0_8 0) (= v_~z$w_buff0~0_342 0) (= v_~main$tmp_guard1~0_21 0) (= v_~z$read_delayed_var~0.offset_7 0) (< 0 |v_#StackHeapBarrier_18|) (= v_~z$r_buff1_thd2~0_206 0) (= v_~y~0_34 0) (= 0 |v_#NULL.base_4|) (= 0 v_~z$r_buff0_thd3~0_140) (= v_~z$read_delayed_var~0.base_7 0) (= v_~z$r_buff0_thd1~0_226 0) (= |v_ULTIMATE.start_main_~#t2040~0.offset_17| 0) (= v_~main$tmp_guard0~0_21 0) (= (store |v_#memory_int_22| |v_ULTIMATE.start_main_~#t2040~0.base_21| (store (select |v_#memory_int_22| |v_ULTIMATE.start_main_~#t2040~0.base_21|) |v_ULTIMATE.start_main_~#t2040~0.offset_17| 0)) |v_#memory_int_21|) (= v_~weak$$choice2~0_109 0) (= |v_#valid_53| (store .cse0 |v_ULTIMATE.start_main_~#t2040~0.base_21| 1)) (= v_~z$mem_tmp~0_19 0) (= v_~z$r_buff0_thd0~0_374 0) (= |v_#NULL.offset_4| 0) (= 0 v_~z$r_buff1_thd3~0_196) (= v_~z$r_buff0_thd2~0_140 0) (= 0 v_~__unbuffered_p2_EAX~0_36) (= v_~z$w_buff0_used~0_875 0) (= 0 v_~weak$$choice0~0_13) (= v_~z$w_buff1~0_249 0) (= 0 v_~x~0_138) (= v_~z~0_182 0) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t2040~0.base_21|)))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_18|, #valid=|v_#valid_55|, #memory_int=|v_#memory_int_22|, #length=|v_#length_26|} OutVars{ULTIMATE.start_main_#t~nondet30=|v_ULTIMATE.start_main_#t~nondet30_21|, ULTIMATE.start_main_#t~ite28=|v_ULTIMATE.start_main_#t~ite28_27|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_206, ULTIMATE.start_main_#t~ite24=|v_ULTIMATE.start_main_#t~ite24_39|, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_29|, #NULL.offset=|v_#NULL.offset_4|, ULTIMATE.start_main_#t~ite26=|v_ULTIMATE.start_main_#t~ite26_29|, ULTIMATE.start_main_#t~ite49=|v_ULTIMATE.start_main_#t~ite49_49|, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_47|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_25|, ULTIMATE.start_main_#t~ite50=|v_ULTIMATE.start_main_#t~ite50_45|, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_32|, ULTIMATE.start_main_~#t2041~0.offset=|v_ULTIMATE.start_main_~#t2041~0.offset_17|, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_374, ULTIMATE.start_main_~#t2041~0.base=|v_ULTIMATE.start_main_~#t2041~0.base_20|, #length=|v_#length_25|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_36, ~z$mem_tmp~0=v_~z$mem_tmp~0_19, ULTIMATE.start_main_#t~nondet22=|v_ULTIMATE.start_main_#t~nondet22_10|, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_43|, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_42|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_516, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_52|, ~z$flush_delayed~0=v_~z$flush_delayed~0_34, ULTIMATE.start_main_#t~ite33=|v_ULTIMATE.start_main_#t~ite33_111|, ~weak$$choice0~0=v_~weak$$choice0~0_13, #StackHeapBarrier=|v_#StackHeapBarrier_18|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_32|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_190, ~z$read_delayed_var~0.base=v_~z$read_delayed_var~0.base_7, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_140, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_140, ULTIMATE.start_main_~#t2040~0.base=|v_ULTIMATE.start_main_~#t2040~0.base_21|, ~x~0=v_~x~0_138, ULTIMATE.start_main_~#t2042~0.offset=|v_ULTIMATE.start_main_~#t2042~0.offset_16|, ULTIMATE.start_main_#t~nondet31=|v_ULTIMATE.start_main_#t~nondet31_21|, ULTIMATE.start_main_#t~ite29=|v_ULTIMATE.start_main_#t~ite29_33|, ~z$read_delayed~0=v_~z$read_delayed~0_8, ULTIMATE.start_main_#t~ite25=|v_ULTIMATE.start_main_#t~ite25_31|, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_29|, ~z$w_buff1~0=v_~z$w_buff1~0_249, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_21, ULTIMATE.start_main_#t~ite27=|v_ULTIMATE.start_main_#t~ite27_121|, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_17|, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_7, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_25|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_41|, ULTIMATE.start_main_#t~ite51=|v_ULTIMATE.start_main_#t~ite51_31|, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_308, ~y~0=v_~y~0_34, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_140, ULTIMATE.start_main_#t~nondet21=|v_ULTIMATE.start_main_#t~nondet21_10|, ULTIMATE.start_main_~#t2042~0.base=|v_ULTIMATE.start_main_~#t2042~0.base_20|, ULTIMATE.start_main_#t~nondet23=|v_ULTIMATE.start_main_#t~nondet23_21|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_875, ~z$w_buff0~0=v_~z$w_buff0~0_342, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_196, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_25|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_54|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_21, ULTIMATE.start_main_~#t2040~0.offset=|v_ULTIMATE.start_main_~#t2040~0.offset_17|, ULTIMATE.start_main_#t~ite32=|v_ULTIMATE.start_main_#t~ite32_59|, #NULL.base=|v_#NULL.base_4|, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_38|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_32|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_20|, #valid=|v_#valid_53|, #memory_int=|v_#memory_int_21|, ~z~0=v_~z~0_182, ~weak$$choice2~0=v_~weak$$choice2~0_109, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_226} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet30, ULTIMATE.start_main_#t~ite28, ~z$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite24, ULTIMATE.start_main_#t~ite47, #NULL.offset, ULTIMATE.start_main_#t~ite26, ULTIMATE.start_main_#t~ite49, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_#t~ite50, ULTIMATE.start_main_#t~ite52, ULTIMATE.start_main_~#t2041~0.offset, ~z$r_buff0_thd0~0, ULTIMATE.start_main_~#t2041~0.base, #length, ~__unbuffered_p2_EAX~0, ~z$mem_tmp~0, ULTIMATE.start_main_#t~nondet22, ULTIMATE.start_main_#t~ite39, ULTIMATE.start_main_#t~ite35, ~z$w_buff1_used~0, ULTIMATE.start_main_#t~ite37, ~z$flush_delayed~0, ULTIMATE.start_main_#t~ite33, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite40, ~z$r_buff1_thd1~0, ~z$read_delayed_var~0.base, ~z$r_buff0_thd3~0, ~__unbuffered_cnt~0, ULTIMATE.start_main_~#t2040~0.base, ~x~0, ULTIMATE.start_main_~#t2042~0.offset, ULTIMATE.start_main_#t~nondet31, ULTIMATE.start_main_#t~ite29, ~z$read_delayed~0, ULTIMATE.start_main_#t~ite25, ULTIMATE.start_main_#t~ite46, ~z$w_buff1~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite27, ULTIMATE.start_main_#t~ite48, ~z$read_delayed_var~0.offset, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite44, ULTIMATE.start_main_#t~ite51, ~z$r_buff1_thd0~0, ~y~0, ~z$r_buff0_thd2~0, ULTIMATE.start_main_#t~nondet21, ULTIMATE.start_main_~#t2042~0.base, ULTIMATE.start_main_#t~nondet23, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$r_buff1_thd3~0, ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite38, ~main$tmp_guard0~0, ULTIMATE.start_main_~#t2040~0.offset, ULTIMATE.start_main_#t~ite32, #NULL.base, ULTIMATE.start_main_#t~ite34, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#res, #valid, #memory_int, ~z~0, ~weak$$choice2~0, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-27 03:39:56,995 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [803] [803] L805-1-->L807: Formula: (and (not (= 0 |v_ULTIMATE.start_main_~#t2041~0.base_12|)) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t2041~0.base_12|) (= 0 (select |v_#valid_35| |v_ULTIMATE.start_main_~#t2041~0.base_12|)) (= |v_#memory_int_13| (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t2041~0.base_12| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t2041~0.base_12|) |v_ULTIMATE.start_main_~#t2041~0.offset_11| 1))) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t2041~0.base_12| 4)) (= |v_#valid_34| (store |v_#valid_35| |v_ULTIMATE.start_main_~#t2041~0.base_12| 1)) (= 0 |v_ULTIMATE.start_main_~#t2041~0.offset_11|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_35|, #memory_int=|v_#memory_int_14|, #length=|v_#length_18|} OutVars{ULTIMATE.start_main_~#t2041~0.offset=|v_ULTIMATE.start_main_~#t2041~0.offset_11|, #StackHeapBarrier=|v_#StackHeapBarrier_12|, ULTIMATE.start_main_#t~nondet21=|v_ULTIMATE.start_main_#t~nondet21_6|, ULTIMATE.start_main_~#t2041~0.base=|v_ULTIMATE.start_main_~#t2041~0.base_12|, #valid=|v_#valid_34|, #memory_int=|v_#memory_int_13|, #length=|v_#length_17|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2041~0.offset, ULTIMATE.start_main_#t~nondet21, ULTIMATE.start_main_~#t2041~0.base, #valid, #memory_int, #length] because there is no mapped edge [2019-12-27 03:39:56,995 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [724] [724] P0ENTRY-->L4-3: Formula: (and (= v_~z$w_buff0_used~0_226 v_~z$w_buff1_used~0_114) (= 2 v_~z$w_buff0~0_55) (= v_~z$w_buff0~0_56 v_~z$w_buff1~0_53) (= v_P0Thread1of1ForFork0_~arg.base_22 |v_P0Thread1of1ForFork0_#in~arg.base_22|) (= 0 (mod v_~z$w_buff1_used~0_114 256)) (= v_P0Thread1of1ForFork0___VERIFIER_assert_~expression_26 |v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_22|) (= v_P0Thread1of1ForFork0_~arg.offset_22 |v_P0Thread1of1ForFork0_#in~arg.offset_22|) (= 1 |v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_22|) (= v_~z$w_buff0_used~0_225 1)) InVars {P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_22|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_226, ~z$w_buff0~0=v_~z$w_buff0~0_56, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_22|} OutVars{P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_22|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_225, ~z$w_buff0~0=v_~z$w_buff0~0_55, P0Thread1of1ForFork0___VERIFIER_assert_~expression=v_P0Thread1of1ForFork0___VERIFIER_assert_~expression_26, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_114, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_22|, ~z$w_buff1~0=v_~z$w_buff1~0_53, P0Thread1of1ForFork0_~arg.base=v_P0Thread1of1ForFork0_~arg.base_22, P0Thread1of1ForFork0___VERIFIER_assert_#in~expression=|v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_22|, P0Thread1of1ForFork0_~arg.offset=v_P0Thread1of1ForFork0_~arg.offset_22} AuxVars[] AssignedVars[~z$w_buff0_used~0, ~z$w_buff0~0, P0Thread1of1ForFork0___VERIFIER_assert_~expression, ~z$w_buff1_used~0, ~z$w_buff1~0, P0Thread1of1ForFork0_~arg.base, P0Thread1of1ForFork0___VERIFIER_assert_#in~expression, P0Thread1of1ForFork0_~arg.offset] because there is no mapped edge [2019-12-27 03:39:56,998 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [789] [789] L807-1-->L809: Formula: (and (< |v_#StackHeapBarrier_9| |v_ULTIMATE.start_main_~#t2042~0.base_9|) (= |v_#length_13| (store |v_#length_14| |v_ULTIMATE.start_main_~#t2042~0.base_9| 4)) (= (store |v_#valid_28| |v_ULTIMATE.start_main_~#t2042~0.base_9| 1) |v_#valid_27|) (= 0 (select |v_#valid_28| |v_ULTIMATE.start_main_~#t2042~0.base_9|)) (not (= |v_ULTIMATE.start_main_~#t2042~0.base_9| 0)) (= (store |v_#memory_int_10| |v_ULTIMATE.start_main_~#t2042~0.base_9| (store (select |v_#memory_int_10| |v_ULTIMATE.start_main_~#t2042~0.base_9|) |v_ULTIMATE.start_main_~#t2042~0.offset_8| 2)) |v_#memory_int_9|) (= |v_ULTIMATE.start_main_~#t2042~0.offset_8| 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_28|, #memory_int=|v_#memory_int_10|, #length=|v_#length_14|} OutVars{ULTIMATE.start_main_~#t2042~0.offset=|v_ULTIMATE.start_main_~#t2042~0.offset_8|, ULTIMATE.start_main_~#t2042~0.base=|v_ULTIMATE.start_main_~#t2042~0.base_9|, #StackHeapBarrier=|v_#StackHeapBarrier_9|, ULTIMATE.start_main_#t~nondet22=|v_ULTIMATE.start_main_#t~nondet22_5|, #valid=|v_#valid_27|, #memory_int=|v_#memory_int_9|, #length=|v_#length_13|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2042~0.offset, ULTIMATE.start_main_~#t2042~0.base, ULTIMATE.start_main_#t~nondet22, #valid, #memory_int, #length] because there is no mapped edge [2019-12-27 03:39:56,998 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [776] [776] L743-->L743-2: Formula: (let ((.cse1 (= (mod ~z$r_buff0_thd1~0_In-45115231 256) 0)) (.cse0 (= (mod ~z$w_buff0_used~0_In-45115231 256) 0))) (or (and (= ~z$w_buff0_used~0_In-45115231 |P0Thread1of1ForFork0_#t~ite5_Out-45115231|) (or .cse0 .cse1)) (and (= 0 |P0Thread1of1ForFork0_#t~ite5_Out-45115231|) (not .cse1) (not .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-45115231, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-45115231} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out-45115231|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-45115231, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-45115231} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-27 03:39:56,999 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [771] [771] L744-->L744-2: Formula: (let ((.cse2 (= 0 (mod ~z$w_buff1_used~0_In1158321458 256))) (.cse3 (= (mod ~z$r_buff1_thd1~0_In1158321458 256) 0)) (.cse1 (= (mod ~z$r_buff0_thd1~0_In1158321458 256) 0)) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In1158321458 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P0Thread1of1ForFork0_#t~ite6_Out1158321458| 0)) (and (or .cse2 .cse3) (or .cse1 .cse0) (= ~z$w_buff1_used~0_In1158321458 |P0Thread1of1ForFork0_#t~ite6_Out1158321458|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1158321458, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In1158321458, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1158321458, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In1158321458} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out1158321458|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1158321458, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In1158321458, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1158321458, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In1158321458} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-27 03:39:57,002 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [782] [782] L745-->L746: Formula: (let ((.cse0 (= (mod ~z$r_buff0_thd1~0_In337790613 256) 0)) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In337790613 256)))) (or (and (= ~z$r_buff0_thd1~0_In337790613 ~z$r_buff0_thd1~0_Out337790613) (or .cse0 .cse1)) (and (= 0 ~z$r_buff0_thd1~0_Out337790613) (not .cse0) (not .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In337790613, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In337790613} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In337790613, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out337790613|, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_Out337790613} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-27 03:39:57,002 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [777] [777] L746-->L746-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff1_thd1~0_In-363160722 256))) (.cse0 (= 0 (mod ~z$w_buff1_used~0_In-363160722 256))) (.cse2 (= (mod ~z$w_buff0_used~0_In-363160722 256) 0)) (.cse3 (= (mod ~z$r_buff0_thd1~0_In-363160722 256) 0))) (or (and (= 0 |P0Thread1of1ForFork0_#t~ite8_Out-363160722|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse1 .cse0) (= ~z$r_buff1_thd1~0_In-363160722 |P0Thread1of1ForFork0_#t~ite8_Out-363160722|) (or .cse2 .cse3)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-363160722, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In-363160722, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-363160722, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-363160722} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-363160722, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out-363160722|, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In-363160722, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-363160722, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-363160722} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-27 03:39:57,002 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [795] [795] L746-2-->P0EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_44 1) v_~__unbuffered_cnt~0_43) (= 0 |v_P0Thread1of1ForFork0_#res.base_5|) (= |v_P0Thread1of1ForFork0_#res.offset_5| 0) (= v_~z$r_buff1_thd1~0_63 |v_P0Thread1of1ForFork0_#t~ite8_28|)) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_28|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_44} OutVars{P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_5|, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_27|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_63, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_43} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#t~ite8, ~z$r_buff1_thd1~0, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-27 03:39:57,002 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [767] [767] L762-2-->L762-5: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff1_used~0_In-807189251 256))) (.cse0 (= (mod ~z$r_buff1_thd2~0_In-807189251 256) 0)) (.cse2 (= |P1Thread1of1ForFork1_#t~ite10_Out-807189251| |P1Thread1of1ForFork1_#t~ite9_Out-807189251|))) (or (and (not .cse0) (not .cse1) (= ~z$w_buff1~0_In-807189251 |P1Thread1of1ForFork1_#t~ite9_Out-807189251|) .cse2) (and (= ~z~0_In-807189251 |P1Thread1of1ForFork1_#t~ite9_Out-807189251|) (or .cse1 .cse0) .cse2))) InVars {~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-807189251, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-807189251, ~z$w_buff1~0=~z$w_buff1~0_In-807189251, ~z~0=~z~0_In-807189251} OutVars{P1Thread1of1ForFork1_#t~ite9=|P1Thread1of1ForFork1_#t~ite9_Out-807189251|, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-807189251, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-807189251, P1Thread1of1ForFork1_#t~ite10=|P1Thread1of1ForFork1_#t~ite10_Out-807189251|, ~z$w_buff1~0=~z$w_buff1~0_In-807189251, ~z~0=~z~0_In-807189251} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite9, P1Thread1of1ForFork1_#t~ite10] because there is no mapped edge [2019-12-27 03:39:57,004 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [762] [762] L782-2-->L782-4: Formula: (let ((.cse0 (= (mod ~z$r_buff1_thd3~0_In-714823285 256) 0)) (.cse1 (= (mod ~z$w_buff1_used~0_In-714823285 256) 0))) (or (and (or .cse0 .cse1) (= |P2Thread1of1ForFork2_#t~ite15_Out-714823285| ~z~0_In-714823285)) (and (not .cse0) (not .cse1) (= |P2Thread1of1ForFork2_#t~ite15_Out-714823285| ~z$w_buff1~0_In-714823285)))) InVars {~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-714823285, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-714823285, ~z$w_buff1~0=~z$w_buff1~0_In-714823285, ~z~0=~z~0_In-714823285} OutVars{P2Thread1of1ForFork2_#t~ite15=|P2Thread1of1ForFork2_#t~ite15_Out-714823285|, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-714823285, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-714823285, ~z$w_buff1~0=~z$w_buff1~0_In-714823285, ~z~0=~z~0_In-714823285} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite15] because there is no mapped edge [2019-12-27 03:39:57,004 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [689] [689] L782-4-->L783: Formula: (= v_~z~0_20 |v_P2Thread1of1ForFork2_#t~ite15_10|) InVars {P2Thread1of1ForFork2_#t~ite15=|v_P2Thread1of1ForFork2_#t~ite15_10|} OutVars{P2Thread1of1ForFork2_#t~ite15=|v_P2Thread1of1ForFork2_#t~ite15_9|, ~z~0=v_~z~0_20, P2Thread1of1ForFork2_#t~ite16=|v_P2Thread1of1ForFork2_#t~ite16_13|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite15, ~z~0, P2Thread1of1ForFork2_#t~ite16] because there is no mapped edge [2019-12-27 03:39:57,004 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [774] [774] L783-->L783-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In-1850809648 256))) (.cse0 (= (mod ~z$w_buff0_used~0_In-1850809648 256) 0))) (or (and (= |P2Thread1of1ForFork2_#t~ite17_Out-1850809648| ~z$w_buff0_used~0_In-1850809648) (or .cse0 .cse1)) (and (= |P2Thread1of1ForFork2_#t~ite17_Out-1850809648| 0) (not .cse1) (not .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1850809648, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1850809648} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1850809648, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1850809648, P2Thread1of1ForFork2_#t~ite17=|P2Thread1of1ForFork2_#t~ite17_Out-1850809648|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite17] because there is no mapped edge [2019-12-27 03:39:57,005 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [772] [772] L784-->L784-2: Formula: (let ((.cse3 (= (mod ~z$w_buff0_used~0_In50740794 256) 0)) (.cse2 (= (mod ~z$r_buff0_thd3~0_In50740794 256) 0)) (.cse1 (= 0 (mod ~z$r_buff1_thd3~0_In50740794 256))) (.cse0 (= (mod ~z$w_buff1_used~0_In50740794 256) 0))) (or (and (or .cse0 .cse1) (= ~z$w_buff1_used~0_In50740794 |P2Thread1of1ForFork2_#t~ite18_Out50740794|) (or .cse2 .cse3)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0))) (= |P2Thread1of1ForFork2_#t~ite18_Out50740794| 0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In50740794, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In50740794, ~z$w_buff1_used~0=~z$w_buff1_used~0_In50740794, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In50740794} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In50740794, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In50740794, ~z$w_buff1_used~0=~z$w_buff1_used~0_In50740794, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In50740794, P2Thread1of1ForFork2_#t~ite18=|P2Thread1of1ForFork2_#t~ite18_Out50740794|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite18] because there is no mapped edge [2019-12-27 03:39:57,005 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [757] [757] L785-->L785-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In-1109446067 256))) (.cse1 (= (mod ~z$r_buff0_thd3~0_In-1109446067 256) 0))) (or (and (= 0 |P2Thread1of1ForFork2_#t~ite19_Out-1109446067|) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= ~z$r_buff0_thd3~0_In-1109446067 |P2Thread1of1ForFork2_#t~ite19_Out-1109446067|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1109446067, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1109446067} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1109446067, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1109446067, P2Thread1of1ForFork2_#t~ite19=|P2Thread1of1ForFork2_#t~ite19_Out-1109446067|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite19] because there is no mapped edge [2019-12-27 03:39:57,006 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [763] [763] L786-->L786-2: Formula: (let ((.cse2 (= (mod ~z$w_buff0_used~0_In-740298771 256) 0)) (.cse3 (= (mod ~z$r_buff0_thd3~0_In-740298771 256) 0)) (.cse1 (= (mod ~z$w_buff1_used~0_In-740298771 256) 0)) (.cse0 (= 0 (mod ~z$r_buff1_thd3~0_In-740298771 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P2Thread1of1ForFork2_#t~ite20_Out-740298771| ~z$r_buff1_thd3~0_In-740298771)) (and (= |P2Thread1of1ForFork2_#t~ite20_Out-740298771| 0) (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0)))))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-740298771, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-740298771, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-740298771, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-740298771} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-740298771, P2Thread1of1ForFork2_#t~ite20=|P2Thread1of1ForFork2_#t~ite20_Out-740298771|, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-740298771, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-740298771, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-740298771} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite20] because there is no mapped edge [2019-12-27 03:39:57,006 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [804] [804] L786-2-->P2EXIT: Formula: (and (= 0 |v_P2Thread1of1ForFork2_#res.base_5|) (= |v_P2Thread1of1ForFork2_#t~ite20_32| v_~z$r_buff1_thd3~0_67) (= |v_P2Thread1of1ForFork2_#res.offset_5| 0) (= v_~__unbuffered_cnt~0_54 (+ v_~__unbuffered_cnt~0_55 1))) InVars {P2Thread1of1ForFork2_#t~ite20=|v_P2Thread1of1ForFork2_#t~ite20_32|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_55} OutVars{P2Thread1of1ForFork2_#t~ite20=|v_P2Thread1of1ForFork2_#t~ite20_31|, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_67, P2Thread1of1ForFork2_#res.base=|v_P2Thread1of1ForFork2_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_54, P2Thread1of1ForFork2_#res.offset=|v_P2Thread1of1ForFork2_#res.offset_5|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite20, ~z$r_buff1_thd3~0, P2Thread1of1ForFork2_#res.base, ~__unbuffered_cnt~0, P2Thread1of1ForFork2_#res.offset] because there is no mapped edge [2019-12-27 03:39:57,007 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [760] [760] L763-->L763-2: Formula: (let ((.cse0 (= (mod ~z$r_buff0_thd2~0_In-199039435 256) 0)) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In-199039435 256)))) (or (and (or .cse0 .cse1) (= ~z$w_buff0_used~0_In-199039435 |P1Thread1of1ForFork1_#t~ite11_Out-199039435|)) (and (= 0 |P1Thread1of1ForFork1_#t~ite11_Out-199039435|) (not .cse0) (not .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-199039435, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-199039435} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-199039435, P1Thread1of1ForFork1_#t~ite11=|P1Thread1of1ForFork1_#t~ite11_Out-199039435|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-199039435} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite11] because there is no mapped edge [2019-12-27 03:39:57,008 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [778] [778] L764-->L764-2: Formula: (let ((.cse2 (= (mod ~z$r_buff1_thd2~0_In-83935295 256) 0)) (.cse3 (= (mod ~z$w_buff1_used~0_In-83935295 256) 0)) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In-83935295 256))) (.cse1 (= (mod ~z$r_buff0_thd2~0_In-83935295 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P1Thread1of1ForFork1_#t~ite12_Out-83935295|)) (and (= ~z$w_buff1_used~0_In-83935295 |P1Thread1of1ForFork1_#t~ite12_Out-83935295|) (or .cse2 .cse3) (or .cse0 .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-83935295, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-83935295, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-83935295, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-83935295} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-83935295, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-83935295, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-83935295, P1Thread1of1ForFork1_#t~ite12=|P1Thread1of1ForFork1_#t~ite12_Out-83935295|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-83935295} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite12] because there is no mapped edge [2019-12-27 03:39:57,008 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [764] [764] L765-->L765-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In113995089 256))) (.cse1 (= 0 (mod ~z$r_buff0_thd2~0_In113995089 256)))) (or (and (or .cse0 .cse1) (= |P1Thread1of1ForFork1_#t~ite13_Out113995089| ~z$r_buff0_thd2~0_In113995089)) (and (not .cse0) (= |P1Thread1of1ForFork1_#t~ite13_Out113995089| 0) (not .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In113995089, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In113995089} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In113995089, P1Thread1of1ForFork1_#t~ite13=|P1Thread1of1ForFork1_#t~ite13_Out113995089|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In113995089} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite13] because there is no mapped edge [2019-12-27 03:39:57,009 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [773] [773] L766-->L766-2: Formula: (let ((.cse3 (= 0 (mod ~z$w_buff0_used~0_In-1459891929 256))) (.cse2 (= 0 (mod ~z$r_buff0_thd2~0_In-1459891929 256))) (.cse1 (= (mod ~z$r_buff1_thd2~0_In-1459891929 256) 0)) (.cse0 (= 0 (mod ~z$w_buff1_used~0_In-1459891929 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~z$r_buff1_thd2~0_In-1459891929 |P1Thread1of1ForFork1_#t~ite14_Out-1459891929|)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0))) (= 0 |P1Thread1of1ForFork1_#t~ite14_Out-1459891929|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1459891929, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-1459891929, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1459891929, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1459891929} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1459891929, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-1459891929, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1459891929, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_Out-1459891929|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1459891929} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite14] because there is no mapped edge [2019-12-27 03:39:57,009 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [805] [805] L766-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork1_#res.base_5|) (= |v_P1Thread1of1ForFork1_#t~ite14_32| v_~z$r_buff1_thd2~0_84) (= (+ v_~__unbuffered_cnt~0_61 1) v_~__unbuffered_cnt~0_60) (= |v_P1Thread1of1ForFork1_#res.offset_5| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_61, P1Thread1of1ForFork1_#t~ite14=|v_P1Thread1of1ForFork1_#t~ite14_32|} OutVars{P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_5|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_84, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_60, P1Thread1of1ForFork1_#t~ite14=|v_P1Thread1of1ForFork1_#t~ite14_31|, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#res.offset, ~z$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#t~ite14, P1Thread1of1ForFork1_#res.base] because there is no mapped edge [2019-12-27 03:39:57,010 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [708] [708] L809-1-->L815: Formula: (and (= 3 v_~__unbuffered_cnt~0_18) (= v_~main$tmp_guard0~0_8 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_18} OutVars{ULTIMATE.start_main_#t~nondet23=|v_ULTIMATE.start_main_#t~nondet23_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_18, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet23, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-27 03:39:57,010 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [761] [761] L815-2-->L815-5: Formula: (let ((.cse0 (= (mod ~z$r_buff1_thd0~0_In-1022309 256) 0)) (.cse1 (= (mod ~z$w_buff1_used~0_In-1022309 256) 0)) (.cse2 (= |ULTIMATE.start_main_#t~ite25_Out-1022309| |ULTIMATE.start_main_#t~ite24_Out-1022309|))) (or (and (not .cse0) (not .cse1) .cse2 (= ~z$w_buff1~0_In-1022309 |ULTIMATE.start_main_#t~ite24_Out-1022309|)) (and (= |ULTIMATE.start_main_#t~ite24_Out-1022309| ~z~0_In-1022309) (or .cse0 .cse1) .cse2))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1022309, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1022309, ~z$w_buff1~0=~z$w_buff1~0_In-1022309, ~z~0=~z~0_In-1022309} OutVars{~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1022309, ULTIMATE.start_main_#t~ite24=|ULTIMATE.start_main_#t~ite24_Out-1022309|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1022309, ULTIMATE.start_main_#t~ite25=|ULTIMATE.start_main_#t~ite25_Out-1022309|, ~z$w_buff1~0=~z$w_buff1~0_In-1022309, ~z~0=~z~0_In-1022309} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite24, ULTIMATE.start_main_#t~ite25] because there is no mapped edge [2019-12-27 03:39:57,011 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [768] [768] L816-->L816-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In-2037912440 256))) (.cse1 (= 0 (mod ~z$r_buff0_thd0~0_In-2037912440 256)))) (or (and (or .cse0 .cse1) (= ~z$w_buff0_used~0_In-2037912440 |ULTIMATE.start_main_#t~ite26_Out-2037912440|)) (and (= 0 |ULTIMATE.start_main_#t~ite26_Out-2037912440|) (not .cse0) (not .cse1)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-2037912440, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-2037912440} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-2037912440, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-2037912440, ULTIMATE.start_main_#t~ite26=|ULTIMATE.start_main_#t~ite26_Out-2037912440|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite26] because there is no mapped edge [2019-12-27 03:39:57,012 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [775] [775] L817-->L817-2: Formula: (let ((.cse2 (= 0 (mod ~z$r_buff0_thd0~0_In1304621756 256))) (.cse3 (= (mod ~z$w_buff0_used~0_In1304621756 256) 0)) (.cse0 (= 0 (mod ~z$w_buff1_used~0_In1304621756 256))) (.cse1 (= (mod ~z$r_buff1_thd0~0_In1304621756 256) 0))) (or (and (= ~z$w_buff1_used~0_In1304621756 |ULTIMATE.start_main_#t~ite27_Out1304621756|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= |ULTIMATE.start_main_#t~ite27_Out1304621756| 0) (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1)))))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1304621756, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1304621756, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1304621756, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1304621756} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1304621756, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1304621756, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1304621756, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1304621756, ULTIMATE.start_main_#t~ite27=|ULTIMATE.start_main_#t~ite27_Out1304621756|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite27] because there is no mapped edge [2019-12-27 03:39:57,013 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [766] [766] L818-->L818-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd0~0_In886888038 256))) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In886888038 256)))) (or (and (= |ULTIMATE.start_main_#t~ite28_Out886888038| ~z$r_buff0_thd0~0_In886888038) (or .cse0 .cse1)) (and (not .cse1) (= |ULTIMATE.start_main_#t~ite28_Out886888038| 0) (not .cse0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In886888038, ~z$w_buff0_used~0=~z$w_buff0_used~0_In886888038} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In886888038, ULTIMATE.start_main_#t~ite28=|ULTIMATE.start_main_#t~ite28_Out886888038|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In886888038} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite28] because there is no mapped edge [2019-12-27 03:39:57,013 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [781] [781] L819-->L819-2: Formula: (let ((.cse0 (= (mod ~z$r_buff0_thd0~0_In599147903 256) 0)) (.cse1 (= (mod ~z$w_buff0_used~0_In599147903 256) 0)) (.cse3 (= 0 (mod ~z$r_buff1_thd0~0_In599147903 256))) (.cse2 (= 0 (mod ~z$w_buff1_used~0_In599147903 256)))) (or (and (= ~z$r_buff1_thd0~0_In599147903 |ULTIMATE.start_main_#t~ite29_Out599147903|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2))) (= |ULTIMATE.start_main_#t~ite29_Out599147903| 0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In599147903, ~z$w_buff0_used~0=~z$w_buff0_used~0_In599147903, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In599147903, ~z$w_buff1_used~0=~z$w_buff1_used~0_In599147903} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In599147903, ULTIMATE.start_main_#t~ite29=|ULTIMATE.start_main_#t~ite29_Out599147903|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In599147903, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In599147903, ~z$w_buff1_used~0=~z$w_buff1_used~0_In599147903} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite29] because there is no mapped edge [2019-12-27 03:39:57,020 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [721] [721] L831-->L832: Formula: (and (= v_~z$r_buff0_thd0~0_103 v_~z$r_buff0_thd0~0_102) (not (= (mod v_~weak$$choice2~0_23 256) 0))) InVars {~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_103, ~weak$$choice2~0=v_~weak$$choice2~0_23} OutVars{~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_102, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_6|, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_10|, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_6|, ~weak$$choice2~0=v_~weak$$choice2~0_23} AuxVars[] AssignedVars[~z$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite47, ULTIMATE.start_main_#t~ite46, ULTIMATE.start_main_#t~ite48] because there is no mapped edge [2019-12-27 03:39:57,022 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [801] [801] L834-->L837-1: Formula: (and (= v_~z$mem_tmp~0_11 v_~z~0_133) (= (mod v_~main$tmp_guard1~0_9 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|) (not (= 0 (mod v_~z$flush_delayed~0_21 256))) (= 0 v_~z$flush_delayed~0_20)) InVars {~z$mem_tmp~0=v_~z$mem_tmp~0_11, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_9, ~z$flush_delayed~0=v_~z$flush_delayed~0_21} OutVars{~z$mem_tmp~0=v_~z$mem_tmp~0_11, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_18|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_9, ~z$flush_delayed~0=v_~z$flush_delayed~0_20, ~z~0=v_~z~0_133, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52, ~z$flush_delayed~0, ~z~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-27 03:39:57,022 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [788] [788] L837-1-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_11 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_5|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_11 0)) InVars {ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_5|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_11, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_5|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression] because there is no mapped edge [2019-12-27 03:39:57,140 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 03:39:57 BasicIcfg [2019-12-27 03:39:57,141 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 03:39:57,142 INFO L168 Benchmark]: Toolchain (without parser) took 93056.47 ms. Allocated memory was 143.1 MB in the beginning and 3.7 GB in the end (delta: 3.5 GB). Free memory was 99.3 MB in the beginning and 1.4 GB in the end (delta: -1.3 GB). Peak memory consumption was 2.2 GB. Max. memory is 7.1 GB. [2019-12-27 03:39:57,143 INFO L168 Benchmark]: CDTParser took 0.42 ms. Allocated memory is still 143.1 MB. Free memory was 119.5 MB in the beginning and 119.3 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. [2019-12-27 03:39:57,143 INFO L168 Benchmark]: CACSL2BoogieTranslator took 795.31 ms. Allocated memory was 143.1 MB in the beginning and 200.3 MB in the end (delta: 57.1 MB). Free memory was 98.9 MB in the beginning and 153.2 MB in the end (delta: -54.3 MB). Peak memory consumption was 21.6 MB. Max. memory is 7.1 GB. [2019-12-27 03:39:57,143 INFO L168 Benchmark]: Boogie Procedure Inliner took 63.83 ms. Allocated memory is still 200.3 MB. Free memory was 153.2 MB in the beginning and 150.5 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-27 03:39:57,144 INFO L168 Benchmark]: Boogie Preprocessor took 43.98 ms. Allocated memory is still 200.3 MB. Free memory was 150.5 MB in the beginning and 147.8 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-27 03:39:57,144 INFO L168 Benchmark]: RCFGBuilder took 1054.50 ms. Allocated memory is still 200.3 MB. Free memory was 147.8 MB in the beginning and 97.9 MB in the end (delta: 49.9 MB). Peak memory consumption was 49.9 MB. Max. memory is 7.1 GB. [2019-12-27 03:39:57,145 INFO L168 Benchmark]: TraceAbstraction took 91093.80 ms. Allocated memory was 200.3 MB in the beginning and 3.7 GB in the end (delta: 3.5 GB). Free memory was 97.9 MB in the beginning and 1.4 GB in the end (delta: -1.3 GB). Peak memory consumption was 2.1 GB. Max. memory is 7.1 GB. [2019-12-27 03:39:57,155 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.42 ms. Allocated memory is still 143.1 MB. Free memory was 119.5 MB in the beginning and 119.3 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 795.31 ms. Allocated memory was 143.1 MB in the beginning and 200.3 MB in the end (delta: 57.1 MB). Free memory was 98.9 MB in the beginning and 153.2 MB in the end (delta: -54.3 MB). Peak memory consumption was 21.6 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 63.83 ms. Allocated memory is still 200.3 MB. Free memory was 153.2 MB in the beginning and 150.5 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 43.98 ms. Allocated memory is still 200.3 MB. Free memory was 150.5 MB in the beginning and 147.8 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1054.50 ms. Allocated memory is still 200.3 MB. Free memory was 147.8 MB in the beginning and 97.9 MB in the end (delta: 49.9 MB). Peak memory consumption was 49.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 91093.80 ms. Allocated memory was 200.3 MB in the beginning and 3.7 GB in the end (delta: 3.5 GB). Free memory was 97.9 MB in the beginning and 1.4 GB in the end (delta: -1.3 GB). Peak memory consumption was 2.1 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 5.6s, 174 ProgramPointsBefore, 93 ProgramPointsAfterwards, 211 TransitionsBefore, 104 TransitionsAfterwards, 17114 CoEnabledTransitionPairs, 8 FixpointIterations, 31 TrivialSequentialCompositions, 44 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 37 ConcurrentYvCompositions, 30 ChoiceCompositions, 6114 VarBasedMoverChecksPositive, 254 VarBasedMoverChecksNegative, 80 SemBasedMoverChecksPositive, 255 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.8s, 0 MoverChecksTotal, 86146 CheckedPairsTotal, 112 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L805] FCALL, FORK 0 pthread_create(&t2040, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L732] 1 z$r_buff1_thd0 = z$r_buff0_thd0 [L733] 1 z$r_buff1_thd1 = z$r_buff0_thd1 [L734] 1 z$r_buff1_thd2 = z$r_buff0_thd2 [L735] 1 z$r_buff1_thd3 = z$r_buff0_thd3 [L736] 1 z$r_buff0_thd1 = (_Bool)1 [L739] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L742] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L807] FCALL, FORK 0 pthread_create(&t2041, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L742] 1 z = z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L743] 1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L744] 1 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L809] FCALL, FORK 0 pthread_create(&t2042, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=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=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L756] 2 x = 2 [L759] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L762] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L776] 3 __unbuffered_p2_EAX = y [L779] 3 z = 1 VAL [__unbuffered_cnt=1, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z)=2, z$w_buff1=0, z$w_buff1_used=0, z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z=2] [L782] 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) VAL [__unbuffered_cnt=1, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z)=2, z$w_buff1=0, z$w_buff1_used=0, z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z=2] [L783] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L784] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L785] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L762] 2 z = z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L763] 2 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L764] 2 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L765] 2 z$r_buff0_thd2 = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L815] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L815] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L816] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L817] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L818] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L819] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L822] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L823] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L824] 0 z$flush_delayed = weak$$choice2 [L825] 0 z$mem_tmp = z VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=1, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L826] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=1, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L826] 0 z = !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L827] EXPR 0 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=1, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L827] 0 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L828] EXPR 0 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=1, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L828] 0 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L829] EXPR 0 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=1, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L829] 0 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L830] EXPR 0 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=1, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L830] 0 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L832] EXPR 0 weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=1, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L832] 0 z$r_buff1_thd0 = weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L833] 0 main$tmp_guard1 = !(x == 2 && z == 2 && __unbuffered_p2_EAX == 1) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=1, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 165 locations, 2 error locations. Result: UNSAFE, OverallTime: 90.7s, OverallIterations: 27, TraceHistogramMax: 1, AutomataDifference: 31.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 4300 SDtfs, 4558 SDslu, 12536 SDs, 0 SdLazy, 8832 SolverSat, 348 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 11.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 364 GetRequests, 90 SyntacticMatches, 26 SemanticMatches, 248 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 997 ImplicationChecksByTransitivity, 4.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=178183occurred in iteration=3, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 33.4s AutomataMinimizationTime, 26 MinimizatonAttempts, 109992 StatesRemovedByMinimization, 23 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 3.6s InterpolantComputationTime, 1437 NumberOfCodeBlocks, 1437 NumberOfCodeBlocksAsserted, 27 NumberOfCheckSat, 1343 ConstructedInterpolants, 0 QuantifiedInterpolants, 312059 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 26 InterpolantComputations, 26 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...