/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix055_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-fae578e [2019-12-18 13:57:29,936 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-18 13:57:29,938 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-18 13:57:29,955 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-18 13:57:29,955 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-18 13:57:29,956 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-18 13:57:29,957 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-18 13:57:29,959 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-18 13:57:29,961 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-18 13:57:29,962 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-18 13:57:29,962 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-18 13:57:29,964 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-18 13:57:29,964 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-18 13:57:29,965 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-18 13:57:29,966 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-18 13:57:29,967 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-18 13:57:29,968 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-18 13:57:29,969 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-18 13:57:29,970 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-18 13:57:29,972 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-18 13:57:29,974 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-18 13:57:29,975 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-18 13:57:29,976 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-18 13:57:29,977 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-18 13:57:29,979 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-18 13:57:29,979 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-18 13:57:29,980 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-18 13:57:29,981 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-18 13:57:29,981 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-18 13:57:29,982 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-18 13:57:29,982 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-18 13:57:29,983 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-18 13:57:29,984 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-18 13:57:29,985 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-18 13:57:29,986 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-18 13:57:29,986 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-18 13:57:29,986 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-18 13:57:29,987 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-18 13:57:29,987 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-18 13:57:29,988 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-18 13:57:29,988 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-18 13:57:29,989 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-18 13:57:30,012 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-18 13:57:30,012 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-18 13:57:30,013 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-18 13:57:30,016 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-18 13:57:30,016 INFO L138 SettingsManager]: * Use SBE=true [2019-12-18 13:57:30,017 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-18 13:57:30,017 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-18 13:57:30,017 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-18 13:57:30,017 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-18 13:57:30,018 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-18 13:57:30,019 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-18 13:57:30,019 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-18 13:57:30,019 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-18 13:57:30,020 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-18 13:57:30,020 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-18 13:57:30,020 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-18 13:57:30,020 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-18 13:57:30,020 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-18 13:57:30,021 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-18 13:57:30,021 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-18 13:57:30,021 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-18 13:57:30,021 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 13:57:30,022 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-18 13:57:30,022 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-18 13:57:30,022 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-18 13:57:30,023 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-18 13:57:30,023 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-18 13:57:30,023 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-18 13:57:30,023 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-18 13:57:30,023 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-18 13:57:30,299 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-18 13:57:30,314 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-18 13:57:30,320 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-18 13:57:30,321 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-18 13:57:30,322 INFO L275 PluginConnector]: CDTParser initialized [2019-12-18 13:57:30,323 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix055_rmo.opt.i [2019-12-18 13:57:30,384 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/98f066d4e/438a1d5f832f437aba48623ee8e6fd73/FLAGe22bb1632 [2019-12-18 13:57:30,949 INFO L306 CDTParser]: Found 1 translation units. [2019-12-18 13:57:30,950 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix055_rmo.opt.i [2019-12-18 13:57:30,968 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/98f066d4e/438a1d5f832f437aba48623ee8e6fd73/FLAGe22bb1632 [2019-12-18 13:57:31,212 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/98f066d4e/438a1d5f832f437aba48623ee8e6fd73 [2019-12-18 13:57:31,220 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-18 13:57:31,222 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-18 13:57:31,223 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-18 13:57:31,223 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-18 13:57:31,227 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-18 13:57:31,228 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 01:57:31" (1/1) ... [2019-12-18 13:57:31,231 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@192f3ce5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:57:31, skipping insertion in model container [2019-12-18 13:57:31,231 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 01:57:31" (1/1) ... [2019-12-18 13:57:31,239 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-18 13:57:31,302 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-18 13:57:31,775 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 13:57:31,792 INFO L203 MainTranslator]: Completed pre-run [2019-12-18 13:57:31,866 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 13:57:31,938 INFO L208 MainTranslator]: Completed translation [2019-12-18 13:57:31,939 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:57:31 WrapperNode [2019-12-18 13:57:31,939 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-18 13:57:31,940 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-18 13:57:31,940 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-18 13:57:31,940 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-18 13:57:31,949 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:57:31" (1/1) ... [2019-12-18 13:57:31,971 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:57:31" (1/1) ... [2019-12-18 13:57:32,012 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-18 13:57:32,013 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-18 13:57:32,013 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-18 13:57:32,013 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-18 13:57:32,028 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:57:31" (1/1) ... [2019-12-18 13:57:32,028 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:57:31" (1/1) ... [2019-12-18 13:57:32,034 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:57:31" (1/1) ... [2019-12-18 13:57:32,035 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:57:31" (1/1) ... [2019-12-18 13:57:32,046 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:57:31" (1/1) ... [2019-12-18 13:57:32,050 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:57:31" (1/1) ... [2019-12-18 13:57:32,054 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:57:31" (1/1) ... [2019-12-18 13:57:32,060 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-18 13:57:32,061 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-18 13:57:32,061 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-18 13:57:32,061 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-18 13:57:32,062 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:57:31" (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 13:57:32,120 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-18 13:57:32,120 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-18 13:57:32,120 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-18 13:57:32,121 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-18 13:57:32,121 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-18 13:57:32,121 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-18 13:57:32,121 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-18 13:57:32,122 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-18 13:57:32,122 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-18 13:57:32,122 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-18 13:57:32,122 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2019-12-18 13:57:32,123 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2019-12-18 13:57:32,123 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-18 13:57:32,123 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-18 13:57:32,123 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-18 13:57:32,125 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 13:57:32,904 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-18 13:57:32,905 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-18 13:57:32,906 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 01:57:32 BoogieIcfgContainer [2019-12-18 13:57:32,906 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-18 13:57:32,907 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-18 13:57:32,908 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-18 13:57:32,911 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-18 13:57:32,911 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 01:57:31" (1/3) ... [2019-12-18 13:57:32,912 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36ef22fd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 01:57:32, skipping insertion in model container [2019-12-18 13:57:32,912 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:57:31" (2/3) ... [2019-12-18 13:57:32,912 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36ef22fd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 01:57:32, skipping insertion in model container [2019-12-18 13:57:32,913 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 01:57:32" (3/3) ... [2019-12-18 13:57:32,914 INFO L109 eAbstractionObserver]: Analyzing ICFG mix055_rmo.opt.i [2019-12-18 13:57:32,924 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-18 13:57:32,925 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-18 13:57:32,938 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-18 13:57:32,939 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-18 13:57:32,980 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:57:32,981 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:57:32,981 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:57:32,982 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:57:32,982 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:57:32,983 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:57:32,983 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:57:32,983 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:57:32,983 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:57:32,983 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:57:32,985 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:57:32,985 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:57:32,986 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:57:32,986 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:57:32,986 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:57:32,986 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:57:32,986 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:57:32,987 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:57:32,987 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:57:32,987 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:57:32,987 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:57:32,988 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:57:32,988 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:57:33,005 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:57:33,006 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:57:33,006 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:57:33,006 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:57:33,006 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:57:33,006 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:57:33,008 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:57:33,008 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:57:33,008 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:57:33,009 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:57:33,009 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:57:33,009 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:57:33,009 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:57:33,009 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:57:33,010 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:57:33,011 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:57:33,011 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:57:33,011 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:57:33,011 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:57:33,012 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:57:33,012 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:57:33,013 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:57:33,014 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:57:33,014 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:57:33,014 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:57:33,014 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:57:33,015 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:57:33,015 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:57:33,015 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:57:33,015 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:57:33,016 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:57:33,016 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:57:33,016 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:57:33,016 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:57:33,017 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:57:33,017 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:57:33,017 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:57:33,017 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:57:33,017 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:57:33,017 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:57:33,018 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:57:33,018 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:57:33,018 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:57:33,019 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:57:33,019 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:57:33,019 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:57:33,019 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:57:33,019 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:57:33,020 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:57:33,020 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:57:33,020 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:57:33,020 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:57:33,020 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:57:33,026 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:57:33,026 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:57:33,027 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:57:33,027 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:57:33,031 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:57:33,031 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:57:33,031 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:57:33,032 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:57:33,037 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:57:33,038 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:57:33,038 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:57:33,038 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:57:33,038 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:57:33,038 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:57:33,038 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:57:33,039 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:57:33,039 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:57:33,039 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:57:33,042 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:57:33,043 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:57:33,043 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:57:33,043 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:57:33,043 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:57:33,043 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:57:33,043 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:57:33,044 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:57:33,044 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:57:33,044 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:57:33,044 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:57:33,044 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:57:33,061 INFO L249 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2019-12-18 13:57:33,079 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-18 13:57:33,079 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-18 13:57:33,080 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-18 13:57:33,080 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-18 13:57:33,080 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-18 13:57:33,080 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-18 13:57:33,080 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-18 13:57:33,080 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-18 13:57:33,099 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 179 places, 207 transitions [2019-12-18 13:57:33,101 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 179 places, 207 transitions [2019-12-18 13:57:33,185 INFO L126 PetriNetUnfolder]: 41/203 cut-off events. [2019-12-18 13:57:33,186 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 13:57:33,204 INFO L76 FinitePrefix]: Finished finitePrefix Result has 216 conditions, 203 events. 41/203 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 267 event pairs. 12/172 useless extension candidates. Maximal degree in co-relation 172. Up to 2 conditions per place. [2019-12-18 13:57:33,227 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 179 places, 207 transitions [2019-12-18 13:57:33,274 INFO L126 PetriNetUnfolder]: 41/203 cut-off events. [2019-12-18 13:57:33,275 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 13:57:33,285 INFO L76 FinitePrefix]: Finished finitePrefix Result has 216 conditions, 203 events. 41/203 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 267 event pairs. 12/172 useless extension candidates. Maximal degree in co-relation 172. Up to 2 conditions per place. [2019-12-18 13:57:33,303 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 12668 [2019-12-18 13:57:33,304 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-18 13:57:38,288 WARN L192 SmtUtils]: Spent 288.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 93 [2019-12-18 13:57:38,440 WARN L192 SmtUtils]: Spent 149.00 ms on a formula simplification that was a NOOP. DAG size: 91 [2019-12-18 13:57:38,465 INFO L206 etLargeBlockEncoding]: Checked pairs total: 50860 [2019-12-18 13:57:38,466 INFO L214 etLargeBlockEncoding]: Total number of compositions: 120 [2019-12-18 13:57:38,469 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 91 places, 97 transitions [2019-12-18 13:57:40,566 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 34622 states. [2019-12-18 13:57:40,568 INFO L276 IsEmpty]: Start isEmpty. Operand 34622 states. [2019-12-18 13:57:40,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-12-18 13:57:40,575 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:57:40,575 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:57:40,576 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:57:40,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:57:40,581 INFO L82 PathProgramCache]: Analyzing trace with hash 1893967926, now seen corresponding path program 1 times [2019-12-18 13:57:40,588 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:57:40,588 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1853711890] [2019-12-18 13:57:40,588 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:57:40,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:57:40,974 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 13:57:40,975 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1853711890] [2019-12-18 13:57:40,976 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:57:40,976 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 13:57:40,977 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1642394382] [2019-12-18 13:57:40,983 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 13:57:40,984 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:57:41,000 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 13:57:41,002 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 13:57:41,005 INFO L87 Difference]: Start difference. First operand 34622 states. Second operand 3 states. [2019-12-18 13:57:42,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:57:42,345 INFO L93 Difference]: Finished difference Result 34366 states and 145832 transitions. [2019-12-18 13:57:42,346 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 13:57:42,347 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2019-12-18 13:57:42,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:57:42,623 INFO L225 Difference]: With dead ends: 34366 [2019-12-18 13:57:42,623 INFO L226 Difference]: Without dead ends: 33694 [2019-12-18 13:57:42,624 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 13:57:43,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33694 states. [2019-12-18 13:57:44,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33694 to 33694. [2019-12-18 13:57:44,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33694 states. [2019-12-18 13:57:44,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33694 states to 33694 states and 143088 transitions. [2019-12-18 13:57:44,404 INFO L78 Accepts]: Start accepts. Automaton has 33694 states and 143088 transitions. Word has length 9 [2019-12-18 13:57:44,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:57:44,405 INFO L462 AbstractCegarLoop]: Abstraction has 33694 states and 143088 transitions. [2019-12-18 13:57:44,405 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 13:57:44,406 INFO L276 IsEmpty]: Start isEmpty. Operand 33694 states and 143088 transitions. [2019-12-18 13:57:44,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-18 13:57:44,412 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:57:44,412 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:57:44,412 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:57:44,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:57:44,413 INFO L82 PathProgramCache]: Analyzing trace with hash 706074371, now seen corresponding path program 1 times [2019-12-18 13:57:44,413 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:57:44,413 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1137007279] [2019-12-18 13:57:44,414 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:57:44,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:57:44,502 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 13:57:44,502 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1137007279] [2019-12-18 13:57:44,503 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:57:44,503 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 13:57:44,504 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1842913129] [2019-12-18 13:57:44,505 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 13:57:44,505 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:57:44,506 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 13:57:44,506 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 13:57:44,506 INFO L87 Difference]: Start difference. First operand 33694 states and 143088 transitions. Second operand 4 states. [2019-12-18 13:57:46,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:57:46,861 INFO L93 Difference]: Finished difference Result 52350 states and 214840 transitions. [2019-12-18 13:57:46,861 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 13:57:46,861 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2019-12-18 13:57:46,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:57:47,133 INFO L225 Difference]: With dead ends: 52350 [2019-12-18 13:57:47,133 INFO L226 Difference]: Without dead ends: 52322 [2019-12-18 13:57:47,134 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 13:57:47,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52322 states. [2019-12-18 13:57:49,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52322 to 47546. [2019-12-18 13:57:49,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47546 states. [2019-12-18 13:57:49,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47546 states to 47546 states and 197076 transitions. [2019-12-18 13:57:49,310 INFO L78 Accepts]: Start accepts. Automaton has 47546 states and 197076 transitions. Word has length 15 [2019-12-18 13:57:49,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:57:49,311 INFO L462 AbstractCegarLoop]: Abstraction has 47546 states and 197076 transitions. [2019-12-18 13:57:49,311 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 13:57:49,311 INFO L276 IsEmpty]: Start isEmpty. Operand 47546 states and 197076 transitions. [2019-12-18 13:57:49,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-18 13:57:49,314 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:57:49,314 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:57:49,315 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:57:49,315 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:57:49,315 INFO L82 PathProgramCache]: Analyzing trace with hash -1899832342, now seen corresponding path program 1 times [2019-12-18 13:57:49,315 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:57:49,316 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [400772256] [2019-12-18 13:57:49,316 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:57:49,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:57:49,421 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 13:57:49,423 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [400772256] [2019-12-18 13:57:49,423 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:57:49,423 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 13:57:49,423 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1603011269] [2019-12-18 13:57:49,425 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 13:57:49,426 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:57:49,426 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 13:57:49,426 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 13:57:49,427 INFO L87 Difference]: Start difference. First operand 47546 states and 197076 transitions. Second operand 4 states. [2019-12-18 13:57:49,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:57:49,896 INFO L93 Difference]: Finished difference Result 58566 states and 240916 transitions. [2019-12-18 13:57:49,900 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 13:57:49,900 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2019-12-18 13:57:49,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:57:52,469 INFO L225 Difference]: With dead ends: 58566 [2019-12-18 13:57:52,470 INFO L226 Difference]: Without dead ends: 58566 [2019-12-18 13:57:52,473 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 13:57:52,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58566 states. [2019-12-18 13:57:53,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58566 to 52262. [2019-12-18 13:57:53,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52262 states. [2019-12-18 13:57:54,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52262 states to 52262 states and 216300 transitions. [2019-12-18 13:57:54,078 INFO L78 Accepts]: Start accepts. Automaton has 52262 states and 216300 transitions. Word has length 15 [2019-12-18 13:57:54,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:57:54,078 INFO L462 AbstractCegarLoop]: Abstraction has 52262 states and 216300 transitions. [2019-12-18 13:57:54,079 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 13:57:54,079 INFO L276 IsEmpty]: Start isEmpty. Operand 52262 states and 216300 transitions. [2019-12-18 13:57:54,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-18 13:57:54,094 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:57:54,095 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] [2019-12-18 13:57:54,095 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:57:54,095 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:57:54,095 INFO L82 PathProgramCache]: Analyzing trace with hash -1099673125, now seen corresponding path program 1 times [2019-12-18 13:57:54,095 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:57:54,096 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [984536548] [2019-12-18 13:57:54,096 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:57:54,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:57:54,178 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 13:57:54,179 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [984536548] [2019-12-18 13:57:54,179 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:57:54,179 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 13:57:54,179 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1416261260] [2019-12-18 13:57:54,180 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 13:57:54,180 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:57:54,181 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 13:57:54,181 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 13:57:54,181 INFO L87 Difference]: Start difference. First operand 52262 states and 216300 transitions. Second operand 4 states. [2019-12-18 13:57:54,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:57:54,841 INFO L93 Difference]: Finished difference Result 41984 states and 159713 transitions. [2019-12-18 13:57:54,841 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 13:57:54,842 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 21 [2019-12-18 13:57:54,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:57:54,966 INFO L225 Difference]: With dead ends: 41984 [2019-12-18 13:57:54,966 INFO L226 Difference]: Without dead ends: 40876 [2019-12-18 13:57:54,967 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 13:57:55,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40876 states. [2019-12-18 13:57:58,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40876 to 40876. [2019-12-18 13:57:58,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40876 states. [2019-12-18 13:57:58,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40876 states to 40876 states and 156237 transitions. [2019-12-18 13:57:58,161 INFO L78 Accepts]: Start accepts. Automaton has 40876 states and 156237 transitions. Word has length 21 [2019-12-18 13:57:58,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:57:58,162 INFO L462 AbstractCegarLoop]: Abstraction has 40876 states and 156237 transitions. [2019-12-18 13:57:58,162 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 13:57:58,162 INFO L276 IsEmpty]: Start isEmpty. Operand 40876 states and 156237 transitions. [2019-12-18 13:57:58,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-18 13:57:58,173 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:57:58,173 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:57:58,174 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:57:58,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:57:58,174 INFO L82 PathProgramCache]: Analyzing trace with hash 637645513, now seen corresponding path program 1 times [2019-12-18 13:57:58,174 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:57:58,175 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1904197866] [2019-12-18 13:57:58,175 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:57:58,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:57:58,275 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 13:57:58,275 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1904197866] [2019-12-18 13:57:58,275 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:57:58,276 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 13:57:58,276 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2018520550] [2019-12-18 13:57:58,276 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 13:57:58,276 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:57:58,277 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 13:57:58,277 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 13:57:58,277 INFO L87 Difference]: Start difference. First operand 40876 states and 156237 transitions. Second operand 5 states. [2019-12-18 13:57:58,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:57:58,905 INFO L93 Difference]: Finished difference Result 54396 states and 204140 transitions. [2019-12-18 13:57:58,905 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-18 13:57:58,905 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-12-18 13:57:58,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:57:59,022 INFO L225 Difference]: With dead ends: 54396 [2019-12-18 13:57:59,023 INFO L226 Difference]: Without dead ends: 54375 [2019-12-18 13:57:59,023 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 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 13:57:59,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54375 states. [2019-12-18 13:58:00,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54375 to 41122. [2019-12-18 13:58:00,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41122 states. [2019-12-18 13:58:00,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41122 states to 41122 states and 156869 transitions. [2019-12-18 13:58:00,251 INFO L78 Accepts]: Start accepts. Automaton has 41122 states and 156869 transitions. Word has length 22 [2019-12-18 13:58:00,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:58:00,251 INFO L462 AbstractCegarLoop]: Abstraction has 41122 states and 156869 transitions. [2019-12-18 13:58:00,251 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 13:58:00,251 INFO L276 IsEmpty]: Start isEmpty. Operand 41122 states and 156869 transitions. [2019-12-18 13:58:00,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-12-18 13:58:00,289 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:58:00,289 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:58:00,290 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:58:00,290 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:58:00,290 INFO L82 PathProgramCache]: Analyzing trace with hash -2027557007, now seen corresponding path program 1 times [2019-12-18 13:58:00,290 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:58:00,291 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [455762547] [2019-12-18 13:58:00,291 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:58:00,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:58:00,338 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 13:58:00,338 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [455762547] [2019-12-18 13:58:00,338 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:58:00,339 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 13:58:00,339 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [921521788] [2019-12-18 13:58:00,339 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 13:58:00,339 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:58:00,340 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 13:58:00,340 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 13:58:00,340 INFO L87 Difference]: Start difference. First operand 41122 states and 156869 transitions. Second operand 3 states. [2019-12-18 13:58:00,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:58:00,642 INFO L93 Difference]: Finished difference Result 51974 states and 196153 transitions. [2019-12-18 13:58:00,643 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 13:58:00,643 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2019-12-18 13:58:00,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:58:01,283 INFO L225 Difference]: With dead ends: 51974 [2019-12-18 13:58:01,283 INFO L226 Difference]: Without dead ends: 51974 [2019-12-18 13:58:01,283 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 13:58:01,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51974 states. [2019-12-18 13:58:02,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51974 to 45309. [2019-12-18 13:58:02,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45309 states. [2019-12-18 13:58:02,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45309 states to 45309 states and 172388 transitions. [2019-12-18 13:58:02,158 INFO L78 Accepts]: Start accepts. Automaton has 45309 states and 172388 transitions. Word has length 30 [2019-12-18 13:58:02,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:58:02,158 INFO L462 AbstractCegarLoop]: Abstraction has 45309 states and 172388 transitions. [2019-12-18 13:58:02,159 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 13:58:02,159 INFO L276 IsEmpty]: Start isEmpty. Operand 45309 states and 172388 transitions. [2019-12-18 13:58:02,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-12-18 13:58:02,186 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:58:02,186 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] [2019-12-18 13:58:02,187 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:58:02,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:58:02,187 INFO L82 PathProgramCache]: Analyzing trace with hash -2027793723, now seen corresponding path program 1 times [2019-12-18 13:58:02,187 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:58:02,188 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1305256229] [2019-12-18 13:58:02,188 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:58:02,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:58:02,272 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 13:58:02,273 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1305256229] [2019-12-18 13:58:02,273 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:58:02,273 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 13:58:02,274 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [985956803] [2019-12-18 13:58:02,274 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 13:58:02,274 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:58:02,274 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 13:58:02,274 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-18 13:58:02,275 INFO L87 Difference]: Start difference. First operand 45309 states and 172388 transitions. Second operand 5 states. [2019-12-18 13:58:02,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:58:02,401 INFO L93 Difference]: Finished difference Result 19765 states and 62245 transitions. [2019-12-18 13:58:02,401 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 13:58:02,402 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 30 [2019-12-18 13:58:02,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:58:02,430 INFO L225 Difference]: With dead ends: 19765 [2019-12-18 13:58:02,430 INFO L226 Difference]: Without dead ends: 18889 [2019-12-18 13:58:02,431 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-18 13:58:02,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18889 states. [2019-12-18 13:58:02,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18889 to 18889. [2019-12-18 13:58:02,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18889 states. [2019-12-18 13:58:02,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18889 states to 18889 states and 59447 transitions. [2019-12-18 13:58:02,986 INFO L78 Accepts]: Start accepts. Automaton has 18889 states and 59447 transitions. Word has length 30 [2019-12-18 13:58:02,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:58:02,986 INFO L462 AbstractCegarLoop]: Abstraction has 18889 states and 59447 transitions. [2019-12-18 13:58:02,986 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 13:58:02,986 INFO L276 IsEmpty]: Start isEmpty. Operand 18889 states and 59447 transitions. [2019-12-18 13:58:02,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-12-18 13:58:02,996 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:58:02,996 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] [2019-12-18 13:58:02,996 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:58:02,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:58:02,997 INFO L82 PathProgramCache]: Analyzing trace with hash -1945851485, now seen corresponding path program 1 times [2019-12-18 13:58:02,997 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:58:02,997 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1976170709] [2019-12-18 13:58:02,997 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:58:03,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:58:03,113 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:58:03,113 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1976170709] [2019-12-18 13:58:03,114 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:58:03,114 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 13:58:03,114 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [145575619] [2019-12-18 13:58:03,114 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 13:58:03,115 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:58:03,115 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 13:58:03,115 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-18 13:58:03,115 INFO L87 Difference]: Start difference. First operand 18889 states and 59447 transitions. Second operand 6 states. [2019-12-18 13:58:03,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:58:03,208 INFO L93 Difference]: Finished difference Result 3470 states and 8793 transitions. [2019-12-18 13:58:03,208 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 13:58:03,208 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 31 [2019-12-18 13:58:03,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:58:03,213 INFO L225 Difference]: With dead ends: 3470 [2019-12-18 13:58:03,213 INFO L226 Difference]: Without dead ends: 3101 [2019-12-18 13:58:03,214 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2019-12-18 13:58:03,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3101 states. [2019-12-18 13:58:03,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3101 to 3101. [2019-12-18 13:58:03,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3101 states. [2019-12-18 13:58:03,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3101 states to 3101 states and 7755 transitions. [2019-12-18 13:58:03,249 INFO L78 Accepts]: Start accepts. Automaton has 3101 states and 7755 transitions. Word has length 31 [2019-12-18 13:58:03,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:58:03,249 INFO L462 AbstractCegarLoop]: Abstraction has 3101 states and 7755 transitions. [2019-12-18 13:58:03,249 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 13:58:03,249 INFO L276 IsEmpty]: Start isEmpty. Operand 3101 states and 7755 transitions. [2019-12-18 13:58:03,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-12-18 13:58:03,252 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:58:03,252 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 13:58:03,253 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:58:03,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:58:03,253 INFO L82 PathProgramCache]: Analyzing trace with hash -476238483, now seen corresponding path program 1 times [2019-12-18 13:58:03,253 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:58:03,254 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1692680260] [2019-12-18 13:58:03,254 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:58:03,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:58:03,366 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 13:58:03,367 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1692680260] [2019-12-18 13:58:03,367 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:58:03,367 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 13:58:03,367 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [851792770] [2019-12-18 13:58:03,368 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 13:58:03,368 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:58:03,368 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 13:58:03,368 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-12-18 13:58:03,368 INFO L87 Difference]: Start difference. First operand 3101 states and 7755 transitions. Second operand 7 states. [2019-12-18 13:58:03,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:58:03,468 INFO L93 Difference]: Finished difference Result 1342 states and 3750 transitions. [2019-12-18 13:58:03,469 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 13:58:03,469 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 43 [2019-12-18 13:58:03,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:58:03,472 INFO L225 Difference]: With dead ends: 1342 [2019-12-18 13:58:03,472 INFO L226 Difference]: Without dead ends: 1293 [2019-12-18 13:58:03,473 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2019-12-18 13:58:03,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1293 states. [2019-12-18 13:58:03,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1293 to 1181. [2019-12-18 13:58:03,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1181 states. [2019-12-18 13:58:03,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1181 states to 1181 states and 3334 transitions. [2019-12-18 13:58:03,491 INFO L78 Accepts]: Start accepts. Automaton has 1181 states and 3334 transitions. Word has length 43 [2019-12-18 13:58:03,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:58:03,491 INFO L462 AbstractCegarLoop]: Abstraction has 1181 states and 3334 transitions. [2019-12-18 13:58:03,492 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 13:58:03,492 INFO L276 IsEmpty]: Start isEmpty. Operand 1181 states and 3334 transitions. [2019-12-18 13:58:03,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-18 13:58:03,494 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:58:03,495 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 13:58:03,495 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:58:03,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:58:03,495 INFO L82 PathProgramCache]: Analyzing trace with hash -409088440, now seen corresponding path program 1 times [2019-12-18 13:58:03,495 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:58:03,496 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1387907654] [2019-12-18 13:58:03,496 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:58:03,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:58:03,584 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 13:58:03,585 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1387907654] [2019-12-18 13:58:03,585 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:58:03,585 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 13:58:03,585 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1331499291] [2019-12-18 13:58:03,585 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 13:58:03,586 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:58:03,586 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 13:58:03,586 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 13:58:03,586 INFO L87 Difference]: Start difference. First operand 1181 states and 3334 transitions. Second operand 5 states. [2019-12-18 13:58:03,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:58:03,835 INFO L93 Difference]: Finished difference Result 1666 states and 4696 transitions. [2019-12-18 13:58:03,836 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 13:58:03,836 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 58 [2019-12-18 13:58:03,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:58:03,840 INFO L225 Difference]: With dead ends: 1666 [2019-12-18 13:58:03,840 INFO L226 Difference]: Without dead ends: 1666 [2019-12-18 13:58:03,840 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-18 13:58:03,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1666 states. [2019-12-18 13:58:03,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1666 to 1470. [2019-12-18 13:58:03,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1470 states. [2019-12-18 13:58:03,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1470 states to 1470 states and 4144 transitions. [2019-12-18 13:58:03,856 INFO L78 Accepts]: Start accepts. Automaton has 1470 states and 4144 transitions. Word has length 58 [2019-12-18 13:58:03,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:58:03,856 INFO L462 AbstractCegarLoop]: Abstraction has 1470 states and 4144 transitions. [2019-12-18 13:58:03,856 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 13:58:03,857 INFO L276 IsEmpty]: Start isEmpty. Operand 1470 states and 4144 transitions. [2019-12-18 13:58:03,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-18 13:58:03,859 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:58:03,859 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:58:03,860 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:58:03,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:58:03,860 INFO L82 PathProgramCache]: Analyzing trace with hash -2087231872, now seen corresponding path program 2 times [2019-12-18 13:58:03,860 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:58:03,860 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1357015328] [2019-12-18 13:58:03,861 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:58:03,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:58:03,975 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 13:58:03,975 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1357015328] [2019-12-18 13:58:03,975 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:58:03,975 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 13:58:03,976 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [921997764] [2019-12-18 13:58:03,976 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 13:58:03,976 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:58:03,976 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 13:58:03,977 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-18 13:58:03,977 INFO L87 Difference]: Start difference. First operand 1470 states and 4144 transitions. Second operand 6 states. [2019-12-18 13:58:04,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:58:04,312 INFO L93 Difference]: Finished difference Result 1745 states and 4788 transitions. [2019-12-18 13:58:04,312 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 13:58:04,312 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 58 [2019-12-18 13:58:04,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:58:04,316 INFO L225 Difference]: With dead ends: 1745 [2019-12-18 13:58:04,316 INFO L226 Difference]: Without dead ends: 1745 [2019-12-18 13:58:04,317 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-18 13:58:04,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1745 states. [2019-12-18 13:58:04,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1745 to 1522. [2019-12-18 13:58:04,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1522 states. [2019-12-18 13:58:04,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1522 states to 1522 states and 4220 transitions. [2019-12-18 13:58:04,333 INFO L78 Accepts]: Start accepts. Automaton has 1522 states and 4220 transitions. Word has length 58 [2019-12-18 13:58:04,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:58:04,333 INFO L462 AbstractCegarLoop]: Abstraction has 1522 states and 4220 transitions. [2019-12-18 13:58:04,333 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 13:58:04,333 INFO L276 IsEmpty]: Start isEmpty. Operand 1522 states and 4220 transitions. [2019-12-18 13:58:04,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-18 13:58:04,335 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:58:04,336 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 13:58:04,336 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:58:04,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:58:04,336 INFO L82 PathProgramCache]: Analyzing trace with hash -893148506, now seen corresponding path program 3 times [2019-12-18 13:58:04,336 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:58:04,336 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2009917193] [2019-12-18 13:58:04,337 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:58:04,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:58:04,416 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 13:58:04,416 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2009917193] [2019-12-18 13:58:04,416 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:58:04,417 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 13:58:04,417 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [537040646] [2019-12-18 13:58:04,417 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 13:58:04,417 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:58:04,418 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 13:58:04,418 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 13:58:04,418 INFO L87 Difference]: Start difference. First operand 1522 states and 4220 transitions. Second operand 3 states. [2019-12-18 13:58:04,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:58:04,432 INFO L93 Difference]: Finished difference Result 1414 states and 3884 transitions. [2019-12-18 13:58:04,432 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 13:58:04,433 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 58 [2019-12-18 13:58:04,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:58:04,435 INFO L225 Difference]: With dead ends: 1414 [2019-12-18 13:58:04,435 INFO L226 Difference]: Without dead ends: 1414 [2019-12-18 13:58:04,436 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 13:58:04,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1414 states. [2019-12-18 13:58:04,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1414 to 1414. [2019-12-18 13:58:04,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1414 states. [2019-12-18 13:58:04,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1414 states to 1414 states and 3884 transitions. [2019-12-18 13:58:04,457 INFO L78 Accepts]: Start accepts. Automaton has 1414 states and 3884 transitions. Word has length 58 [2019-12-18 13:58:04,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:58:04,457 INFO L462 AbstractCegarLoop]: Abstraction has 1414 states and 3884 transitions. [2019-12-18 13:58:04,457 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 13:58:04,457 INFO L276 IsEmpty]: Start isEmpty. Operand 1414 states and 3884 transitions. [2019-12-18 13:58:04,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-18 13:58:04,460 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:58:04,460 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 13:58:04,460 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:58:04,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:58:04,461 INFO L82 PathProgramCache]: Analyzing trace with hash -465324325, now seen corresponding path program 1 times [2019-12-18 13:58:04,461 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:58:04,461 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1531864913] [2019-12-18 13:58:04,462 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:58:04,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:58:04,809 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 13:58:04,809 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1531864913] [2019-12-18 13:58:04,810 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:58:04,810 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-18 13:58:04,810 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [365974987] [2019-12-18 13:58:04,810 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-18 13:58:04,810 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:58:04,811 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-18 13:58:04,811 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2019-12-18 13:58:04,811 INFO L87 Difference]: Start difference. First operand 1414 states and 3884 transitions. Second operand 12 states. [2019-12-18 13:58:06,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:58:06,181 INFO L93 Difference]: Finished difference Result 3338 states and 8414 transitions. [2019-12-18 13:58:06,181 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-12-18 13:58:06,182 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 59 [2019-12-18 13:58:06,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:58:06,185 INFO L225 Difference]: With dead ends: 3338 [2019-12-18 13:58:06,185 INFO L226 Difference]: Without dead ends: 2093 [2019-12-18 13:58:06,186 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 287 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=246, Invalid=1086, Unknown=0, NotChecked=0, Total=1332 [2019-12-18 13:58:06,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2093 states. [2019-12-18 13:58:06,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2093 to 1274. [2019-12-18 13:58:06,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1274 states. [2019-12-18 13:58:06,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1274 states to 1274 states and 3413 transitions. [2019-12-18 13:58:06,211 INFO L78 Accepts]: Start accepts. Automaton has 1274 states and 3413 transitions. Word has length 59 [2019-12-18 13:58:06,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:58:06,211 INFO L462 AbstractCegarLoop]: Abstraction has 1274 states and 3413 transitions. [2019-12-18 13:58:06,211 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-18 13:58:06,212 INFO L276 IsEmpty]: Start isEmpty. Operand 1274 states and 3413 transitions. [2019-12-18 13:58:06,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-18 13:58:06,214 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:58:06,215 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 13:58:06,215 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:58:06,215 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:58:06,215 INFO L82 PathProgramCache]: Analyzing trace with hash -1959943393, now seen corresponding path program 2 times [2019-12-18 13:58:06,216 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:58:06,216 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1309123136] [2019-12-18 13:58:06,216 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:58:06,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:58:06,305 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 13:58:06,305 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1309123136] [2019-12-18 13:58:06,306 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:58:06,306 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 13:58:06,306 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [721937030] [2019-12-18 13:58:06,306 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 13:58:06,306 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:58:06,307 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 13:58:06,307 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 13:58:06,307 INFO L87 Difference]: Start difference. First operand 1274 states and 3413 transitions. Second operand 3 states. [2019-12-18 13:58:06,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:58:06,352 INFO L93 Difference]: Finished difference Result 1273 states and 3411 transitions. [2019-12-18 13:58:06,352 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 13:58:06,352 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 59 [2019-12-18 13:58:06,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:58:06,354 INFO L225 Difference]: With dead ends: 1273 [2019-12-18 13:58:06,354 INFO L226 Difference]: Without dead ends: 1273 [2019-12-18 13:58:06,355 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 13:58:06,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1273 states. [2019-12-18 13:58:06,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1273 to 1020. [2019-12-18 13:58:06,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1020 states. [2019-12-18 13:58:06,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1020 states to 1020 states and 2717 transitions. [2019-12-18 13:58:06,371 INFO L78 Accepts]: Start accepts. Automaton has 1020 states and 2717 transitions. Word has length 59 [2019-12-18 13:58:06,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:58:06,372 INFO L462 AbstractCegarLoop]: Abstraction has 1020 states and 2717 transitions. [2019-12-18 13:58:06,372 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 13:58:06,372 INFO L276 IsEmpty]: Start isEmpty. Operand 1020 states and 2717 transitions. [2019-12-18 13:58:06,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-12-18 13:58:06,374 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:58:06,375 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:58:06,375 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:58:06,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:58:06,375 INFO L82 PathProgramCache]: Analyzing trace with hash 1968443931, now seen corresponding path program 1 times [2019-12-18 13:58:06,375 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:58:06,376 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [358455052] [2019-12-18 13:58:06,376 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:58:06,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:58:06,507 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 13:58:06,508 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [358455052] [2019-12-18 13:58:06,508 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:58:06,508 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 13:58:06,508 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1037691188] [2019-12-18 13:58:06,509 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 13:58:06,509 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:58:06,509 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 13:58:06,509 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-18 13:58:06,510 INFO L87 Difference]: Start difference. First operand 1020 states and 2717 transitions. Second operand 6 states. [2019-12-18 13:58:06,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:58:06,585 INFO L93 Difference]: Finished difference Result 1390 states and 3454 transitions. [2019-12-18 13:58:06,586 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 13:58:06,586 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 60 [2019-12-18 13:58:06,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:58:06,588 INFO L225 Difference]: With dead ends: 1390 [2019-12-18 13:58:06,588 INFO L226 Difference]: Without dead ends: 808 [2019-12-18 13:58:06,589 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-12-18 13:58:06,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 808 states. [2019-12-18 13:58:06,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 808 to 748. [2019-12-18 13:58:06,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 748 states. [2019-12-18 13:58:06,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 748 states to 748 states and 1739 transitions. [2019-12-18 13:58:06,599 INFO L78 Accepts]: Start accepts. Automaton has 748 states and 1739 transitions. Word has length 60 [2019-12-18 13:58:06,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:58:06,599 INFO L462 AbstractCegarLoop]: Abstraction has 748 states and 1739 transitions. [2019-12-18 13:58:06,599 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 13:58:06,599 INFO L276 IsEmpty]: Start isEmpty. Operand 748 states and 1739 transitions. [2019-12-18 13:58:06,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-12-18 13:58:06,600 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:58:06,600 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:58:06,600 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:58:06,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:58:06,601 INFO L82 PathProgramCache]: Analyzing trace with hash 1783112387, now seen corresponding path program 2 times [2019-12-18 13:58:06,601 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:58:06,601 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [837120709] [2019-12-18 13:58:06,601 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:58:06,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:58:06,843 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 13:58:06,843 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [837120709] [2019-12-18 13:58:06,843 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:58:06,844 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-12-18 13:58:06,844 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1693459472] [2019-12-18 13:58:06,844 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-18 13:58:06,844 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:58:06,845 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-18 13:58:06,845 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2019-12-18 13:58:06,845 INFO L87 Difference]: Start difference. First operand 748 states and 1739 transitions. Second operand 13 states. [2019-12-18 13:58:08,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:58:08,355 INFO L93 Difference]: Finished difference Result 2187 states and 5118 transitions. [2019-12-18 13:58:08,355 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-12-18 13:58:08,355 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 60 [2019-12-18 13:58:08,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:58:08,356 INFO L225 Difference]: With dead ends: 2187 [2019-12-18 13:58:08,356 INFO L226 Difference]: Without dead ends: 247 [2019-12-18 13:58:08,357 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 172 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=254, Invalid=802, Unknown=0, NotChecked=0, Total=1056 [2019-12-18 13:58:08,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2019-12-18 13:58:08,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 215. [2019-12-18 13:58:08,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 215 states. [2019-12-18 13:58:08,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 364 transitions. [2019-12-18 13:58:08,361 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 364 transitions. Word has length 60 [2019-12-18 13:58:08,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:58:08,361 INFO L462 AbstractCegarLoop]: Abstraction has 215 states and 364 transitions. [2019-12-18 13:58:08,361 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-18 13:58:08,361 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 364 transitions. [2019-12-18 13:58:08,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-12-18 13:58:08,362 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:58:08,362 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:58:08,362 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:58:08,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:58:08,362 INFO L82 PathProgramCache]: Analyzing trace with hash 424334393, now seen corresponding path program 3 times [2019-12-18 13:58:08,363 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:58:08,363 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [469459327] [2019-12-18 13:58:08,363 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:58:08,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:58:08,616 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 13:58:08,616 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [469459327] [2019-12-18 13:58:08,617 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:58:08,617 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-12-18 13:58:08,617 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1557742816] [2019-12-18 13:58:08,617 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-18 13:58:08,618 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:58:08,618 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-18 13:58:08,618 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2019-12-18 13:58:08,618 INFO L87 Difference]: Start difference. First operand 215 states and 364 transitions. Second operand 14 states. [2019-12-18 13:58:09,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:58:09,221 INFO L93 Difference]: Finished difference Result 366 states and 609 transitions. [2019-12-18 13:58:09,221 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-18 13:58:09,221 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 60 [2019-12-18 13:58:09,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:58:09,222 INFO L225 Difference]: With dead ends: 366 [2019-12-18 13:58:09,222 INFO L226 Difference]: Without dead ends: 333 [2019-12-18 13:58:09,223 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=117, Invalid=483, Unknown=0, NotChecked=0, Total=600 [2019-12-18 13:58:09,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 333 states. [2019-12-18 13:58:09,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 333 to 323. [2019-12-18 13:58:09,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 323 states. [2019-12-18 13:58:09,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 323 states to 323 states and 549 transitions. [2019-12-18 13:58:09,228 INFO L78 Accepts]: Start accepts. Automaton has 323 states and 549 transitions. Word has length 60 [2019-12-18 13:58:09,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:58:09,228 INFO L462 AbstractCegarLoop]: Abstraction has 323 states and 549 transitions. [2019-12-18 13:58:09,228 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-18 13:58:09,229 INFO L276 IsEmpty]: Start isEmpty. Operand 323 states and 549 transitions. [2019-12-18 13:58:09,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-12-18 13:58:09,229 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:58:09,229 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:58:09,230 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:58:09,230 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:58:09,230 INFO L82 PathProgramCache]: Analyzing trace with hash -1750352957, now seen corresponding path program 4 times [2019-12-18 13:58:09,230 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:58:09,230 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [144682768] [2019-12-18 13:58:09,231 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:58:09,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 13:58:09,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 13:58:09,384 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-18 13:58:09,384 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-18 13:58:09,388 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [783] [783] ULTIMATE.startENTRY-->L823: Formula: (let ((.cse0 (store |v_#valid_72| 0 0))) (and (= (store |v_#length_32| |v_ULTIMATE.start_main_~#t1477~0.base_22| 4) |v_#length_31|) (= v_~z$w_buff0~0_106 0) (= v_~z$r_buff0_thd2~0_89 0) (= v_~main$tmp_guard0~0_30 0) (= 0 |v_ULTIMATE.start_main_~#t1477~0.offset_17|) (= |v_#NULL.offset_6| 0) (= 0 v_~z$r_buff1_thd1~0_90) (< 0 |v_#StackHeapBarrier_21|) (= v_~a~0_108 0) (= v_~z$w_buff0_used~0_517 0) (= v_~z$r_buff0_thd0~0_321 0) (= 0 v_~__unbuffered_p1_EAX~0_34) (= (store |v_#memory_int_28| |v_ULTIMATE.start_main_~#t1477~0.base_22| (store (select |v_#memory_int_28| |v_ULTIMATE.start_main_~#t1477~0.base_22|) |v_ULTIMATE.start_main_~#t1477~0.offset_17| 0)) |v_#memory_int_27|) (= v_~z$read_delayed_var~0.offset_7 0) (= v_~z$r_buff1_thd0~0_244 0) (= (select .cse0 |v_ULTIMATE.start_main_~#t1477~0.base_22|) 0) (= 0 v_~z$w_buff1~0_99) (= 0 |v_#NULL.base_6|) (= 0 v_~z$r_buff1_thd2~0_90) (= v_~z$read_delayed_var~0.base_7 0) (= 0 v_~z$flush_delayed~0_47) (= v_~z$read_delayed~0_7 0) (= 0 v_~z$r_buff0_thd3~0_147) (= 0 v_~z$r_buff1_thd4~0_142) (= 0 v_~z$r_buff1_thd3~0_154) (= 0 v_~weak$$choice0~0_24) (= v_~__unbuffered_cnt~0_141 0) (< |v_#StackHeapBarrier_21| |v_ULTIMATE.start_main_~#t1477~0.base_22|) (= v_~z$w_buff1_used~0_308 0) (= 0 v_~__unbuffered_p3_EAX~0_99) (= v_~weak$$choice2~0_108 0) (= v_~z$r_buff0_thd1~0_89 0) (= 0 v_~z$r_buff0_thd4~0_241) (= v_~z~0_160 0) (= v_~z$mem_tmp~0_28 0) (= v_~y~0_41 0) (= v_~x~0_54 0) (= |v_#valid_70| (store .cse0 |v_ULTIMATE.start_main_~#t1477~0.base_22| 1)) (= v_~main$tmp_guard1~0_22 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_21|, #valid=|v_#valid_72|, #memory_int=|v_#memory_int_28|, #length=|v_#length_32|} OutVars{ULTIMATE.start_main_#t~ite28=|v_ULTIMATE.start_main_#t~ite28_33|, ULTIMATE.start_main_~#t1480~0.offset=|v_ULTIMATE.start_main_~#t1480~0.offset_16|, ULTIMATE.start_main_~#t1479~0.base=|v_ULTIMATE.start_main_~#t1479~0.base_20|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_90, ULTIMATE.start_main_#t~ite24=|v_ULTIMATE.start_main_#t~ite24_55|, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_38|, #NULL.offset=|v_#NULL.offset_6|, ULTIMATE.start_main_#t~ite20=|v_ULTIMATE.start_main_#t~ite20_30|, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_19|, ULTIMATE.start_main_#t~ite22=|v_ULTIMATE.start_main_#t~ite22_35|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_42|, ~a~0=v_~a~0_108, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_321, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_34, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_241, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_99, #length=|v_#length_31|, ~z$mem_tmp~0=v_~z$mem_tmp~0_28, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_96|, ULTIMATE.start_main_~#t1477~0.base=|v_ULTIMATE.start_main_~#t1477~0.base_22|, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_33|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_308, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_30|, ~z$flush_delayed~0=v_~z$flush_delayed~0_47, ULTIMATE.start_main_#t~ite31=|v_ULTIMATE.start_main_#t~ite31_33|, ULTIMATE.start_main_#t~ite33=|v_ULTIMATE.start_main_#t~ite33_32|, ~weak$$choice0~0=v_~weak$$choice0~0_24, #StackHeapBarrier=|v_#StackHeapBarrier_21|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_141|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_90, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_9|, ~z$read_delayed_var~0.base=v_~z$read_delayed_var~0.base_7, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_147, ULTIMATE.start_main_#t~nondet17=|v_ULTIMATE.start_main_#t~nondet17_10|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_141, ~x~0=v_~x~0_54, ULTIMATE.start_main_~#t1477~0.offset=|v_ULTIMATE.start_main_~#t1477~0.offset_17|, ~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_142, ULTIMATE.start_main_#t~ite29=|v_ULTIMATE.start_main_#t~ite29_40|, ~z$read_delayed~0=v_~z$read_delayed~0_7, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_35|, ~z$w_buff1~0=v_~z$w_buff1~0_99, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_22, ULTIMATE.start_main_#t~ite27=|v_ULTIMATE.start_main_#t~ite27_29|, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_7, ULTIMATE.start_main_#t~ite21=|v_ULTIMATE.start_main_#t~ite21_105|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_33|, ULTIMATE.start_main_#t~ite23=|v_ULTIMATE.start_main_#t~ite23_39|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_35|, ULTIMATE.start_main_~#t1478~0.base=|v_ULTIMATE.start_main_~#t1478~0.base_23|, ULTIMATE.start_main_#t~ite30=|v_ULTIMATE.start_main_#t~ite30_40|, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_244, ULTIMATE.start_main_#t~nondet26=|v_ULTIMATE.start_main_#t~nondet26_41|, ~y~0=v_~y~0_41, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_89, ULTIMATE.start_main_~#t1480~0.base=|v_ULTIMATE.start_main_~#t1480~0.base_20|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_517, ~z$w_buff0~0=v_~z$w_buff0~0_106, ULTIMATE.start_main_#t~ite19=|v_ULTIMATE.start_main_#t~ite19_33|, ULTIMATE.start_main_#t~nondet25=|v_ULTIMATE.start_main_#t~nondet25_41|, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_154, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_31|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_91|, ULTIMATE.start_main_~#t1479~0.offset=|v_ULTIMATE.start_main_~#t1479~0.offset_17|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_30, ULTIMATE.start_main_#t~ite32=|v_ULTIMATE.start_main_#t~ite32_30|, #NULL.base=|v_#NULL.base_6|, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_34|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_27|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_17|, #valid=|v_#valid_70|, #memory_int=|v_#memory_int_27|, ULTIMATE.start_main_#t~nondet16=|v_ULTIMATE.start_main_#t~nondet16_9|, ULTIMATE.start_main_~#t1478~0.offset=|v_ULTIMATE.start_main_~#t1478~0.offset_18|, ULTIMATE.start_main_#t~nondet18=|v_ULTIMATE.start_main_#t~nondet18_20|, ~z~0=v_~z~0_160, ~weak$$choice2~0=v_~weak$$choice2~0_108, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_89} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite28, ULTIMATE.start_main_~#t1480~0.offset, ULTIMATE.start_main_~#t1479~0.base, ~z$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite24, ULTIMATE.start_main_#t~ite47, #NULL.offset, ULTIMATE.start_main_#t~ite20, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite22, ULTIMATE.start_main_#t~ite45, ~a~0, ~z$r_buff0_thd0~0, ~__unbuffered_p1_EAX~0, ~z$r_buff0_thd4~0, ~__unbuffered_p3_EAX~0, #length, ~z$mem_tmp~0, ULTIMATE.start_main_#t~ite39, ULTIMATE.start_main_~#t1477~0.base, ULTIMATE.start_main_#t~ite35, ~z$w_buff1_used~0, ULTIMATE.start_main_#t~ite37, ~z$flush_delayed~0, ULTIMATE.start_main_#t~ite31, ULTIMATE.start_main_#t~ite33, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite40, ~z$r_buff1_thd1~0, ULTIMATE.start_main_#t~nondet15, ~z$read_delayed_var~0.base, ~z$r_buff0_thd3~0, ULTIMATE.start_main_#t~nondet17, ~__unbuffered_cnt~0, ~x~0, ULTIMATE.start_main_~#t1477~0.offset, ~z$r_buff1_thd4~0, ULTIMATE.start_main_#t~ite29, ~z$read_delayed~0, ULTIMATE.start_main_#t~ite46, ~z$w_buff1~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite27, ~z$read_delayed_var~0.offset, ULTIMATE.start_main_#t~ite21, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite23, ULTIMATE.start_main_#t~ite44, ULTIMATE.start_main_~#t1478~0.base, ULTIMATE.start_main_#t~ite30, ~z$r_buff1_thd0~0, ULTIMATE.start_main_#t~nondet26, ~y~0, ~z$r_buff0_thd2~0, ULTIMATE.start_main_~#t1480~0.base, ~z$w_buff0_used~0, ~z$w_buff0~0, ULTIMATE.start_main_#t~ite19, ULTIMATE.start_main_#t~nondet25, ~z$r_buff1_thd3~0, ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite38, ULTIMATE.start_main_~#t1479~0.offset, ~main$tmp_guard0~0, ULTIMATE.start_main_#t~ite32, #NULL.base, ULTIMATE.start_main_#t~ite34, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#res, #valid, #memory_int, ULTIMATE.start_main_#t~nondet16, ULTIMATE.start_main_~#t1478~0.offset, ULTIMATE.start_main_#t~nondet18, ~z~0, ~weak$$choice2~0, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-18 13:58:09,390 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [750] [750] L823-1-->L825: Formula: (and (< |v_#StackHeapBarrier_15| |v_ULTIMATE.start_main_~#t1478~0.base_13|) (= (store |v_#memory_int_20| |v_ULTIMATE.start_main_~#t1478~0.base_13| (store (select |v_#memory_int_20| |v_ULTIMATE.start_main_~#t1478~0.base_13|) |v_ULTIMATE.start_main_~#t1478~0.offset_11| 1)) |v_#memory_int_19|) (= (select |v_#valid_47| |v_ULTIMATE.start_main_~#t1478~0.base_13|) 0) (= 0 |v_ULTIMATE.start_main_~#t1478~0.offset_11|) (not (= 0 |v_ULTIMATE.start_main_~#t1478~0.base_13|)) (= (store |v_#valid_47| |v_ULTIMATE.start_main_~#t1478~0.base_13| 1) |v_#valid_46|) (= |v_#length_23| (store |v_#length_24| |v_ULTIMATE.start_main_~#t1478~0.base_13| 4))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_15|, #valid=|v_#valid_47|, #memory_int=|v_#memory_int_20|, #length=|v_#length_24|} OutVars{ULTIMATE.start_main_~#t1478~0.base=|v_ULTIMATE.start_main_~#t1478~0.base_13|, #StackHeapBarrier=|v_#StackHeapBarrier_15|, #valid=|v_#valid_46|, #memory_int=|v_#memory_int_19|, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_5|, ULTIMATE.start_main_~#t1478~0.offset=|v_ULTIMATE.start_main_~#t1478~0.offset_11|, #length=|v_#length_23|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1478~0.base, #valid, #memory_int, ULTIMATE.start_main_#t~nondet15, ULTIMATE.start_main_~#t1478~0.offset, #length] because there is no mapped edge [2019-12-18 13:58:09,392 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [745] [745] L825-1-->L827: Formula: (and (= 0 |v_ULTIMATE.start_main_~#t1479~0.offset_10|) (= (store |v_#length_20| |v_ULTIMATE.start_main_~#t1479~0.base_10| 4) |v_#length_19|) (= |v_#valid_40| (store |v_#valid_41| |v_ULTIMATE.start_main_~#t1479~0.base_10| 1)) (= (select |v_#valid_41| |v_ULTIMATE.start_main_~#t1479~0.base_10|) 0) (not (= 0 |v_ULTIMATE.start_main_~#t1479~0.base_10|)) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t1479~0.base_10|) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1479~0.base_10| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1479~0.base_10|) |v_ULTIMATE.start_main_~#t1479~0.offset_10| 2)) |v_#memory_int_15|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_41|, #memory_int=|v_#memory_int_16|, #length=|v_#length_20|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_12|, ULTIMATE.start_main_~#t1479~0.base=|v_ULTIMATE.start_main_~#t1479~0.base_10|, #valid=|v_#valid_40|, #memory_int=|v_#memory_int_15|, ULTIMATE.start_main_#t~nondet16=|v_ULTIMATE.start_main_#t~nondet16_5|, ULTIMATE.start_main_~#t1479~0.offset=|v_ULTIMATE.start_main_~#t1479~0.offset_10|, #length=|v_#length_19|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1479~0.base, #valid, #memory_int, ULTIMATE.start_main_#t~nondet16, ULTIMATE.start_main_~#t1479~0.offset, #length] because there is no mapped edge [2019-12-18 13:58:09,393 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [749] [749] L827-1-->L829: Formula: (and (= |v_#valid_44| (store |v_#valid_45| |v_ULTIMATE.start_main_~#t1480~0.base_11| 1)) (< |v_#StackHeapBarrier_14| |v_ULTIMATE.start_main_~#t1480~0.base_11|) (= (select |v_#valid_45| |v_ULTIMATE.start_main_~#t1480~0.base_11|) 0) (not (= |v_ULTIMATE.start_main_~#t1480~0.base_11| 0)) (= |v_#length_21| (store |v_#length_22| |v_ULTIMATE.start_main_~#t1480~0.base_11| 4)) (= |v_ULTIMATE.start_main_~#t1480~0.offset_10| 0) (= |v_#memory_int_17| (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1480~0.base_11| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1480~0.base_11|) |v_ULTIMATE.start_main_~#t1480~0.offset_10| 3)))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_14|, #valid=|v_#valid_45|, #memory_int=|v_#memory_int_18|, #length=|v_#length_22|} OutVars{ULTIMATE.start_main_~#t1480~0.base=|v_ULTIMATE.start_main_~#t1480~0.base_11|, #StackHeapBarrier=|v_#StackHeapBarrier_14|, ULTIMATE.start_main_~#t1480~0.offset=|v_ULTIMATE.start_main_~#t1480~0.offset_10|, #valid=|v_#valid_44|, #memory_int=|v_#memory_int_17|, #length=|v_#length_21|, ULTIMATE.start_main_#t~nondet17=|v_ULTIMATE.start_main_#t~nondet17_6|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1480~0.base, ULTIMATE.start_main_~#t1480~0.offset, #valid, #memory_int, #length, ULTIMATE.start_main_#t~nondet17] because there is no mapped edge [2019-12-18 13:58:09,395 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [766] [766] L4-->L800: Formula: (and (= ~z$r_buff1_thd3~0_Out1276849870 ~z$r_buff0_thd3~0_In1276849870) (= ~z$r_buff0_thd4~0_In1276849870 ~z$r_buff1_thd4~0_Out1276849870) (= ~z$r_buff0_thd1~0_In1276849870 ~z$r_buff1_thd1~0_Out1276849870) (= ~z$r_buff0_thd2~0_In1276849870 ~z$r_buff1_thd2~0_Out1276849870) (= ~__unbuffered_p3_EAX~0_Out1276849870 ~a~0_In1276849870) (not (= P3Thread1of1ForFork3___VERIFIER_assert_~expression_In1276849870 0)) (= ~z$r_buff1_thd0~0_Out1276849870 ~z$r_buff0_thd0~0_In1276849870) (= 1 ~z$r_buff0_thd4~0_Out1276849870)) InVars {~a~0=~a~0_In1276849870, P3Thread1of1ForFork3___VERIFIER_assert_~expression=P3Thread1of1ForFork3___VERIFIER_assert_~expression_In1276849870, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1276849870, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In1276849870, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1276849870, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In1276849870, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1276849870} OutVars{P3Thread1of1ForFork3___VERIFIER_assert_~expression=P3Thread1of1ForFork3___VERIFIER_assert_~expression_In1276849870, ~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_Out1276849870, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_Out1276849870, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_Out1276849870, ~a~0=~a~0_In1276849870, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1276849870, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_Out1276849870, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_Out1276849870, ~__unbuffered_p3_EAX~0=~__unbuffered_p3_EAX~0_Out1276849870, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_Out1276849870, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1276849870, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In1276849870, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1276849870} AuxVars[] AssignedVars[~z$r_buff1_thd4~0, ~z$r_buff1_thd3~0, ~z$r_buff1_thd0~0, ~z$r_buff1_thd2~0, ~z$r_buff1_thd1~0, ~__unbuffered_p3_EAX~0, ~z$r_buff0_thd4~0] because there is no mapped edge [2019-12-18 13:58:09,396 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [738] [738] P0ENTRY-->P0EXIT: Formula: (and (= 0 |v_P0Thread1of1ForFork0_#res.base_9|) (= |v_P0Thread1of1ForFork0_#res.offset_9| 0) (= v_P0Thread1of1ForFork0_~arg.base_19 |v_P0Thread1of1ForFork0_#in~arg.base_19|) (= (+ v_~__unbuffered_cnt~0_81 1) v_~__unbuffered_cnt~0_80) (= v_~x~0_32 1) (= v_~a~0_41 1) (= v_P0Thread1of1ForFork0_~arg.offset_19 |v_P0Thread1of1ForFork0_#in~arg.offset_19|)) InVars {P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_19|, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_19|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_81} OutVars{~a~0=v_~a~0_41, P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_19|, P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_9|, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_19|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_9|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_80, P0Thread1of1ForFork0_~arg.base=v_P0Thread1of1ForFork0_~arg.base_19, ~x~0=v_~x~0_32, P0Thread1of1ForFork0_~arg.offset=v_P0Thread1of1ForFork0_~arg.offset_19} AuxVars[] AssignedVars[~a~0, P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0, P0Thread1of1ForFork0_~arg.base, ~x~0, P0Thread1of1ForFork0_~arg.offset] because there is no mapped edge [2019-12-18 13:58:09,397 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [748] [748] P1ENTRY-->P1EXIT: Formula: (and (= v_~y~0_32 v_~__unbuffered_p1_EAX~0_23) (= |v_P1Thread1of1ForFork1_#res.offset_11| 0) (= v_P1Thread1of1ForFork1_~arg.base_19 |v_P1Thread1of1ForFork1_#in~arg.base_19|) (= 0 |v_P1Thread1of1ForFork1_#res.base_11|) (= v_~x~0_41 2) (= v_~__unbuffered_cnt~0_115 (+ v_~__unbuffered_cnt~0_116 1)) (= |v_P1Thread1of1ForFork1_#in~arg.offset_19| v_P1Thread1of1ForFork1_~arg.offset_19)) InVars {P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_19|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_19|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_116, ~y~0=v_~y~0_32} OutVars{P1Thread1of1ForFork1_~arg.offset=v_P1Thread1of1ForFork1_~arg.offset_19, P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_11|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_23, P1Thread1of1ForFork1_~arg.base=v_P1Thread1of1ForFork1_~arg.base_19, P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_19|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_19|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_115, ~y~0=v_~y~0_32, ~x~0=v_~x~0_41, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_11|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_~arg.offset, P1Thread1of1ForFork1_#res.offset, ~__unbuffered_p1_EAX~0, P1Thread1of1ForFork1_~arg.base, ~__unbuffered_cnt~0, ~x~0, P1Thread1of1ForFork1_#res.base] because there is no mapped edge [2019-12-18 13:58:09,398 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [722] [722] L801-->L801-2: Formula: (let ((.cse0 (= (mod ~z$w_buff0_used~0_In-1414514587 256) 0)) (.cse1 (= 0 (mod ~z$r_buff0_thd4~0_In-1414514587 256)))) (or (and (= |P3Thread1of1ForFork3_#t~ite11_Out-1414514587| 0) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= |P3Thread1of1ForFork3_#t~ite11_Out-1414514587| ~z$w_buff0_used~0_In-1414514587)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1414514587, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-1414514587} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1414514587, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-1414514587, P3Thread1of1ForFork3_#t~ite11=|P3Thread1of1ForFork3_#t~ite11_Out-1414514587|} AuxVars[] AssignedVars[P3Thread1of1ForFork3_#t~ite11] because there is no mapped edge [2019-12-18 13:58:09,399 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [710] [710] L770-2-->L770-4: Formula: (let ((.cse0 (= (mod ~z$w_buff1_used~0_In1460514778 256) 0)) (.cse1 (= (mod ~z$r_buff1_thd3~0_In1460514778 256) 0))) (or (and (= ~z~0_In1460514778 |P2Thread1of1ForFork2_#t~ite3_Out1460514778|) (or .cse0 .cse1)) (and (= |P2Thread1of1ForFork2_#t~ite3_Out1460514778| ~z$w_buff1~0_In1460514778) (not .cse0) (not .cse1)))) InVars {~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1460514778, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1460514778, ~z$w_buff1~0=~z$w_buff1~0_In1460514778, ~z~0=~z~0_In1460514778} OutVars{P2Thread1of1ForFork2_#t~ite3=|P2Thread1of1ForFork2_#t~ite3_Out1460514778|, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1460514778, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1460514778, ~z$w_buff1~0=~z$w_buff1~0_In1460514778, ~z~0=~z~0_In1460514778} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite3] because there is no mapped edge [2019-12-18 13:58:09,399 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [693] [693] L770-4-->L771: Formula: (= |v_P2Thread1of1ForFork2_#t~ite3_14| v_~z~0_35) InVars {P2Thread1of1ForFork2_#t~ite3=|v_P2Thread1of1ForFork2_#t~ite3_14|} OutVars{P2Thread1of1ForFork2_#t~ite4=|v_P2Thread1of1ForFork2_#t~ite4_13|, P2Thread1of1ForFork2_#t~ite3=|v_P2Thread1of1ForFork2_#t~ite3_13|, ~z~0=v_~z~0_35} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite4, P2Thread1of1ForFork2_#t~ite3, ~z~0] because there is no mapped edge [2019-12-18 13:58:09,400 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [724] [724] L802-->L802-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff0_thd4~0_In-1161555095 256))) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In-1161555095 256))) (.cse3 (= 0 (mod ~z$r_buff1_thd4~0_In-1161555095 256))) (.cse2 (= 0 (mod ~z$w_buff1_used~0_In-1161555095 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P3Thread1of1ForFork3_#t~ite12_Out-1161555095|)) (and (or .cse0 .cse1) (= ~z$w_buff1_used~0_In-1161555095 |P3Thread1of1ForFork3_#t~ite12_Out-1161555095|) (or .cse3 .cse2)))) InVars {~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In-1161555095, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1161555095, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-1161555095, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1161555095} OutVars{~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In-1161555095, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1161555095, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-1161555095, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1161555095, P3Thread1of1ForFork3_#t~ite12=|P3Thread1of1ForFork3_#t~ite12_Out-1161555095|} AuxVars[] AssignedVars[P3Thread1of1ForFork3_#t~ite12] because there is no mapped edge [2019-12-18 13:58:09,401 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [707] [707] L803-->L804: Formula: (let ((.cse1 (= (mod ~z$r_buff0_thd4~0_In1559686085 256) 0)) (.cse0 (= (mod ~z$w_buff0_used~0_In1559686085 256) 0))) (or (and (not .cse0) (not .cse1) (= ~z$r_buff0_thd4~0_Out1559686085 0)) (and (or .cse1 .cse0) (= ~z$r_buff0_thd4~0_Out1559686085 ~z$r_buff0_thd4~0_In1559686085)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1559686085, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In1559686085} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1559686085, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_Out1559686085, P3Thread1of1ForFork3_#t~ite13=|P3Thread1of1ForFork3_#t~ite13_Out1559686085|} AuxVars[] AssignedVars[~z$r_buff0_thd4~0, P3Thread1of1ForFork3_#t~ite13] because there is no mapped edge [2019-12-18 13:58:09,401 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [721] [721] L804-->L804-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In725999013 256))) (.cse1 (= 0 (mod ~z$r_buff0_thd4~0_In725999013 256))) (.cse2 (= (mod ~z$r_buff1_thd4~0_In725999013 256) 0)) (.cse3 (= (mod ~z$w_buff1_used~0_In725999013 256) 0))) (or (and (or .cse0 .cse1) (= ~z$r_buff1_thd4~0_In725999013 |P3Thread1of1ForFork3_#t~ite14_Out725999013|) (or .cse2 .cse3)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P3Thread1of1ForFork3_#t~ite14_Out725999013|)))) InVars {~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In725999013, ~z$w_buff0_used~0=~z$w_buff0_used~0_In725999013, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In725999013, ~z$w_buff1_used~0=~z$w_buff1_used~0_In725999013} OutVars{~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In725999013, ~z$w_buff0_used~0=~z$w_buff0_used~0_In725999013, P3Thread1of1ForFork3_#t~ite14=|P3Thread1of1ForFork3_#t~ite14_Out725999013|, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In725999013, ~z$w_buff1_used~0=~z$w_buff1_used~0_In725999013} AuxVars[] AssignedVars[P3Thread1of1ForFork3_#t~ite14] because there is no mapped edge [2019-12-18 13:58:09,401 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [747] [747] L804-2-->P3EXIT: Formula: (and (= v_~__unbuffered_cnt~0_109 (+ v_~__unbuffered_cnt~0_110 1)) (= 0 |v_P3Thread1of1ForFork3_#res.offset_5|) (= 0 |v_P3Thread1of1ForFork3_#res.base_5|) (= |v_P3Thread1of1ForFork3_#t~ite14_46| v_~z$r_buff1_thd4~0_84)) InVars {P3Thread1of1ForFork3_#t~ite14=|v_P3Thread1of1ForFork3_#t~ite14_46|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_110} OutVars{~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_84, P3Thread1of1ForFork3_#t~ite14=|v_P3Thread1of1ForFork3_#t~ite14_45|, P3Thread1of1ForFork3_#res.base=|v_P3Thread1of1ForFork3_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_109, P3Thread1of1ForFork3_#res.offset=|v_P3Thread1of1ForFork3_#res.offset_5|} AuxVars[] AssignedVars[~z$r_buff1_thd4~0, P3Thread1of1ForFork3_#t~ite14, P3Thread1of1ForFork3_#res.base, ~__unbuffered_cnt~0, P3Thread1of1ForFork3_#res.offset] because there is no mapped edge [2019-12-18 13:58:09,401 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [717] [717] L771-->L771-2: Formula: (let ((.cse1 (= (mod ~z$r_buff0_thd3~0_In1632882385 256) 0)) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In1632882385 256)))) (or (and (= |P2Thread1of1ForFork2_#t~ite5_Out1632882385| ~z$w_buff0_used~0_In1632882385) (or .cse0 .cse1)) (and (not .cse1) (= |P2Thread1of1ForFork2_#t~ite5_Out1632882385| 0) (not .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1632882385, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1632882385} OutVars{P2Thread1of1ForFork2_#t~ite5=|P2Thread1of1ForFork2_#t~ite5_Out1632882385|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1632882385, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1632882385} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite5] because there is no mapped edge [2019-12-18 13:58:09,402 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [713] [713] L772-->L772-2: Formula: (let ((.cse3 (= 0 (mod ~z$w_buff0_used~0_In19829826 256))) (.cse2 (= 0 (mod ~z$r_buff0_thd3~0_In19829826 256))) (.cse0 (= 0 (mod ~z$r_buff1_thd3~0_In19829826 256))) (.cse1 (= 0 (mod ~z$w_buff1_used~0_In19829826 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P2Thread1of1ForFork2_#t~ite6_Out19829826|)) (and (= ~z$w_buff1_used~0_In19829826 |P2Thread1of1ForFork2_#t~ite6_Out19829826|) (or .cse3 .cse2) (or .cse0 .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In19829826, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In19829826, ~z$w_buff1_used~0=~z$w_buff1_used~0_In19829826, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In19829826} OutVars{P2Thread1of1ForFork2_#t~ite6=|P2Thread1of1ForFork2_#t~ite6_Out19829826|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In19829826, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In19829826, ~z$w_buff1_used~0=~z$w_buff1_used~0_In19829826, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In19829826} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite6] because there is no mapped edge [2019-12-18 13:58:09,403 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [714] [714] L773-->L773-2: Formula: (let ((.cse1 (= (mod ~z$r_buff0_thd3~0_In2125332897 256) 0)) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In2125332897 256)))) (or (and (= |P2Thread1of1ForFork2_#t~ite7_Out2125332897| ~z$r_buff0_thd3~0_In2125332897) (or .cse0 .cse1)) (and (= |P2Thread1of1ForFork2_#t~ite7_Out2125332897| 0) (not .cse1) (not .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In2125332897, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In2125332897} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In2125332897, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In2125332897, P2Thread1of1ForFork2_#t~ite7=|P2Thread1of1ForFork2_#t~ite7_Out2125332897|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite7] because there is no mapped edge [2019-12-18 13:58:09,404 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [712] [712] L774-->L774-2: Formula: (let ((.cse1 (= (mod ~z$r_buff0_thd3~0_In534699500 256) 0)) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In534699500 256))) (.cse3 (= (mod ~z$w_buff1_used~0_In534699500 256) 0)) (.cse2 (= (mod ~z$r_buff1_thd3~0_In534699500 256) 0))) (or (and (= |P2Thread1of1ForFork2_#t~ite8_Out534699500| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= |P2Thread1of1ForFork2_#t~ite8_Out534699500| ~z$r_buff1_thd3~0_In534699500) (or .cse1 .cse0) (or .cse3 .cse2)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In534699500, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In534699500, ~z$w_buff1_used~0=~z$w_buff1_used~0_In534699500, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In534699500} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In534699500, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In534699500, ~z$w_buff1_used~0=~z$w_buff1_used~0_In534699500, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In534699500, P2Thread1of1ForFork2_#t~ite8=|P2Thread1of1ForFork2_#t~ite8_Out534699500|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite8] because there is no mapped edge [2019-12-18 13:58:09,404 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [761] [761] L774-2-->P2EXIT: Formula: (and (= 0 |v_P2Thread1of1ForFork2_#res.base_5|) (= v_~__unbuffered_cnt~0_125 (+ v_~__unbuffered_cnt~0_126 1)) (= |v_P2Thread1of1ForFork2_#t~ite8_44| v_~z$r_buff1_thd3~0_126) (= |v_P2Thread1of1ForFork2_#res.offset_5| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_126, P2Thread1of1ForFork2_#t~ite8=|v_P2Thread1of1ForFork2_#t~ite8_44|} OutVars{~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_126, P2Thread1of1ForFork2_#res.base=|v_P2Thread1of1ForFork2_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_125, P2Thread1of1ForFork2_#res.offset=|v_P2Thread1of1ForFork2_#res.offset_5|, P2Thread1of1ForFork2_#t~ite8=|v_P2Thread1of1ForFork2_#t~ite8_43|} AuxVars[] AssignedVars[~z$r_buff1_thd3~0, P2Thread1of1ForFork2_#res.base, ~__unbuffered_cnt~0, P2Thread1of1ForFork2_#res.offset, P2Thread1of1ForFork2_#t~ite8] because there is no mapped edge [2019-12-18 13:58:09,405 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [652] [652] L833-->L835-2: Formula: (and (or (= 0 (mod v_~z$w_buff0_used~0_104 256)) (= (mod v_~z$r_buff0_thd0~0_62 256) 0)) (not (= 0 (mod v_~main$tmp_guard0~0_5 256)))) InVars {~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_62, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_104, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_5} OutVars{~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_62, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_104, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_5} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-18 13:58:09,406 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [708] [708] L835-2-->L835-4: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff1_used~0_In-1019652695 256))) (.cse1 (= 0 (mod ~z$r_buff1_thd0~0_In-1019652695 256)))) (or (and (= ~z$w_buff1~0_In-1019652695 |ULTIMATE.start_main_#t~ite19_Out-1019652695|) (not .cse0) (not .cse1)) (and (= ~z~0_In-1019652695 |ULTIMATE.start_main_#t~ite19_Out-1019652695|) (or .cse0 .cse1)))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1019652695, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1019652695, ~z$w_buff1~0=~z$w_buff1~0_In-1019652695, ~z~0=~z~0_In-1019652695} OutVars{ULTIMATE.start_main_#t~ite19=|ULTIMATE.start_main_#t~ite19_Out-1019652695|, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1019652695, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1019652695, ~z$w_buff1~0=~z$w_buff1~0_In-1019652695, ~z~0=~z~0_In-1019652695} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite19] because there is no mapped edge [2019-12-18 13:58:09,406 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [671] [671] L835-4-->L836: Formula: (= v_~z~0_32 |v_ULTIMATE.start_main_#t~ite19_7|) InVars {ULTIMATE.start_main_#t~ite19=|v_ULTIMATE.start_main_#t~ite19_7|} OutVars{ULTIMATE.start_main_#t~ite19=|v_ULTIMATE.start_main_#t~ite19_6|, ~z~0=v_~z~0_32, ULTIMATE.start_main_#t~ite20=|v_ULTIMATE.start_main_#t~ite20_7|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite19, ~z~0, ULTIMATE.start_main_#t~ite20] because there is no mapped edge [2019-12-18 13:58:09,406 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [716] [716] L836-->L836-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd0~0_In-285899250 256))) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In-285899250 256)))) (or (and (= |ULTIMATE.start_main_#t~ite21_Out-285899250| ~z$w_buff0_used~0_In-285899250) (or .cse0 .cse1)) (and (not .cse1) (= |ULTIMATE.start_main_#t~ite21_Out-285899250| 0) (not .cse0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-285899250, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-285899250} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-285899250, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-285899250, ULTIMATE.start_main_#t~ite21=|ULTIMATE.start_main_#t~ite21_Out-285899250|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite21] because there is no mapped edge [2019-12-18 13:58:09,407 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [718] [718] L837-->L837-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd0~0_In590944466 256))) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In590944466 256))) (.cse3 (= 0 (mod ~z$w_buff1_used~0_In590944466 256))) (.cse2 (= (mod ~z$r_buff1_thd0~0_In590944466 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite22_Out590944466| 0)) (and (or .cse1 .cse0) (or .cse3 .cse2) (= |ULTIMATE.start_main_#t~ite22_Out590944466| ~z$w_buff1_used~0_In590944466)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In590944466, ~z$w_buff0_used~0=~z$w_buff0_used~0_In590944466, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In590944466, ~z$w_buff1_used~0=~z$w_buff1_used~0_In590944466} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In590944466, ~z$w_buff0_used~0=~z$w_buff0_used~0_In590944466, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In590944466, ~z$w_buff1_used~0=~z$w_buff1_used~0_In590944466, ULTIMATE.start_main_#t~ite22=|ULTIMATE.start_main_#t~ite22_Out590944466|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite22] because there is no mapped edge [2019-12-18 13:58:09,408 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [723] [723] L838-->L838-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd0~0_In2027563519 256))) (.cse0 (= (mod ~z$w_buff0_used~0_In2027563519 256) 0))) (or (and (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite23_Out2027563519|) (not .cse1)) (and (= ~z$r_buff0_thd0~0_In2027563519 |ULTIMATE.start_main_#t~ite23_Out2027563519|) (or .cse1 .cse0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In2027563519, ~z$w_buff0_used~0=~z$w_buff0_used~0_In2027563519} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In2027563519, ~z$w_buff0_used~0=~z$w_buff0_used~0_In2027563519, ULTIMATE.start_main_#t~ite23=|ULTIMATE.start_main_#t~ite23_Out2027563519|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite23] because there is no mapped edge [2019-12-18 13:58:09,409 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [720] [720] L839-->L839-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd0~0_In-1940212969 256))) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In-1940212969 256))) (.cse3 (= (mod ~z$r_buff1_thd0~0_In-1940212969 256) 0)) (.cse2 (= 0 (mod ~z$w_buff1_used~0_In-1940212969 256)))) (or (and (= |ULTIMATE.start_main_#t~ite24_Out-1940212969| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse1 .cse0) (or .cse3 .cse2) (= |ULTIMATE.start_main_#t~ite24_Out-1940212969| ~z$r_buff1_thd0~0_In-1940212969)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1940212969, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1940212969, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1940212969, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1940212969} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1940212969, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1940212969, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1940212969, ULTIMATE.start_main_#t~ite24=|ULTIMATE.start_main_#t~ite24_Out-1940212969|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1940212969} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite24] because there is no mapped edge [2019-12-18 13:58:09,413 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [767] [767] L848-->L848-8: Formula: (let ((.cse1 (= (mod ~weak$$choice2~0_In1340385139 256) 0))) (or (and (= ~z$w_buff1~0_In1340385139 |ULTIMATE.start_main_#t~ite33_Out1340385139|) (= |ULTIMATE.start_main_#t~ite34_Out1340385139| |ULTIMATE.start_main_#t~ite33_Out1340385139|) (let ((.cse0 (= (mod ~z$r_buff0_thd0~0_In1340385139 256) 0))) (or (= 0 (mod ~z$w_buff0_used~0_In1340385139 256)) (and .cse0 (= (mod ~z$w_buff1_used~0_In1340385139 256) 0)) (and (= (mod ~z$r_buff1_thd0~0_In1340385139 256) 0) .cse0))) .cse1) (and (not .cse1) (= |ULTIMATE.start_main_#t~ite34_Out1340385139| ~z$w_buff1~0_In1340385139) (= |ULTIMATE.start_main_#t~ite33_In1340385139| |ULTIMATE.start_main_#t~ite33_Out1340385139|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1340385139, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1340385139, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1340385139, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1340385139, ~z$w_buff1~0=~z$w_buff1~0_In1340385139, ~weak$$choice2~0=~weak$$choice2~0_In1340385139, ULTIMATE.start_main_#t~ite33=|ULTIMATE.start_main_#t~ite33_In1340385139|} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1340385139, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1340385139, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1340385139, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1340385139, ~z$w_buff1~0=~z$w_buff1~0_In1340385139, ~weak$$choice2~0=~weak$$choice2~0_In1340385139, ULTIMATE.start_main_#t~ite33=|ULTIMATE.start_main_#t~ite33_Out1340385139|, ULTIMATE.start_main_#t~ite34=|ULTIMATE.start_main_#t~ite34_Out1340385139|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite33, ULTIMATE.start_main_#t~ite34] because there is no mapped edge [2019-12-18 13:58:09,415 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [764] [764] L850-->L850-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In1359406858 256)))) (or (and (= |ULTIMATE.start_main_#t~ite39_In1359406858| |ULTIMATE.start_main_#t~ite39_Out1359406858|) (not .cse0) (= ~z$w_buff1_used~0_In1359406858 |ULTIMATE.start_main_#t~ite40_Out1359406858|)) (and .cse0 (= |ULTIMATE.start_main_#t~ite39_Out1359406858| ~z$w_buff1_used~0_In1359406858) (= |ULTIMATE.start_main_#t~ite39_Out1359406858| |ULTIMATE.start_main_#t~ite40_Out1359406858|) (let ((.cse1 (= 0 (mod ~z$r_buff0_thd0~0_In1359406858 256)))) (or (= 0 (mod ~z$w_buff0_used~0_In1359406858 256)) (and (= (mod ~z$w_buff1_used~0_In1359406858 256) 0) .cse1) (and (= 0 (mod ~z$r_buff1_thd0~0_In1359406858 256)) .cse1)))))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1359406858, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1359406858, ULTIMATE.start_main_#t~ite39=|ULTIMATE.start_main_#t~ite39_In1359406858|, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1359406858, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1359406858, ~weak$$choice2~0=~weak$$choice2~0_In1359406858} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1359406858, ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out1359406858|, ULTIMATE.start_main_#t~ite39=|ULTIMATE.start_main_#t~ite39_Out1359406858|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1359406858, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1359406858, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1359406858, ~weak$$choice2~0=~weak$$choice2~0_In1359406858} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite40, ULTIMATE.start_main_#t~ite39] because there is no mapped edge [2019-12-18 13:58:09,416 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [705] [705] L851-->L852: Formula: (and (= v_~z$r_buff0_thd0~0_135 v_~z$r_buff0_thd0~0_134) (not (= (mod v_~weak$$choice2~0_41 256) 0))) InVars {~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_135, ~weak$$choice2~0=v_~weak$$choice2~0_41} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_14|, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_134, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_9|, ~weak$$choice2~0=v_~weak$$choice2~0_41, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_12|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ~z$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-18 13:58:09,416 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [765] [765] L852-->L852-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-460143204 256)))) (or (and (= |ULTIMATE.start_main_#t~ite46_Out-460143204| ~z$r_buff1_thd0~0_In-460143204) (= |ULTIMATE.start_main_#t~ite45_In-460143204| |ULTIMATE.start_main_#t~ite45_Out-460143204|) (not .cse0)) (and (let ((.cse1 (= (mod ~z$r_buff0_thd0~0_In-460143204 256) 0))) (or (and (= 0 (mod ~z$w_buff1_used~0_In-460143204 256)) .cse1) (and (= (mod ~z$r_buff1_thd0~0_In-460143204 256) 0) .cse1) (= (mod ~z$w_buff0_used~0_In-460143204 256) 0))) .cse0 (= ~z$r_buff1_thd0~0_In-460143204 |ULTIMATE.start_main_#t~ite45_Out-460143204|) (= |ULTIMATE.start_main_#t~ite46_Out-460143204| |ULTIMATE.start_main_#t~ite45_Out-460143204|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-460143204, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-460143204, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-460143204, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-460143204, ~weak$$choice2~0=~weak$$choice2~0_In-460143204, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_In-460143204|} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-460143204, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-460143204, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-460143204, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-460143204, ULTIMATE.start_main_#t~ite46=|ULTIMATE.start_main_#t~ite46_Out-460143204|, ~weak$$choice2~0=~weak$$choice2~0_In-460143204, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out-460143204|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite46, ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-12-18 13:58:09,417 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [762] [762] L854-->L4: Formula: (and (= 0 v_~z$flush_delayed~0_38) (not (= (mod v_~z$flush_delayed~0_39 256) 0)) (= v_~z$mem_tmp~0_25 v_~z~0_127) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_7| (mod v_~main$tmp_guard1~0_12 256))) InVars {~z$mem_tmp~0=v_~z$mem_tmp~0_25, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_12, ~z$flush_delayed~0=v_~z$flush_delayed~0_39} OutVars{~z$mem_tmp~0=v_~z$mem_tmp~0_25, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_11, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_24|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_12, ~z$flush_delayed~0=v_~z$flush_delayed~0_38, ~z~0=v_~z~0_127, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_7|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ULTIMATE.start_main_#t~ite47, ~z$flush_delayed~0, ~z~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-18 13:58:09,418 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [758] [758] L4-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_10 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_10 0)) InVars {ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_10, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression] because there is no mapped edge [2019-12-18 13:58:09,534 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.12 01:58:09 BasicIcfg [2019-12-18 13:58:09,535 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-18 13:58:09,540 INFO L168 Benchmark]: Toolchain (without parser) took 38314.97 ms. Allocated memory was 145.8 MB in the beginning and 2.0 GB in the end (delta: 1.9 GB). Free memory was 101.8 MB in the beginning and 894.6 MB in the end (delta: -792.8 MB). Peak memory consumption was 1.1 GB. Max. memory is 7.1 GB. [2019-12-18 13:58:09,540 INFO L168 Benchmark]: CDTParser took 0.45 ms. Allocated memory is still 145.8 MB. Free memory was 122.2 MB in the beginning and 122.0 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. [2019-12-18 13:58:09,541 INFO L168 Benchmark]: CACSL2BoogieTranslator took 716.70 ms. Allocated memory was 145.8 MB in the beginning and 203.4 MB in the end (delta: 57.7 MB). Free memory was 101.6 MB in the beginning and 154.5 MB in the end (delta: -52.9 MB). Peak memory consumption was 20.7 MB. Max. memory is 7.1 GB. [2019-12-18 13:58:09,542 INFO L168 Benchmark]: Boogie Procedure Inliner took 72.26 ms. Allocated memory is still 203.4 MB. Free memory was 154.5 MB in the beginning and 151.9 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-18 13:58:09,542 INFO L168 Benchmark]: Boogie Preprocessor took 47.68 ms. Allocated memory is still 203.4 MB. Free memory was 151.9 MB in the beginning and 149.2 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-18 13:58:09,543 INFO L168 Benchmark]: RCFGBuilder took 845.76 ms. Allocated memory is still 203.4 MB. Free memory was 149.2 MB in the beginning and 99.9 MB in the end (delta: 49.3 MB). Peak memory consumption was 49.3 MB. Max. memory is 7.1 GB. [2019-12-18 13:58:09,544 INFO L168 Benchmark]: TraceAbstraction took 36627.34 ms. Allocated memory was 203.4 MB in the beginning and 2.0 GB in the end (delta: 1.8 GB). Free memory was 99.2 MB in the beginning and 894.6 MB in the end (delta: -795.4 MB). Peak memory consumption was 1.0 GB. Max. memory is 7.1 GB. [2019-12-18 13:58:09,547 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.45 ms. Allocated memory is still 145.8 MB. Free memory was 122.2 MB in the beginning and 122.0 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 716.70 ms. Allocated memory was 145.8 MB in the beginning and 203.4 MB in the end (delta: 57.7 MB). Free memory was 101.6 MB in the beginning and 154.5 MB in the end (delta: -52.9 MB). Peak memory consumption was 20.7 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 72.26 ms. Allocated memory is still 203.4 MB. Free memory was 154.5 MB in the beginning and 151.9 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 47.68 ms. Allocated memory is still 203.4 MB. Free memory was 151.9 MB in the beginning and 149.2 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 845.76 ms. Allocated memory is still 203.4 MB. Free memory was 149.2 MB in the beginning and 99.9 MB in the end (delta: 49.3 MB). Peak memory consumption was 49.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 36627.34 ms. Allocated memory was 203.4 MB in the beginning and 2.0 GB in the end (delta: 1.8 GB). Free memory was 99.2 MB in the beginning and 894.6 MB in the end (delta: -795.4 MB). Peak memory consumption was 1.0 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 5.3s, 179 ProgramPointsBefore, 91 ProgramPointsAfterwards, 207 TransitionsBefore, 97 TransitionsAfterwards, 12668 CoEnabledTransitionPairs, 7 FixpointIterations, 35 TrivialSequentialCompositions, 50 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 35 ConcurrentYvCompositions, 27 ChoiceCompositions, 4846 VarBasedMoverChecksPositive, 179 VarBasedMoverChecksNegative, 25 SemBasedMoverChecksPositive, 208 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.3s, 0 MoverChecksTotal, 50860 CheckedPairsTotal, 120 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L823] FCALL, FORK 0 pthread_create(&t1477, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L825] FCALL, FORK 0 pthread_create(&t1478, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=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, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L827] FCALL, FORK 0 pthread_create(&t1479, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=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, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L829] FCALL, FORK 0 pthread_create(&t1480, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=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, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L784] 4 z$w_buff1 = z$w_buff0 [L785] 4 z$w_buff0 = 2 [L786] 4 z$w_buff1_used = z$w_buff0_used [L787] 4 z$w_buff0_used = (_Bool)1 [L800] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=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, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L764] 3 y = 1 [L767] 3 z = 1 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=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=0, weak$$choice2=0, x=2, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L800] 4 z = z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L770] 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=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=0, weak$$choice2=0, x=2, y=1, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L801] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L802] 4 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L771] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L772] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L773] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L831] 0 main$tmp_guard0 = __unbuffered_cnt == 4 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=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=0, weak$$choice2=0, x=2, y=1, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L836] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L837] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L838] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L839] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L842] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L843] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L844] 0 z$flush_delayed = weak$$choice2 [L845] 0 z$mem_tmp = z VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=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=2, y=1, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L846] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=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=2, y=1, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L846] 0 z = !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L847] EXPR 0 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=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=2, y=1, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L847] 0 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L848] 0 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L849] EXPR 0 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=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=2, y=1, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L849] 0 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L850] 0 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L852] 0 z$r_buff1_thd0 = weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L853] 0 main$tmp_guard1 = !(x == 2 && z == 2 && __unbuffered_p1_EAX == 0 && __unbuffered_p3_EAX == 0) VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=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=2, y=1, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 167 locations, 2 error locations. Result: UNSAFE, OverallTime: 36.3s, OverallIterations: 18, TraceHistogramMax: 1, AutomataDifference: 14.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 2086 SDtfs, 2871 SDslu, 5671 SDs, 0 SdLazy, 3353 SolverSat, 260 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 178 GetRequests, 23 SyntacticMatches, 9 SemanticMatches, 146 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 559 ImplicationChecksByTransitivity, 2.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=52262occurred in iteration=3, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 11.5s AutomataMinimizationTime, 17 MinimizatonAttempts, 32703 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.7s InterpolantComputationTime, 748 NumberOfCodeBlocks, 748 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 671 ConstructedInterpolants, 0 QuantifiedInterpolants, 142534 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 17 InterpolantComputations, 17 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...