/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix052_pso.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-26 22:56:43,814 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-26 22:56:43,816 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-26 22:56:43,828 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-26 22:56:43,829 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-26 22:56:43,830 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-26 22:56:43,831 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-26 22:56:43,833 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-26 22:56:43,835 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-26 22:56:43,836 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-26 22:56:43,837 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-26 22:56:43,838 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-26 22:56:43,838 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-26 22:56:43,839 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-26 22:56:43,840 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-26 22:56:43,841 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-26 22:56:43,844 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-26 22:56:43,845 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-26 22:56:43,847 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-26 22:56:43,852 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-26 22:56:43,854 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-26 22:56:43,857 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-26 22:56:43,859 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-26 22:56:43,860 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-26 22:56:43,862 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-26 22:56:43,863 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-26 22:56:43,863 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-26 22:56:43,865 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-26 22:56:43,866 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-26 22:56:43,868 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-26 22:56:43,868 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-26 22:56:43,869 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-26 22:56:43,870 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-26 22:56:43,871 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-26 22:56:43,874 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-26 22:56:43,875 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-26 22:56:43,875 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-26 22:56:43,876 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-26 22:56:43,876 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-26 22:56:43,878 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-26 22:56:43,880 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-26 22:56:43,881 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-26 22:56:43,903 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-26 22:56:43,903 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-26 22:56:43,906 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-26 22:56:43,906 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-26 22:56:43,906 INFO L138 SettingsManager]: * Use SBE=true [2019-12-26 22:56:43,906 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-26 22:56:43,906 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-26 22:56:43,907 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-26 22:56:43,907 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-26 22:56:43,907 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-26 22:56:43,908 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-26 22:56:43,908 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-26 22:56:43,908 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-26 22:56:43,909 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-26 22:56:43,909 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-26 22:56:43,909 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-26 22:56:43,909 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-26 22:56:43,910 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-26 22:56:43,910 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-26 22:56:43,910 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-26 22:56:43,910 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-26 22:56:43,910 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-26 22:56:43,910 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-26 22:56:43,911 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-26 22:56:43,911 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-26 22:56:43,911 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-26 22:56:43,911 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-26 22:56:43,911 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-26 22:56:43,912 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-26 22:56:43,912 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-26 22:56:44,200 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-26 22:56:44,213 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-26 22:56:44,216 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-26 22:56:44,218 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-26 22:56:44,218 INFO L275 PluginConnector]: CDTParser initialized [2019-12-26 22:56:44,219 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix052_pso.oepc.i [2019-12-26 22:56:44,281 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a0a5d8ee0/0da5b7410e674ce6960d45554d285309/FLAG9c787ce5c [2019-12-26 22:56:44,816 INFO L306 CDTParser]: Found 1 translation units. [2019-12-26 22:56:44,818 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix052_pso.oepc.i [2019-12-26 22:56:44,836 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a0a5d8ee0/0da5b7410e674ce6960d45554d285309/FLAG9c787ce5c [2019-12-26 22:56:45,131 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a0a5d8ee0/0da5b7410e674ce6960d45554d285309 [2019-12-26 22:56:45,141 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-26 22:56:45,143 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-26 22:56:45,144 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-26 22:56:45,144 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-26 22:56:45,148 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-26 22:56:45,149 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.12 10:56:45" (1/1) ... [2019-12-26 22:56:45,152 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6e211ff5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:56:45, skipping insertion in model container [2019-12-26 22:56:45,152 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.12 10:56:45" (1/1) ... [2019-12-26 22:56:45,160 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-26 22:56:45,205 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-26 22:56:45,773 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-26 22:56:45,791 INFO L203 MainTranslator]: Completed pre-run [2019-12-26 22:56:45,872 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-26 22:56:45,972 INFO L208 MainTranslator]: Completed translation [2019-12-26 22:56:45,973 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:56:45 WrapperNode [2019-12-26 22:56:45,973 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-26 22:56:45,973 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-26 22:56:45,974 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-26 22:56:45,974 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-26 22:56:45,980 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:56:45" (1/1) ... [2019-12-26 22:56:46,008 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:56:45" (1/1) ... [2019-12-26 22:56:46,043 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-26 22:56:46,043 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-26 22:56:46,043 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-26 22:56:46,044 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-26 22:56:46,053 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:56:45" (1/1) ... [2019-12-26 22:56:46,054 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:56:45" (1/1) ... [2019-12-26 22:56:46,058 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:56:45" (1/1) ... [2019-12-26 22:56:46,059 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:56:45" (1/1) ... [2019-12-26 22:56:46,075 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:56:45" (1/1) ... [2019-12-26 22:56:46,081 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:56:45" (1/1) ... [2019-12-26 22:56:46,086 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:56:45" (1/1) ... [2019-12-26 22:56:46,091 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-26 22:56:46,098 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-26 22:56:46,098 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-26 22:56:46,098 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-26 22:56:46,099 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:56:45" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-26 22:56:46,172 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-26 22:56:46,172 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-26 22:56:46,172 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-26 22:56:46,172 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-26 22:56:46,173 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-26 22:56:46,173 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-26 22:56:46,173 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-26 22:56:46,173 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-26 22:56:46,173 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-26 22:56:46,174 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-26 22:56:46,174 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-26 22:56:46,174 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-26 22:56:46,174 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-26 22:56:46,176 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-26 22:56:46,929 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-26 22:56:46,929 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-26 22:56:46,931 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.12 10:56:46 BoogieIcfgContainer [2019-12-26 22:56:46,931 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-26 22:56:46,932 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-26 22:56:46,932 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-26 22:56:46,936 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-26 22:56:46,937 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.12 10:56:45" (1/3) ... [2019-12-26 22:56:46,938 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f7b493b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.12 10:56:46, skipping insertion in model container [2019-12-26 22:56:46,938 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:56:45" (2/3) ... [2019-12-26 22:56:46,938 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f7b493b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.12 10:56:46, skipping insertion in model container [2019-12-26 22:56:46,939 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.12 10:56:46" (3/3) ... [2019-12-26 22:56:46,940 INFO L109 eAbstractionObserver]: Analyzing ICFG mix052_pso.oepc.i [2019-12-26 22:56:46,951 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-26 22:56:46,951 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-26 22:56:46,960 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-26 22:56:46,961 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-26 22:56:47,004 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:56:47,004 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:56:47,004 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:56:47,005 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:56:47,005 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:56:47,005 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:56:47,006 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:56:47,006 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:56:47,006 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:56:47,007 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:56:47,007 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:56:47,007 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:56:47,008 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:56:47,008 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:56:47,008 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:56:47,008 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:56:47,009 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:56:47,009 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:56:47,009 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:56:47,009 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:56:47,010 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:56:47,010 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:56:47,010 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:56:47,010 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:56:47,011 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:56:47,011 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:56:47,011 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:56:47,011 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:56:47,012 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:56:47,012 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:56:47,012 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:56:47,012 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:56:47,013 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:56:47,013 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:56:47,013 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:56:47,014 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:56:47,014 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:56:47,014 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:56:47,014 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:56:47,015 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:56:47,015 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:56:47,015 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:56:47,015 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:56:47,016 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:56:47,016 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:56:47,016 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:56:47,033 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:56:47,033 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:56:47,034 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:56:47,034 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:56:47,034 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:56:47,034 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:56:47,034 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:56:47,035 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:56:47,035 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:56:47,035 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:56:47,035 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:56:47,035 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:56:47,036 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:56:47,036 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:56:47,036 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:56:47,036 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:56:47,037 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:56:47,037 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:56:47,038 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:56:47,038 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:56:47,038 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:56:47,038 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:56:47,038 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:56:47,039 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:56:47,039 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:56:47,039 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:56:47,039 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:56:47,040 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:56:47,040 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:56:47,040 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:56:47,040 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:56:47,040 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:56:47,041 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:56:47,041 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:56:47,041 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:56:47,041 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:56:47,041 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:56:47,042 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:56:47,042 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:56:47,042 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:56:47,042 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:56:47,043 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:56:47,043 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:56:47,043 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:56:47,043 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:56:47,043 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:56:47,044 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:56:47,044 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:56:47,044 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:56:47,044 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:56:47,044 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:56:47,045 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:56:47,045 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:56:47,045 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:56:47,045 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:56:47,045 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:56:47,046 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:56:47,046 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:56:47,046 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:56:47,046 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:56:47,046 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:56:47,047 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:56:47,047 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:56:47,047 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:56:47,047 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:56:47,048 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:56:47,048 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:56:47,048 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:56:47,048 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:56:47,048 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:56:47,049 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:56:47,049 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:56:47,049 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:56:47,049 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:56:47,049 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:56:47,049 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:56:47,050 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:56:47,050 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:56:47,050 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:56:47,050 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:56:47,050 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:56:47,051 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:56:47,051 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:56:47,051 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:56:47,051 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:56:47,051 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:56:47,052 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:56:47,052 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:56:47,052 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:56:47,052 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:56:47,052 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:56:47,053 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:56:47,053 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:56:47,053 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:56:47,053 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:56:47,053 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:56:47,054 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:56:47,054 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:56:47,054 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:56:47,054 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:56:47,055 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:56:47,055 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:56:47,055 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:56:47,055 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:56:47,055 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:56:47,056 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:56:47,056 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:56:47,056 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:56:47,056 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:56:47,056 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:56:47,056 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:56:47,057 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:56:47,057 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:56:47,057 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:56:47,057 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:56:47,057 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:56:47,058 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:56:47,058 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:56:47,058 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:56:47,058 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:56:47,058 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:56:47,059 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:56:47,059 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:56:47,059 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:56:47,059 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:56:47,059 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:56:47,060 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:56:47,060 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:56:47,060 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:56:47,060 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:56:47,060 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:56:47,061 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:56:47,061 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:56:47,061 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:56:47,061 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:56:47,061 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:56:47,065 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:56:47,065 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:56:47,065 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:56:47,065 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:56:47,066 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:56:47,066 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:56:47,066 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:56:47,066 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:56:47,066 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:56:47,067 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:56:47,067 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:56:47,067 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:56:47,069 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:56:47,070 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:56:47,070 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:56:47,070 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:56:47,070 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:56:47,070 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:56:47,071 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:56:47,071 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:56:47,071 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:56:47,071 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:56:47,073 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:56:47,073 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:56:47,074 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:56:47,074 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:56:47,074 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:56:47,074 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:56:47,074 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:56:47,075 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:56:47,075 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:56:47,075 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:56:47,075 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:56:47,075 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:56:47,076 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:56:47,076 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:56:47,076 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:56:47,076 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:56:47,076 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:56:47,076 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:56:47,077 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:56:47,077 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:56:47,077 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:56:47,077 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:56:47,077 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:56:47,078 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:56:47,078 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:56:47,078 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:56:47,078 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:56:47,079 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:56:47,079 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:56:47,079 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:56:47,079 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:56:47,079 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:56:47,080 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:56:47,098 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-26 22:56:47,114 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-26 22:56:47,114 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-26 22:56:47,114 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-26 22:56:47,114 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-26 22:56:47,114 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-26 22:56:47,114 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-26 22:56:47,114 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-26 22:56:47,115 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-26 22:56:47,131 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 175 places, 212 transitions [2019-12-26 22:56:47,132 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 175 places, 212 transitions [2019-12-26 22:56:47,246 INFO L132 PetriNetUnfolder]: 47/209 cut-off events. [2019-12-26 22:56:47,246 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-26 22:56:47,266 INFO L76 FinitePrefix]: Finished finitePrefix Result has 219 conditions, 209 events. 47/209 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 437 event pairs. 0/160 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-26 22:56:47,288 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 175 places, 212 transitions [2019-12-26 22:56:47,363 INFO L132 PetriNetUnfolder]: 47/209 cut-off events. [2019-12-26 22:56:47,363 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-26 22:56:47,370 INFO L76 FinitePrefix]: Finished finitePrefix Result has 219 conditions, 209 events. 47/209 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 437 event pairs. 0/160 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-26 22:56:47,391 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 19004 [2019-12-26 22:56:47,393 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-26 22:56:53,039 WARN L192 SmtUtils]: Spent 241.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 87 [2019-12-26 22:56:53,170 WARN L192 SmtUtils]: Spent 128.00 ms on a formula simplification that was a NOOP. DAG size: 85 [2019-12-26 22:56:53,581 INFO L206 etLargeBlockEncoding]: Checked pairs total: 125946 [2019-12-26 22:56:53,582 INFO L214 etLargeBlockEncoding]: Total number of compositions: 121 [2019-12-26 22:56:53,587 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 92 places, 102 transitions [2019-12-26 22:57:12,241 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 111572 states. [2019-12-26 22:57:12,242 INFO L276 IsEmpty]: Start isEmpty. Operand 111572 states. [2019-12-26 22:57:12,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-26 22:57:12,247 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:57:12,248 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-26 22:57:12,248 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:57:12,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:57:12,253 INFO L82 PathProgramCache]: Analyzing trace with hash 912834, now seen corresponding path program 1 times [2019-12-26 22:57:12,262 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:57:12,262 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1525633273] [2019-12-26 22:57:12,263 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:57:12,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:57:12,462 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 22:57:12,462 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1525633273] [2019-12-26 22:57:12,463 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:57:12,463 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-26 22:57:12,464 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [103724861] [2019-12-26 22:57:12,468 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 22:57:12,468 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:57:12,480 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 22:57:12,481 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 22:57:12,482 INFO L87 Difference]: Start difference. First operand 111572 states. Second operand 3 states. [2019-12-26 22:57:15,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:57:15,446 INFO L93 Difference]: Finished difference Result 110910 states and 474711 transitions. [2019-12-26 22:57:15,446 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 22:57:15,448 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-26 22:57:15,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:57:16,034 INFO L225 Difference]: With dead ends: 110910 [2019-12-26 22:57:16,034 INFO L226 Difference]: Without dead ends: 98066 [2019-12-26 22:57:16,036 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 22:57:20,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98066 states. [2019-12-26 22:57:22,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98066 to 98066. [2019-12-26 22:57:22,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98066 states. [2019-12-26 22:57:26,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98066 states to 98066 states and 418629 transitions. [2019-12-26 22:57:26,989 INFO L78 Accepts]: Start accepts. Automaton has 98066 states and 418629 transitions. Word has length 3 [2019-12-26 22:57:26,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:57:26,989 INFO L462 AbstractCegarLoop]: Abstraction has 98066 states and 418629 transitions. [2019-12-26 22:57:26,990 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 22:57:26,990 INFO L276 IsEmpty]: Start isEmpty. Operand 98066 states and 418629 transitions. [2019-12-26 22:57:26,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-26 22:57:26,994 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:57:26,994 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 22:57:26,995 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:57:26,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:57:26,995 INFO L82 PathProgramCache]: Analyzing trace with hash 1027484309, now seen corresponding path program 1 times [2019-12-26 22:57:26,996 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:57:26,996 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [244458907] [2019-12-26 22:57:26,996 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:57:27,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:57:27,089 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 22:57:27,089 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [244458907] [2019-12-26 22:57:27,090 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:57:27,090 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 22:57:27,090 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [241432457] [2019-12-26 22:57:27,092 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-26 22:57:27,092 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:57:27,092 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-26 22:57:27,093 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-26 22:57:27,093 INFO L87 Difference]: Start difference. First operand 98066 states and 418629 transitions. Second operand 4 states. [2019-12-26 22:57:28,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:57:28,288 INFO L93 Difference]: Finished difference Result 156656 states and 639635 transitions. [2019-12-26 22:57:28,288 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-26 22:57:28,288 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-26 22:57:28,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:57:33,662 INFO L225 Difference]: With dead ends: 156656 [2019-12-26 22:57:33,662 INFO L226 Difference]: Without dead ends: 156558 [2019-12-26 22:57:33,663 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-26 22:57:38,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156558 states. [2019-12-26 22:57:41,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156558 to 142946. [2019-12-26 22:57:41,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142946 states. [2019-12-26 22:57:42,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142946 states to 142946 states and 591329 transitions. [2019-12-26 22:57:42,090 INFO L78 Accepts]: Start accepts. Automaton has 142946 states and 591329 transitions. Word has length 11 [2019-12-26 22:57:42,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:57:42,090 INFO L462 AbstractCegarLoop]: Abstraction has 142946 states and 591329 transitions. [2019-12-26 22:57:42,090 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-26 22:57:42,090 INFO L276 IsEmpty]: Start isEmpty. Operand 142946 states and 591329 transitions. [2019-12-26 22:57:42,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-26 22:57:42,098 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:57:42,098 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 22:57:42,098 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:57:42,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:57:42,099 INFO L82 PathProgramCache]: Analyzing trace with hash 1461043352, now seen corresponding path program 1 times [2019-12-26 22:57:42,099 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:57:42,099 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1542546566] [2019-12-26 22:57:42,099 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:57:42,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:57:42,176 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 22:57:42,176 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1542546566] [2019-12-26 22:57:42,176 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:57:42,176 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 22:57:42,177 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [462354114] [2019-12-26 22:57:42,177 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 22:57:42,177 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:57:42,178 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 22:57:42,178 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 22:57:42,178 INFO L87 Difference]: Start difference. First operand 142946 states and 591329 transitions. Second operand 3 states. [2019-12-26 22:57:42,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:57:42,307 INFO L93 Difference]: Finished difference Result 31386 states and 102018 transitions. [2019-12-26 22:57:42,307 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 22:57:42,307 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-26 22:57:42,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:57:42,364 INFO L225 Difference]: With dead ends: 31386 [2019-12-26 22:57:42,365 INFO L226 Difference]: Without dead ends: 31386 [2019-12-26 22:57:42,365 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 22:57:42,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31386 states. [2019-12-26 22:57:43,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31386 to 31386. [2019-12-26 22:57:43,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31386 states. [2019-12-26 22:57:44,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31386 states to 31386 states and 102018 transitions. [2019-12-26 22:57:44,060 INFO L78 Accepts]: Start accepts. Automaton has 31386 states and 102018 transitions. Word has length 13 [2019-12-26 22:57:44,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:57:44,060 INFO L462 AbstractCegarLoop]: Abstraction has 31386 states and 102018 transitions. [2019-12-26 22:57:44,061 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 22:57:44,061 INFO L276 IsEmpty]: Start isEmpty. Operand 31386 states and 102018 transitions. [2019-12-26 22:57:44,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-26 22:57:44,063 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:57:44,064 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 22:57:44,064 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:57:44,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:57:44,064 INFO L82 PathProgramCache]: Analyzing trace with hash -876468662, now seen corresponding path program 1 times [2019-12-26 22:57:44,065 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:57:44,065 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1085064023] [2019-12-26 22:57:44,065 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:57:44,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:57:44,207 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 22:57:44,207 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1085064023] [2019-12-26 22:57:44,211 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:57:44,211 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 22:57:44,211 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1857443489] [2019-12-26 22:57:44,212 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-26 22:57:44,212 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:57:44,212 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-26 22:57:44,212 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-26 22:57:44,213 INFO L87 Difference]: Start difference. First operand 31386 states and 102018 transitions. Second operand 5 states. [2019-12-26 22:57:44,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:57:44,685 INFO L93 Difference]: Finished difference Result 43205 states and 138515 transitions. [2019-12-26 22:57:44,685 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-26 22:57:44,686 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2019-12-26 22:57:44,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:57:44,784 INFO L225 Difference]: With dead ends: 43205 [2019-12-26 22:57:44,784 INFO L226 Difference]: Without dead ends: 43205 [2019-12-26 22:57:44,785 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-26 22:57:45,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43205 states. [2019-12-26 22:57:45,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43205 to 36470. [2019-12-26 22:57:45,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36470 states. [2019-12-26 22:57:45,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36470 states to 36470 states and 117941 transitions. [2019-12-26 22:57:45,496 INFO L78 Accepts]: Start accepts. Automaton has 36470 states and 117941 transitions. Word has length 16 [2019-12-26 22:57:45,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:57:45,497 INFO L462 AbstractCegarLoop]: Abstraction has 36470 states and 117941 transitions. [2019-12-26 22:57:45,497 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-26 22:57:45,498 INFO L276 IsEmpty]: Start isEmpty. Operand 36470 states and 117941 transitions. [2019-12-26 22:57:45,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-26 22:57:45,507 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:57:45,507 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 22:57:45,508 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:57:45,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:57:45,508 INFO L82 PathProgramCache]: Analyzing trace with hash -1783143627, now seen corresponding path program 1 times [2019-12-26 22:57:45,508 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:57:45,509 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [726835415] [2019-12-26 22:57:45,509 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:57:45,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:57:46,166 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 22:57:46,167 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [726835415] [2019-12-26 22:57:46,167 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:57:46,167 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-26 22:57:46,168 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1728822957] [2019-12-26 22:57:46,168 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-26 22:57:46,168 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:57:46,168 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-26 22:57:46,169 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-26 22:57:46,175 INFO L87 Difference]: Start difference. First operand 36470 states and 117941 transitions. Second operand 6 states. [2019-12-26 22:57:47,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:57:47,173 INFO L93 Difference]: Finished difference Result 56051 states and 176371 transitions. [2019-12-26 22:57:47,174 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-26 22:57:47,174 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2019-12-26 22:57:47,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:57:47,268 INFO L225 Difference]: With dead ends: 56051 [2019-12-26 22:57:47,269 INFO L226 Difference]: Without dead ends: 56037 [2019-12-26 22:57:47,269 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2019-12-26 22:57:47,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56037 states. [2019-12-26 22:57:48,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56037 to 37420. [2019-12-26 22:57:48,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37420 states. [2019-12-26 22:57:48,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37420 states to 37420 states and 120221 transitions. [2019-12-26 22:57:48,104 INFO L78 Accepts]: Start accepts. Automaton has 37420 states and 120221 transitions. Word has length 22 [2019-12-26 22:57:48,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:57:48,105 INFO L462 AbstractCegarLoop]: Abstraction has 37420 states and 120221 transitions. [2019-12-26 22:57:48,105 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-26 22:57:48,105 INFO L276 IsEmpty]: Start isEmpty. Operand 37420 states and 120221 transitions. [2019-12-26 22:57:48,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-26 22:57:48,120 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:57:48,120 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 22:57:48,120 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:57:48,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:57:48,121 INFO L82 PathProgramCache]: Analyzing trace with hash 1148876988, now seen corresponding path program 1 times [2019-12-26 22:57:48,121 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:57:48,121 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1965569269] [2019-12-26 22:57:48,121 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:57:48,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:57:48,186 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 22:57:48,186 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1965569269] [2019-12-26 22:57:48,186 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:57:48,187 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 22:57:48,187 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1946431440] [2019-12-26 22:57:48,187 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-26 22:57:48,187 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:57:48,188 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-26 22:57:48,188 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-26 22:57:48,188 INFO L87 Difference]: Start difference. First operand 37420 states and 120221 transitions. Second operand 4 states. [2019-12-26 22:57:48,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:57:48,561 INFO L93 Difference]: Finished difference Result 15281 states and 46378 transitions. [2019-12-26 22:57:48,561 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-26 22:57:48,561 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2019-12-26 22:57:48,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:57:48,584 INFO L225 Difference]: With dead ends: 15281 [2019-12-26 22:57:48,585 INFO L226 Difference]: Without dead ends: 15281 [2019-12-26 22:57:48,585 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-26 22:57:48,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15281 states. [2019-12-26 22:57:48,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15281 to 15023. [2019-12-26 22:57:48,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15023 states. [2019-12-26 22:57:48,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15023 states to 15023 states and 45642 transitions. [2019-12-26 22:57:48,817 INFO L78 Accepts]: Start accepts. Automaton has 15023 states and 45642 transitions. Word has length 25 [2019-12-26 22:57:48,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:57:48,817 INFO L462 AbstractCegarLoop]: Abstraction has 15023 states and 45642 transitions. [2019-12-26 22:57:48,817 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-26 22:57:48,817 INFO L276 IsEmpty]: Start isEmpty. Operand 15023 states and 45642 transitions. [2019-12-26 22:57:48,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-26 22:57:48,828 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:57:48,828 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 22:57:48,828 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:57:48,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:57:48,829 INFO L82 PathProgramCache]: Analyzing trace with hash -1026533913, now seen corresponding path program 1 times [2019-12-26 22:57:48,829 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:57:48,829 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [494690383] [2019-12-26 22:57:48,829 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:57:48,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:57:48,973 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 22:57:48,974 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [494690383] [2019-12-26 22:57:48,974 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:57:48,974 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-26 22:57:48,974 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1772881300] [2019-12-26 22:57:48,976 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-26 22:57:48,976 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:57:48,976 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-26 22:57:48,976 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-26 22:57:48,976 INFO L87 Difference]: Start difference. First operand 15023 states and 45642 transitions. Second operand 6 states. [2019-12-26 22:57:49,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:57:49,530 INFO L93 Difference]: Finished difference Result 21679 states and 63968 transitions. [2019-12-26 22:57:49,531 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-26 22:57:49,531 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2019-12-26 22:57:49,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:57:49,563 INFO L225 Difference]: With dead ends: 21679 [2019-12-26 22:57:49,563 INFO L226 Difference]: Without dead ends: 21679 [2019-12-26 22:57:49,563 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-12-26 22:57:49,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21679 states. [2019-12-26 22:57:49,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21679 to 17339. [2019-12-26 22:57:49,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17339 states. [2019-12-26 22:57:49,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17339 states to 17339 states and 52223 transitions. [2019-12-26 22:57:49,861 INFO L78 Accepts]: Start accepts. Automaton has 17339 states and 52223 transitions. Word has length 27 [2019-12-26 22:57:49,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:57:49,862 INFO L462 AbstractCegarLoop]: Abstraction has 17339 states and 52223 transitions. [2019-12-26 22:57:49,862 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-26 22:57:49,862 INFO L276 IsEmpty]: Start isEmpty. Operand 17339 states and 52223 transitions. [2019-12-26 22:57:49,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-26 22:57:49,879 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:57:49,880 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 22:57:49,880 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:57:49,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:57:49,880 INFO L82 PathProgramCache]: Analyzing trace with hash 1079552274, now seen corresponding path program 1 times [2019-12-26 22:57:49,880 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:57:49,880 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [335843716] [2019-12-26 22:57:49,880 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:57:49,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:57:49,967 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 22:57:49,967 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [335843716] [2019-12-26 22:57:49,967 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:57:49,967 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-26 22:57:49,968 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1551329944] [2019-12-26 22:57:49,968 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-26 22:57:49,968 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:57:49,969 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-26 22:57:49,969 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-26 22:57:49,969 INFO L87 Difference]: Start difference. First operand 17339 states and 52223 transitions. Second operand 7 states. [2019-12-26 22:57:51,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:57:51,203 INFO L93 Difference]: Finished difference Result 24589 states and 72044 transitions. [2019-12-26 22:57:51,204 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-26 22:57:51,204 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 33 [2019-12-26 22:57:51,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:57:51,237 INFO L225 Difference]: With dead ends: 24589 [2019-12-26 22:57:51,237 INFO L226 Difference]: Without dead ends: 24589 [2019-12-26 22:57:51,238 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=90, Invalid=252, Unknown=0, NotChecked=0, Total=342 [2019-12-26 22:57:51,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24589 states. [2019-12-26 22:57:51,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24589 to 16666. [2019-12-26 22:57:51,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16666 states. [2019-12-26 22:57:51,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16666 states to 16666 states and 50150 transitions. [2019-12-26 22:57:51,736 INFO L78 Accepts]: Start accepts. Automaton has 16666 states and 50150 transitions. Word has length 33 [2019-12-26 22:57:51,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:57:51,736 INFO L462 AbstractCegarLoop]: Abstraction has 16666 states and 50150 transitions. [2019-12-26 22:57:51,736 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-26 22:57:51,737 INFO L276 IsEmpty]: Start isEmpty. Operand 16666 states and 50150 transitions. [2019-12-26 22:57:51,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-26 22:57:51,758 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:57:51,759 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 22:57:51,759 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:57:51,759 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:57:51,759 INFO L82 PathProgramCache]: Analyzing trace with hash 1641373212, now seen corresponding path program 1 times [2019-12-26 22:57:51,760 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:57:51,760 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1909854752] [2019-12-26 22:57:51,760 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:57:51,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:57:51,842 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 22:57:51,842 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1909854752] [2019-12-26 22:57:51,843 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:57:51,843 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-26 22:57:51,843 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1422281502] [2019-12-26 22:57:51,843 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-26 22:57:51,844 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:57:51,844 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-26 22:57:51,844 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-26 22:57:51,844 INFO L87 Difference]: Start difference. First operand 16666 states and 50150 transitions. Second operand 5 states. [2019-12-26 22:57:52,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:57:52,458 INFO L93 Difference]: Finished difference Result 23224 states and 69393 transitions. [2019-12-26 22:57:52,458 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-26 22:57:52,459 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 39 [2019-12-26 22:57:52,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:57:52,494 INFO L225 Difference]: With dead ends: 23224 [2019-12-26 22:57:52,494 INFO L226 Difference]: Without dead ends: 23224 [2019-12-26 22:57:52,495 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-26 22:57:52,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23224 states. [2019-12-26 22:57:52,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23224 to 21703. [2019-12-26 22:57:52,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21703 states. [2019-12-26 22:57:52,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21703 states to 21703 states and 65239 transitions. [2019-12-26 22:57:52,832 INFO L78 Accepts]: Start accepts. Automaton has 21703 states and 65239 transitions. Word has length 39 [2019-12-26 22:57:52,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:57:52,832 INFO L462 AbstractCegarLoop]: Abstraction has 21703 states and 65239 transitions. [2019-12-26 22:57:52,832 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-26 22:57:52,832 INFO L276 IsEmpty]: Start isEmpty. Operand 21703 states and 65239 transitions. [2019-12-26 22:57:52,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-26 22:57:52,859 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:57:52,859 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 22:57:52,859 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:57:52,859 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:57:52,860 INFO L82 PathProgramCache]: Analyzing trace with hash -589002614, now seen corresponding path program 2 times [2019-12-26 22:57:52,860 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:57:52,860 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1167056701] [2019-12-26 22:57:52,860 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:57:52,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:57:52,916 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 22:57:52,916 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1167056701] [2019-12-26 22:57:52,916 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:57:52,916 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-26 22:57:52,917 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [931354156] [2019-12-26 22:57:52,917 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-26 22:57:52,917 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:57:52,917 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-26 22:57:52,918 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-26 22:57:52,918 INFO L87 Difference]: Start difference. First operand 21703 states and 65239 transitions. Second operand 5 states. [2019-12-26 22:57:53,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:57:53,025 INFO L93 Difference]: Finished difference Result 20476 states and 62395 transitions. [2019-12-26 22:57:53,025 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-26 22:57:53,025 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 39 [2019-12-26 22:57:53,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:57:53,067 INFO L225 Difference]: With dead ends: 20476 [2019-12-26 22:57:53,067 INFO L226 Difference]: Without dead ends: 20476 [2019-12-26 22:57:53,068 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-26 22:57:53,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20476 states. [2019-12-26 22:57:53,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20476 to 19636. [2019-12-26 22:57:53,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19636 states. [2019-12-26 22:57:53,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19636 states to 19636 states and 60128 transitions. [2019-12-26 22:57:53,477 INFO L78 Accepts]: Start accepts. Automaton has 19636 states and 60128 transitions. Word has length 39 [2019-12-26 22:57:53,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:57:53,477 INFO L462 AbstractCegarLoop]: Abstraction has 19636 states and 60128 transitions. [2019-12-26 22:57:53,477 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-26 22:57:53,478 INFO L276 IsEmpty]: Start isEmpty. Operand 19636 states and 60128 transitions. [2019-12-26 22:57:53,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-26 22:57:53,498 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:57:53,498 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 22:57:53,498 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:57:53,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:57:53,499 INFO L82 PathProgramCache]: Analyzing trace with hash -411911737, now seen corresponding path program 1 times [2019-12-26 22:57:53,499 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:57:53,499 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [585942340] [2019-12-26 22:57:53,499 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:57:53,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:57:53,552 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 22:57:53,552 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [585942340] [2019-12-26 22:57:53,552 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:57:53,553 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 22:57:53,553 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1554226485] [2019-12-26 22:57:53,553 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 22:57:53,553 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:57:53,554 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 22:57:53,554 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 22:57:53,554 INFO L87 Difference]: Start difference. First operand 19636 states and 60128 transitions. Second operand 3 states. [2019-12-26 22:57:53,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:57:53,859 INFO L93 Difference]: Finished difference Result 29371 states and 90040 transitions. [2019-12-26 22:57:53,859 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 22:57:53,859 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 64 [2019-12-26 22:57:53,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:57:53,900 INFO L225 Difference]: With dead ends: 29371 [2019-12-26 22:57:53,900 INFO L226 Difference]: Without dead ends: 29371 [2019-12-26 22:57:53,903 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 22:57:54,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29371 states. [2019-12-26 22:57:54,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29371 to 22257. [2019-12-26 22:57:54,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22257 states. [2019-12-26 22:57:54,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22257 states to 22257 states and 68986 transitions. [2019-12-26 22:57:54,317 INFO L78 Accepts]: Start accepts. Automaton has 22257 states and 68986 transitions. Word has length 64 [2019-12-26 22:57:54,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:57:54,318 INFO L462 AbstractCegarLoop]: Abstraction has 22257 states and 68986 transitions. [2019-12-26 22:57:54,318 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 22:57:54,318 INFO L276 IsEmpty]: Start isEmpty. Operand 22257 states and 68986 transitions. [2019-12-26 22:57:54,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-26 22:57:54,342 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:57:54,342 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 22:57:54,342 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:57:54,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:57:54,342 INFO L82 PathProgramCache]: Analyzing trace with hash 190415677, now seen corresponding path program 1 times [2019-12-26 22:57:54,343 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:57:54,343 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1184709527] [2019-12-26 22:57:54,343 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:57:54,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:57:54,419 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 22:57:54,419 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1184709527] [2019-12-26 22:57:54,419 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:57:54,420 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 22:57:54,420 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [460332716] [2019-12-26 22:57:54,420 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-26 22:57:54,420 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:57:54,421 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-26 22:57:54,421 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-26 22:57:54,421 INFO L87 Difference]: Start difference. First operand 22257 states and 68986 transitions. Second operand 4 states. [2019-12-26 22:57:54,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:57:54,598 INFO L93 Difference]: Finished difference Result 41807 states and 129823 transitions. [2019-12-26 22:57:54,598 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-26 22:57:54,598 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 64 [2019-12-26 22:57:54,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:57:54,643 INFO L225 Difference]: With dead ends: 41807 [2019-12-26 22:57:54,643 INFO L226 Difference]: Without dead ends: 20833 [2019-12-26 22:57:54,643 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-26 22:57:54,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20833 states. [2019-12-26 22:57:54,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20833 to 20833. [2019-12-26 22:57:54,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20833 states. [2019-12-26 22:57:54,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20833 states to 20833 states and 64483 transitions. [2019-12-26 22:57:54,985 INFO L78 Accepts]: Start accepts. Automaton has 20833 states and 64483 transitions. Word has length 64 [2019-12-26 22:57:54,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:57:54,986 INFO L462 AbstractCegarLoop]: Abstraction has 20833 states and 64483 transitions. [2019-12-26 22:57:54,986 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-26 22:57:54,986 INFO L276 IsEmpty]: Start isEmpty. Operand 20833 states and 64483 transitions. [2019-12-26 22:57:55,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-26 22:57:55,015 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:57:55,016 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 22:57:55,016 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:57:55,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:57:55,016 INFO L82 PathProgramCache]: Analyzing trace with hash -1559426519, now seen corresponding path program 2 times [2019-12-26 22:57:55,016 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:57:55,017 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1734966660] [2019-12-26 22:57:55,017 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:57:55,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:57:55,103 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 22:57:55,103 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1734966660] [2019-12-26 22:57:55,103 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:57:55,103 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-26 22:57:55,104 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1737351450] [2019-12-26 22:57:55,104 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-26 22:57:55,104 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:57:55,104 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-26 22:57:55,105 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-26 22:57:55,105 INFO L87 Difference]: Start difference. First operand 20833 states and 64483 transitions. Second operand 7 states. [2019-12-26 22:57:55,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:57:55,656 INFO L93 Difference]: Finished difference Result 61323 states and 187457 transitions. [2019-12-26 22:57:55,656 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-26 22:57:55,656 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 64 [2019-12-26 22:57:55,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:57:56,059 INFO L225 Difference]: With dead ends: 61323 [2019-12-26 22:57:56,059 INFO L226 Difference]: Without dead ends: 42147 [2019-12-26 22:57:56,059 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2019-12-26 22:57:56,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42147 states. [2019-12-26 22:57:56,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42147 to 23713. [2019-12-26 22:57:56,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23713 states. [2019-12-26 22:57:56,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23713 states to 23713 states and 73274 transitions. [2019-12-26 22:57:56,529 INFO L78 Accepts]: Start accepts. Automaton has 23713 states and 73274 transitions. Word has length 64 [2019-12-26 22:57:56,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:57:56,530 INFO L462 AbstractCegarLoop]: Abstraction has 23713 states and 73274 transitions. [2019-12-26 22:57:56,530 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-26 22:57:56,530 INFO L276 IsEmpty]: Start isEmpty. Operand 23713 states and 73274 transitions. [2019-12-26 22:57:56,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-26 22:57:56,554 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:57:56,554 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 22:57:56,554 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:57:56,554 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:57:56,554 INFO L82 PathProgramCache]: Analyzing trace with hash 1388462743, now seen corresponding path program 3 times [2019-12-26 22:57:56,554 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:57:56,555 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [145210983] [2019-12-26 22:57:56,555 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:57:56,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:57:56,642 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 22:57:56,642 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [145210983] [2019-12-26 22:57:56,643 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:57:56,643 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-26 22:57:56,643 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [843058577] [2019-12-26 22:57:56,643 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-26 22:57:56,643 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:57:56,644 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-26 22:57:56,644 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-26 22:57:56,644 INFO L87 Difference]: Start difference. First operand 23713 states and 73274 transitions. Second operand 7 states. [2019-12-26 22:57:57,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:57:57,170 INFO L93 Difference]: Finished difference Result 68574 states and 211095 transitions. [2019-12-26 22:57:57,170 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-26 22:57:57,170 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 64 [2019-12-26 22:57:57,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:57:57,244 INFO L225 Difference]: With dead ends: 68574 [2019-12-26 22:57:57,244 INFO L226 Difference]: Without dead ends: 51641 [2019-12-26 22:57:57,244 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=53, Invalid=157, Unknown=0, NotChecked=0, Total=210 [2019-12-26 22:57:57,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51641 states. [2019-12-26 22:57:58,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51641 to 27716. [2019-12-26 22:57:58,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27716 states. [2019-12-26 22:57:58,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27716 states to 27716 states and 86140 transitions. [2019-12-26 22:57:58,252 INFO L78 Accepts]: Start accepts. Automaton has 27716 states and 86140 transitions. Word has length 64 [2019-12-26 22:57:58,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:57:58,252 INFO L462 AbstractCegarLoop]: Abstraction has 27716 states and 86140 transitions. [2019-12-26 22:57:58,252 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-26 22:57:58,252 INFO L276 IsEmpty]: Start isEmpty. Operand 27716 states and 86140 transitions. [2019-12-26 22:57:58,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-26 22:57:58,281 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:57:58,282 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 22:57:58,282 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:57:58,282 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:57:58,282 INFO L82 PathProgramCache]: Analyzing trace with hash -317627445, now seen corresponding path program 4 times [2019-12-26 22:57:58,282 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:57:58,282 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1876678964] [2019-12-26 22:57:58,282 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:57:58,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:57:58,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-26 22:57:58,375 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1876678964] [2019-12-26 22:57:58,375 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:57:58,376 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-26 22:57:58,376 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1661864643] [2019-12-26 22:57:58,376 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-26 22:57:58,376 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:57:58,376 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-26 22:57:58,377 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-26 22:57:58,377 INFO L87 Difference]: Start difference. First operand 27716 states and 86140 transitions. Second operand 7 states. [2019-12-26 22:57:58,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:57:58,871 INFO L93 Difference]: Finished difference Result 58876 states and 180784 transitions. [2019-12-26 22:57:58,872 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-26 22:57:58,872 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 64 [2019-12-26 22:57:58,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:57:58,965 INFO L225 Difference]: With dead ends: 58876 [2019-12-26 22:57:58,965 INFO L226 Difference]: Without dead ends: 51661 [2019-12-26 22:57:58,966 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2019-12-26 22:57:59,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51661 states. [2019-12-26 22:57:59,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51661 to 28024. [2019-12-26 22:57:59,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28024 states. [2019-12-26 22:57:59,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28024 states to 28024 states and 87091 transitions. [2019-12-26 22:57:59,607 INFO L78 Accepts]: Start accepts. Automaton has 28024 states and 87091 transitions. Word has length 64 [2019-12-26 22:57:59,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:57:59,608 INFO L462 AbstractCegarLoop]: Abstraction has 28024 states and 87091 transitions. [2019-12-26 22:57:59,608 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-26 22:57:59,608 INFO L276 IsEmpty]: Start isEmpty. Operand 28024 states and 87091 transitions. [2019-12-26 22:57:59,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-26 22:57:59,640 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:57:59,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] [2019-12-26 22:57:59,640 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:57:59,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:57:59,640 INFO L82 PathProgramCache]: Analyzing trace with hash -1087297877, now seen corresponding path program 5 times [2019-12-26 22:57:59,640 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:57:59,640 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [141696190] [2019-12-26 22:57:59,641 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:57:59,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:57:59,701 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 22:57:59,701 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [141696190] [2019-12-26 22:57:59,701 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:57:59,701 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 22:57:59,702 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [125989535] [2019-12-26 22:57:59,702 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 22:57:59,702 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:57:59,702 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 22:57:59,703 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 22:57:59,703 INFO L87 Difference]: Start difference. First operand 28024 states and 87091 transitions. Second operand 3 states. [2019-12-26 22:57:59,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:57:59,863 INFO L93 Difference]: Finished difference Result 33789 states and 104171 transitions. [2019-12-26 22:57:59,863 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 22:57:59,863 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 64 [2019-12-26 22:57:59,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:57:59,910 INFO L225 Difference]: With dead ends: 33789 [2019-12-26 22:57:59,910 INFO L226 Difference]: Without dead ends: 33789 [2019-12-26 22:57:59,911 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 22:58:00,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33789 states. [2019-12-26 22:58:00,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33789 to 29603. [2019-12-26 22:58:00,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29603 states. [2019-12-26 22:58:00,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29603 states to 29603 states and 91943 transitions. [2019-12-26 22:58:00,661 INFO L78 Accepts]: Start accepts. Automaton has 29603 states and 91943 transitions. Word has length 64 [2019-12-26 22:58:00,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:58:00,661 INFO L462 AbstractCegarLoop]: Abstraction has 29603 states and 91943 transitions. [2019-12-26 22:58:00,661 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 22:58:00,662 INFO L276 IsEmpty]: Start isEmpty. Operand 29603 states and 91943 transitions. [2019-12-26 22:58:00,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-26 22:58:00,692 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:58:00,692 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 22:58:00,693 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:58:00,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:58:00,693 INFO L82 PathProgramCache]: Analyzing trace with hash -181535548, now seen corresponding path program 1 times [2019-12-26 22:58:00,693 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:58:00,693 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2087793550] [2019-12-26 22:58:00,694 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:58:00,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:58:00,750 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 22:58:00,751 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2087793550] [2019-12-26 22:58:00,751 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:58:00,751 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-26 22:58:00,751 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [69758442] [2019-12-26 22:58:00,752 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-26 22:58:00,752 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:58:00,752 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-26 22:58:00,752 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-26 22:58:00,752 INFO L87 Difference]: Start difference. First operand 29603 states and 91943 transitions. Second operand 4 states. [2019-12-26 22:58:01,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:58:01,248 INFO L93 Difference]: Finished difference Result 45817 states and 143094 transitions. [2019-12-26 22:58:01,248 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-26 22:58:01,248 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 65 [2019-12-26 22:58:01,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:58:01,360 INFO L225 Difference]: With dead ends: 45817 [2019-12-26 22:58:01,360 INFO L226 Difference]: Without dead ends: 45817 [2019-12-26 22:58:01,361 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-26 22:58:01,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45817 states. [2019-12-26 22:58:02,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45817 to 31959. [2019-12-26 22:58:02,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31959 states. [2019-12-26 22:58:02,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31959 states to 31959 states and 100397 transitions. [2019-12-26 22:58:02,165 INFO L78 Accepts]: Start accepts. Automaton has 31959 states and 100397 transitions. Word has length 65 [2019-12-26 22:58:02,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:58:02,165 INFO L462 AbstractCegarLoop]: Abstraction has 31959 states and 100397 transitions. [2019-12-26 22:58:02,165 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-26 22:58:02,165 INFO L276 IsEmpty]: Start isEmpty. Operand 31959 states and 100397 transitions. [2019-12-26 22:58:02,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-26 22:58:02,202 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:58:02,202 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 22:58:02,202 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:58:02,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:58:02,202 INFO L82 PathProgramCache]: Analyzing trace with hash -701292531, now seen corresponding path program 1 times [2019-12-26 22:58:02,203 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:58:02,203 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1338480701] [2019-12-26 22:58:02,203 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:58:02,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:58:02,279 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 22:58:02,279 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1338480701] [2019-12-26 22:58:02,279 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:58:02,279 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-26 22:58:02,280 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1147149679] [2019-12-26 22:58:02,280 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-26 22:58:02,280 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:58:02,280 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-26 22:58:02,281 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-26 22:58:02,281 INFO L87 Difference]: Start difference. First operand 31959 states and 100397 transitions. Second operand 7 states. [2019-12-26 22:58:03,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:58:03,185 INFO L93 Difference]: Finished difference Result 69632 states and 216004 transitions. [2019-12-26 22:58:03,186 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-26 22:58:03,186 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 65 [2019-12-26 22:58:03,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:58:03,285 INFO L225 Difference]: With dead ends: 69632 [2019-12-26 22:58:03,285 INFO L226 Difference]: Without dead ends: 63631 [2019-12-26 22:58:03,286 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2019-12-26 22:58:03,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63631 states. [2019-12-26 22:58:03,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63631 to 31991. [2019-12-26 22:58:03,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31991 states. [2019-12-26 22:58:04,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31991 states to 31991 states and 100515 transitions. [2019-12-26 22:58:04,014 INFO L78 Accepts]: Start accepts. Automaton has 31991 states and 100515 transitions. Word has length 65 [2019-12-26 22:58:04,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:58:04,015 INFO L462 AbstractCegarLoop]: Abstraction has 31991 states and 100515 transitions. [2019-12-26 22:58:04,015 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-26 22:58:04,015 INFO L276 IsEmpty]: Start isEmpty. Operand 31991 states and 100515 transitions. [2019-12-26 22:58:04,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-26 22:58:04,052 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:58:04,052 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 22:58:04,052 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:58:04,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:58:04,052 INFO L82 PathProgramCache]: Analyzing trace with hash -1336640005, now seen corresponding path program 2 times [2019-12-26 22:58:04,052 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:58:04,052 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [24877243] [2019-12-26 22:58:04,053 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:58:04,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:58:04,171 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 22:58:04,172 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [24877243] [2019-12-26 22:58:04,172 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:58:04,172 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-26 22:58:04,172 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [710104114] [2019-12-26 22:58:04,173 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-26 22:58:04,173 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:58:04,173 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-26 22:58:04,173 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-12-26 22:58:04,173 INFO L87 Difference]: Start difference. First operand 31991 states and 100515 transitions. Second operand 7 states. [2019-12-26 22:58:05,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:58:05,043 INFO L93 Difference]: Finished difference Result 44848 states and 139960 transitions. [2019-12-26 22:58:05,043 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-26 22:58:05,044 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 65 [2019-12-26 22:58:05,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:58:05,112 INFO L225 Difference]: With dead ends: 44848 [2019-12-26 22:58:05,112 INFO L226 Difference]: Without dead ends: 44844 [2019-12-26 22:58:05,113 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2019-12-26 22:58:05,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44844 states. [2019-12-26 22:58:06,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44844 to 32249. [2019-12-26 22:58:06,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32249 states. [2019-12-26 22:58:06,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32249 states to 32249 states and 99750 transitions. [2019-12-26 22:58:06,150 INFO L78 Accepts]: Start accepts. Automaton has 32249 states and 99750 transitions. Word has length 65 [2019-12-26 22:58:06,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:58:06,150 INFO L462 AbstractCegarLoop]: Abstraction has 32249 states and 99750 transitions. [2019-12-26 22:58:06,150 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-26 22:58:06,150 INFO L276 IsEmpty]: Start isEmpty. Operand 32249 states and 99750 transitions. [2019-12-26 22:58:06,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-26 22:58:06,187 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:58:06,187 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 22:58:06,187 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:58:06,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:58:06,187 INFO L82 PathProgramCache]: Analyzing trace with hash -152741241, now seen corresponding path program 1 times [2019-12-26 22:58:06,187 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:58:06,187 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1077548809] [2019-12-26 22:58:06,187 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:58:06,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:58:06,232 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 22:58:06,232 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1077548809] [2019-12-26 22:58:06,233 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:58:06,233 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 22:58:06,233 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1337448439] [2019-12-26 22:58:06,233 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 22:58:06,234 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:58:06,234 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 22:58:06,234 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 22:58:06,234 INFO L87 Difference]: Start difference. First operand 32249 states and 99750 transitions. Second operand 3 states. [2019-12-26 22:58:06,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:58:06,473 INFO L93 Difference]: Finished difference Result 43160 states and 132643 transitions. [2019-12-26 22:58:06,473 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 22:58:06,473 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-26 22:58:06,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:58:06,537 INFO L225 Difference]: With dead ends: 43160 [2019-12-26 22:58:06,537 INFO L226 Difference]: Without dead ends: 43160 [2019-12-26 22:58:06,538 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 22:58:06,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43160 states. [2019-12-26 22:58:07,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43160 to 32489. [2019-12-26 22:58:07,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32489 states. [2019-12-26 22:58:07,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32489 states to 32489 states and 100545 transitions. [2019-12-26 22:58:07,119 INFO L78 Accepts]: Start accepts. Automaton has 32489 states and 100545 transitions. Word has length 65 [2019-12-26 22:58:07,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:58:07,120 INFO L462 AbstractCegarLoop]: Abstraction has 32489 states and 100545 transitions. [2019-12-26 22:58:07,120 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 22:58:07,120 INFO L276 IsEmpty]: Start isEmpty. Operand 32489 states and 100545 transitions. [2019-12-26 22:58:07,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-26 22:58:07,155 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:58:07,155 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 22:58:07,155 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:58:07,155 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:58:07,155 INFO L82 PathProgramCache]: Analyzing trace with hash -422803263, now seen corresponding path program 2 times [2019-12-26 22:58:07,156 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:58:07,156 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [427076020] [2019-12-26 22:58:07,156 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:58:07,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:58:07,254 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 22:58:07,254 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [427076020] [2019-12-26 22:58:07,254 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:58:07,255 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-26 22:58:07,255 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [744943580] [2019-12-26 22:58:07,256 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-26 22:58:07,256 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:58:07,256 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-26 22:58:07,256 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-26 22:58:07,256 INFO L87 Difference]: Start difference. First operand 32489 states and 100545 transitions. Second operand 7 states. [2019-12-26 22:58:07,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:58:07,889 INFO L93 Difference]: Finished difference Result 52071 states and 162140 transitions. [2019-12-26 22:58:07,889 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-26 22:58:07,889 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 65 [2019-12-26 22:58:07,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:58:07,971 INFO L225 Difference]: With dead ends: 52071 [2019-12-26 22:58:07,971 INFO L226 Difference]: Without dead ends: 52071 [2019-12-26 22:58:07,971 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2019-12-26 22:58:08,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52071 states. [2019-12-26 22:58:08,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52071 to 33507. [2019-12-26 22:58:08,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33507 states. [2019-12-26 22:58:08,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33507 states to 33507 states and 103713 transitions. [2019-12-26 22:58:08,996 INFO L78 Accepts]: Start accepts. Automaton has 33507 states and 103713 transitions. Word has length 65 [2019-12-26 22:58:08,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:58:08,996 INFO L462 AbstractCegarLoop]: Abstraction has 33507 states and 103713 transitions. [2019-12-26 22:58:08,997 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-26 22:58:08,997 INFO L276 IsEmpty]: Start isEmpty. Operand 33507 states and 103713 transitions. [2019-12-26 22:58:09,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-26 22:58:09,033 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:58:09,034 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 22:58:09,034 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:58:09,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:58:09,034 INFO L82 PathProgramCache]: Analyzing trace with hash 1008271868, now seen corresponding path program 1 times [2019-12-26 22:58:09,034 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:58:09,035 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [647695575] [2019-12-26 22:58:09,035 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:58:09,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:58:09,090 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 22:58:09,091 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [647695575] [2019-12-26 22:58:09,091 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:58:09,091 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 22:58:09,091 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1881582696] [2019-12-26 22:58:09,092 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-26 22:58:09,092 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:58:09,092 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-26 22:58:09,092 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-26 22:58:09,092 INFO L87 Difference]: Start difference. First operand 33507 states and 103713 transitions. Second operand 4 states. [2019-12-26 22:58:09,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:58:09,311 INFO L93 Difference]: Finished difference Result 33507 states and 103505 transitions. [2019-12-26 22:58:09,311 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-26 22:58:09,311 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 65 [2019-12-26 22:58:09,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:58:09,399 INFO L225 Difference]: With dead ends: 33507 [2019-12-26 22:58:09,400 INFO L226 Difference]: Without dead ends: 33507 [2019-12-26 22:58:09,406 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-26 22:58:09,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33507 states. [2019-12-26 22:58:10,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33507 to 28069. [2019-12-26 22:58:10,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28069 states. [2019-12-26 22:58:10,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28069 states to 28069 states and 85930 transitions. [2019-12-26 22:58:10,154 INFO L78 Accepts]: Start accepts. Automaton has 28069 states and 85930 transitions. Word has length 65 [2019-12-26 22:58:10,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:58:10,154 INFO L462 AbstractCegarLoop]: Abstraction has 28069 states and 85930 transitions. [2019-12-26 22:58:10,154 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-26 22:58:10,154 INFO L276 IsEmpty]: Start isEmpty. Operand 28069 states and 85930 transitions. [2019-12-26 22:58:10,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-26 22:58:10,185 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:58:10,185 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 22:58:10,186 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:58:10,186 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:58:10,186 INFO L82 PathProgramCache]: Analyzing trace with hash 148182117, now seen corresponding path program 1 times [2019-12-26 22:58:10,186 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:58:10,186 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1155971804] [2019-12-26 22:58:10,186 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:58:10,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:58:10,264 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 22:58:10,265 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1155971804] [2019-12-26 22:58:10,265 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:58:10,265 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-26 22:58:10,265 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1259096138] [2019-12-26 22:58:10,267 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-26 22:58:10,267 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:58:10,268 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-26 22:58:10,268 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-26 22:58:10,268 INFO L87 Difference]: Start difference. First operand 28069 states and 85930 transitions. Second operand 5 states. [2019-12-26 22:58:10,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:58:10,965 INFO L93 Difference]: Finished difference Result 40500 states and 121827 transitions. [2019-12-26 22:58:10,965 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-26 22:58:10,965 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 65 [2019-12-26 22:58:10,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:58:11,065 INFO L225 Difference]: With dead ends: 40500 [2019-12-26 22:58:11,065 INFO L226 Difference]: Without dead ends: 40276 [2019-12-26 22:58:11,066 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-26 22:58:11,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40276 states. [2019-12-26 22:58:12,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40276 to 32300. [2019-12-26 22:58:12,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32300 states. [2019-12-26 22:58:12,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32300 states to 32300 states and 98642 transitions. [2019-12-26 22:58:12,430 INFO L78 Accepts]: Start accepts. Automaton has 32300 states and 98642 transitions. Word has length 65 [2019-12-26 22:58:12,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:58:12,430 INFO L462 AbstractCegarLoop]: Abstraction has 32300 states and 98642 transitions. [2019-12-26 22:58:12,430 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-26 22:58:12,430 INFO L276 IsEmpty]: Start isEmpty. Operand 32300 states and 98642 transitions. [2019-12-26 22:58:12,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-26 22:58:12,480 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:58:12,481 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 22:58:12,481 INFO L410 AbstractCegarLoop]: === Iteration 24 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:58:12,481 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:58:12,481 INFO L82 PathProgramCache]: Analyzing trace with hash -272998531, now seen corresponding path program 2 times [2019-12-26 22:58:12,481 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:58:12,482 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [432494019] [2019-12-26 22:58:12,482 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:58:12,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:58:12,645 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 22:58:12,645 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [432494019] [2019-12-26 22:58:12,645 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:58:12,645 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-26 22:58:12,646 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [214300176] [2019-12-26 22:58:12,647 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-26 22:58:12,647 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:58:12,648 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-26 22:58:12,648 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-12-26 22:58:12,648 INFO L87 Difference]: Start difference. First operand 32300 states and 98642 transitions. Second operand 9 states. [2019-12-26 22:58:14,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:58:14,259 INFO L93 Difference]: Finished difference Result 49096 states and 148270 transitions. [2019-12-26 22:58:14,260 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-26 22:58:14,260 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 65 [2019-12-26 22:58:14,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:58:14,332 INFO L225 Difference]: With dead ends: 49096 [2019-12-26 22:58:14,332 INFO L226 Difference]: Without dead ends: 49000 [2019-12-26 22:58:14,333 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 3 SyntacticMatches, 4 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=74, Invalid=198, Unknown=0, NotChecked=0, Total=272 [2019-12-26 22:58:14,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49000 states. [2019-12-26 22:58:14,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49000 to 33469. [2019-12-26 22:58:14,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33469 states. [2019-12-26 22:58:14,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33469 states to 33469 states and 102034 transitions. [2019-12-26 22:58:14,968 INFO L78 Accepts]: Start accepts. Automaton has 33469 states and 102034 transitions. Word has length 65 [2019-12-26 22:58:14,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:58:14,968 INFO L462 AbstractCegarLoop]: Abstraction has 33469 states and 102034 transitions. [2019-12-26 22:58:14,969 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-26 22:58:14,969 INFO L276 IsEmpty]: Start isEmpty. Operand 33469 states and 102034 transitions. [2019-12-26 22:58:15,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-26 22:58:15,006 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:58:15,006 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 22:58:15,006 INFO L410 AbstractCegarLoop]: === Iteration 25 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:58:15,006 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:58:15,007 INFO L82 PathProgramCache]: Analyzing trace with hash 312846933, now seen corresponding path program 3 times [2019-12-26 22:58:15,007 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:58:15,007 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1258110263] [2019-12-26 22:58:15,007 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:58:15,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:58:15,213 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 22:58:15,213 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1258110263] [2019-12-26 22:58:15,213 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:58:15,213 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-12-26 22:58:15,214 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1199093367] [2019-12-26 22:58:15,214 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-26 22:58:15,214 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:58:15,214 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-26 22:58:15,215 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2019-12-26 22:58:15,215 INFO L87 Difference]: Start difference. First operand 33469 states and 102034 transitions. Second operand 12 states. [2019-12-26 22:58:17,142 WARN L192 SmtUtils]: Spent 258.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2019-12-26 22:58:18,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:58:18,557 INFO L93 Difference]: Finished difference Result 53177 states and 159246 transitions. [2019-12-26 22:58:18,558 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-12-26 22:58:18,558 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 65 [2019-12-26 22:58:18,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:58:18,636 INFO L225 Difference]: With dead ends: 53177 [2019-12-26 22:58:18,636 INFO L226 Difference]: Without dead ends: 52869 [2019-12-26 22:58:18,637 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 2 SyntacticMatches, 4 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 239 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=231, Invalid=891, Unknown=0, NotChecked=0, Total=1122 [2019-12-26 22:58:18,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52869 states. [2019-12-26 22:58:19,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52869 to 36360. [2019-12-26 22:58:19,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36360 states. [2019-12-26 22:58:19,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36360 states to 36360 states and 110560 transitions. [2019-12-26 22:58:19,341 INFO L78 Accepts]: Start accepts. Automaton has 36360 states and 110560 transitions. Word has length 65 [2019-12-26 22:58:19,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:58:19,342 INFO L462 AbstractCegarLoop]: Abstraction has 36360 states and 110560 transitions. [2019-12-26 22:58:19,342 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-26 22:58:19,342 INFO L276 IsEmpty]: Start isEmpty. Operand 36360 states and 110560 transitions. [2019-12-26 22:58:19,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-26 22:58:19,383 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:58:19,383 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 22:58:19,383 INFO L410 AbstractCegarLoop]: === Iteration 26 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:58:19,383 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:58:19,383 INFO L82 PathProgramCache]: Analyzing trace with hash -1178106421, now seen corresponding path program 4 times [2019-12-26 22:58:19,384 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:58:19,384 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2036345946] [2019-12-26 22:58:19,384 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:58:19,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:58:19,444 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 22:58:19,444 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2036345946] [2019-12-26 22:58:19,444 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:58:19,445 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 22:58:19,445 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1012627030] [2019-12-26 22:58:19,445 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 22:58:19,445 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:58:19,446 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 22:58:19,446 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 22:58:19,446 INFO L87 Difference]: Start difference. First operand 36360 states and 110560 transitions. Second operand 3 states. [2019-12-26 22:58:19,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:58:19,576 INFO L93 Difference]: Finished difference Result 28637 states and 86093 transitions. [2019-12-26 22:58:19,577 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 22:58:19,577 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-26 22:58:19,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:58:19,629 INFO L225 Difference]: With dead ends: 28637 [2019-12-26 22:58:19,629 INFO L226 Difference]: Without dead ends: 28637 [2019-12-26 22:58:19,630 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 22:58:19,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28637 states. [2019-12-26 22:58:20,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28637 to 27897. [2019-12-26 22:58:20,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27897 states. [2019-12-26 22:58:20,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27897 states to 27897 states and 83745 transitions. [2019-12-26 22:58:20,076 INFO L78 Accepts]: Start accepts. Automaton has 27897 states and 83745 transitions. Word has length 65 [2019-12-26 22:58:20,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:58:20,076 INFO L462 AbstractCegarLoop]: Abstraction has 27897 states and 83745 transitions. [2019-12-26 22:58:20,076 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 22:58:20,076 INFO L276 IsEmpty]: Start isEmpty. Operand 27897 states and 83745 transitions. [2019-12-26 22:58:20,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-26 22:58:20,103 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:58:20,103 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 22:58:20,103 INFO L410 AbstractCegarLoop]: === Iteration 27 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:58:20,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:58:20,104 INFO L82 PathProgramCache]: Analyzing trace with hash 587293515, now seen corresponding path program 1 times [2019-12-26 22:58:20,104 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:58:20,104 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1014050441] [2019-12-26 22:58:20,104 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:58:20,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:58:20,158 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 22:58:20,158 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1014050441] [2019-12-26 22:58:20,158 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:58:20,158 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 22:58:20,159 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [733766786] [2019-12-26 22:58:20,159 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 22:58:20,159 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:58:20,160 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 22:58:20,160 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 22:58:20,160 INFO L87 Difference]: Start difference. First operand 27897 states and 83745 transitions. Second operand 3 states. [2019-12-26 22:58:20,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:58:20,551 INFO L93 Difference]: Finished difference Result 27897 states and 83744 transitions. [2019-12-26 22:58:20,551 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 22:58:20,552 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-12-26 22:58:20,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:58:20,602 INFO L225 Difference]: With dead ends: 27897 [2019-12-26 22:58:20,602 INFO L226 Difference]: Without dead ends: 27897 [2019-12-26 22:58:20,603 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 22:58:20,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27897 states. [2019-12-26 22:58:20,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27897 to 22261. [2019-12-26 22:58:20,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22261 states. [2019-12-26 22:58:20,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22261 states to 22261 states and 67922 transitions. [2019-12-26 22:58:20,993 INFO L78 Accepts]: Start accepts. Automaton has 22261 states and 67922 transitions. Word has length 66 [2019-12-26 22:58:20,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:58:20,994 INFO L462 AbstractCegarLoop]: Abstraction has 22261 states and 67922 transitions. [2019-12-26 22:58:20,994 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 22:58:20,994 INFO L276 IsEmpty]: Start isEmpty. Operand 22261 states and 67922 transitions. [2019-12-26 22:58:21,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-26 22:58:21,015 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:58:21,015 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 22:58:21,015 INFO L410 AbstractCegarLoop]: === Iteration 28 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:58:21,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:58:21,015 INFO L82 PathProgramCache]: Analyzing trace with hash -2007326845, now seen corresponding path program 1 times [2019-12-26 22:58:21,015 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:58:21,015 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [187795558] [2019-12-26 22:58:21,016 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:58:21,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:58:21,192 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 22:58:21,192 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [187795558] [2019-12-26 22:58:21,192 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:58:21,192 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-26 22:58:21,193 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2073883732] [2019-12-26 22:58:21,193 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-26 22:58:21,193 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:58:21,193 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-26 22:58:21,194 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-26 22:58:21,194 INFO L87 Difference]: Start difference. First operand 22261 states and 67922 transitions. Second operand 11 states. [2019-12-26 22:58:22,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:58:22,556 INFO L93 Difference]: Finished difference Result 46687 states and 142559 transitions. [2019-12-26 22:58:22,556 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-12-26 22:58:22,556 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 67 [2019-12-26 22:58:22,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:58:22,605 INFO L225 Difference]: With dead ends: 46687 [2019-12-26 22:58:22,606 INFO L226 Difference]: Without dead ends: 34941 [2019-12-26 22:58:22,606 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 241 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=203, Invalid=853, Unknown=0, NotChecked=0, Total=1056 [2019-12-26 22:58:22,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34941 states. [2019-12-26 22:58:22,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34941 to 22177. [2019-12-26 22:58:22,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22177 states. [2019-12-26 22:58:23,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22177 states to 22177 states and 67008 transitions. [2019-12-26 22:58:23,036 INFO L78 Accepts]: Start accepts. Automaton has 22177 states and 67008 transitions. Word has length 67 [2019-12-26 22:58:23,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:58:23,036 INFO L462 AbstractCegarLoop]: Abstraction has 22177 states and 67008 transitions. [2019-12-26 22:58:23,036 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-26 22:58:23,037 INFO L276 IsEmpty]: Start isEmpty. Operand 22177 states and 67008 transitions. [2019-12-26 22:58:23,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-26 22:58:23,061 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:58:23,061 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 22:58:23,061 INFO L410 AbstractCegarLoop]: === Iteration 29 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:58:23,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:58:23,061 INFO L82 PathProgramCache]: Analyzing trace with hash -1156108883, now seen corresponding path program 2 times [2019-12-26 22:58:23,062 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:58:23,062 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2129419233] [2019-12-26 22:58:23,062 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:58:23,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:58:23,511 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 22:58:23,511 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2129419233] [2019-12-26 22:58:23,511 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:58:23,511 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-26 22:58:23,512 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [289519139] [2019-12-26 22:58:23,512 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-26 22:58:23,512 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:58:23,512 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-26 22:58:23,513 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=199, Unknown=0, NotChecked=0, Total=240 [2019-12-26 22:58:23,513 INFO L87 Difference]: Start difference. First operand 22177 states and 67008 transitions. Second operand 16 states. [2019-12-26 22:58:26,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:58:26,342 INFO L93 Difference]: Finished difference Result 28270 states and 83980 transitions. [2019-12-26 22:58:26,342 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-12-26 22:58:26,342 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 67 [2019-12-26 22:58:26,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:58:26,379 INFO L225 Difference]: With dead ends: 28270 [2019-12-26 22:58:26,380 INFO L226 Difference]: Without dead ends: 27543 [2019-12-26 22:58:26,380 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 0 SyntacticMatches, 3 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 431 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=323, Invalid=1399, Unknown=0, NotChecked=0, Total=1722 [2019-12-26 22:58:26,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27543 states. [2019-12-26 22:58:26,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27543 to 22099. [2019-12-26 22:58:26,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22099 states. [2019-12-26 22:58:26,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22099 states to 22099 states and 66804 transitions. [2019-12-26 22:58:26,757 INFO L78 Accepts]: Start accepts. Automaton has 22099 states and 66804 transitions. Word has length 67 [2019-12-26 22:58:26,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:58:26,757 INFO L462 AbstractCegarLoop]: Abstraction has 22099 states and 66804 transitions. [2019-12-26 22:58:26,757 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-26 22:58:26,757 INFO L276 IsEmpty]: Start isEmpty. Operand 22099 states and 66804 transitions. [2019-12-26 22:58:26,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-26 22:58:26,783 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:58:26,784 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 22:58:26,784 INFO L410 AbstractCegarLoop]: === Iteration 30 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:58:26,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:58:26,784 INFO L82 PathProgramCache]: Analyzing trace with hash 204518299, now seen corresponding path program 3 times [2019-12-26 22:58:26,784 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:58:26,784 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [699250022] [2019-12-26 22:58:26,784 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:58:26,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:58:26,914 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 22:58:26,916 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [699250022] [2019-12-26 22:58:26,917 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:58:26,917 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-26 22:58:26,917 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1402476931] [2019-12-26 22:58:26,918 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-26 22:58:26,918 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:58:26,918 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-26 22:58:26,918 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-12-26 22:58:26,918 INFO L87 Difference]: Start difference. First operand 22099 states and 66804 transitions. Second operand 9 states. [2019-12-26 22:58:28,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:58:28,237 INFO L93 Difference]: Finished difference Result 29615 states and 88224 transitions. [2019-12-26 22:58:28,238 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-12-26 22:58:28,238 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 67 [2019-12-26 22:58:28,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:58:28,277 INFO L225 Difference]: With dead ends: 29615 [2019-12-26 22:58:28,277 INFO L226 Difference]: Without dead ends: 28744 [2019-12-26 22:58:28,278 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=214, Unknown=0, NotChecked=0, Total=272 [2019-12-26 22:58:28,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28744 states. [2019-12-26 22:58:28,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28744 to 21515. [2019-12-26 22:58:28,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21515 states. [2019-12-26 22:58:28,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21515 states to 21515 states and 65201 transitions. [2019-12-26 22:58:28,658 INFO L78 Accepts]: Start accepts. Automaton has 21515 states and 65201 transitions. Word has length 67 [2019-12-26 22:58:28,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:58:28,658 INFO L462 AbstractCegarLoop]: Abstraction has 21515 states and 65201 transitions. [2019-12-26 22:58:28,658 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-26 22:58:28,659 INFO L276 IsEmpty]: Start isEmpty. Operand 21515 states and 65201 transitions. [2019-12-26 22:58:28,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-26 22:58:28,681 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:58:28,681 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 22:58:28,681 INFO L410 AbstractCegarLoop]: === Iteration 31 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:58:28,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:58:28,682 INFO L82 PathProgramCache]: Analyzing trace with hash -2101838907, now seen corresponding path program 4 times [2019-12-26 22:58:28,682 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:58:28,682 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2067390105] [2019-12-26 22:58:28,682 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:58:28,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-26 22:58:28,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-26 22:58:28,783 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-26 22:58:28,783 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-26 22:58:28,787 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [894] [894] ULTIMATE.startENTRY-->L820: Formula: (let ((.cse0 (store |v_#valid_71| 0 0))) (and (= v_~z$w_buff0_used~0_958 0) (= v_~x~0_72 0) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t1391~0.base_26|)) (= v_~z$r_buff0_thd2~0_111 0) (= |v_#NULL.offset_6| 0) (= 0 v_~__unbuffered_p1_EAX~0_40) (= v_~z$r_buff1_thd0~0_129 0) (= |v_#length_23| (store |v_#length_24| |v_ULTIMATE.start_main_~#t1391~0.base_26| 4)) (= v_~z$w_buff1_used~0_531 0) (= v_~y~0_19 0) (= v_~z$r_buff0_thd1~0_132 0) (= v_~z$r_buff1_thd1~0_108 0) (= v_~z$read_delayed_var~0.offset_7 0) (= v_~main$tmp_guard1~0_39 0) (= (store .cse0 |v_ULTIMATE.start_main_~#t1391~0.base_26| 1) |v_#valid_69|) (= v_~z$w_buff0~0_487 0) (< 0 |v_#StackHeapBarrier_18|) (= v_~z$r_buff1_thd2~0_104 0) (= 0 v_~__unbuffered_p2_EAX~0_53) (= v_~z$w_buff1~0_307 0) (= 0 v_~z$r_buff1_thd3~0_237) (= 0 |v_#NULL.base_6|) (= 0 v_~z$flush_delayed~0_24) (= v_~z$r_buff0_thd0~0_141 0) (= 0 |v_ULTIMATE.start_main_~#t1391~0.offset_19|) (= v_~z$read_delayed_var~0.base_7 0) (= v_~z$read_delayed~0_7 0) (= v_~z$mem_tmp~0_13 0) (= v_~z~0_174 0) (= 0 v_~__unbuffered_cnt~0_91) (= 0 v_~z$r_buff0_thd3~0_332) (= v_~main$tmp_guard0~0_26 0) (= v_~weak$$choice2~0_107 0) (= (store |v_#memory_int_22| |v_ULTIMATE.start_main_~#t1391~0.base_26| (store (select |v_#memory_int_22| |v_ULTIMATE.start_main_~#t1391~0.base_26|) |v_ULTIMATE.start_main_~#t1391~0.offset_19| 0)) |v_#memory_int_21|) (< |v_#StackHeapBarrier_18| |v_ULTIMATE.start_main_~#t1391~0.base_26|) (= 0 v_~weak$$choice0~0_12))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_18|, #valid=|v_#valid_71|, #memory_int=|v_#memory_int_22|, #length=|v_#length_24|} OutVars{~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_104, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_31|, #NULL.offset=|v_#NULL.offset_6|, ULTIMATE.start_main_#t~ite49=|v_ULTIMATE.start_main_#t~ite49_287|, ULTIMATE.start_main_#t~ite50=|v_ULTIMATE.start_main_#t~ite50_41|, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_85|, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_141, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_40, #length=|v_#length_23|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_53, ULTIMATE.start_main_~#t1392~0.offset=|v_ULTIMATE.start_main_~#t1392~0.offset_19|, ULTIMATE.start_main_~#t1393~0.base=|v_ULTIMATE.start_main_~#t1393~0.base_16|, ~z$mem_tmp~0=v_~z$mem_tmp~0_13, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_8|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_531, ~z$flush_delayed~0=v_~z$flush_delayed~0_24, ~weak$$choice0~0=v_~weak$$choice0~0_12, #StackHeapBarrier=|v_#StackHeapBarrier_18|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_108, ~z$read_delayed_var~0.base=v_~z$read_delayed_var~0.base_7, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_332, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_91, ~x~0=v_~x~0_72, ULTIMATE.start_main_~#t1393~0.offset=|v_ULTIMATE.start_main_~#t1393~0.offset_12|, ULTIMATE.start_main_~#t1392~0.base=|v_ULTIMATE.start_main_~#t1392~0.base_23|, ~z$read_delayed~0=v_~z$read_delayed~0_7, ~z$w_buff1~0=v_~z$w_buff1~0_307, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_39, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_35|, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_7, ULTIMATE.start_main_#t~ite51=|v_ULTIMATE.start_main_#t~ite51_35|, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_129, ~y~0=v_~y~0_19, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_111, ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_23|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_958, ~z$w_buff0~0=v_~z$w_buff0~0_487, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_7|, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_237, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_26, ULTIMATE.start_main_~#t1391~0.base=|v_ULTIMATE.start_main_~#t1391~0.base_26|, ULTIMATE.start_main_~#t1391~0.offset=|v_ULTIMATE.start_main_~#t1391~0.offset_19|, #NULL.base=|v_#NULL.base_6|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_24|, #valid=|v_#valid_69|, #memory_int=|v_#memory_int_21|, ~z~0=v_~z~0_174, ~weak$$choice2~0=v_~weak$$choice2~0_107, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_132} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1393~0.offset, ULTIMATE.start_main_~#t1392~0.base, ~z$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite47, ~z$read_delayed~0, #NULL.offset, ~z$w_buff1~0, ULTIMATE.start_main_#t~ite49, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite48, ~z$read_delayed_var~0.offset, ULTIMATE.start_main_#t~ite50, ULTIMATE.start_main_#t~ite52, ~z$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite51, ~__unbuffered_p1_EAX~0, ~z$r_buff1_thd0~0, #length, ~__unbuffered_p2_EAX~0, ULTIMATE.start_main_~#t1392~0.offset, ~y~0, ~z$r_buff0_thd2~0, ULTIMATE.start_main_~#t1393~0.base, ~z$mem_tmp~0, ULTIMATE.start_main_#t~nondet46, ~z$w_buff0_used~0, ~z$w_buff0~0, ULTIMATE.start_main_#t~nondet44, ~z$r_buff1_thd3~0, ULTIMATE.start_main_#t~nondet45, ~z$w_buff1_used~0, ~z$flush_delayed~0, ~main$tmp_guard0~0, ULTIMATE.start_main_~#t1391~0.base, ULTIMATE.start_main_~#t1391~0.offset, #NULL.base, ~weak$$choice0~0, ULTIMATE.start_main_#res, ~z$r_buff1_thd1~0, #valid, #memory_int, ~z$read_delayed_var~0.base, ~z$r_buff0_thd3~0, ~__unbuffered_cnt~0, ~z~0, ~weak$$choice2~0, ~z$r_buff0_thd1~0, ~x~0] because there is no mapped edge [2019-12-26 22:58:28,788 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [850] [850] L820-1-->L822: Formula: (and (= (store |v_#length_14| |v_ULTIMATE.start_main_~#t1392~0.base_9| 4) |v_#length_13|) (= |v_#valid_33| (store |v_#valid_34| |v_ULTIMATE.start_main_~#t1392~0.base_9| 1)) (= 0 (select |v_#valid_34| |v_ULTIMATE.start_main_~#t1392~0.base_9|)) (not (= |v_ULTIMATE.start_main_~#t1392~0.base_9| 0)) (= |v_ULTIMATE.start_main_~#t1392~0.offset_8| 0) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1392~0.base_9| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1392~0.base_9|) |v_ULTIMATE.start_main_~#t1392~0.offset_8| 1)) |v_#memory_int_11|) (< |v_#StackHeapBarrier_10| |v_ULTIMATE.start_main_~#t1392~0.base_9|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_34|, #memory_int=|v_#memory_int_12|, #length=|v_#length_14|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_10|, ULTIMATE.start_main_~#t1392~0.base=|v_ULTIMATE.start_main_~#t1392~0.base_9|, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_3|, #valid=|v_#valid_33|, #memory_int=|v_#memory_int_11|, #length=|v_#length_13|, ULTIMATE.start_main_~#t1392~0.offset=|v_ULTIMATE.start_main_~#t1392~0.offset_8|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1392~0.base, ULTIMATE.start_main_#t~nondet44, #valid, #memory_int, #length, ULTIMATE.start_main_~#t1392~0.offset] because there is no mapped edge [2019-12-26 22:58:28,788 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [874] [874] P0ENTRY-->L4-3: Formula: (and (= 1 ~z$w_buff0~0_Out-538703647) (= |P0Thread1of1ForFork0_#in~arg.offset_In-538703647| P0Thread1of1ForFork0_~arg.offset_Out-538703647) (= |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_Out-538703647| 1) (= P0Thread1of1ForFork0_~arg.base_Out-538703647 |P0Thread1of1ForFork0_#in~arg.base_In-538703647|) (= ~z$w_buff1_used~0_Out-538703647 ~z$w_buff0_used~0_In-538703647) (= ~z$w_buff1~0_Out-538703647 ~z$w_buff0~0_In-538703647) (= 0 (mod ~z$w_buff1_used~0_Out-538703647 256)) (= |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_Out-538703647| P0Thread1of1ForFork0___VERIFIER_assert_~expression_Out-538703647) (= 1 ~z$w_buff0_used~0_Out-538703647)) InVars {P0Thread1of1ForFork0_#in~arg.offset=|P0Thread1of1ForFork0_#in~arg.offset_In-538703647|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-538703647, ~z$w_buff0~0=~z$w_buff0~0_In-538703647, P0Thread1of1ForFork0_#in~arg.base=|P0Thread1of1ForFork0_#in~arg.base_In-538703647|} OutVars{P0Thread1of1ForFork0_#in~arg.offset=|P0Thread1of1ForFork0_#in~arg.offset_In-538703647|, ~z$w_buff0_used~0=~z$w_buff0_used~0_Out-538703647, ~z$w_buff0~0=~z$w_buff0~0_Out-538703647, ~z$w_buff1_used~0=~z$w_buff1_used~0_Out-538703647, P0Thread1of1ForFork0___VERIFIER_assert_~expression=P0Thread1of1ForFork0___VERIFIER_assert_~expression_Out-538703647, P0Thread1of1ForFork0_#in~arg.base=|P0Thread1of1ForFork0_#in~arg.base_In-538703647|, ~z$w_buff1~0=~z$w_buff1~0_Out-538703647, P0Thread1of1ForFork0_~arg.base=P0Thread1of1ForFork0_~arg.base_Out-538703647, P0Thread1of1ForFork0___VERIFIER_assert_#in~expression=|P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_Out-538703647|, P0Thread1of1ForFork0_~arg.offset=P0Thread1of1ForFork0_~arg.offset_Out-538703647} AuxVars[] AssignedVars[~z$w_buff0_used~0, ~z$w_buff0~0, ~z$w_buff1_used~0, P0Thread1of1ForFork0___VERIFIER_assert_~expression, ~z$w_buff1~0, P0Thread1of1ForFork0_~arg.base, P0Thread1of1ForFork0___VERIFIER_assert_#in~expression, P0Thread1of1ForFork0_~arg.offset] because there is no mapped edge [2019-12-26 22:58:28,790 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [872] [872] L822-1-->L824: Formula: (and (= (select |v_#valid_41| |v_ULTIMATE.start_main_~#t1393~0.base_11|) 0) (= |v_#valid_40| (store |v_#valid_41| |v_ULTIMATE.start_main_~#t1393~0.base_11| 1)) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t1393~0.base_11| 4)) (= |v_#memory_int_15| (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1393~0.base_11| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1393~0.base_11|) |v_ULTIMATE.start_main_~#t1393~0.offset_9| 2))) (not (= |v_ULTIMATE.start_main_~#t1393~0.base_11| 0)) (= |v_ULTIMATE.start_main_~#t1393~0.offset_9| 0) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t1393~0.base_11|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_41|, #memory_int=|v_#memory_int_16|, #length=|v_#length_18|} OutVars{ULTIMATE.start_main_~#t1393~0.offset=|v_ULTIMATE.start_main_~#t1393~0.offset_9|, #StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_40|, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_5|, #memory_int=|v_#memory_int_15|, #length=|v_#length_17|, ULTIMATE.start_main_~#t1393~0.base=|v_ULTIMATE.start_main_~#t1393~0.base_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1393~0.offset, #valid, ULTIMATE.start_main_#t~nondet45, #memory_int, #length, ULTIMATE.start_main_~#t1393~0.base] because there is no mapped edge [2019-12-26 22:58:28,792 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [817] [817] L764-2-->L764-5: Formula: (let ((.cse2 (= 0 (mod ~z$r_buff1_thd2~0_In-163165011 256))) (.cse0 (= (mod ~z$w_buff1_used~0_In-163165011 256) 0)) (.cse1 (= |P1Thread1of1ForFork1_#t~ite10_Out-163165011| |P1Thread1of1ForFork1_#t~ite9_Out-163165011|))) (or (and (not .cse0) (= |P1Thread1of1ForFork1_#t~ite9_Out-163165011| ~z$w_buff1~0_In-163165011) .cse1 (not .cse2)) (and (= ~z~0_In-163165011 |P1Thread1of1ForFork1_#t~ite9_Out-163165011|) (or .cse2 .cse0) .cse1))) InVars {~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-163165011, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-163165011, ~z$w_buff1~0=~z$w_buff1~0_In-163165011, ~z~0=~z~0_In-163165011} OutVars{P1Thread1of1ForFork1_#t~ite9=|P1Thread1of1ForFork1_#t~ite9_Out-163165011|, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-163165011, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-163165011, P1Thread1of1ForFork1_#t~ite10=|P1Thread1of1ForFork1_#t~ite10_Out-163165011|, ~z$w_buff1~0=~z$w_buff1~0_In-163165011, ~z~0=~z~0_In-163165011} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite9, P1Thread1of1ForFork1_#t~ite10] because there is no mapped edge [2019-12-26 22:58:28,793 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [836] [836] L765-->L765-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In263918599 256))) (.cse1 (= 0 (mod ~z$r_buff0_thd2~0_In263918599 256)))) (or (and (or .cse0 .cse1) (= ~z$w_buff0_used~0_In263918599 |P1Thread1of1ForFork1_#t~ite11_Out263918599|)) (and (not .cse0) (= 0 |P1Thread1of1ForFork1_#t~ite11_Out263918599|) (not .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In263918599, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In263918599} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In263918599, P1Thread1of1ForFork1_#t~ite11=|P1Thread1of1ForFork1_#t~ite11_Out263918599|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In263918599} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite11] because there is no mapped edge [2019-12-26 22:58:28,795 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [828] [828] L766-->L766-2: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In666020483 256) 0)) (.cse0 (= (mod ~z$r_buff0_thd2~0_In666020483 256) 0)) (.cse3 (= (mod ~z$r_buff1_thd2~0_In666020483 256) 0)) (.cse2 (= (mod ~z$w_buff1_used~0_In666020483 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P1Thread1of1ForFork1_#t~ite12_Out666020483|)) (and (or .cse1 .cse0) (or .cse3 .cse2) (= ~z$w_buff1_used~0_In666020483 |P1Thread1of1ForFork1_#t~ite12_Out666020483|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In666020483, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In666020483, ~z$w_buff1_used~0=~z$w_buff1_used~0_In666020483, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In666020483} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In666020483, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In666020483, ~z$w_buff1_used~0=~z$w_buff1_used~0_In666020483, P1Thread1of1ForFork1_#t~ite12=|P1Thread1of1ForFork1_#t~ite12_Out666020483|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In666020483} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite12] because there is no mapped edge [2019-12-26 22:58:28,796 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [841] [841] L767-->L767-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In1309285719 256))) (.cse1 (= 0 (mod ~z$r_buff0_thd2~0_In1309285719 256)))) (or (and (= ~z$r_buff0_thd2~0_In1309285719 |P1Thread1of1ForFork1_#t~ite13_Out1309285719|) (or .cse0 .cse1)) (and (= 0 |P1Thread1of1ForFork1_#t~ite13_Out1309285719|) (not .cse0) (not .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1309285719, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1309285719} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1309285719, P1Thread1of1ForFork1_#t~ite13=|P1Thread1of1ForFork1_#t~ite13_Out1309285719|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1309285719} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite13] because there is no mapped edge [2019-12-26 22:58:28,796 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [873] [873] L787-->L787-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-383692564 256)))) (or (and (= |P2Thread1of1ForFork2_#t~ite23_In-383692564| |P2Thread1of1ForFork2_#t~ite23_Out-383692564|) (= |P2Thread1of1ForFork2_#t~ite24_Out-383692564| ~z$w_buff1~0_In-383692564) (not .cse0)) (and (= |P2Thread1of1ForFork2_#t~ite23_Out-383692564| |P2Thread1of1ForFork2_#t~ite24_Out-383692564|) .cse0 (let ((.cse1 (= (mod ~z$r_buff0_thd3~0_In-383692564 256) 0))) (or (and .cse1 (= 0 (mod ~z$w_buff1_used~0_In-383692564 256))) (and (= (mod ~z$r_buff1_thd3~0_In-383692564 256) 0) .cse1) (= 0 (mod ~z$w_buff0_used~0_In-383692564 256)))) (= |P2Thread1of1ForFork2_#t~ite23_Out-383692564| ~z$w_buff1~0_In-383692564)))) InVars {P2Thread1of1ForFork2_#t~ite23=|P2Thread1of1ForFork2_#t~ite23_In-383692564|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-383692564, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-383692564, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-383692564, ~z$w_buff1~0=~z$w_buff1~0_In-383692564, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-383692564, ~weak$$choice2~0=~weak$$choice2~0_In-383692564} OutVars{P2Thread1of1ForFork2_#t~ite23=|P2Thread1of1ForFork2_#t~ite23_Out-383692564|, P2Thread1of1ForFork2_#t~ite24=|P2Thread1of1ForFork2_#t~ite24_Out-383692564|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-383692564, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-383692564, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-383692564, ~z$w_buff1~0=~z$w_buff1~0_In-383692564, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-383692564, ~weak$$choice2~0=~weak$$choice2~0_In-383692564} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite23, P2Thread1of1ForFork2_#t~ite24] because there is no mapped edge [2019-12-26 22:58:28,797 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [875] [875] L788-->L788-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-1147781208 256)))) (or (and (= ~z$w_buff0_used~0_In-1147781208 |P2Thread1of1ForFork2_#t~ite26_Out-1147781208|) .cse0 (let ((.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In-1147781208 256)))) (or (and (= 0 (mod ~z$w_buff1_used~0_In-1147781208 256)) .cse1) (and .cse1 (= 0 (mod ~z$r_buff1_thd3~0_In-1147781208 256))) (= (mod ~z$w_buff0_used~0_In-1147781208 256) 0))) (= |P2Thread1of1ForFork2_#t~ite27_Out-1147781208| |P2Thread1of1ForFork2_#t~ite26_Out-1147781208|)) (and (= |P2Thread1of1ForFork2_#t~ite27_Out-1147781208| ~z$w_buff0_used~0_In-1147781208) (not .cse0) (= |P2Thread1of1ForFork2_#t~ite26_In-1147781208| |P2Thread1of1ForFork2_#t~ite26_Out-1147781208|)))) InVars {P2Thread1of1ForFork2_#t~ite26=|P2Thread1of1ForFork2_#t~ite26_In-1147781208|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1147781208, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1147781208, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1147781208, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1147781208, ~weak$$choice2~0=~weak$$choice2~0_In-1147781208} OutVars{P2Thread1of1ForFork2_#t~ite26=|P2Thread1of1ForFork2_#t~ite26_Out-1147781208|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1147781208, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1147781208, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1147781208, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1147781208, ~weak$$choice2~0=~weak$$choice2~0_In-1147781208, P2Thread1of1ForFork2_#t~ite27=|P2Thread1of1ForFork2_#t~ite27_Out-1147781208|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite26, P2Thread1of1ForFork2_#t~ite27] because there is no mapped edge [2019-12-26 22:58:28,798 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [827] [827] L768-->L768-2: Formula: (let ((.cse2 (= 0 (mod ~z$w_buff0_used~0_In-2024639519 256))) (.cse3 (= 0 (mod ~z$r_buff0_thd2~0_In-2024639519 256))) (.cse1 (= 0 (mod ~z$r_buff1_thd2~0_In-2024639519 256))) (.cse0 (= (mod ~z$w_buff1_used~0_In-2024639519 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~z$r_buff1_thd2~0_In-2024639519 |P1Thread1of1ForFork1_#t~ite14_Out-2024639519|)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0))) (= |P1Thread1of1ForFork1_#t~ite14_Out-2024639519| 0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-2024639519, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-2024639519, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-2024639519, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-2024639519} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-2024639519, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-2024639519, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-2024639519, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_Out-2024639519|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-2024639519} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite14] because there is no mapped edge [2019-12-26 22:58:28,798 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [848] [848] L768-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork1_#res.base_5|) (= |v_P1Thread1of1ForFork1_#t~ite14_28| v_~z$r_buff1_thd2~0_55) (= |v_P1Thread1of1ForFork1_#res.offset_5| 0) (= (+ v_~__unbuffered_cnt~0_40 1) v_~__unbuffered_cnt~0_39)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_40, P1Thread1of1ForFork1_#t~ite14=|v_P1Thread1of1ForFork1_#t~ite14_28|} OutVars{P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_5|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_55, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_39, P1Thread1of1ForFork1_#t~ite14=|v_P1Thread1of1ForFork1_#t~ite14_27|, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#res.offset, ~z$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#t~ite14, P1Thread1of1ForFork1_#res.base] because there is no mapped edge [2019-12-26 22:58:28,798 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [876] [876] L789-->L789-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-638289171 256)))) (or (and (= |P2Thread1of1ForFork2_#t~ite29_In-638289171| |P2Thread1of1ForFork2_#t~ite29_Out-638289171|) (not .cse0) (= ~z$w_buff1_used~0_In-638289171 |P2Thread1of1ForFork2_#t~ite30_Out-638289171|)) (and (let ((.cse1 (= (mod ~z$r_buff0_thd3~0_In-638289171 256) 0))) (or (and .cse1 (= (mod ~z$w_buff1_used~0_In-638289171 256) 0)) (= 0 (mod ~z$w_buff0_used~0_In-638289171 256)) (and .cse1 (= (mod ~z$r_buff1_thd3~0_In-638289171 256) 0)))) .cse0 (= |P2Thread1of1ForFork2_#t~ite30_Out-638289171| |P2Thread1of1ForFork2_#t~ite29_Out-638289171|) (= ~z$w_buff1_used~0_In-638289171 |P2Thread1of1ForFork2_#t~ite29_Out-638289171|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-638289171, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-638289171, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-638289171, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-638289171, ~weak$$choice2~0=~weak$$choice2~0_In-638289171, P2Thread1of1ForFork2_#t~ite29=|P2Thread1of1ForFork2_#t~ite29_In-638289171|} OutVars{P2Thread1of1ForFork2_#t~ite30=|P2Thread1of1ForFork2_#t~ite30_Out-638289171|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-638289171, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-638289171, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-638289171, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-638289171, ~weak$$choice2~0=~weak$$choice2~0_In-638289171, P2Thread1of1ForFork2_#t~ite29=|P2Thread1of1ForFork2_#t~ite29_Out-638289171|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite30, P2Thread1of1ForFork2_#t~ite29] because there is no mapped edge [2019-12-26 22:58:28,799 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [779] [779] L790-->L791: Formula: (and (= v_~z$r_buff0_thd3~0_68 v_~z$r_buff0_thd3~0_67) (not (= 0 (mod v_~weak$$choice2~0_15 256)))) InVars {~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_68, ~weak$$choice2~0=v_~weak$$choice2~0_15} OutVars{P2Thread1of1ForFork2_#t~ite31=|v_P2Thread1of1ForFork2_#t~ite31_8|, P2Thread1of1ForFork2_#t~ite33=|v_P2Thread1of1ForFork2_#t~ite33_9|, P2Thread1of1ForFork2_#t~ite32=|v_P2Thread1of1ForFork2_#t~ite32_9|, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_67, ~weak$$choice2~0=v_~weak$$choice2~0_15} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite31, P2Thread1of1ForFork2_#t~ite33, P2Thread1of1ForFork2_#t~ite32, ~z$r_buff0_thd3~0] because there is no mapped edge [2019-12-26 22:58:28,800 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [761] [761] L793-->L797: Formula: (and (= 0 v_~z$flush_delayed~0_6) (= v_~z~0_25 v_~z$mem_tmp~0_5) (not (= 0 (mod v_~z$flush_delayed~0_7 256)))) InVars {~z$mem_tmp~0=v_~z$mem_tmp~0_5, ~z$flush_delayed~0=v_~z$flush_delayed~0_7} OutVars{~z$mem_tmp~0=v_~z$mem_tmp~0_5, P2Thread1of1ForFork2_#t~ite37=|v_P2Thread1of1ForFork2_#t~ite37_7|, ~z$flush_delayed~0=v_~z$flush_delayed~0_6, ~z~0=v_~z~0_25} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite37, ~z$flush_delayed~0, ~z~0] because there is no mapped edge [2019-12-26 22:58:28,801 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [839] [839] L745-->L745-2: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In85391335 256) 0)) (.cse0 (= 0 (mod ~z$r_buff0_thd1~0_In85391335 256)))) (or (and (or .cse0 .cse1) (= |P0Thread1of1ForFork0_#t~ite5_Out85391335| ~z$w_buff0_used~0_In85391335)) (and (not .cse1) (not .cse0) (= |P0Thread1of1ForFork0_#t~ite5_Out85391335| 0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In85391335, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In85391335} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out85391335|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In85391335, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In85391335} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-26 22:58:28,802 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [818] [818] L746-->L746-2: Formula: (let ((.cse3 (= (mod ~z$w_buff1_used~0_In-2133861002 256) 0)) (.cse2 (= (mod ~z$r_buff1_thd1~0_In-2133861002 256) 0)) (.cse0 (= (mod ~z$r_buff0_thd1~0_In-2133861002 256) 0)) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In-2133861002 256)))) (or (and (= 0 |P0Thread1of1ForFork0_#t~ite6_Out-2133861002|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse3 .cse2) (= |P0Thread1of1ForFork0_#t~ite6_Out-2133861002| ~z$w_buff1_used~0_In-2133861002) (or .cse0 .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-2133861002, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In-2133861002, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-2133861002, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-2133861002} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out-2133861002|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-2133861002, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In-2133861002, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-2133861002, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-2133861002} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-26 22:58:28,803 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [837] [837] L747-->L748: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd1~0_In-1446542332 256))) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In-1446542332 256)))) (or (and (= ~z$r_buff0_thd1~0_Out-1446542332 0) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= ~z$r_buff0_thd1~0_Out-1446542332 ~z$r_buff0_thd1~0_In-1446542332)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1446542332, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-1446542332} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1446542332, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out-1446542332|, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_Out-1446542332} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-26 22:58:28,803 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [838] [838] L748-->L748-2: Formula: (let ((.cse3 (= 0 (mod ~z$r_buff1_thd1~0_In760834627 256))) (.cse2 (= 0 (mod ~z$w_buff1_used~0_In760834627 256))) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In760834627 256))) (.cse1 (= 0 (mod ~z$r_buff0_thd1~0_In760834627 256)))) (or (and (= 0 |P0Thread1of1ForFork0_#t~ite8_Out760834627|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse3 .cse2) (or .cse0 .cse1) (= ~z$r_buff1_thd1~0_In760834627 |P0Thread1of1ForFork0_#t~ite8_Out760834627|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In760834627, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In760834627, ~z$w_buff1_used~0=~z$w_buff1_used~0_In760834627, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In760834627} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In760834627, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out760834627|, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In760834627, ~z$w_buff1_used~0=~z$w_buff1_used~0_In760834627, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In760834627} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-26 22:58:28,803 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [861] [861] L748-2-->P0EXIT: Formula: (and (= v_~__unbuffered_cnt~0_73 (+ v_~__unbuffered_cnt~0_74 1)) (= 0 |v_P0Thread1of1ForFork0_#res.base_5|) (= v_~z$r_buff1_thd1~0_68 |v_P0Thread1of1ForFork0_#t~ite8_44|) (= |v_P0Thread1of1ForFork0_#res.offset_5| 0)) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_44|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_74} OutVars{P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_5|, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_43|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_68, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_73} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#t~ite8, ~z$r_buff1_thd1~0, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-26 22:58:28,803 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [829] [829] L797-2-->L797-5: Formula: (let ((.cse0 (= |P2Thread1of1ForFork2_#t~ite39_Out-732280209| |P2Thread1of1ForFork2_#t~ite38_Out-732280209|)) (.cse1 (= 0 (mod ~z$r_buff1_thd3~0_In-732280209 256))) (.cse2 (= 0 (mod ~z$w_buff1_used~0_In-732280209 256)))) (or (and .cse0 (or .cse1 .cse2) (= ~z~0_In-732280209 |P2Thread1of1ForFork2_#t~ite38_Out-732280209|)) (and (= ~z$w_buff1~0_In-732280209 |P2Thread1of1ForFork2_#t~ite38_Out-732280209|) .cse0 (not .cse1) (not .cse2)))) InVars {~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-732280209, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-732280209, ~z$w_buff1~0=~z$w_buff1~0_In-732280209, ~z~0=~z~0_In-732280209} OutVars{~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-732280209, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-732280209, ~z$w_buff1~0=~z$w_buff1~0_In-732280209, ~z~0=~z~0_In-732280209, P2Thread1of1ForFork2_#t~ite39=|P2Thread1of1ForFork2_#t~ite39_Out-732280209|, P2Thread1of1ForFork2_#t~ite38=|P2Thread1of1ForFork2_#t~ite38_Out-732280209|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite39, P2Thread1of1ForFork2_#t~ite38] because there is no mapped edge [2019-12-26 22:58:28,804 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [832] [832] L798-->L798-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In409026902 256))) (.cse1 (= (mod ~z$r_buff0_thd3~0_In409026902 256) 0))) (or (and (= ~z$w_buff0_used~0_In409026902 |P2Thread1of1ForFork2_#t~ite40_Out409026902|) (or .cse0 .cse1)) (and (= 0 |P2Thread1of1ForFork2_#t~ite40_Out409026902|) (not .cse0) (not .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In409026902, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In409026902} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In409026902, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In409026902, P2Thread1of1ForFork2_#t~ite40=|P2Thread1of1ForFork2_#t~ite40_Out409026902|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite40] because there is no mapped edge [2019-12-26 22:58:28,805 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [819] [819] L799-->L799-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff1_thd3~0_In209018167 256))) (.cse0 (= (mod ~z$w_buff1_used~0_In209018167 256) 0)) (.cse3 (= (mod ~z$w_buff0_used~0_In209018167 256) 0)) (.cse2 (= (mod ~z$r_buff0_thd3~0_In209018167 256) 0))) (or (and (= 0 |P2Thread1of1ForFork2_#t~ite41_Out209018167|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse1 .cse0) (or .cse3 .cse2) (= ~z$w_buff1_used~0_In209018167 |P2Thread1of1ForFork2_#t~ite41_Out209018167|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In209018167, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In209018167, ~z$w_buff1_used~0=~z$w_buff1_used~0_In209018167, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In209018167} OutVars{P2Thread1of1ForFork2_#t~ite41=|P2Thread1of1ForFork2_#t~ite41_Out209018167|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In209018167, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In209018167, ~z$w_buff1_used~0=~z$w_buff1_used~0_In209018167, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In209018167} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite41] because there is no mapped edge [2019-12-26 22:58:28,806 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [815] [815] L800-->L800-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In-1698835617 256))) (.cse0 (= (mod ~z$w_buff0_used~0_In-1698835617 256) 0))) (or (and (or .cse0 .cse1) (= ~z$r_buff0_thd3~0_In-1698835617 |P2Thread1of1ForFork2_#t~ite42_Out-1698835617|)) (and (not .cse1) (not .cse0) (= 0 |P2Thread1of1ForFork2_#t~ite42_Out-1698835617|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1698835617, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1698835617} OutVars{P2Thread1of1ForFork2_#t~ite42=|P2Thread1of1ForFork2_#t~ite42_Out-1698835617|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1698835617, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1698835617} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite42] because there is no mapped edge [2019-12-26 22:58:28,807 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [834] [834] L801-->L801-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In890243874 256))) (.cse0 (= (mod ~z$r_buff0_thd3~0_In890243874 256) 0)) (.cse3 (= 0 (mod ~z$w_buff1_used~0_In890243874 256))) (.cse2 (= (mod ~z$r_buff1_thd3~0_In890243874 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P2Thread1of1ForFork2_#t~ite43_Out890243874|)) (and (or .cse1 .cse0) (= ~z$r_buff1_thd3~0_In890243874 |P2Thread1of1ForFork2_#t~ite43_Out890243874|) (or .cse3 .cse2)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In890243874, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In890243874, ~z$w_buff1_used~0=~z$w_buff1_used~0_In890243874, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In890243874} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In890243874, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In890243874, P2Thread1of1ForFork2_#t~ite43=|P2Thread1of1ForFork2_#t~ite43_Out890243874|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In890243874, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In890243874} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite43] because there is no mapped edge [2019-12-26 22:58:28,807 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [859] [859] L801-2-->P2EXIT: Formula: (and (= 0 |v_P2Thread1of1ForFork2_#res.base_5|) (= v_~z$r_buff1_thd3~0_136 |v_P2Thread1of1ForFork2_#t~ite43_30|) (= |v_P2Thread1of1ForFork2_#res.offset_5| 0) (= (+ v_~__unbuffered_cnt~0_56 1) v_~__unbuffered_cnt~0_55)) InVars {P2Thread1of1ForFork2_#t~ite43=|v_P2Thread1of1ForFork2_#t~ite43_30|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_56} OutVars{~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_136, P2Thread1of1ForFork2_#t~ite43=|v_P2Thread1of1ForFork2_#t~ite43_29|, P2Thread1of1ForFork2_#res.base=|v_P2Thread1of1ForFork2_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_55, P2Thread1of1ForFork2_#res.offset=|v_P2Thread1of1ForFork2_#res.offset_5|} AuxVars[] AssignedVars[~z$r_buff1_thd3~0, P2Thread1of1ForFork2_#t~ite43, P2Thread1of1ForFork2_#res.base, ~__unbuffered_cnt~0, P2Thread1of1ForFork2_#res.offset] because there is no mapped edge [2019-12-26 22:58:28,807 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [781] [781] L824-1-->L830: Formula: (and (= v_~main$tmp_guard0~0_7 1) (= 3 v_~__unbuffered_cnt~0_13)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_13} OutVars{ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_13, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet46, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-26 22:58:28,808 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [825] [825] L830-2-->L830-5: Formula: (let ((.cse1 (= |ULTIMATE.start_main_#t~ite48_Out770776972| |ULTIMATE.start_main_#t~ite47_Out770776972|)) (.cse0 (= 0 (mod ~z$w_buff1_used~0_In770776972 256))) (.cse2 (= 0 (mod ~z$r_buff1_thd0~0_In770776972 256)))) (or (and (not .cse0) .cse1 (= ~z$w_buff1~0_In770776972 |ULTIMATE.start_main_#t~ite47_Out770776972|) (not .cse2)) (and .cse1 (or .cse0 .cse2) (= |ULTIMATE.start_main_#t~ite47_Out770776972| ~z~0_In770776972)))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In770776972, ~z$w_buff1_used~0=~z$w_buff1_used~0_In770776972, ~z$w_buff1~0=~z$w_buff1~0_In770776972, ~z~0=~z~0_In770776972} OutVars{~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In770776972, ULTIMATE.start_main_#t~ite47=|ULTIMATE.start_main_#t~ite47_Out770776972|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In770776972, ~z$w_buff1~0=~z$w_buff1~0_In770776972, ULTIMATE.start_main_#t~ite48=|ULTIMATE.start_main_#t~ite48_Out770776972|, ~z~0=~z~0_In770776972} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite47, ULTIMATE.start_main_#t~ite48] because there is no mapped edge [2019-12-26 22:58:28,808 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [821] [821] L831-->L831-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff0_thd0~0_In213025910 256))) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In213025910 256)))) (or (and (= ~z$w_buff0_used~0_In213025910 |ULTIMATE.start_main_#t~ite49_Out213025910|) (or .cse0 .cse1)) (and (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite49_Out213025910|) (not .cse1)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In213025910, ~z$w_buff0_used~0=~z$w_buff0_used~0_In213025910} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In213025910, ~z$w_buff0_used~0=~z$w_buff0_used~0_In213025910, ULTIMATE.start_main_#t~ite49=|ULTIMATE.start_main_#t~ite49_Out213025910|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite49] because there is no mapped edge [2019-12-26 22:58:28,811 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [840] [840] L832-->L832-2: Formula: (let ((.cse2 (= (mod ~z$w_buff1_used~0_In-1428313746 256) 0)) (.cse3 (= 0 (mod ~z$r_buff1_thd0~0_In-1428313746 256))) (.cse1 (= (mod ~z$w_buff0_used~0_In-1428313746 256) 0)) (.cse0 (= 0 (mod ~z$r_buff0_thd0~0_In-1428313746 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite50_Out-1428313746| 0)) (and (or .cse2 .cse3) (= ~z$w_buff1_used~0_In-1428313746 |ULTIMATE.start_main_#t~ite50_Out-1428313746|) (or .cse1 .cse0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1428313746, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1428313746, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1428313746, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1428313746} OutVars{ULTIMATE.start_main_#t~ite50=|ULTIMATE.start_main_#t~ite50_Out-1428313746|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1428313746, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1428313746, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1428313746, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1428313746} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite50] because there is no mapped edge [2019-12-26 22:58:28,812 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [831] [831] L833-->L833-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In1280386749 256))) (.cse0 (= 0 (mod ~z$r_buff0_thd0~0_In1280386749 256)))) (or (and (= ~z$r_buff0_thd0~0_In1280386749 |ULTIMATE.start_main_#t~ite51_Out1280386749|) (or .cse0 .cse1)) (and (not .cse1) (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite51_Out1280386749|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1280386749, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1280386749} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1280386749, ULTIMATE.start_main_#t~ite51=|ULTIMATE.start_main_#t~ite51_Out1280386749|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1280386749} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite51] because there is no mapped edge [2019-12-26 22:58:28,812 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [820] [820] L834-->L834-2: Formula: (let ((.cse3 (= 0 (mod ~z$r_buff0_thd0~0_In-517342361 256))) (.cse2 (= 0 (mod ~z$w_buff0_used~0_In-517342361 256))) (.cse0 (= (mod ~z$w_buff1_used~0_In-517342361 256) 0)) (.cse1 (= 0 (mod ~z$r_buff1_thd0~0_In-517342361 256)))) (or (and (or .cse0 .cse1) (= ~z$r_buff1_thd0~0_In-517342361 |ULTIMATE.start_main_#t~ite52_Out-517342361|) (or .cse2 .cse3)) (and (= 0 |ULTIMATE.start_main_#t~ite52_Out-517342361|) (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1)))))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-517342361, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-517342361, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-517342361, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-517342361} OutVars{ULTIMATE.start_main_#t~ite52=|ULTIMATE.start_main_#t~ite52_Out-517342361|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-517342361, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-517342361, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-517342361, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-517342361} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52] because there is no mapped edge [2019-12-26 22:58:28,813 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [883] [883] L834-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_~main$tmp_guard1~0_21 0) (= 0 v_~__unbuffered_p2_EAX~0_28) (= 0 v_~__unbuffered_p1_EAX~0_23) (= |v_ULTIMATE.start_main_#t~ite52_50| v_~z$r_buff1_thd0~0_94) (= v_ULTIMATE.start___VERIFIER_assert_~expression_15 0) (= v_~x~0_47 2) (= v_ULTIMATE.start___VERIFIER_assert_~expression_15 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_10|)) InVars {ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_50|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_23, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_28, ~x~0=v_~x~0_47} OutVars{ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_49|, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_15, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_23, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_94, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_21, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_28, ~x~0=v_~x~0_47, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52, ULTIMATE.start___VERIFIER_assert_~expression, ~z$r_buff1_thd0~0, ~main$tmp_guard1~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-26 22:58:28,931 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.12 10:58:28 BasicIcfg [2019-12-26 22:58:28,931 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-26 22:58:28,936 INFO L168 Benchmark]: Toolchain (without parser) took 103793.85 ms. Allocated memory was 145.2 MB in the beginning and 3.2 GB in the end (delta: 3.0 GB). Free memory was 99.8 MB in the beginning and 955.2 MB in the end (delta: -855.4 MB). Peak memory consumption was 2.2 GB. Max. memory is 7.1 GB. [2019-12-26 22:58:28,937 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 145.2 MB. Free memory was 120.3 MB in the beginning and 120.1 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. [2019-12-26 22:58:28,938 INFO L168 Benchmark]: CACSL2BoogieTranslator took 828.99 ms. Allocated memory was 145.2 MB in the beginning and 202.9 MB in the end (delta: 57.7 MB). Free memory was 99.5 MB in the beginning and 155.1 MB in the end (delta: -55.5 MB). Peak memory consumption was 20.6 MB. Max. memory is 7.1 GB. [2019-12-26 22:58:28,938 INFO L168 Benchmark]: Boogie Procedure Inliner took 69.69 ms. Allocated memory is still 202.9 MB. Free memory was 155.1 MB in the beginning and 152.3 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-26 22:58:28,939 INFO L168 Benchmark]: Boogie Preprocessor took 48.09 ms. Allocated memory is still 202.9 MB. Free memory was 152.3 MB in the beginning and 150.4 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2019-12-26 22:58:28,939 INFO L168 Benchmark]: RCFGBuilder took 833.05 ms. Allocated memory is still 202.9 MB. Free memory was 150.4 MB in the beginning and 100.2 MB in the end (delta: 50.2 MB). Peak memory consumption was 50.2 MB. Max. memory is 7.1 GB. [2019-12-26 22:58:28,940 INFO L168 Benchmark]: TraceAbstraction took 101999.25 ms. Allocated memory was 202.9 MB in the beginning and 3.2 GB in the end (delta: 3.0 GB). Free memory was 99.5 MB in the beginning and 955.2 MB in the end (delta: -855.6 MB). Peak memory consumption was 2.1 GB. Max. memory is 7.1 GB. [2019-12-26 22:58:28,942 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.23 ms. Allocated memory is still 145.2 MB. Free memory was 120.3 MB in the beginning and 120.1 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 828.99 ms. Allocated memory was 145.2 MB in the beginning and 202.9 MB in the end (delta: 57.7 MB). Free memory was 99.5 MB in the beginning and 155.1 MB in the end (delta: -55.5 MB). Peak memory consumption was 20.6 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 69.69 ms. Allocated memory is still 202.9 MB. Free memory was 155.1 MB in the beginning and 152.3 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 48.09 ms. Allocated memory is still 202.9 MB. Free memory was 152.3 MB in the beginning and 150.4 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 833.05 ms. Allocated memory is still 202.9 MB. Free memory was 150.4 MB in the beginning and 100.2 MB in the end (delta: 50.2 MB). Peak memory consumption was 50.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 101999.25 ms. Allocated memory was 202.9 MB in the beginning and 3.2 GB in the end (delta: 3.0 GB). Free memory was 99.5 MB in the beginning and 955.2 MB in the end (delta: -855.6 MB). 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: 6.4s, 175 ProgramPointsBefore, 92 ProgramPointsAfterwards, 212 TransitionsBefore, 102 TransitionsAfterwards, 19004 CoEnabledTransitionPairs, 12 FixpointIterations, 32 TrivialSequentialCompositions, 54 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 35 ConcurrentYvCompositions, 31 ChoiceCompositions, 7186 VarBasedMoverChecksPositive, 380 VarBasedMoverChecksNegative, 188 SemBasedMoverChecksPositive, 286 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 2.1s, 0 MoverChecksTotal, 125946 CheckedPairsTotal, 121 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L820] FCALL, FORK 0 pthread_create(&t1391, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=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] [L734] 1 z$r_buff1_thd0 = z$r_buff0_thd0 [L735] 1 z$r_buff1_thd1 = z$r_buff0_thd1 [L736] 1 z$r_buff1_thd2 = z$r_buff0_thd2 [L737] 1 z$r_buff1_thd3 = z$r_buff0_thd3 [L738] 1 z$r_buff0_thd1 = (_Bool)1 [L741] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=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=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L744] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=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=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L822] FCALL, FORK 0 pthread_create(&t1392, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=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=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L824] FCALL, FORK 0 pthread_create(&t1393, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=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=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L758] 2 x = 2 [L761] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=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=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L764] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=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=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L764] 2 z = z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L778] 3 y = 1 [L781] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L782] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L783] 3 z$flush_delayed = weak$$choice2 [L784] 3 z$mem_tmp = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L785] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) VAL [!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L785] 3 z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L765] 2 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L786] EXPR 3 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0))=1, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L766] 2 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L786] 3 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L787] 3 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L767] 2 z$r_buff0_thd2 = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L788] 3 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L789] 3 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L791] EXPR 3 weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))=0, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L791] 3 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L792] 3 __unbuffered_p2_EAX = z VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L797] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L744] 1 z = z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L745] 1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L746] 1 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L797] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L798] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L799] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L800] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L830] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L830] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L831] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L832] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L833] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 166 locations, 2 error locations. Result: UNSAFE, OverallTime: 101.6s, OverallIterations: 31, TraceHistogramMax: 1, AutomataDifference: 34.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 6638 SDtfs, 7924 SDslu, 20801 SDs, 0 SdLazy, 13445 SolverSat, 422 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 12.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 353 GetRequests, 58 SyntacticMatches, 25 SemanticMatches, 270 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1147 ImplicationChecksByTransitivity, 3.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=142946occurred in iteration=2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 37.6s AutomataMinimizationTime, 30 MinimizatonAttempts, 295737 StatesRemovedByMinimization, 27 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 3.0s InterpolantComputationTime, 1596 NumberOfCodeBlocks, 1596 NumberOfCodeBlocksAsserted, 31 NumberOfCheckSat, 1499 ConstructedInterpolants, 0 QuantifiedInterpolants, 308995 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 30 InterpolantComputations, 30 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...