/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix017_power.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-fae578e [2019-12-18 16:31:42,845 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-18 16:31:42,848 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-18 16:31:42,866 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-18 16:31:42,867 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-18 16:31:42,869 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-18 16:31:42,871 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-18 16:31:42,880 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-18 16:31:42,884 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-18 16:31:42,887 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-18 16:31:42,889 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-18 16:31:42,891 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-18 16:31:42,891 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-18 16:31:42,893 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-18 16:31:42,895 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-18 16:31:42,896 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-18 16:31:42,897 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-18 16:31:42,898 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-18 16:31:42,899 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-18 16:31:42,904 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-18 16:31:42,908 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-18 16:31:42,913 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-18 16:31:42,914 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-18 16:31:42,915 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-18 16:31:42,917 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-18 16:31:42,917 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-18 16:31:42,918 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-18 16:31:42,919 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-18 16:31:42,921 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-18 16:31:42,922 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-18 16:31:42,922 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-18 16:31:42,924 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-18 16:31:42,924 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-18 16:31:42,926 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-18 16:31:42,927 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-18 16:31:42,927 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-18 16:31:42,928 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-18 16:31:42,928 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-18 16:31:42,928 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-18 16:31:42,929 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-18 16:31:42,931 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-18 16:31:42,932 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe.epf [2019-12-18 16:31:42,963 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-18 16:31:42,963 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-18 16:31:42,968 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-18 16:31:42,968 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-18 16:31:42,968 INFO L138 SettingsManager]: * Use SBE=true [2019-12-18 16:31:42,972 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-18 16:31:42,972 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-18 16:31:42,972 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-18 16:31:42,973 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-18 16:31:42,973 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-18 16:31:42,973 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-18 16:31:42,973 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-18 16:31:42,973 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-18 16:31:42,973 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-18 16:31:42,974 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-18 16:31:42,974 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-18 16:31:42,974 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-18 16:31:42,974 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-18 16:31:42,974 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-18 16:31:42,977 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-18 16:31:42,977 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-18 16:31:42,977 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 16:31:42,977 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-18 16:31:42,978 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-18 16:31:42,978 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-18 16:31:42,978 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-18 16:31:42,978 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-18 16:31:42,978 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-18 16:31:42,978 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-18 16:31:43,283 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-18 16:31:43,300 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-18 16:31:43,304 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-18 16:31:43,305 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-18 16:31:43,306 INFO L275 PluginConnector]: CDTParser initialized [2019-12-18 16:31:43,306 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix017_power.opt.i [2019-12-18 16:31:43,369 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1d38cec22/16cc09fac55949ff9c67217a995a7bca/FLAG7859cf14b [2019-12-18 16:31:43,879 INFO L306 CDTParser]: Found 1 translation units. [2019-12-18 16:31:43,880 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix017_power.opt.i [2019-12-18 16:31:43,901 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1d38cec22/16cc09fac55949ff9c67217a995a7bca/FLAG7859cf14b [2019-12-18 16:31:44,143 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1d38cec22/16cc09fac55949ff9c67217a995a7bca [2019-12-18 16:31:44,152 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-18 16:31:44,154 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-18 16:31:44,156 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-18 16:31:44,156 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-18 16:31:44,160 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-18 16:31:44,161 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 04:31:44" (1/1) ... [2019-12-18 16:31:44,167 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3f7cabb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 04:31:44, skipping insertion in model container [2019-12-18 16:31:44,168 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 04:31:44" (1/1) ... [2019-12-18 16:31:44,176 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-18 16:31:44,246 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-18 16:31:44,741 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 16:31:44,759 INFO L203 MainTranslator]: Completed pre-run [2019-12-18 16:31:44,839 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 16:31:44,910 INFO L208 MainTranslator]: Completed translation [2019-12-18 16:31:44,911 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 04:31:44 WrapperNode [2019-12-18 16:31:44,911 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-18 16:31:44,912 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-18 16:31:44,912 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-18 16:31:44,912 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-18 16:31:44,921 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 04:31:44" (1/1) ... [2019-12-18 16:31:44,941 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 04:31:44" (1/1) ... [2019-12-18 16:31:44,973 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-18 16:31:44,974 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-18 16:31:44,974 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-18 16:31:44,974 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-18 16:31:44,988 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 04:31:44" (1/1) ... [2019-12-18 16:31:44,988 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 04:31:44" (1/1) ... [2019-12-18 16:31:44,993 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 04:31:44" (1/1) ... [2019-12-18 16:31:44,993 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 04:31:44" (1/1) ... [2019-12-18 16:31:45,008 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 04:31:44" (1/1) ... [2019-12-18 16:31:45,015 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 04:31:44" (1/1) ... [2019-12-18 16:31:45,019 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 04:31:44" (1/1) ... [2019-12-18 16:31:45,024 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-18 16:31:45,025 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-18 16:31:45,025 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-18 16:31:45,025 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-18 16:31:45,026 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 04:31:44" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 16:31:45,092 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-18 16:31:45,092 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-18 16:31:45,092 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-18 16:31:45,093 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-18 16:31:45,093 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-18 16:31:45,093 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-18 16:31:45,093 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-18 16:31:45,093 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-18 16:31:45,094 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-18 16:31:45,094 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-18 16:31:45,094 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2019-12-18 16:31:45,094 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2019-12-18 16:31:45,094 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-18 16:31:45,094 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-18 16:31:45,095 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-18 16:31:45,097 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-18 16:31:45,895 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-18 16:31:45,896 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-18 16:31:45,897 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 04:31:45 BoogieIcfgContainer [2019-12-18 16:31:45,898 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-18 16:31:45,899 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-18 16:31:45,899 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-18 16:31:45,903 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-18 16:31:45,903 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 04:31:44" (1/3) ... [2019-12-18 16:31:45,904 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7129798c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 04:31:45, skipping insertion in model container [2019-12-18 16:31:45,904 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 04:31:44" (2/3) ... [2019-12-18 16:31:45,905 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7129798c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 04:31:45, skipping insertion in model container [2019-12-18 16:31:45,905 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 04:31:45" (3/3) ... [2019-12-18 16:31:45,907 INFO L109 eAbstractionObserver]: Analyzing ICFG mix017_power.opt.i [2019-12-18 16:31:45,918 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-18 16:31:45,918 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-18 16:31:45,927 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-18 16:31:45,928 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-18 16:31:45,971 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:31:45,971 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:31:45,972 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:31:45,972 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:31:45,972 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:31:45,973 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:31:45,974 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:31:45,974 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:31:45,974 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:31:45,975 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:31:45,975 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:31:45,975 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:31:45,975 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:31:45,976 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:31:45,976 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:31:45,976 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:31:45,977 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:31:45,977 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:31:45,977 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:31:45,978 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:31:45,978 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:31:45,979 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:31:45,979 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:31:45,980 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:31:45,980 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:31:45,980 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:31:45,980 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:31:45,981 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:31:45,981 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:31:45,981 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:31:45,982 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:31:45,982 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:31:45,982 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:31:45,983 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:31:45,983 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:31:45,983 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:31:45,983 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:31:45,984 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:31:45,984 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:31:45,984 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:31:45,985 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:31:45,985 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:31:45,985 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:31:45,986 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:31:45,986 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:31:45,986 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:31:45,987 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:31:45,987 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:31:45,987 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:31:45,987 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:31:45,988 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:31:45,988 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:31:45,988 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:31:45,989 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:31:45,989 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:31:46,017 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:31:46,018 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:31:46,018 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:31:46,018 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:31:46,019 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:31:46,019 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:31:46,019 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:31:46,020 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:31:46,020 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:31:46,020 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:31:46,020 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:31:46,021 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:31:46,022 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:31:46,022 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:31:46,022 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:31:46,022 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:31:46,023 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:31:46,023 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:31:46,023 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:31:46,024 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:31:46,024 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:31:46,024 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:31:46,025 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:31:46,025 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:31:46,026 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:31:46,026 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:31:46,026 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:31:46,027 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:31:46,027 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:31:46,028 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:31:46,028 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:31:46,028 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:31:46,028 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:31:46,028 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:31:46,029 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:31:46,029 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:31:46,029 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:31:46,029 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:31:46,030 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:31:46,030 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:31:46,030 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:31:46,030 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:31:46,030 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:31:46,031 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:31:46,031 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:31:46,032 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:31:46,035 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:31:46,036 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:31:46,036 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:31:46,036 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:31:46,043 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:31:46,043 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:31:46,043 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:31:46,044 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:31:46,045 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:31:46,045 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:31:46,045 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:31:46,045 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:31:46,046 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:31:46,046 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:31:46,046 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:31:46,046 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:31:46,047 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:31:46,047 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:31:46,047 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:31:46,048 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:31:46,048 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:31:46,048 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:31:46,048 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:31:46,048 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:31:46,049 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:31:46,050 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:31:46,050 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:31:46,050 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:31:46,050 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:31:46,051 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:31:46,051 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:31:46,051 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:31:46,051 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:31:46,056 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:31:46,056 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:31:46,057 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:31:46,057 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:31:46,057 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:31:46,057 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:31:46,057 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:31:46,058 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:31:46,058 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:31:46,058 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:31:46,058 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:31:46,058 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:31:46,059 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:31:46,059 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:31:46,063 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:31:46,063 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:31:46,063 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:31:46,064 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:31:46,064 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:31:46,064 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:31:46,064 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:31:46,064 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:31:46,065 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:31:46,065 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:31:46,065 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:31:46,065 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:31:46,065 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:31:46,065 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:31:46,066 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:31:46,066 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:31:46,069 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:31:46,070 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:31:46,070 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:31:46,070 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:31:46,070 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:31:46,070 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:31:46,071 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:31:46,071 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:31:46,071 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:31:46,073 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:31:46,077 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:31:46,077 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:31:46,077 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:31:46,077 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:31:46,079 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:31:46,079 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:31:46,079 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:31:46,080 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:31:46,080 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:31:46,080 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:31:46,080 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:31:46,081 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:31:46,081 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:31:46,081 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:31:46,081 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:31:46,081 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:31:46,081 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:31:46,082 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:31:46,082 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:31:46,082 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:31:46,082 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:31:46,082 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:31:46,082 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:31:46,083 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:31:46,083 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:31:46,083 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:31:46,083 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:31:46,083 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:31:46,084 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:31:46,084 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:31:46,084 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:31:46,089 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:31:46,089 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:31:46,089 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:31:46,089 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:31:46,090 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:31:46,090 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:31:46,090 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:31:46,090 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:31:46,091 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:31:46,091 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:31:46,091 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:31:46,091 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:31:46,106 INFO L249 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2019-12-18 16:31:46,128 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-18 16:31:46,129 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-18 16:31:46,129 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-18 16:31:46,129 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-18 16:31:46,129 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-18 16:31:46,129 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-18 16:31:46,129 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-18 16:31:46,129 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-18 16:31:46,146 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 182 places, 210 transitions [2019-12-18 16:31:46,148 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 182 places, 210 transitions [2019-12-18 16:31:46,238 INFO L126 PetriNetUnfolder]: 41/206 cut-off events. [2019-12-18 16:31:46,238 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 16:31:46,261 INFO L76 FinitePrefix]: Finished finitePrefix Result has 219 conditions, 206 events. 41/206 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 440 event pairs. 12/175 useless extension candidates. Maximal degree in co-relation 172. Up to 2 conditions per place. [2019-12-18 16:31:46,293 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 182 places, 210 transitions [2019-12-18 16:31:46,343 INFO L126 PetriNetUnfolder]: 41/206 cut-off events. [2019-12-18 16:31:46,343 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 16:31:46,355 INFO L76 FinitePrefix]: Finished finitePrefix Result has 219 conditions, 206 events. 41/206 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 440 event pairs. 12/175 useless extension candidates. Maximal degree in co-relation 172. Up to 2 conditions per place. [2019-12-18 16:31:46,379 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 18126 [2019-12-18 16:31:46,380 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-18 16:31:52,536 WARN L192 SmtUtils]: Spent 302.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 99 [2019-12-18 16:31:52,703 WARN L192 SmtUtils]: Spent 164.00 ms on a formula simplification that was a NOOP. DAG size: 97 [2019-12-18 16:31:52,726 INFO L206 etLargeBlockEncoding]: Checked pairs total: 72619 [2019-12-18 16:31:52,726 INFO L214 etLargeBlockEncoding]: Total number of compositions: 123 [2019-12-18 16:31:52,730 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 88 places, 92 transitions [2019-12-18 16:32:26,058 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 160086 states. [2019-12-18 16:32:26,059 INFO L276 IsEmpty]: Start isEmpty. Operand 160086 states. [2019-12-18 16:32:26,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-12-18 16:32:26,066 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:32:26,067 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-12-18 16:32:26,067 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:32:26,073 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:32:26,073 INFO L82 PathProgramCache]: Analyzing trace with hash 1489169700, now seen corresponding path program 1 times [2019-12-18 16:32:26,081 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:32:26,081 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1383729763] [2019-12-18 16:32:26,081 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:32:26,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:32:26,326 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 16:32:26,327 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1383729763] [2019-12-18 16:32:26,328 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:32:26,328 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 16:32:26,328 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [277338471] [2019-12-18 16:32:26,333 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 16:32:26,333 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:32:26,344 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 16:32:26,344 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 16:32:26,346 INFO L87 Difference]: Start difference. First operand 160086 states. Second operand 3 states. [2019-12-18 16:32:32,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:32:32,259 INFO L93 Difference]: Finished difference Result 158106 states and 752394 transitions. [2019-12-18 16:32:32,259 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 16:32:32,261 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2019-12-18 16:32:32,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:32:33,137 INFO L225 Difference]: With dead ends: 158106 [2019-12-18 16:32:33,137 INFO L226 Difference]: Without dead ends: 149058 [2019-12-18 16:32:33,139 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 16:32:42,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149058 states. [2019-12-18 16:32:46,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149058 to 149058. [2019-12-18 16:32:46,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149058 states. [2019-12-18 16:32:51,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149058 states to 149058 states and 708428 transitions. [2019-12-18 16:32:51,814 INFO L78 Accepts]: Start accepts. Automaton has 149058 states and 708428 transitions. Word has length 7 [2019-12-18 16:32:51,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:32:51,815 INFO L462 AbstractCegarLoop]: Abstraction has 149058 states and 708428 transitions. [2019-12-18 16:32:51,815 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 16:32:51,815 INFO L276 IsEmpty]: Start isEmpty. Operand 149058 states and 708428 transitions. [2019-12-18 16:32:51,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-18 16:32:51,827 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:32:51,827 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 16:32:51,827 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:32:51,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:32:51,828 INFO L82 PathProgramCache]: Analyzing trace with hash 1593754123, now seen corresponding path program 1 times [2019-12-18 16:32:51,828 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:32:51,828 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [545093042] [2019-12-18 16:32:51,829 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:32:51,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:32:51,987 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 16:32:51,987 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [545093042] [2019-12-18 16:32:51,988 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:32:51,990 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 16:32:51,990 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1150370046] [2019-12-18 16:32:51,992 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 16:32:51,992 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:32:51,992 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 16:32:51,993 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 16:32:51,993 INFO L87 Difference]: Start difference. First operand 149058 states and 708428 transitions. Second operand 4 states. [2019-12-18 16:32:59,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:32:59,388 INFO L93 Difference]: Finished difference Result 235386 states and 1077036 transitions. [2019-12-18 16:32:59,388 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 16:32:59,389 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2019-12-18 16:32:59,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:33:00,234 INFO L225 Difference]: With dead ends: 235386 [2019-12-18 16:33:00,234 INFO L226 Difference]: Without dead ends: 235190 [2019-12-18 16:33:00,235 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 16:33:07,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235190 states. [2019-12-18 16:33:13,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235190 to 218838. [2019-12-18 16:33:13,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 218838 states. [2019-12-18 16:33:25,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218838 states to 218838 states and 1009170 transitions. [2019-12-18 16:33:25,023 INFO L78 Accepts]: Start accepts. Automaton has 218838 states and 1009170 transitions. Word has length 15 [2019-12-18 16:33:25,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:33:25,024 INFO L462 AbstractCegarLoop]: Abstraction has 218838 states and 1009170 transitions. [2019-12-18 16:33:25,024 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 16:33:25,024 INFO L276 IsEmpty]: Start isEmpty. Operand 218838 states and 1009170 transitions. [2019-12-18 16:33:25,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-18 16:33:25,030 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:33:25,030 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 16:33:25,030 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:33:25,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:33:25,031 INFO L82 PathProgramCache]: Analyzing trace with hash -314430534, now seen corresponding path program 1 times [2019-12-18 16:33:25,031 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:33:25,031 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [502520775] [2019-12-18 16:33:25,031 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:33:25,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:33:25,105 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 16:33:25,108 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [502520775] [2019-12-18 16:33:25,108 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:33:25,109 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 16:33:25,109 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2126764882] [2019-12-18 16:33:25,109 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 16:33:25,109 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:33:25,110 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 16:33:25,110 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 16:33:25,110 INFO L87 Difference]: Start difference. First operand 218838 states and 1009170 transitions. Second operand 3 states. [2019-12-18 16:33:25,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:33:25,801 INFO L93 Difference]: Finished difference Result 136511 states and 567133 transitions. [2019-12-18 16:33:25,802 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 16:33:25,802 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2019-12-18 16:33:25,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:33:34,217 INFO L225 Difference]: With dead ends: 136511 [2019-12-18 16:33:34,218 INFO L226 Difference]: Without dead ends: 136511 [2019-12-18 16:33:34,219 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 16:33:37,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136511 states. [2019-12-18 16:33:39,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136511 to 136511. [2019-12-18 16:33:39,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136511 states. [2019-12-18 16:33:40,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136511 states to 136511 states and 567133 transitions. [2019-12-18 16:33:40,817 INFO L78 Accepts]: Start accepts. Automaton has 136511 states and 567133 transitions. Word has length 15 [2019-12-18 16:33:40,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:33:40,818 INFO L462 AbstractCegarLoop]: Abstraction has 136511 states and 567133 transitions. [2019-12-18 16:33:40,818 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 16:33:40,818 INFO L276 IsEmpty]: Start isEmpty. Operand 136511 states and 567133 transitions. [2019-12-18 16:33:40,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-18 16:33:40,822 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:33:40,822 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 16:33:40,823 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:33:40,823 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:33:40,823 INFO L82 PathProgramCache]: Analyzing trace with hash -1173494608, now seen corresponding path program 1 times [2019-12-18 16:33:40,823 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:33:40,824 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [835057291] [2019-12-18 16:33:40,824 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:33:40,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:33:40,882 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 16:33:40,883 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [835057291] [2019-12-18 16:33:40,883 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:33:40,883 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 16:33:40,883 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [556709475] [2019-12-18 16:33:40,884 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 16:33:40,885 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:33:40,885 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 16:33:40,885 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 16:33:40,885 INFO L87 Difference]: Start difference. First operand 136511 states and 567133 transitions. Second operand 4 states. [2019-12-18 16:33:41,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:33:41,071 INFO L93 Difference]: Finished difference Result 37132 states and 130918 transitions. [2019-12-18 16:33:41,071 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 16:33:41,071 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-12-18 16:33:41,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:33:41,169 INFO L225 Difference]: With dead ends: 37132 [2019-12-18 16:33:41,169 INFO L226 Difference]: Without dead ends: 37132 [2019-12-18 16:33:41,170 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 16:33:41,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37132 states. [2019-12-18 16:33:41,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37132 to 37132. [2019-12-18 16:33:41,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37132 states. [2019-12-18 16:33:41,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37132 states to 37132 states and 130918 transitions. [2019-12-18 16:33:41,860 INFO L78 Accepts]: Start accepts. Automaton has 37132 states and 130918 transitions. Word has length 16 [2019-12-18 16:33:41,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:33:41,861 INFO L462 AbstractCegarLoop]: Abstraction has 37132 states and 130918 transitions. [2019-12-18 16:33:41,861 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 16:33:41,861 INFO L276 IsEmpty]: Start isEmpty. Operand 37132 states and 130918 transitions. [2019-12-18 16:33:41,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-18 16:33:41,863 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:33:41,864 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 16:33:41,864 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:33:41,864 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:33:41,864 INFO L82 PathProgramCache]: Analyzing trace with hash 24118251, now seen corresponding path program 1 times [2019-12-18 16:33:41,864 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:33:41,864 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [262895514] [2019-12-18 16:33:41,864 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:33:41,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:33:41,963 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 16:33:41,964 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [262895514] [2019-12-18 16:33:41,964 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:33:41,964 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 16:33:41,964 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [220945189] [2019-12-18 16:33:41,965 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 16:33:41,965 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:33:41,965 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 16:33:41,965 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 16:33:41,966 INFO L87 Difference]: Start difference. First operand 37132 states and 130918 transitions. Second operand 4 states. [2019-12-18 16:33:45,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:33:45,142 INFO L93 Difference]: Finished difference Result 47278 states and 165300 transitions. [2019-12-18 16:33:45,142 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 16:33:45,142 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-12-18 16:33:45,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:33:45,275 INFO L225 Difference]: With dead ends: 47278 [2019-12-18 16:33:45,275 INFO L226 Difference]: Without dead ends: 47267 [2019-12-18 16:33:45,276 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 16:33:45,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47267 states. [2019-12-18 16:33:46,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47267 to 41603. [2019-12-18 16:33:46,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41603 states. [2019-12-18 16:33:46,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41603 states to 41603 states and 146400 transitions. [2019-12-18 16:33:46,114 INFO L78 Accepts]: Start accepts. Automaton has 41603 states and 146400 transitions. Word has length 16 [2019-12-18 16:33:46,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:33:46,114 INFO L462 AbstractCegarLoop]: Abstraction has 41603 states and 146400 transitions. [2019-12-18 16:33:46,114 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 16:33:46,114 INFO L276 IsEmpty]: Start isEmpty. Operand 41603 states and 146400 transitions. [2019-12-18 16:33:46,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-12-18 16:33:46,132 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:33:46,132 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] [2019-12-18 16:33:46,133 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:33:46,133 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:33:46,133 INFO L82 PathProgramCache]: Analyzing trace with hash -116240952, now seen corresponding path program 1 times [2019-12-18 16:33:46,133 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:33:46,133 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2070286525] [2019-12-18 16:33:46,134 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:33:46,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:33:46,266 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 16:33:46,267 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2070286525] [2019-12-18 16:33:46,267 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:33:46,267 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 16:33:46,267 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1714904594] [2019-12-18 16:33:46,267 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 16:33:46,268 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:33:46,268 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 16:33:46,268 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 16:33:46,268 INFO L87 Difference]: Start difference. First operand 41603 states and 146400 transitions. Second operand 5 states. [2019-12-18 16:33:46,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:33:46,887 INFO L93 Difference]: Finished difference Result 52097 states and 180773 transitions. [2019-12-18 16:33:46,887 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-18 16:33:46,888 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 24 [2019-12-18 16:33:46,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:33:46,989 INFO L225 Difference]: With dead ends: 52097 [2019-12-18 16:33:46,989 INFO L226 Difference]: Without dead ends: 52074 [2019-12-18 16:33:46,989 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-18 16:33:47,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52074 states. [2019-12-18 16:33:48,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52074 to 40948. [2019-12-18 16:33:48,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40948 states. [2019-12-18 16:33:48,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40948 states to 40948 states and 143892 transitions. [2019-12-18 16:33:48,181 INFO L78 Accepts]: Start accepts. Automaton has 40948 states and 143892 transitions. Word has length 24 [2019-12-18 16:33:48,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:33:48,182 INFO L462 AbstractCegarLoop]: Abstraction has 40948 states and 143892 transitions. [2019-12-18 16:33:48,182 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 16:33:48,182 INFO L276 IsEmpty]: Start isEmpty. Operand 40948 states and 143892 transitions. [2019-12-18 16:33:48,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-18 16:33:48,203 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:33:48,203 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 16:33:48,203 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:33:48,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:33:48,204 INFO L82 PathProgramCache]: Analyzing trace with hash 2109697444, now seen corresponding path program 1 times [2019-12-18 16:33:48,204 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:33:48,204 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2054989223] [2019-12-18 16:33:48,205 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:33:48,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:33:48,276 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 16:33:48,276 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2054989223] [2019-12-18 16:33:48,276 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:33:48,277 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 16:33:48,277 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1616263049] [2019-12-18 16:33:48,277 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 16:33:48,277 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:33:48,278 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 16:33:48,278 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-18 16:33:48,278 INFO L87 Difference]: Start difference. First operand 40948 states and 143892 transitions. Second operand 5 states. [2019-12-18 16:33:48,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:33:48,408 INFO L93 Difference]: Finished difference Result 20928 states and 74435 transitions. [2019-12-18 16:33:48,408 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 16:33:48,408 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2019-12-18 16:33:48,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:33:48,448 INFO L225 Difference]: With dead ends: 20928 [2019-12-18 16:33:48,448 INFO L226 Difference]: Without dead ends: 20928 [2019-12-18 16:33:48,449 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-18 16:33:48,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20928 states. [2019-12-18 16:33:48,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20928 to 20736. [2019-12-18 16:33:48,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20736 states. [2019-12-18 16:33:48,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20736 states to 20736 states and 73779 transitions. [2019-12-18 16:33:48,812 INFO L78 Accepts]: Start accepts. Automaton has 20736 states and 73779 transitions. Word has length 28 [2019-12-18 16:33:48,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:33:48,813 INFO L462 AbstractCegarLoop]: Abstraction has 20736 states and 73779 transitions. [2019-12-18 16:33:48,813 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 16:33:48,813 INFO L276 IsEmpty]: Start isEmpty. Operand 20736 states and 73779 transitions. [2019-12-18 16:33:48,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-12-18 16:33:48,847 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:33:48,847 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] [2019-12-18 16:33:48,847 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:33:48,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:33:48,847 INFO L82 PathProgramCache]: Analyzing trace with hash 708784038, now seen corresponding path program 1 times [2019-12-18 16:33:48,848 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:33:48,848 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [143904384] [2019-12-18 16:33:48,848 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:33:49,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:33:49,243 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 16:33:49,243 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [143904384] [2019-12-18 16:33:49,244 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:33:49,244 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 16:33:49,244 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [630137745] [2019-12-18 16:33:49,244 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 16:33:49,245 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:33:49,245 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 16:33:49,245 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 16:33:49,245 INFO L87 Difference]: Start difference. First operand 20736 states and 73779 transitions. Second operand 4 states. [2019-12-18 16:33:49,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:33:49,381 INFO L93 Difference]: Finished difference Result 30054 states and 102106 transitions. [2019-12-18 16:33:49,381 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 16:33:49,381 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 42 [2019-12-18 16:33:49,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:33:49,419 INFO L225 Difference]: With dead ends: 30054 [2019-12-18 16:33:49,419 INFO L226 Difference]: Without dead ends: 21038 [2019-12-18 16:33:49,420 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 16:33:49,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21038 states. [2019-12-18 16:33:49,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21038 to 20942. [2019-12-18 16:33:49,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20942 states. [2019-12-18 16:33:49,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20942 states to 20942 states and 73630 transitions. [2019-12-18 16:33:49,769 INFO L78 Accepts]: Start accepts. Automaton has 20942 states and 73630 transitions. Word has length 42 [2019-12-18 16:33:49,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:33:49,769 INFO L462 AbstractCegarLoop]: Abstraction has 20942 states and 73630 transitions. [2019-12-18 16:33:49,769 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 16:33:49,769 INFO L276 IsEmpty]: Start isEmpty. Operand 20942 states and 73630 transitions. [2019-12-18 16:33:49,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-12-18 16:33:49,802 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:33:49,802 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] [2019-12-18 16:33:49,802 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:33:49,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:33:49,803 INFO L82 PathProgramCache]: Analyzing trace with hash 1622826474, now seen corresponding path program 2 times [2019-12-18 16:33:49,803 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:33:49,803 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1892706003] [2019-12-18 16:33:49,803 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:33:49,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:33:49,885 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 16:33:49,885 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1892706003] [2019-12-18 16:33:49,886 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:33:49,886 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 16:33:49,886 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1628652294] [2019-12-18 16:33:49,886 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 16:33:49,887 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:33:49,887 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 16:33:49,887 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 16:33:49,887 INFO L87 Difference]: Start difference. First operand 20942 states and 73630 transitions. Second operand 5 states. [2019-12-18 16:33:50,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:33:50,544 INFO L93 Difference]: Finished difference Result 31343 states and 109184 transitions. [2019-12-18 16:33:50,544 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 16:33:50,545 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 42 [2019-12-18 16:33:50,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:33:50,603 INFO L225 Difference]: With dead ends: 31343 [2019-12-18 16:33:50,604 INFO L226 Difference]: Without dead ends: 31343 [2019-12-18 16:33:50,604 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-18 16:33:50,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31343 states. [2019-12-18 16:33:51,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31343 to 28179. [2019-12-18 16:33:51,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28179 states. [2019-12-18 16:33:51,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28179 states to 28179 states and 98942 transitions. [2019-12-18 16:33:51,408 INFO L78 Accepts]: Start accepts. Automaton has 28179 states and 98942 transitions. Word has length 42 [2019-12-18 16:33:51,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:33:51,409 INFO L462 AbstractCegarLoop]: Abstraction has 28179 states and 98942 transitions. [2019-12-18 16:33:51,409 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 16:33:51,409 INFO L276 IsEmpty]: Start isEmpty. Operand 28179 states and 98942 transitions. [2019-12-18 16:33:51,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-12-18 16:33:51,466 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:33:51,467 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] [2019-12-18 16:33:51,467 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:33:51,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:33:51,467 INFO L82 PathProgramCache]: Analyzing trace with hash 1262851908, now seen corresponding path program 3 times [2019-12-18 16:33:51,468 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:33:51,468 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [837691930] [2019-12-18 16:33:51,468 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:33:51,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:33:51,589 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 16:33:51,589 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [837691930] [2019-12-18 16:33:51,589 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:33:51,589 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 16:33:51,590 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1312767122] [2019-12-18 16:33:51,590 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 16:33:51,590 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:33:51,590 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 16:33:51,591 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 16:33:51,591 INFO L87 Difference]: Start difference. First operand 28179 states and 98942 transitions. Second operand 3 states. [2019-12-18 16:33:51,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:33:51,739 INFO L93 Difference]: Finished difference Result 28179 states and 98016 transitions. [2019-12-18 16:33:51,740 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 16:33:51,740 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 42 [2019-12-18 16:33:51,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:33:51,791 INFO L225 Difference]: With dead ends: 28179 [2019-12-18 16:33:51,791 INFO L226 Difference]: Without dead ends: 28179 [2019-12-18 16:33:51,792 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 16:33:51,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28179 states. [2019-12-18 16:33:52,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28179 to 28081. [2019-12-18 16:33:52,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28081 states. [2019-12-18 16:33:52,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28081 states to 28081 states and 97669 transitions. [2019-12-18 16:33:52,254 INFO L78 Accepts]: Start accepts. Automaton has 28081 states and 97669 transitions. Word has length 42 [2019-12-18 16:33:52,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:33:52,255 INFO L462 AbstractCegarLoop]: Abstraction has 28081 states and 97669 transitions. [2019-12-18 16:33:52,255 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 16:33:52,255 INFO L276 IsEmpty]: Start isEmpty. Operand 28081 states and 97669 transitions. [2019-12-18 16:33:52,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-12-18 16:33:52,300 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:33:52,301 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] [2019-12-18 16:33:52,301 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:33:52,301 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:33:52,301 INFO L82 PathProgramCache]: Analyzing trace with hash -233422742, now seen corresponding path program 1 times [2019-12-18 16:33:52,301 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:33:52,302 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [966618471] [2019-12-18 16:33:52,302 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:33:52,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:33:52,374 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 16:33:52,375 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [966618471] [2019-12-18 16:33:52,375 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:33:52,375 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 16:33:52,375 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [946797881] [2019-12-18 16:33:52,376 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 16:33:52,377 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:33:52,377 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 16:33:52,377 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-12-18 16:33:52,377 INFO L87 Difference]: Start difference. First operand 28081 states and 97669 transitions. Second operand 6 states. [2019-12-18 16:33:52,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:33:52,592 INFO L93 Difference]: Finished difference Result 26703 states and 94213 transitions. [2019-12-18 16:33:52,592 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 16:33:52,593 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 43 [2019-12-18 16:33:52,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:33:52,649 INFO L225 Difference]: With dead ends: 26703 [2019-12-18 16:33:52,649 INFO L226 Difference]: Without dead ends: 24369 [2019-12-18 16:33:52,650 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-12-18 16:33:52,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24369 states. [2019-12-18 16:33:53,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24369 to 23157. [2019-12-18 16:33:53,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23157 states. [2019-12-18 16:33:53,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23157 states to 23157 states and 81461 transitions. [2019-12-18 16:33:53,327 INFO L78 Accepts]: Start accepts. Automaton has 23157 states and 81461 transitions. Word has length 43 [2019-12-18 16:33:53,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:33:53,328 INFO L462 AbstractCegarLoop]: Abstraction has 23157 states and 81461 transitions. [2019-12-18 16:33:53,328 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 16:33:53,328 INFO L276 IsEmpty]: Start isEmpty. Operand 23157 states and 81461 transitions. [2019-12-18 16:33:53,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-18 16:33:53,371 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:33:53,372 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] [2019-12-18 16:33:53,372 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:33:53,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:33:53,372 INFO L82 PathProgramCache]: Analyzing trace with hash 692220713, now seen corresponding path program 1 times [2019-12-18 16:33:53,372 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:33:53,373 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [562238213] [2019-12-18 16:33:53,373 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:33:53,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:33:53,438 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 16:33:53,439 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [562238213] [2019-12-18 16:33:53,439 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:33:53,439 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 16:33:53,440 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [488277715] [2019-12-18 16:33:53,440 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 16:33:53,440 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:33:53,440 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 16:33:53,441 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 16:33:53,441 INFO L87 Difference]: Start difference. First operand 23157 states and 81461 transitions. Second operand 4 states. [2019-12-18 16:33:53,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:33:53,607 INFO L93 Difference]: Finished difference Result 33241 states and 112360 transitions. [2019-12-18 16:33:53,607 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 16:33:53,607 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 58 [2019-12-18 16:33:53,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:33:53,624 INFO L225 Difference]: With dead ends: 33241 [2019-12-18 16:33:53,624 INFO L226 Difference]: Without dead ends: 10910 [2019-12-18 16:33:53,624 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-18 16:33:53,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10910 states. [2019-12-18 16:33:53,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10910 to 10910. [2019-12-18 16:33:53,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10910 states. [2019-12-18 16:33:53,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10910 states to 10910 states and 33183 transitions. [2019-12-18 16:33:53,787 INFO L78 Accepts]: Start accepts. Automaton has 10910 states and 33183 transitions. Word has length 58 [2019-12-18 16:33:53,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:33:53,787 INFO L462 AbstractCegarLoop]: Abstraction has 10910 states and 33183 transitions. [2019-12-18 16:33:53,787 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 16:33:53,787 INFO L276 IsEmpty]: Start isEmpty. Operand 10910 states and 33183 transitions. [2019-12-18 16:33:53,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-18 16:33:53,799 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:33:53,799 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] [2019-12-18 16:33:53,800 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:33:53,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:33:53,800 INFO L82 PathProgramCache]: Analyzing trace with hash -531606549, now seen corresponding path program 2 times [2019-12-18 16:33:53,800 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:33:53,800 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1044982087] [2019-12-18 16:33:53,800 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:33:53,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:33:53,924 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 16:33:53,924 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1044982087] [2019-12-18 16:33:53,924 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:33:53,924 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 16:33:53,925 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1573812801] [2019-12-18 16:33:53,925 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 16:33:53,925 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:33:53,926 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 16:33:53,926 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-12-18 16:33:53,926 INFO L87 Difference]: Start difference. First operand 10910 states and 33183 transitions. Second operand 9 states. [2019-12-18 16:33:55,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:33:55,560 INFO L93 Difference]: Finished difference Result 26416 states and 80249 transitions. [2019-12-18 16:33:55,560 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-12-18 16:33:55,560 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 58 [2019-12-18 16:33:55,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:33:55,591 INFO L225 Difference]: With dead ends: 26416 [2019-12-18 16:33:55,591 INFO L226 Difference]: Without dead ends: 17909 [2019-12-18 16:33:55,592 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 141 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=144, Invalid=558, Unknown=0, NotChecked=0, Total=702 [2019-12-18 16:33:55,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17909 states. [2019-12-18 16:33:55,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17909 to 13372. [2019-12-18 16:33:55,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13372 states. [2019-12-18 16:33:55,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13372 states to 13372 states and 40279 transitions. [2019-12-18 16:33:55,833 INFO L78 Accepts]: Start accepts. Automaton has 13372 states and 40279 transitions. Word has length 58 [2019-12-18 16:33:55,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:33:55,833 INFO L462 AbstractCegarLoop]: Abstraction has 13372 states and 40279 transitions. [2019-12-18 16:33:55,833 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 16:33:55,833 INFO L276 IsEmpty]: Start isEmpty. Operand 13372 states and 40279 transitions. [2019-12-18 16:33:55,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-18 16:33:55,847 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:33:55,848 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] [2019-12-18 16:33:55,848 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:33:55,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:33:55,848 INFO L82 PathProgramCache]: Analyzing trace with hash -48042617, now seen corresponding path program 3 times [2019-12-18 16:33:55,848 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:33:55,848 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1821722887] [2019-12-18 16:33:55,849 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:33:55,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:33:55,959 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 16:33:55,959 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1821722887] [2019-12-18 16:33:55,960 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:33:55,960 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 16:33:55,960 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1708156695] [2019-12-18 16:33:55,960 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 16:33:55,961 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:33:55,961 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 16:33:55,961 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 16:33:55,961 INFO L87 Difference]: Start difference. First operand 13372 states and 40279 transitions. Second operand 3 states. [2019-12-18 16:33:56,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:33:56,022 INFO L93 Difference]: Finished difference Result 13370 states and 40274 transitions. [2019-12-18 16:33:56,022 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 16:33:56,022 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 58 [2019-12-18 16:33:56,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:33:56,046 INFO L225 Difference]: With dead ends: 13370 [2019-12-18 16:33:56,046 INFO L226 Difference]: Without dead ends: 13370 [2019-12-18 16:33:56,046 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 16:33:56,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13370 states. [2019-12-18 16:33:56,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13370 to 12570. [2019-12-18 16:33:56,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12570 states. [2019-12-18 16:33:56,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12570 states to 12570 states and 38047 transitions. [2019-12-18 16:33:56,331 INFO L78 Accepts]: Start accepts. Automaton has 12570 states and 38047 transitions. Word has length 58 [2019-12-18 16:33:56,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:33:56,331 INFO L462 AbstractCegarLoop]: Abstraction has 12570 states and 38047 transitions. [2019-12-18 16:33:56,331 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 16:33:56,331 INFO L276 IsEmpty]: Start isEmpty. Operand 12570 states and 38047 transitions. [2019-12-18 16:33:56,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-18 16:33:56,344 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:33:56,344 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] [2019-12-18 16:33:56,344 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:33:56,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:33:56,344 INFO L82 PathProgramCache]: Analyzing trace with hash -1658578216, now seen corresponding path program 1 times [2019-12-18 16:33:56,344 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:33:56,344 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [188460463] [2019-12-18 16:33:56,345 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:33:56,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:33:56,501 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 16:33:56,501 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [188460463] [2019-12-18 16:33:56,501 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:33:56,502 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 16:33:56,502 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1569925852] [2019-12-18 16:33:56,502 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-18 16:33:56,502 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:33:56,503 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-18 16:33:56,503 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-12-18 16:33:56,503 INFO L87 Difference]: Start difference. First operand 12570 states and 38047 transitions. Second operand 10 states. [2019-12-18 16:33:58,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:33:58,053 INFO L93 Difference]: Finished difference Result 18689 states and 56057 transitions. [2019-12-18 16:33:58,054 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-18 16:33:58,054 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 59 [2019-12-18 16:33:58,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:33:58,077 INFO L225 Difference]: With dead ends: 18689 [2019-12-18 16:33:58,077 INFO L226 Difference]: Without dead ends: 16519 [2019-12-18 16:33:58,078 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=89, Invalid=331, Unknown=0, NotChecked=0, Total=420 [2019-12-18 16:33:58,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16519 states. [2019-12-18 16:33:58,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16519 to 12898. [2019-12-18 16:33:58,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12898 states. [2019-12-18 16:33:58,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12898 states to 12898 states and 38870 transitions. [2019-12-18 16:33:58,296 INFO L78 Accepts]: Start accepts. Automaton has 12898 states and 38870 transitions. Word has length 59 [2019-12-18 16:33:58,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:33:58,296 INFO L462 AbstractCegarLoop]: Abstraction has 12898 states and 38870 transitions. [2019-12-18 16:33:58,296 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-18 16:33:58,296 INFO L276 IsEmpty]: Start isEmpty. Operand 12898 states and 38870 transitions. [2019-12-18 16:33:58,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-18 16:33:58,310 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:33:58,310 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] [2019-12-18 16:33:58,311 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:33:58,311 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:33:58,311 INFO L82 PathProgramCache]: Analyzing trace with hash -1816631088, now seen corresponding path program 2 times [2019-12-18 16:33:58,311 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:33:58,311 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1702958766] [2019-12-18 16:33:58,311 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:33:58,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:33:58,486 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 16:33:58,486 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1702958766] [2019-12-18 16:33:58,486 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:33:58,486 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-18 16:33:58,487 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [360276177] [2019-12-18 16:33:58,487 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-18 16:33:58,487 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:33:58,487 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-18 16:33:58,488 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2019-12-18 16:33:58,488 INFO L87 Difference]: Start difference. First operand 12898 states and 38870 transitions. Second operand 11 states. [2019-12-18 16:33:59,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:33:59,709 INFO L93 Difference]: Finished difference Result 16572 states and 49634 transitions. [2019-12-18 16:33:59,709 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-18 16:33:59,709 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 59 [2019-12-18 16:33:59,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:33:59,732 INFO L225 Difference]: With dead ends: 16572 [2019-12-18 16:33:59,732 INFO L226 Difference]: Without dead ends: 15626 [2019-12-18 16:33:59,732 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=73, Invalid=307, Unknown=0, NotChecked=0, Total=380 [2019-12-18 16:33:59,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15626 states. [2019-12-18 16:33:59,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15626 to 12908. [2019-12-18 16:33:59,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12908 states. [2019-12-18 16:33:59,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12908 states to 12908 states and 38893 transitions. [2019-12-18 16:33:59,943 INFO L78 Accepts]: Start accepts. Automaton has 12908 states and 38893 transitions. Word has length 59 [2019-12-18 16:33:59,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:33:59,944 INFO L462 AbstractCegarLoop]: Abstraction has 12908 states and 38893 transitions. [2019-12-18 16:33:59,944 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-18 16:33:59,944 INFO L276 IsEmpty]: Start isEmpty. Operand 12908 states and 38893 transitions. [2019-12-18 16:33:59,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-18 16:33:59,958 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:33:59,958 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] [2019-12-18 16:33:59,958 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:33:59,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:33:59,958 INFO L82 PathProgramCache]: Analyzing trace with hash 720693238, now seen corresponding path program 3 times [2019-12-18 16:33:59,958 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:33:59,959 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1130867347] [2019-12-18 16:33:59,959 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:33:59,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:34:00,180 WARN L192 SmtUtils]: Spent 135.00 ms on a formula simplification that was a NOOP. DAG size: 3 [2019-12-18 16:34:00,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-18 16:34:00,702 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1130867347] [2019-12-18 16:34:00,702 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:34:00,702 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-12-18 16:34:00,702 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2141074570] [2019-12-18 16:34:00,702 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-12-18 16:34:00,703 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:34:00,703 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-12-18 16:34:00,703 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=278, Unknown=0, NotChecked=0, Total=342 [2019-12-18 16:34:00,703 INFO L87 Difference]: Start difference. First operand 12908 states and 38893 transitions. Second operand 19 states. [2019-12-18 16:34:06,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:34:06,728 INFO L93 Difference]: Finished difference Result 20637 states and 61701 transitions. [2019-12-18 16:34:06,728 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2019-12-18 16:34:06,728 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 59 [2019-12-18 16:34:06,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:34:06,754 INFO L225 Difference]: With dead ends: 20637 [2019-12-18 16:34:06,754 INFO L226 Difference]: Without dead ends: 18245 [2019-12-18 16:34:06,756 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 1 SyntacticMatches, 4 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1112 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=586, Invalid=3446, Unknown=0, NotChecked=0, Total=4032 [2019-12-18 16:34:06,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18245 states. [2019-12-18 16:34:07,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18245 to 13112. [2019-12-18 16:34:07,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13112 states. [2019-12-18 16:34:07,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13112 states to 13112 states and 39419 transitions. [2019-12-18 16:34:07,057 INFO L78 Accepts]: Start accepts. Automaton has 13112 states and 39419 transitions. Word has length 59 [2019-12-18 16:34:07,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:34:07,057 INFO L462 AbstractCegarLoop]: Abstraction has 13112 states and 39419 transitions. [2019-12-18 16:34:07,058 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-12-18 16:34:07,058 INFO L276 IsEmpty]: Start isEmpty. Operand 13112 states and 39419 transitions. [2019-12-18 16:34:07,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-18 16:34:07,071 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:34:07,071 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] [2019-12-18 16:34:07,071 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:34:07,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:34:07,072 INFO L82 PathProgramCache]: Analyzing trace with hash -512977392, now seen corresponding path program 1 times [2019-12-18 16:34:07,072 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:34:07,072 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [865836764] [2019-12-18 16:34:07,072 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:34:07,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:34:07,129 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 16:34:07,130 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [865836764] [2019-12-18 16:34:07,130 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:34:07,130 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 16:34:07,131 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1966994246] [2019-12-18 16:34:07,131 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 16:34:07,131 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:34:07,131 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 16:34:07,132 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 16:34:07,132 INFO L87 Difference]: Start difference. First operand 13112 states and 39419 transitions. Second operand 3 states. [2019-12-18 16:34:07,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:34:07,237 INFO L93 Difference]: Finished difference Result 17411 states and 52565 transitions. [2019-12-18 16:34:07,237 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 16:34:07,238 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 59 [2019-12-18 16:34:07,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:34:07,272 INFO L225 Difference]: With dead ends: 17411 [2019-12-18 16:34:07,272 INFO L226 Difference]: Without dead ends: 17411 [2019-12-18 16:34:07,273 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 16:34:07,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17411 states. [2019-12-18 16:34:07,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17411 to 15785. [2019-12-18 16:34:07,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15785 states. [2019-12-18 16:34:07,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15785 states to 15785 states and 47682 transitions. [2019-12-18 16:34:07,772 INFO L78 Accepts]: Start accepts. Automaton has 15785 states and 47682 transitions. Word has length 59 [2019-12-18 16:34:07,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:34:07,772 INFO L462 AbstractCegarLoop]: Abstraction has 15785 states and 47682 transitions. [2019-12-18 16:34:07,772 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 16:34:07,773 INFO L276 IsEmpty]: Start isEmpty. Operand 15785 states and 47682 transitions. [2019-12-18 16:34:07,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-18 16:34:07,805 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:34:07,805 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] [2019-12-18 16:34:07,806 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:34:07,806 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:34:07,806 INFO L82 PathProgramCache]: Analyzing trace with hash 758912560, now seen corresponding path program 4 times [2019-12-18 16:34:07,806 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:34:07,807 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [293771706] [2019-12-18 16:34:07,807 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:34:07,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:34:08,036 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 16:34:08,036 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [293771706] [2019-12-18 16:34:08,036 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:34:08,036 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-18 16:34:08,037 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2001275408] [2019-12-18 16:34:08,037 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-18 16:34:08,038 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:34:08,038 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-18 16:34:08,038 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2019-12-18 16:34:08,038 INFO L87 Difference]: Start difference. First operand 15785 states and 47682 transitions. Second operand 12 states. [2019-12-18 16:34:09,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:34:09,835 INFO L93 Difference]: Finished difference Result 21388 states and 64110 transitions. [2019-12-18 16:34:09,836 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-12-18 16:34:09,836 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 59 [2019-12-18 16:34:09,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:34:09,863 INFO L225 Difference]: With dead ends: 21388 [2019-12-18 16:34:09,863 INFO L226 Difference]: Without dead ends: 19686 [2019-12-18 16:34:09,864 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=112, Invalid=488, Unknown=0, NotChecked=0, Total=600 [2019-12-18 16:34:09,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19686 states. [2019-12-18 16:34:10,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19686 to 15537. [2019-12-18 16:34:10,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15537 states. [2019-12-18 16:34:10,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15537 states to 15537 states and 47016 transitions. [2019-12-18 16:34:10,126 INFO L78 Accepts]: Start accepts. Automaton has 15537 states and 47016 transitions. Word has length 59 [2019-12-18 16:34:10,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:34:10,126 INFO L462 AbstractCegarLoop]: Abstraction has 15537 states and 47016 transitions. [2019-12-18 16:34:10,127 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-18 16:34:10,127 INFO L276 IsEmpty]: Start isEmpty. Operand 15537 states and 47016 transitions. [2019-12-18 16:34:10,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-18 16:34:10,145 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:34:10,146 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] [2019-12-18 16:34:10,146 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:34:10,146 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:34:10,146 INFO L82 PathProgramCache]: Analyzing trace with hash -998730410, now seen corresponding path program 5 times [2019-12-18 16:34:10,146 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:34:10,147 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [453366423] [2019-12-18 16:34:10,147 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:34:10,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:34:10,753 WARN L192 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 10 [2019-12-18 16:34:10,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-18 16:34:10,973 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [453366423] [2019-12-18 16:34:10,973 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:34:10,974 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2019-12-18 16:34:10,974 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [707296025] [2019-12-18 16:34:10,974 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-12-18 16:34:10,974 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:34:10,975 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-12-18 16:34:10,975 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=312, Unknown=0, NotChecked=0, Total=380 [2019-12-18 16:34:10,975 INFO L87 Difference]: Start difference. First operand 15537 states and 47016 transitions. Second operand 20 states. [2019-12-18 16:34:16,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:34:16,010 INFO L93 Difference]: Finished difference Result 24668 states and 73300 transitions. [2019-12-18 16:34:16,010 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2019-12-18 16:34:16,010 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 59 [2019-12-18 16:34:16,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:34:16,042 INFO L225 Difference]: With dead ends: 24668 [2019-12-18 16:34:16,042 INFO L226 Difference]: Without dead ends: 22978 [2019-12-18 16:34:16,044 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 1 SyntacticMatches, 3 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1265 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=675, Invalid=3747, Unknown=0, NotChecked=0, Total=4422 [2019-12-18 16:34:16,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22978 states. [2019-12-18 16:34:16,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22978 to 15521. [2019-12-18 16:34:16,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15521 states. [2019-12-18 16:34:16,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15521 states to 15521 states and 46966 transitions. [2019-12-18 16:34:16,326 INFO L78 Accepts]: Start accepts. Automaton has 15521 states and 46966 transitions. Word has length 59 [2019-12-18 16:34:16,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:34:16,326 INFO L462 AbstractCegarLoop]: Abstraction has 15521 states and 46966 transitions. [2019-12-18 16:34:16,326 INFO L463 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-12-18 16:34:16,326 INFO L276 IsEmpty]: Start isEmpty. Operand 15521 states and 46966 transitions. [2019-12-18 16:34:16,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-18 16:34:16,461 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:34:16,461 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] [2019-12-18 16:34:16,461 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:34:16,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:34:16,461 INFO L82 PathProgramCache]: Analyzing trace with hash -186666566, now seen corresponding path program 6 times [2019-12-18 16:34:16,462 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:34:16,462 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [348165004] [2019-12-18 16:34:16,462 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:34:16,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:34:16,720 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 16:34:16,721 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [348165004] [2019-12-18 16:34:16,722 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:34:16,722 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-12-18 16:34:16,722 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [486569605] [2019-12-18 16:34:16,723 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-18 16:34:16,723 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:34:16,724 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-18 16:34:16,724 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2019-12-18 16:34:16,724 INFO L87 Difference]: Start difference. First operand 15521 states and 46966 transitions. Second operand 14 states. [2019-12-18 16:34:18,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:34:18,999 INFO L93 Difference]: Finished difference Result 22602 states and 68065 transitions. [2019-12-18 16:34:19,005 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-12-18 16:34:19,005 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 59 [2019-12-18 16:34:19,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:34:19,034 INFO L225 Difference]: With dead ends: 22602 [2019-12-18 16:34:19,034 INFO L226 Difference]: Without dead ends: 19862 [2019-12-18 16:34:19,034 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 212 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=218, Invalid=1042, Unknown=0, NotChecked=0, Total=1260 [2019-12-18 16:34:19,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19862 states. [2019-12-18 16:34:19,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19862 to 15239. [2019-12-18 16:34:19,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15239 states. [2019-12-18 16:34:19,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15239 states to 15239 states and 46171 transitions. [2019-12-18 16:34:19,293 INFO L78 Accepts]: Start accepts. Automaton has 15239 states and 46171 transitions. Word has length 59 [2019-12-18 16:34:19,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:34:19,293 INFO L462 AbstractCegarLoop]: Abstraction has 15239 states and 46171 transitions. [2019-12-18 16:34:19,293 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-18 16:34:19,293 INFO L276 IsEmpty]: Start isEmpty. Operand 15239 states and 46171 transitions. [2019-12-18 16:34:19,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-18 16:34:19,309 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:34:19,309 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] [2019-12-18 16:34:19,309 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:34:19,310 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:34:19,310 INFO L82 PathProgramCache]: Analyzing trace with hash -1744760602, now seen corresponding path program 7 times [2019-12-18 16:34:19,310 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:34:19,310 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1258427906] [2019-12-18 16:34:19,310 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:34:19,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:34:19,488 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 16:34:19,489 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1258427906] [2019-12-18 16:34:19,492 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:34:19,492 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-18 16:34:19,492 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [636832349] [2019-12-18 16:34:19,492 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-18 16:34:19,493 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:34:19,493 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-18 16:34:19,493 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2019-12-18 16:34:19,493 INFO L87 Difference]: Start difference. First operand 15239 states and 46171 transitions. Second operand 12 states. [2019-12-18 16:34:20,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:34:20,879 INFO L93 Difference]: Finished difference Result 19240 states and 57867 transitions. [2019-12-18 16:34:20,880 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-18 16:34:20,880 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 59 [2019-12-18 16:34:20,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:34:20,906 INFO L225 Difference]: With dead ends: 19240 [2019-12-18 16:34:20,906 INFO L226 Difference]: Without dead ends: 18562 [2019-12-18 16:34:20,907 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=100, Invalid=406, Unknown=0, NotChecked=0, Total=506 [2019-12-18 16:34:20,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18562 states. [2019-12-18 16:34:21,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18562 to 15163. [2019-12-18 16:34:21,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15163 states. [2019-12-18 16:34:21,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15163 states to 15163 states and 45974 transitions. [2019-12-18 16:34:21,250 INFO L78 Accepts]: Start accepts. Automaton has 15163 states and 45974 transitions. Word has length 59 [2019-12-18 16:34:21,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:34:21,250 INFO L462 AbstractCegarLoop]: Abstraction has 15163 states and 45974 transitions. [2019-12-18 16:34:21,250 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-18 16:34:21,250 INFO L276 IsEmpty]: Start isEmpty. Operand 15163 states and 45974 transitions. [2019-12-18 16:34:21,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-18 16:34:21,265 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:34:21,265 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] [2019-12-18 16:34:21,266 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:34:21,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:34:21,266 INFO L82 PathProgramCache]: Analyzing trace with hash -300648998, now seen corresponding path program 8 times [2019-12-18 16:34:21,266 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:34:21,267 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1085556050] [2019-12-18 16:34:21,267 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:34:21,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 16:34:21,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 16:34:21,388 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-18 16:34:21,388 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-18 16:34:21,393 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [857] [857] ULTIMATE.startENTRY-->L845: Formula: (let ((.cse0 (store |v_#valid_101| 0 0))) (and (= 0 v_~y$r_buff0_thd3~0_200) (= v_~weak$$choice2~0_146 0) (= v_~z~0_79 0) (= 0 v_~y$read_delayed_var~0.offset_7) (= |v_#NULL.offset_6| 0) (= v_~y$read_delayed~0_7 0) (= v_~y$w_buff0_used~0_906 0) (= |v_ULTIMATE.start_main_~#t437~0.offset_27| 0) (= v_~__unbuffered_cnt~0_174 0) (= v_~main$tmp_guard1~0_51 0) (= (store |v_#memory_int_22| |v_ULTIMATE.start_main_~#t437~0.base_42| (store (select |v_#memory_int_22| |v_ULTIMATE.start_main_~#t437~0.base_42|) |v_ULTIMATE.start_main_~#t437~0.offset_27| 0)) |v_#memory_int_21|) (= |v_#valid_99| (store .cse0 |v_ULTIMATE.start_main_~#t437~0.base_42| 1)) (= 0 v_~__unbuffered_p3_EAX~0_50) (= 0 v_~__unbuffered_p2_EAX~0_106) (= 0 v_~y$r_buff0_thd2~0_339) (= v_~y$mem_tmp~0_18 0) (= 0 v_~__unbuffered_p1_EAX~0_54) (= 0 v_~y$r_buff1_thd4~0_165) (= 0 v_~y$w_buff0~0_533) (= 0 v_~y$r_buff1_thd2~0_235) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t437~0.base_42|)) (= 0 v_~__unbuffered_p3_EBX~0_50) (= 0 |v_#NULL.base_6|) (= v_~y$w_buff1~0_348 0) (= 0 v_~y$r_buff0_thd4~0_151) (= 0 v_~y$read_delayed_var~0.base_7) (= 0 v_~__unbuffered_p0_EAX~0_64) (< 0 |v_#StackHeapBarrier_20|) (= 0 v_~weak$$choice0~0_16) (= v_~a~0_35 0) (= v_~main$tmp_guard0~0_21 0) (= 0 v_~y$flush_delayed~0_42) (= v_~x~0_39 0) (= v_~y$r_buff0_thd1~0_73 0) (< |v_#StackHeapBarrier_20| |v_ULTIMATE.start_main_~#t437~0.base_42|) (= 0 v_~y$r_buff1_thd1~0_74) (= v_~y~0_158 0) (= v_~y$r_buff1_thd0~0_169 0) (= v_~y$r_buff0_thd0~0_171 0) (= v_~y$w_buff1_used~0_540 0) (= |v_#length_31| (store |v_#length_32| |v_ULTIMATE.start_main_~#t437~0.base_42| 4)) (= 0 v_~y$r_buff1_thd3~0_136))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_20|, #valid=|v_#valid_101|, #memory_int=|v_#memory_int_22|, #length=|v_#length_32|} OutVars{ULTIMATE.start_main_~#t438~0.offset=|v_ULTIMATE.start_main_~#t438~0.offset_19|, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_110|, #NULL.offset=|v_#NULL.offset_6|, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_39|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_43|, ~y$read_delayed~0=v_~y$read_delayed~0_7, ~a~0=v_~a~0_35, ~y$mem_tmp~0=v_~y$mem_tmp~0_18, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_64, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_136, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_54, ULTIMATE.start_main_~#t440~0.offset=|v_ULTIMATE.start_main_~#t440~0.offset_19|, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_73, ~y$flush_delayed~0=v_~y$flush_delayed~0_42, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_50, #length=|v_#length_31|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_106, ULTIMATE.start_main_#t~nondet41=|v_ULTIMATE.start_main_#t~nondet41_21|, ULTIMATE.start_main_~#t439~0.base=|v_ULTIMATE.start_main_~#t439~0.base_24|, ULTIMATE.start_main_~#t438~0.base=|v_ULTIMATE.start_main_~#t438~0.base_34|, ~weak$$choice0~0=v_~weak$$choice0~0_16, #StackHeapBarrier=|v_#StackHeapBarrier_20|, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_165, ~y$w_buff1~0=v_~y$w_buff1~0_348, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_7, ULTIMATE.start_main_~#t437~0.offset=|v_ULTIMATE.start_main_~#t437~0.offset_27|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_339, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_9|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_174, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_169, ~x~0=v_~x~0_39, ULTIMATE.start_main_~#t440~0.base=|v_ULTIMATE.start_main_~#t440~0.base_25|, ~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_7, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_906, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_35|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_51, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_41|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_239|, ULTIMATE.start_main_~#t439~0.offset=|v_ULTIMATE.start_main_~#t439~0.offset_18|, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_74, ~y$w_buff0~0=v_~y$w_buff0~0_533, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_200, ~y~0=v_~y~0_158, ULTIMATE.start_main_~#t437~0.base=|v_ULTIMATE.start_main_~#t437~0.base_42|, ULTIMATE.start_main_#t~nondet40=|v_ULTIMATE.start_main_#t~nondet40_10|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_21, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_50, #NULL.base=|v_#NULL.base_6|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_235, ~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_151, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_33|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_171, #valid=|v_#valid_99|, #memory_int=|v_#memory_int_21|, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_9|, ~z~0=v_~z~0_79, ~weak$$choice2~0=v_~weak$$choice2~0_146, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_540} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t438~0.offset, ULTIMATE.start_main_#t~ite47, #NULL.offset, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite45, ~y$read_delayed~0, ~a~0, ~y$mem_tmp~0, ~__unbuffered_p0_EAX~0, ~y$r_buff1_thd3~0, ~__unbuffered_p1_EAX~0, ULTIMATE.start_main_~#t440~0.offset, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, ~__unbuffered_p3_EAX~0, #length, ~__unbuffered_p2_EAX~0, ULTIMATE.start_main_#t~nondet41, ULTIMATE.start_main_~#t439~0.base, ULTIMATE.start_main_~#t438~0.base, ~weak$$choice0~0, ~y$r_buff1_thd4~0, ~y$w_buff1~0, ~y$read_delayed_var~0.base, ULTIMATE.start_main_~#t437~0.offset, ~y$r_buff0_thd2~0, ULTIMATE.start_main_#t~nondet38, ~__unbuffered_cnt~0, ~y$r_buff1_thd0~0, ~x~0, ULTIMATE.start_main_~#t440~0.base, ~y$read_delayed_var~0.offset, ~y$w_buff0_used~0, ULTIMATE.start_main_#t~ite46, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite44, ULTIMATE.start_main_~#t439~0.offset, ~y$r_buff1_thd1~0, ~y$w_buff0~0, ~y$r_buff0_thd3~0, ~y~0, ULTIMATE.start_main_~#t437~0.base, ULTIMATE.start_main_#t~nondet40, ~main$tmp_guard0~0, ~__unbuffered_p3_EBX~0, #NULL.base, ~y$r_buff1_thd2~0, ~y$r_buff0_thd4~0, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, #valid, #memory_int, ULTIMATE.start_main_#t~nondet39, ~z~0, ~weak$$choice2~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-18 16:34:21,395 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [811] [811] L845-1-->L847: Formula: (and (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t438~0.base_11| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t438~0.base_11|) |v_ULTIMATE.start_main_~#t438~0.offset_10| 1)) |v_#memory_int_17|) (= 0 (select |v_#valid_44| |v_ULTIMATE.start_main_~#t438~0.base_11|)) (= (store |v_#valid_44| |v_ULTIMATE.start_main_~#t438~0.base_11| 1) |v_#valid_43|) (not (= 0 |v_ULTIMATE.start_main_~#t438~0.base_11|)) (= |v_ULTIMATE.start_main_~#t438~0.offset_10| 0) (= |v_#length_23| (store |v_#length_24| |v_ULTIMATE.start_main_~#t438~0.base_11| 4)) (< |v_#StackHeapBarrier_13| |v_ULTIMATE.start_main_~#t438~0.base_11|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_13|, #valid=|v_#valid_44|, #memory_int=|v_#memory_int_18|, #length=|v_#length_24|} OutVars{ULTIMATE.start_main_~#t438~0.base=|v_ULTIMATE.start_main_~#t438~0.base_11|, #StackHeapBarrier=|v_#StackHeapBarrier_13|, ULTIMATE.start_main_~#t438~0.offset=|v_ULTIMATE.start_main_~#t438~0.offset_10|, #valid=|v_#valid_43|, #memory_int=|v_#memory_int_17|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_5|, #length=|v_#length_23|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t438~0.base, ULTIMATE.start_main_~#t438~0.offset, #valid, #memory_int, ULTIMATE.start_main_#t~nondet38, #length] because there is no mapped edge [2019-12-18 16:34:21,396 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [808] [808] L847-1-->L849: Formula: (and (not (= |v_ULTIMATE.start_main_~#t439~0.base_10| 0)) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t439~0.base_10| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t439~0.base_10|) |v_ULTIMATE.start_main_~#t439~0.offset_9| 2)) |v_#memory_int_13|) (= 0 (select |v_#valid_40| |v_ULTIMATE.start_main_~#t439~0.base_10|)) (= |v_#length_19| (store |v_#length_20| |v_ULTIMATE.start_main_~#t439~0.base_10| 4)) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t439~0.base_10|) (= |v_ULTIMATE.start_main_~#t439~0.offset_9| 0) (= |v_#valid_39| (store |v_#valid_40| |v_ULTIMATE.start_main_~#t439~0.base_10| 1))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_40|, #memory_int=|v_#memory_int_14|, #length=|v_#length_20|} OutVars{ULTIMATE.start_main_~#t439~0.offset=|v_ULTIMATE.start_main_~#t439~0.offset_9|, #StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_39|, #memory_int=|v_#memory_int_13|, #length=|v_#length_19|, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_5|, ULTIMATE.start_main_~#t439~0.base=|v_ULTIMATE.start_main_~#t439~0.base_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t439~0.offset, #valid, #memory_int, #length, ULTIMATE.start_main_#t~nondet39, ULTIMATE.start_main_~#t439~0.base] because there is no mapped edge [2019-12-18 16:34:21,397 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [832] [832] P2ENTRY-->L4-3: Formula: (and (= 1 ~y$w_buff0~0_Out-47735896) (= |P2Thread1of1ForFork3___VERIFIER_assert_#in~expression_Out-47735896| P2Thread1of1ForFork3___VERIFIER_assert_~expression_Out-47735896) (= |P2Thread1of1ForFork3_#in~arg.base_In-47735896| P2Thread1of1ForFork3_~arg.base_Out-47735896) (= ~y$w_buff1~0_Out-47735896 ~y$w_buff0~0_In-47735896) (= ~y$w_buff0_used~0_Out-47735896 1) (= |P2Thread1of1ForFork3_#in~arg.offset_In-47735896| P2Thread1of1ForFork3_~arg.offset_Out-47735896) (= (mod ~y$w_buff1_used~0_Out-47735896 256) 0) (= |P2Thread1of1ForFork3___VERIFIER_assert_#in~expression_Out-47735896| 1) (= ~y$w_buff1_used~0_Out-47735896 ~y$w_buff0_used~0_In-47735896)) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-47735896, ~y$w_buff0~0=~y$w_buff0~0_In-47735896, P2Thread1of1ForFork3_#in~arg.base=|P2Thread1of1ForFork3_#in~arg.base_In-47735896|, P2Thread1of1ForFork3_#in~arg.offset=|P2Thread1of1ForFork3_#in~arg.offset_In-47735896|} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_Out-47735896, ~y$w_buff1~0=~y$w_buff1~0_Out-47735896, P2Thread1of1ForFork3___VERIFIER_assert_#in~expression=|P2Thread1of1ForFork3___VERIFIER_assert_#in~expression_Out-47735896|, ~y$w_buff0~0=~y$w_buff0~0_Out-47735896, P2Thread1of1ForFork3_~arg.base=P2Thread1of1ForFork3_~arg.base_Out-47735896, P2Thread1of1ForFork3___VERIFIER_assert_~expression=P2Thread1of1ForFork3___VERIFIER_assert_~expression_Out-47735896, P2Thread1of1ForFork3_#in~arg.base=|P2Thread1of1ForFork3_#in~arg.base_In-47735896|, P2Thread1of1ForFork3_~arg.offset=P2Thread1of1ForFork3_~arg.offset_Out-47735896, P2Thread1of1ForFork3_#in~arg.offset=|P2Thread1of1ForFork3_#in~arg.offset_In-47735896|, ~y$w_buff1_used~0=~y$w_buff1_used~0_Out-47735896} AuxVars[] AssignedVars[~y$w_buff0_used~0, ~y$w_buff1~0, P2Thread1of1ForFork3___VERIFIER_assert_#in~expression, ~y$w_buff0~0, P2Thread1of1ForFork3_~arg.base, P2Thread1of1ForFork3___VERIFIER_assert_~expression, P2Thread1of1ForFork3_~arg.offset, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-18 16:34:21,400 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [809] [809] L849-1-->L851: Formula: (and (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t440~0.base_13| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t440~0.base_13|) |v_ULTIMATE.start_main_~#t440~0.offset_11| 3)) |v_#memory_int_15|) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t440~0.base_13|) (= 0 |v_ULTIMATE.start_main_~#t440~0.offset_11|) (not (= |v_ULTIMATE.start_main_~#t440~0.base_13| 0)) (= (store |v_#length_22| |v_ULTIMATE.start_main_~#t440~0.base_13| 4) |v_#length_21|) (= |v_#valid_41| (store |v_#valid_42| |v_ULTIMATE.start_main_~#t440~0.base_13| 1)) (= 0 (select |v_#valid_42| |v_ULTIMATE.start_main_~#t440~0.base_13|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_42|, #memory_int=|v_#memory_int_16|, #length=|v_#length_22|} OutVars{ULTIMATE.start_main_~#t440~0.base=|v_ULTIMATE.start_main_~#t440~0.base_13|, #StackHeapBarrier=|v_#StackHeapBarrier_12|, ULTIMATE.start_main_#t~nondet40=|v_ULTIMATE.start_main_#t~nondet40_6|, ULTIMATE.start_main_~#t440~0.offset=|v_ULTIMATE.start_main_~#t440~0.offset_11|, #valid=|v_#valid_41|, #memory_int=|v_#memory_int_15|, #length=|v_#length_21|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t440~0.base, ULTIMATE.start_main_#t~nondet40, ULTIMATE.start_main_~#t440~0.offset, #valid, #memory_int, #length] because there is no mapped edge [2019-12-18 16:34:21,402 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [820] [820] P0ENTRY-->P0EXIT: Formula: (and (= v_~x~0_23 v_~__unbuffered_p0_EAX~0_23) (= v_P0Thread1of1ForFork1_~arg.offset_15 |v_P0Thread1of1ForFork1_#in~arg.offset_15|) (= |v_P0Thread1of1ForFork1_#in~arg.base_15| v_P0Thread1of1ForFork1_~arg.base_15) (= 0 |v_P0Thread1of1ForFork1_#res.offset_7|) (= v_~__unbuffered_cnt~0_106 (+ v_~__unbuffered_cnt~0_107 1)) (= 0 |v_P0Thread1of1ForFork1_#res.base_7|) (= v_~a~0_19 1)) InVars {P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_15|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_107, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_15|, ~x~0=v_~x~0_23} OutVars{~a~0=v_~a~0_19, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_23, P0Thread1of1ForFork1_#res.offset=|v_P0Thread1of1ForFork1_#res.offset_7|, P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_15|, P0Thread1of1ForFork1_#res.base=|v_P0Thread1of1ForFork1_#res.base_7|, P0Thread1of1ForFork1_~arg.offset=v_P0Thread1of1ForFork1_~arg.offset_15, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_106, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_15|, ~x~0=v_~x~0_23, P0Thread1of1ForFork1_~arg.base=v_P0Thread1of1ForFork1_~arg.base_15} AuxVars[] AssignedVars[~a~0, ~__unbuffered_p0_EAX~0, P0Thread1of1ForFork1_#res.offset, P0Thread1of1ForFork1_#res.base, P0Thread1of1ForFork1_~arg.offset, ~__unbuffered_cnt~0, P0Thread1of1ForFork1_~arg.base] because there is no mapped edge [2019-12-18 16:34:21,404 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [776] [776] L822-2-->L822-5: Formula: (let ((.cse1 (= |P3Thread1of1ForFork0_#t~ite32_Out-210347384| |P3Thread1of1ForFork0_#t~ite33_Out-210347384|)) (.cse0 (= 0 (mod ~y$r_buff1_thd4~0_In-210347384 256))) (.cse2 (= (mod ~y$w_buff1_used~0_In-210347384 256) 0))) (or (and (not .cse0) .cse1 (not .cse2) (= |P3Thread1of1ForFork0_#t~ite32_Out-210347384| ~y$w_buff1~0_In-210347384)) (and .cse1 (or .cse0 .cse2) (= ~y~0_In-210347384 |P3Thread1of1ForFork0_#t~ite32_Out-210347384|)))) InVars {~y$r_buff1_thd4~0=~y$r_buff1_thd4~0_In-210347384, ~y$w_buff1~0=~y$w_buff1~0_In-210347384, ~y~0=~y~0_In-210347384, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-210347384} OutVars{~y$r_buff1_thd4~0=~y$r_buff1_thd4~0_In-210347384, ~y$w_buff1~0=~y$w_buff1~0_In-210347384, ~y~0=~y~0_In-210347384, P3Thread1of1ForFork0_#t~ite33=|P3Thread1of1ForFork0_#t~ite33_Out-210347384|, P3Thread1of1ForFork0_#t~ite32=|P3Thread1of1ForFork0_#t~ite32_Out-210347384|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-210347384} AuxVars[] AssignedVars[P3Thread1of1ForFork0_#t~ite33, P3Thread1of1ForFork0_#t~ite32] because there is no mapped edge [2019-12-18 16:34:21,405 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [791] [791] L800-->L800-2: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In-482845833 256) 0)) (.cse1 (= (mod ~y$r_buff0_thd3~0_In-482845833 256) 0))) (or (and (= |P2Thread1of1ForFork3_#t~ite28_Out-482845833| ~y$w_buff0_used~0_In-482845833) (or .cse0 .cse1)) (and (not .cse0) (not .cse1) (= |P2Thread1of1ForFork3_#t~ite28_Out-482845833| 0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-482845833, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-482845833} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-482845833, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-482845833, P2Thread1of1ForFork3_#t~ite28=|P2Thread1of1ForFork3_#t~ite28_Out-482845833|} AuxVars[] AssignedVars[P2Thread1of1ForFork3_#t~ite28] because there is no mapped edge [2019-12-18 16:34:21,408 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [777] [777] L823-->L823-2: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd4~0_In1409184514 256) 0)) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In1409184514 256)))) (or (and (or .cse0 .cse1) (= |P3Thread1of1ForFork0_#t~ite34_Out1409184514| ~y$w_buff0_used~0_In1409184514)) (and (= 0 |P3Thread1of1ForFork0_#t~ite34_Out1409184514|) (not .cse1) (not .cse0)))) InVars {~y$r_buff0_thd4~0=~y$r_buff0_thd4~0_In1409184514, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1409184514} OutVars{~y$r_buff0_thd4~0=~y$r_buff0_thd4~0_In1409184514, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1409184514, P3Thread1of1ForFork0_#t~ite34=|P3Thread1of1ForFork0_#t~ite34_Out1409184514|} AuxVars[] AssignedVars[P3Thread1of1ForFork0_#t~ite34] because there is no mapped edge [2019-12-18 16:34:21,410 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [780] [780] L801-->L801-2: Formula: (let ((.cse3 (= 0 (mod ~y$r_buff1_thd3~0_In503168829 256))) (.cse2 (= 0 (mod ~y$w_buff1_used~0_In503168829 256))) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In503168829 256))) (.cse0 (= (mod ~y$r_buff0_thd3~0_In503168829 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P2Thread1of1ForFork3_#t~ite29_Out503168829|)) (and (= |P2Thread1of1ForFork3_#t~ite29_Out503168829| ~y$w_buff1_used~0_In503168829) (or .cse3 .cse2) (or .cse1 .cse0)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In503168829, ~y$w_buff0_used~0=~y$w_buff0_used~0_In503168829, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In503168829, ~y$w_buff1_used~0=~y$w_buff1_used~0_In503168829} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In503168829, ~y$w_buff0_used~0=~y$w_buff0_used~0_In503168829, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In503168829, P2Thread1of1ForFork3_#t~ite29=|P2Thread1of1ForFork3_#t~ite29_Out503168829|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In503168829} AuxVars[] AssignedVars[P2Thread1of1ForFork3_#t~ite29] because there is no mapped edge [2019-12-18 16:34:21,413 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [829] [829] L763-->L763-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-1008227128 256)))) (or (and (not .cse0) (= |P1Thread1of1ForFork2_#t~ite8_In-1008227128| |P1Thread1of1ForFork2_#t~ite8_Out-1008227128|) (= |P1Thread1of1ForFork2_#t~ite9_Out-1008227128| ~y$w_buff0~0_In-1008227128)) (and (= |P1Thread1of1ForFork2_#t~ite9_Out-1008227128| |P1Thread1of1ForFork2_#t~ite8_Out-1008227128|) (let ((.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In-1008227128 256)))) (or (and .cse1 (= 0 (mod ~y$r_buff1_thd2~0_In-1008227128 256))) (= (mod ~y$w_buff0_used~0_In-1008227128 256) 0) (and .cse1 (= 0 (mod ~y$w_buff1_used~0_In-1008227128 256))))) (= |P1Thread1of1ForFork2_#t~ite8_Out-1008227128| ~y$w_buff0~0_In-1008227128) .cse0))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1008227128, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1008227128, P1Thread1of1ForFork2_#t~ite8=|P1Thread1of1ForFork2_#t~ite8_In-1008227128|, ~y$w_buff0~0=~y$w_buff0~0_In-1008227128, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1008227128, ~weak$$choice2~0=~weak$$choice2~0_In-1008227128, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1008227128} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1008227128, P1Thread1of1ForFork2_#t~ite9=|P1Thread1of1ForFork2_#t~ite9_Out-1008227128|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1008227128, P1Thread1of1ForFork2_#t~ite8=|P1Thread1of1ForFork2_#t~ite8_Out-1008227128|, ~y$w_buff0~0=~y$w_buff0~0_In-1008227128, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1008227128, ~weak$$choice2~0=~weak$$choice2~0_In-1008227128, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1008227128} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite9, P1Thread1of1ForFork2_#t~ite8] because there is no mapped edge [2019-12-18 16:34:21,415 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [782] [782] L802-->L803: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In-1802393852 256))) (.cse1 (= 0 (mod ~y$r_buff0_thd3~0_In-1802393852 256)))) (or (and (or .cse0 .cse1) (= ~y$r_buff0_thd3~0_In-1802393852 ~y$r_buff0_thd3~0_Out-1802393852)) (and (not .cse0) (= ~y$r_buff0_thd3~0_Out-1802393852 0) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1802393852, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-1802393852} OutVars{P2Thread1of1ForFork3_#t~ite30=|P2Thread1of1ForFork3_#t~ite30_Out-1802393852|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1802393852, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_Out-1802393852} AuxVars[] AssignedVars[P2Thread1of1ForFork3_#t~ite30, ~y$r_buff0_thd3~0] because there is no mapped edge [2019-12-18 16:34:21,415 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [784] [784] L803-->L803-2: Formula: (let ((.cse2 (= 0 (mod ~y$w_buff0_used~0_In540460201 256))) (.cse3 (= (mod ~y$r_buff0_thd3~0_In540460201 256) 0)) (.cse0 (= 0 (mod ~y$w_buff1_used~0_In540460201 256))) (.cse1 (= (mod ~y$r_buff1_thd3~0_In540460201 256) 0))) (or (and (or .cse0 .cse1) (= ~y$r_buff1_thd3~0_In540460201 |P2Thread1of1ForFork3_#t~ite31_Out540460201|) (or .cse2 .cse3)) (and (= 0 |P2Thread1of1ForFork3_#t~ite31_Out540460201|) (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1)))))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In540460201, ~y$w_buff0_used~0=~y$w_buff0_used~0_In540460201, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In540460201, ~y$w_buff1_used~0=~y$w_buff1_used~0_In540460201} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In540460201, ~y$w_buff0_used~0=~y$w_buff0_used~0_In540460201, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In540460201, P2Thread1of1ForFork3_#t~ite31=|P2Thread1of1ForFork3_#t~ite31_Out540460201|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In540460201} AuxVars[] AssignedVars[P2Thread1of1ForFork3_#t~ite31] because there is no mapped edge [2019-12-18 16:34:21,415 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [810] [810] L803-2-->P2EXIT: Formula: (and (= |v_P2Thread1of1ForFork3_#res.offset_5| 0) (= 0 |v_P2Thread1of1ForFork3_#res.base_5|) (= v_~__unbuffered_cnt~0_100 (+ v_~__unbuffered_cnt~0_101 1)) (= |v_P2Thread1of1ForFork3_#t~ite31_40| v_~y$r_buff1_thd3~0_57)) InVars {P2Thread1of1ForFork3_#t~ite31=|v_P2Thread1of1ForFork3_#t~ite31_40|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_101} OutVars{~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_57, P2Thread1of1ForFork3_#t~ite31=|v_P2Thread1of1ForFork3_#t~ite31_39|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_100, P2Thread1of1ForFork3_#res.base=|v_P2Thread1of1ForFork3_#res.base_5|, P2Thread1of1ForFork3_#res.offset=|v_P2Thread1of1ForFork3_#res.offset_5|} AuxVars[] AssignedVars[~y$r_buff1_thd3~0, P2Thread1of1ForFork3_#t~ite31, ~__unbuffered_cnt~0, P2Thread1of1ForFork3_#res.base, P2Thread1of1ForFork3_#res.offset] because there is no mapped edge [2019-12-18 16:34:21,417 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [783] [783] L824-->L824-2: Formula: (let ((.cse2 (= 0 (mod ~y$r_buff1_thd4~0_In-178436303 256))) (.cse3 (= 0 (mod ~y$w_buff1_used~0_In-178436303 256))) (.cse1 (= (mod ~y$r_buff0_thd4~0_In-178436303 256) 0)) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In-178436303 256)))) (or (and (= |P3Thread1of1ForFork0_#t~ite35_Out-178436303| ~y$w_buff1_used~0_In-178436303) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0))) (= |P3Thread1of1ForFork0_#t~ite35_Out-178436303| 0)))) InVars {~y$r_buff0_thd4~0=~y$r_buff0_thd4~0_In-178436303, ~y$r_buff1_thd4~0=~y$r_buff1_thd4~0_In-178436303, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-178436303, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-178436303} OutVars{~y$r_buff0_thd4~0=~y$r_buff0_thd4~0_In-178436303, ~y$r_buff1_thd4~0=~y$r_buff1_thd4~0_In-178436303, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-178436303, P3Thread1of1ForFork0_#t~ite35=|P3Thread1of1ForFork0_#t~ite35_Out-178436303|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-178436303} AuxVars[] AssignedVars[P3Thread1of1ForFork0_#t~ite35] because there is no mapped edge [2019-12-18 16:34:21,419 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [773] [773] L825-->L825-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In-1925375327 256))) (.cse1 (= 0 (mod ~y$r_buff0_thd4~0_In-1925375327 256)))) (or (and (= |P3Thread1of1ForFork0_#t~ite36_Out-1925375327| ~y$r_buff0_thd4~0_In-1925375327) (or .cse0 .cse1)) (and (not .cse0) (= |P3Thread1of1ForFork0_#t~ite36_Out-1925375327| 0) (not .cse1)))) InVars {~y$r_buff0_thd4~0=~y$r_buff0_thd4~0_In-1925375327, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1925375327} OutVars{~y$r_buff0_thd4~0=~y$r_buff0_thd4~0_In-1925375327, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1925375327, P3Thread1of1ForFork0_#t~ite36=|P3Thread1of1ForFork0_#t~ite36_Out-1925375327|} AuxVars[] AssignedVars[P3Thread1of1ForFork0_#t~ite36] because there is no mapped edge [2019-12-18 16:34:21,420 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [781] [781] L826-->L826-2: Formula: (let ((.cse3 (= 0 (mod ~y$w_buff1_used~0_In-390337240 256))) (.cse2 (= (mod ~y$r_buff1_thd4~0_In-390337240 256) 0)) (.cse1 (= 0 (mod ~y$r_buff0_thd4~0_In-390337240 256))) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In-390337240 256)))) (or (and (= |P3Thread1of1ForFork0_#t~ite37_Out-390337240| ~y$r_buff1_thd4~0_In-390337240) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= |P3Thread1of1ForFork0_#t~ite37_Out-390337240| 0) (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0)))))) InVars {~y$r_buff0_thd4~0=~y$r_buff0_thd4~0_In-390337240, ~y$r_buff1_thd4~0=~y$r_buff1_thd4~0_In-390337240, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-390337240, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-390337240} OutVars{~y$r_buff0_thd4~0=~y$r_buff0_thd4~0_In-390337240, ~y$r_buff1_thd4~0=~y$r_buff1_thd4~0_In-390337240, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-390337240, P3Thread1of1ForFork0_#t~ite37=|P3Thread1of1ForFork0_#t~ite37_Out-390337240|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-390337240} AuxVars[] AssignedVars[P3Thread1of1ForFork0_#t~ite37] because there is no mapped edge [2019-12-18 16:34:21,420 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [801] [801] L826-2-->P3EXIT: Formula: (and (= |v_P3Thread1of1ForFork0_#res.base_5| 0) (= |v_P3Thread1of1ForFork0_#t~ite37_36| v_~y$r_buff1_thd4~0_55) (= 0 |v_P3Thread1of1ForFork0_#res.offset_5|) (= v_~__unbuffered_cnt~0_77 (+ v_~__unbuffered_cnt~0_78 1))) InVars {P3Thread1of1ForFork0_#t~ite37=|v_P3Thread1of1ForFork0_#t~ite37_36|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_78} OutVars{~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_55, P3Thread1of1ForFork0_#res.offset=|v_P3Thread1of1ForFork0_#res.offset_5|, P3Thread1of1ForFork0_#t~ite37=|v_P3Thread1of1ForFork0_#t~ite37_35|, P3Thread1of1ForFork0_#res.base=|v_P3Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_77} AuxVars[] AssignedVars[~y$r_buff1_thd4~0, P3Thread1of1ForFork0_#res.offset, P3Thread1of1ForFork0_#t~ite37, P3Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-18 16:34:21,421 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [831] [831] L764-->L764-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In1910514713 256)))) (or (and .cse0 (let ((.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In1910514713 256)))) (or (and .cse1 (= 0 (mod ~y$r_buff1_thd2~0_In1910514713 256))) (and (= 0 (mod ~y$w_buff1_used~0_In1910514713 256)) .cse1) (= 0 (mod ~y$w_buff0_used~0_In1910514713 256)))) (= |P1Thread1of1ForFork2_#t~ite11_Out1910514713| |P1Thread1of1ForFork2_#t~ite12_Out1910514713|) (= |P1Thread1of1ForFork2_#t~ite11_Out1910514713| ~y$w_buff1~0_In1910514713)) (and (not .cse0) (= |P1Thread1of1ForFork2_#t~ite12_Out1910514713| ~y$w_buff1~0_In1910514713) (= |P1Thread1of1ForFork2_#t~ite11_In1910514713| |P1Thread1of1ForFork2_#t~ite11_Out1910514713|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1910514713, ~y$w_buff1~0=~y$w_buff1~0_In1910514713, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1910514713, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1910514713, P1Thread1of1ForFork2_#t~ite11=|P1Thread1of1ForFork2_#t~ite11_In1910514713|, ~weak$$choice2~0=~weak$$choice2~0_In1910514713, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1910514713} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1910514713, ~y$w_buff1~0=~y$w_buff1~0_In1910514713, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1910514713, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1910514713, P1Thread1of1ForFork2_#t~ite12=|P1Thread1of1ForFork2_#t~ite12_Out1910514713|, P1Thread1of1ForFork2_#t~ite11=|P1Thread1of1ForFork2_#t~ite11_Out1910514713|, ~weak$$choice2~0=~weak$$choice2~0_In1910514713, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1910514713} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite12, P1Thread1of1ForFork2_#t~ite11] because there is no mapped edge [2019-12-18 16:34:21,422 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [833] [833] L765-->L765-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In1592882323 256)))) (or (and .cse0 (= |P1Thread1of1ForFork2_#t~ite15_Out1592882323| |P1Thread1of1ForFork2_#t~ite14_Out1592882323|) (let ((.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In1592882323 256)))) (or (and (= (mod ~y$w_buff1_used~0_In1592882323 256) 0) .cse1) (= 0 (mod ~y$w_buff0_used~0_In1592882323 256)) (and (= 0 (mod ~y$r_buff1_thd2~0_In1592882323 256)) .cse1))) (= ~y$w_buff0_used~0_In1592882323 |P1Thread1of1ForFork2_#t~ite14_Out1592882323|)) (and (= |P1Thread1of1ForFork2_#t~ite15_Out1592882323| ~y$w_buff0_used~0_In1592882323) (= |P1Thread1of1ForFork2_#t~ite14_In1592882323| |P1Thread1of1ForFork2_#t~ite14_Out1592882323|) (not .cse0)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1592882323, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1592882323, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1592882323, ~weak$$choice2~0=~weak$$choice2~0_In1592882323, P1Thread1of1ForFork2_#t~ite14=|P1Thread1of1ForFork2_#t~ite14_In1592882323|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1592882323} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1592882323, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1592882323, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1592882323, ~weak$$choice2~0=~weak$$choice2~0_In1592882323, P1Thread1of1ForFork2_#t~ite14=|P1Thread1of1ForFork2_#t~ite14_Out1592882323|, P1Thread1of1ForFork2_#t~ite15=|P1Thread1of1ForFork2_#t~ite15_Out1592882323|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1592882323} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite14, P1Thread1of1ForFork2_#t~ite15] because there is no mapped edge [2019-12-18 16:34:21,427 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [771] [771] L767-->L768: Formula: (and (= v_~y$r_buff0_thd2~0_109 v_~y$r_buff0_thd2~0_108) (not (= (mod v_~weak$$choice2~0_39 256) 0))) InVars {~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_109, ~weak$$choice2~0=v_~weak$$choice2~0_39} OutVars{P1Thread1of1ForFork2_#t~ite19=|v_P1Thread1of1ForFork2_#t~ite19_8|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_108, P1Thread1of1ForFork2_#t~ite20=|v_P1Thread1of1ForFork2_#t~ite20_9|, P1Thread1of1ForFork2_#t~ite21=|v_P1Thread1of1ForFork2_#t~ite21_8|, ~weak$$choice2~0=v_~weak$$choice2~0_39} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite19, ~y$r_buff0_thd2~0, P1Thread1of1ForFork2_#t~ite20, P1Thread1of1ForFork2_#t~ite21] because there is no mapped edge [2019-12-18 16:34:21,427 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [834] [834] L768-->L768-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-1222921742 256)))) (or (and (= |P1Thread1of1ForFork2_#t~ite23_In-1222921742| |P1Thread1of1ForFork2_#t~ite23_Out-1222921742|) (= |P1Thread1of1ForFork2_#t~ite24_Out-1222921742| ~y$r_buff1_thd2~0_In-1222921742) (not .cse0)) (and (= |P1Thread1of1ForFork2_#t~ite24_Out-1222921742| |P1Thread1of1ForFork2_#t~ite23_Out-1222921742|) .cse0 (let ((.cse1 (= (mod ~y$r_buff0_thd2~0_In-1222921742 256) 0))) (or (and .cse1 (= (mod ~y$r_buff1_thd2~0_In-1222921742 256) 0)) (and (= (mod ~y$w_buff1_used~0_In-1222921742 256) 0) .cse1) (= 0 (mod ~y$w_buff0_used~0_In-1222921742 256)))) (= ~y$r_buff1_thd2~0_In-1222921742 |P1Thread1of1ForFork2_#t~ite23_Out-1222921742|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1222921742, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1222921742, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1222921742, P1Thread1of1ForFork2_#t~ite23=|P1Thread1of1ForFork2_#t~ite23_In-1222921742|, ~weak$$choice2~0=~weak$$choice2~0_In-1222921742, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1222921742} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1222921742, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1222921742, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1222921742, P1Thread1of1ForFork2_#t~ite23=|P1Thread1of1ForFork2_#t~ite23_Out-1222921742|, ~weak$$choice2~0=~weak$$choice2~0_In-1222921742, P1Thread1of1ForFork2_#t~ite24=|P1Thread1of1ForFork2_#t~ite24_Out-1222921742|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1222921742} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite23, P1Thread1of1ForFork2_#t~ite24] because there is no mapped edge [2019-12-18 16:34:21,429 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [741] [741] L770-->L778: Formula: (and (= (+ v_~__unbuffered_cnt~0_22 1) v_~__unbuffered_cnt~0_21) (= v_~y~0_29 v_~y$mem_tmp~0_6) (= 0 v_~y$flush_delayed~0_8) (not (= 0 (mod v_~y$flush_delayed~0_9 256)))) InVars {~y$mem_tmp~0=v_~y$mem_tmp~0_6, ~y$flush_delayed~0=v_~y$flush_delayed~0_9, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_22} OutVars{~y$mem_tmp~0=v_~y$mem_tmp~0_6, ~y$flush_delayed~0=v_~y$flush_delayed~0_8, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_21, ~y~0=v_~y~0_29, P1Thread1of1ForFork2_#t~ite25=|v_P1Thread1of1ForFork2_#t~ite25_7|} AuxVars[] AssignedVars[~y$flush_delayed~0, ~__unbuffered_cnt~0, ~y~0, P1Thread1of1ForFork2_#t~ite25] because there is no mapped edge [2019-12-18 16:34:21,429 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [712] [712] L851-1-->L857: Formula: (and (= 4 v_~__unbuffered_cnt~0_20) (= v_~main$tmp_guard0~0_6 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_20} OutVars{ULTIMATE.start_main_#t~nondet41=|v_ULTIMATE.start_main_#t~nondet41_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_20, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_6} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet41, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-18 16:34:21,431 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [788] [788] L857-2-->L857-4: Formula: (let ((.cse1 (= (mod ~y$w_buff1_used~0_In1197839756 256) 0)) (.cse0 (= (mod ~y$r_buff1_thd0~0_In1197839756 256) 0))) (or (and (= ~y~0_In1197839756 |ULTIMATE.start_main_#t~ite42_Out1197839756|) (or .cse0 .cse1)) (and (not .cse1) (= |ULTIMATE.start_main_#t~ite42_Out1197839756| ~y$w_buff1~0_In1197839756) (not .cse0)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In1197839756, ~y~0=~y~0_In1197839756, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1197839756, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1197839756} OutVars{~y$w_buff1~0=~y$w_buff1~0_In1197839756, ~y~0=~y~0_In1197839756, ULTIMATE.start_main_#t~ite42=|ULTIMATE.start_main_#t~ite42_Out1197839756|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1197839756, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1197839756} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-18 16:34:21,431 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [762] [762] L857-4-->L858: Formula: (= v_~y~0_46 |v_ULTIMATE.start_main_#t~ite42_14|) InVars {ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_14|} OutVars{ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_13|, ~y~0=v_~y~0_46, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_13|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43, ~y~0, ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-18 16:34:21,431 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [793] [793] L858-->L858-2: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In1008983733 256) 0)) (.cse1 (= (mod ~y$r_buff0_thd0~0_In1008983733 256) 0))) (or (and (not .cse0) (= |ULTIMATE.start_main_#t~ite44_Out1008983733| 0) (not .cse1)) (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite44_Out1008983733| ~y$w_buff0_used~0_In1008983733)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1008983733, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1008983733} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1008983733, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1008983733, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out1008983733|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-18 16:34:21,432 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [794] [794] L859-->L859-2: Formula: (let ((.cse2 (= 0 (mod ~y$r_buff1_thd0~0_In-783185423 256))) (.cse3 (= (mod ~y$w_buff1_used~0_In-783185423 256) 0)) (.cse1 (= (mod ~y$w_buff0_used~0_In-783185423 256) 0)) (.cse0 (= (mod ~y$r_buff0_thd0~0_In-783185423 256) 0))) (or (and (= ~y$w_buff1_used~0_In-783185423 |ULTIMATE.start_main_#t~ite45_Out-783185423|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= 0 |ULTIMATE.start_main_#t~ite45_Out-783185423|) (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0)))))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-783185423, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-783185423, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-783185423, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-783185423} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-783185423, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-783185423, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-783185423, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out-783185423|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-783185423} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-12-18 16:34:21,434 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [778] [778] L860-->L860-2: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd0~0_In-2141528988 256) 0)) (.cse0 (= (mod ~y$w_buff0_used~0_In-2141528988 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite46_Out-2141528988| ~y$r_buff0_thd0~0_In-2141528988) (or .cse0 .cse1)) (and (not .cse1) (not .cse0) (= |ULTIMATE.start_main_#t~ite46_Out-2141528988| 0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-2141528988, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-2141528988} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-2141528988, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-2141528988, ULTIMATE.start_main_#t~ite46=|ULTIMATE.start_main_#t~ite46_Out-2141528988|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite46] because there is no mapped edge [2019-12-18 16:34:21,435 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [786] [786] L861-->L861-2: Formula: (let ((.cse2 (= (mod ~y$w_buff0_used~0_In1714974384 256) 0)) (.cse3 (= (mod ~y$r_buff0_thd0~0_In1714974384 256) 0)) (.cse0 (= (mod ~y$r_buff1_thd0~0_In1714974384 256) 0)) (.cse1 (= (mod ~y$w_buff1_used~0_In1714974384 256) 0))) (or (and (= 0 |ULTIMATE.start_main_#t~ite47_Out1714974384|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= ~y$r_buff1_thd0~0_In1714974384 |ULTIMATE.start_main_#t~ite47_Out1714974384|) (or .cse2 .cse3) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1714974384, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1714974384, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1714974384, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1714974384} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1714974384, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1714974384, ULTIMATE.start_main_#t~ite47=|ULTIMATE.start_main_#t~ite47_Out1714974384|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1714974384, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1714974384} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite47] because there is no mapped edge [2019-12-18 16:34:21,435 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [849] [849] L861-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_~y$r_buff1_thd0~0_133 |v_ULTIMATE.start_main_#t~ite47_73|) (= 0 v_~__unbuffered_p2_EAX~0_78) (= 0 v_~__unbuffered_p1_EAX~0_32) (= 0 v_~__unbuffered_p3_EBX~0_31) (= 0 v_~__unbuffered_p0_EAX~0_46) (= 1 v_~__unbuffered_p3_EAX~0_31) (= v_~main$tmp_guard1~0_29 0) (= (mod v_~main$tmp_guard1~0_29 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_13|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_21 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_13|)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_46, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_32, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_31, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_73|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_78, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_31} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_46, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_21, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_32, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_31, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_72|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_29, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_78, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_31, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_133, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_13|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ULTIMATE.start_main_#t~ite47, ~main$tmp_guard1~0, ~y$r_buff1_thd0~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-18 16:34:21,538 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.12 04:34:21 BasicIcfg [2019-12-18 16:34:21,538 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-18 16:34:21,540 INFO L168 Benchmark]: Toolchain (without parser) took 157386.55 ms. Allocated memory was 138.4 MB in the beginning and 2.4 GB in the end (delta: 2.3 GB). Free memory was 101.7 MB in the beginning and 1.6 GB in the end (delta: -1.5 GB). Peak memory consumption was 832.1 MB. Max. memory is 7.1 GB. [2019-12-18 16:34:21,540 INFO L168 Benchmark]: CDTParser took 0.48 ms. Allocated memory is still 138.4 MB. Free memory was 121.6 MB in the beginning and 121.4 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. [2019-12-18 16:34:21,541 INFO L168 Benchmark]: CACSL2BoogieTranslator took 755.38 ms. Allocated memory was 138.4 MB in the beginning and 201.3 MB in the end (delta: 62.9 MB). Free memory was 101.3 MB in the beginning and 154.4 MB in the end (delta: -53.1 MB). Peak memory consumption was 25.9 MB. Max. memory is 7.1 GB. [2019-12-18 16:34:21,541 INFO L168 Benchmark]: Boogie Procedure Inliner took 61.90 ms. Allocated memory is still 201.3 MB. Free memory was 154.4 MB in the beginning and 151.7 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-18 16:34:21,542 INFO L168 Benchmark]: Boogie Preprocessor took 50.56 ms. Allocated memory is still 201.3 MB. Free memory was 151.7 MB in the beginning and 149.7 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2019-12-18 16:34:21,542 INFO L168 Benchmark]: RCFGBuilder took 873.02 ms. Allocated memory is still 201.3 MB. Free memory was 149.0 MB in the beginning and 100.0 MB in the end (delta: 49.0 MB). Peak memory consumption was 49.0 MB. Max. memory is 7.1 GB. [2019-12-18 16:34:21,543 INFO L168 Benchmark]: TraceAbstraction took 155639.48 ms. Allocated memory was 201.3 MB in the beginning and 2.4 GB in the end (delta: 2.2 GB). Free memory was 99.3 MB in the beginning and 1.6 GB in the end (delta: -1.5 GB). Peak memory consumption was 766.8 MB. Max. memory is 7.1 GB. [2019-12-18 16:34:21,545 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.48 ms. Allocated memory is still 138.4 MB. Free memory was 121.6 MB in the beginning and 121.4 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 755.38 ms. Allocated memory was 138.4 MB in the beginning and 201.3 MB in the end (delta: 62.9 MB). Free memory was 101.3 MB in the beginning and 154.4 MB in the end (delta: -53.1 MB). Peak memory consumption was 25.9 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 61.90 ms. Allocated memory is still 201.3 MB. Free memory was 154.4 MB in the beginning and 151.7 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 50.56 ms. Allocated memory is still 201.3 MB. Free memory was 151.7 MB in the beginning and 149.7 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 873.02 ms. Allocated memory is still 201.3 MB. Free memory was 149.0 MB in the beginning and 100.0 MB in the end (delta: 49.0 MB). Peak memory consumption was 49.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 155639.48 ms. Allocated memory was 201.3 MB in the beginning and 2.4 GB in the end (delta: 2.2 GB). Free memory was 99.3 MB in the beginning and 1.6 GB in the end (delta: -1.5 GB). Peak memory consumption was 766.8 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 6.5s, 182 ProgramPointsBefore, 88 ProgramPointsAfterwards, 210 TransitionsBefore, 92 TransitionsAfterwards, 18126 CoEnabledTransitionPairs, 8 FixpointIterations, 38 TrivialSequentialCompositions, 55 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 30 ConcurrentYvCompositions, 29 ChoiceCompositions, 7271 VarBasedMoverChecksPositive, 240 VarBasedMoverChecksNegative, 64 SemBasedMoverChecksPositive, 256 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 2.0s, 0 MoverChecksTotal, 72619 CheckedPairsTotal, 123 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L845] FCALL, FORK 0 pthread_create(&t437, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L847] FCALL, FORK 0 pthread_create(&t438, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L849] FCALL, FORK 0 pthread_create(&t439, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L788] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L789] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L790] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L791] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L792] 3 y$r_buff1_thd4 = y$r_buff0_thd4 [L793] 3 y$r_buff0_thd3 = (_Bool)1 [L796] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L799] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L851] FCALL, FORK 0 pthread_create(&t440, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=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=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L813] 4 z = 1 [L816] 4 __unbuffered_p3_EAX = z [L819] 4 __unbuffered_p3_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L822] EXPR 4 y$w_buff0_used && y$r_buff0_thd4 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L799] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L822] 4 y = y$w_buff0_used && y$r_buff0_thd4 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y) [L755] 2 x = 1 [L758] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L759] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L760] 2 y$flush_delayed = weak$$choice2 [L761] 2 y$mem_tmp = y VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L800] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L762] EXPR 2 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) VAL [!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1)=0, \result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L801] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L762] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L763] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L823] 4 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$w_buff0_used [L824] 4 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$w_buff1_used [L825] 4 y$r_buff0_thd4 = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$r_buff0_thd4 [L764] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L765] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L766] EXPR 2 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L766] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L768] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L769] 2 __unbuffered_p1_EAX = y VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L857] 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L858] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L859] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L860] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 170 locations, 2 error locations. Result: UNSAFE, OverallTime: 155.2s, OverallIterations: 23, TraceHistogramMax: 1, AutomataDifference: 51.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 4223 SDtfs, 5610 SDslu, 17453 SDs, 0 SdLazy, 19219 SolverSat, 321 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 15.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 348 GetRequests, 32 SyntacticMatches, 12 SemanticMatches, 304 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2947 ImplicationChecksByTransitivity, 5.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=218838occurred 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: 58.4s AutomataMinimizationTime, 22 MinimizatonAttempts, 75967 StatesRemovedByMinimization, 18 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 3.3s InterpolantComputationTime, 995 NumberOfCodeBlocks, 995 NumberOfCodeBlocksAsserted, 23 NumberOfCheckSat, 914 ConstructedInterpolants, 0 QuantifiedInterpolants, 222968 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 22 InterpolantComputations, 22 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...