/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix010_power.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-fae578e [2019-12-18 16:19:29,934 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-18 16:19:29,936 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-18 16:19:29,948 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-18 16:19:29,948 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-18 16:19:29,949 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-18 16:19:29,951 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-18 16:19:29,952 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-18 16:19:29,954 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-18 16:19:29,955 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-18 16:19:29,956 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-18 16:19:29,957 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-18 16:19:29,957 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-18 16:19:29,958 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-18 16:19:29,959 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-18 16:19:29,960 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-18 16:19:29,961 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-18 16:19:29,962 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-18 16:19:29,963 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-18 16:19:29,965 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-18 16:19:29,967 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-18 16:19:29,968 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-18 16:19:29,969 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-18 16:19:29,970 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-18 16:19:29,972 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-18 16:19:29,972 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-18 16:19:29,972 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-18 16:19:29,973 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-18 16:19:29,974 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-18 16:19:29,974 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-18 16:19:29,975 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-18 16:19:29,975 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-18 16:19:29,976 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-18 16:19:29,977 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-18 16:19:29,978 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-18 16:19:29,978 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-18 16:19:29,979 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-18 16:19:29,979 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-18 16:19:29,979 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-18 16:19:29,980 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-18 16:19:29,981 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-18 16:19:29,981 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe.epf [2019-12-18 16:19:29,996 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-18 16:19:29,997 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-18 16:19:29,998 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-18 16:19:29,998 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-18 16:19:29,999 INFO L138 SettingsManager]: * Use SBE=true [2019-12-18 16:19:29,999 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-18 16:19:29,999 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-18 16:19:29,999 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-18 16:19:29,999 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-18 16:19:30,000 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-18 16:19:30,000 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-18 16:19:30,000 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-18 16:19:30,000 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-18 16:19:30,000 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-18 16:19:30,002 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-18 16:19:30,002 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-18 16:19:30,002 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-18 16:19:30,002 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-18 16:19:30,003 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-18 16:19:30,003 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-18 16:19:30,003 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-18 16:19:30,003 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 16:19:30,004 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-18 16:19:30,004 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-18 16:19:30,004 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-18 16:19:30,004 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-18 16:19:30,005 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-18 16:19:30,005 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-18 16:19:30,005 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-18 16:19:30,298 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-18 16:19:30,311 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-18 16:19:30,315 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-18 16:19:30,316 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-18 16:19:30,316 INFO L275 PluginConnector]: CDTParser initialized [2019-12-18 16:19:30,317 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix010_power.oepc.i [2019-12-18 16:19:30,376 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8b7e5019b/3ec7e190553740cfb03c0c7fb61534fd/FLAG6bbcaf3d8 [2019-12-18 16:19:30,896 INFO L306 CDTParser]: Found 1 translation units. [2019-12-18 16:19:30,899 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix010_power.oepc.i [2019-12-18 16:19:30,927 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8b7e5019b/3ec7e190553740cfb03c0c7fb61534fd/FLAG6bbcaf3d8 [2019-12-18 16:19:31,202 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8b7e5019b/3ec7e190553740cfb03c0c7fb61534fd [2019-12-18 16:19:31,214 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-18 16:19:31,217 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-18 16:19:31,220 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-18 16:19:31,221 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-18 16:19:31,224 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-18 16:19:31,225 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 04:19:31" (1/1) ... [2019-12-18 16:19:31,228 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@75cc43a4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 04:19:31, skipping insertion in model container [2019-12-18 16:19:31,228 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 04:19:31" (1/1) ... [2019-12-18 16:19:31,237 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-18 16:19:31,305 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-18 16:19:31,783 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 16:19:31,798 INFO L203 MainTranslator]: Completed pre-run [2019-12-18 16:19:31,894 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 16:19:31,974 INFO L208 MainTranslator]: Completed translation [2019-12-18 16:19:31,974 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 04:19:31 WrapperNode [2019-12-18 16:19:31,974 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-18 16:19:31,975 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-18 16:19:31,975 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-18 16:19:31,975 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-18 16:19:31,984 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 04:19:31" (1/1) ... [2019-12-18 16:19:32,005 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 04:19:31" (1/1) ... [2019-12-18 16:19:32,035 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-18 16:19:32,035 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-18 16:19:32,035 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-18 16:19:32,036 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-18 16:19:32,045 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 04:19:31" (1/1) ... [2019-12-18 16:19:32,046 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 04:19:31" (1/1) ... [2019-12-18 16:19:32,055 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 04:19:31" (1/1) ... [2019-12-18 16:19:32,055 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 04:19:31" (1/1) ... [2019-12-18 16:19:32,076 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 04:19:31" (1/1) ... [2019-12-18 16:19:32,081 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 04:19:31" (1/1) ... [2019-12-18 16:19:32,085 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 04:19:31" (1/1) ... [2019-12-18 16:19:32,090 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-18 16:19:32,090 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-18 16:19:32,091 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-18 16:19:32,091 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-18 16:19:32,092 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 04:19: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 16:19:32,158 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-18 16:19:32,158 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-18 16:19:32,158 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-18 16:19:32,158 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-18 16:19:32,158 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-18 16:19:32,159 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-18 16:19:32,159 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-18 16:19:32,159 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-18 16:19:32,159 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-18 16:19:32,159 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-18 16:19:32,160 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-18 16:19:32,160 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-18 16:19:32,160 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-18 16:19:32,162 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-18 16:19:32,937 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-18 16:19:32,937 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-18 16:19:32,938 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 04:19:32 BoogieIcfgContainer [2019-12-18 16:19:32,938 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-18 16:19:32,940 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-18 16:19:32,941 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-18 16:19:32,944 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-18 16:19:32,945 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 04:19:31" (1/3) ... [2019-12-18 16:19:32,946 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1da1bf37 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 04:19:32, skipping insertion in model container [2019-12-18 16:19:32,948 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 04:19:31" (2/3) ... [2019-12-18 16:19:32,949 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1da1bf37 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 04:19:32, skipping insertion in model container [2019-12-18 16:19:32,949 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 04:19:32" (3/3) ... [2019-12-18 16:19:32,951 INFO L109 eAbstractionObserver]: Analyzing ICFG mix010_power.oepc.i [2019-12-18 16:19:32,959 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-18 16:19:32,960 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-18 16:19:32,966 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-18 16:19:32,967 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-18 16:19:33,016 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:19:33,017 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:19:33,017 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:19:33,017 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:19:33,017 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:19:33,018 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:19:33,018 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:19:33,018 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:19:33,019 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:19:33,019 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:19:33,019 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:19:33,019 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:19:33,020 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:19:33,020 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:19:33,020 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:19:33,021 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:19:33,021 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:19:33,021 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:19:33,021 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:19:33,021 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:19:33,022 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:19:33,022 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:19:33,022 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:19:33,023 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:19:33,023 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:19:33,023 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:19:33,023 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:19:33,024 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:19:33,024 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:19:33,024 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:19:33,025 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:19:33,025 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:19:33,025 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:19:33,025 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:19:33,026 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:19:33,026 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:19:33,026 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:19:33,027 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:19:33,027 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:19:33,027 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:19:33,027 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:19:33,028 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:19:33,028 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:19:33,028 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:19:33,029 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:19:33,029 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:19:33,029 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:19:33,029 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:19:33,030 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:19:33,030 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:19:33,030 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:19:33,030 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:19:33,031 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:19:33,031 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:19:33,031 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:19:33,031 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:19:33,032 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:19:33,032 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:19:33,032 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:19:33,032 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:19:33,033 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:19:33,033 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:19:33,033 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:19:33,033 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:19:33,035 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:19:33,035 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:19:33,035 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:19:33,035 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:19:33,035 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:19:33,036 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:19:33,036 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:19:33,036 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:19:33,036 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:19:33,053 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:19:33,053 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:19:33,053 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:19:33,054 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:19:33,054 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:19:33,054 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:19:33,054 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:19:33,055 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:19:33,055 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:19:33,055 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:19:33,055 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:19:33,055 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:19:33,055 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:19:33,056 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:19:33,056 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:19:33,056 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:19:33,056 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:19:33,057 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:19:33,057 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:19:33,057 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:19:33,057 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:19:33,058 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:19:33,058 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:19:33,058 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:19:33,058 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:19:33,058 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:19:33,059 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:19:33,059 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:19:33,059 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:19:33,059 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:19:33,059 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:19:33,060 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:19:33,060 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:19:33,060 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:19:33,060 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:19:33,061 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:19:33,061 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:19:33,061 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:19:33,061 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:19:33,061 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:19:33,062 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:19:33,062 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:19:33,062 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:19:33,062 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:19:33,062 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:19:33,063 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:19:33,063 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:19:33,063 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:19:33,063 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:19:33,063 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:19:33,064 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:19:33,064 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:19:33,064 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:19:33,064 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:19:33,065 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:19:33,065 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:19:33,065 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:19:33,065 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:19:33,065 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:19:33,066 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:19:33,066 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:19:33,066 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:19:33,066 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:19:33,066 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:19:33,067 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:19:33,067 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:19:33,067 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:19:33,067 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:19:33,067 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:19:33,068 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:19:33,068 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:19:33,068 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:19:33,068 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:19:33,068 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:19:33,069 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:19:33,069 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:19:33,069 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:19:33,069 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:19:33,070 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:19:33,070 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:19:33,070 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:19:33,070 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:19:33,070 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:19:33,071 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:19:33,071 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:19:33,071 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:19:33,071 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:19:33,071 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:19:33,072 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:19:33,072 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:19:33,072 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:19:33,072 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:19:33,072 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:19:33,073 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:19:33,073 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:19:33,073 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:19:33,073 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:19:33,073 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:19:33,074 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:19:33,074 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:19:33,074 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:19:33,074 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:19:33,074 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:19:33,075 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:19:33,075 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:19:33,075 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:19:33,075 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:19:33,075 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:19:33,076 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:19:33,079 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:19:33,080 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:19:33,080 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:19:33,080 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:19:33,080 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:19:33,080 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:19:33,081 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:19:33,081 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:19:33,081 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:19:33,081 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:19:33,081 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:19:33,082 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:19:33,082 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:19:33,082 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:19:33,082 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:19:33,082 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:19:33,083 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:19:33,083 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:19:33,083 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:19:33,083 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:19:33,083 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:19:33,083 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:19:33,084 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:19:33,084 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:19:33,084 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:19:33,084 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:19:33,084 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:19:33,085 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:19:33,085 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:19:33,085 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:19:33,085 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:19:33,085 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:19:33,086 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:19:33,089 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:19:33,090 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:19:33,090 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:19:33,090 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:19:33,090 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:19:33,090 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:19:33,091 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:19:33,091 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:19:33,091 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:19:33,091 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:19:33,092 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:19:33,092 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:19:33,097 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:19:33,098 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:19:33,098 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:19:33,098 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:19:33,098 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:19:33,098 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:19:33,098 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:19:33,099 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:19:33,099 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:19:33,099 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:19:33,116 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-18 16:19:33,136 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-18 16:19:33,137 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-18 16:19:33,137 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-18 16:19:33,137 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-18 16:19:33,137 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-18 16:19:33,137 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-18 16:19:33,137 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-18 16:19:33,137 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-18 16:19:33,154 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 179 places, 216 transitions [2019-12-18 16:19:33,156 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 179 places, 216 transitions [2019-12-18 16:19:33,277 INFO L126 PetriNetUnfolder]: 47/213 cut-off events. [2019-12-18 16:19:33,277 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 16:19:33,302 INFO L76 FinitePrefix]: Finished finitePrefix Result has 223 conditions, 213 events. 47/213 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 431 event pairs. 9/173 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-18 16:19:33,329 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 179 places, 216 transitions [2019-12-18 16:19:33,392 INFO L126 PetriNetUnfolder]: 47/213 cut-off events. [2019-12-18 16:19:33,392 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 16:19:33,403 INFO L76 FinitePrefix]: Finished finitePrefix Result has 223 conditions, 213 events. 47/213 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 431 event pairs. 9/173 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-18 16:19:33,429 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 19004 [2019-12-18 16:19:33,431 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-18 16:19:37,482 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 25 [2019-12-18 16:19:38,326 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 75 [2019-12-18 16:19:38,745 WARN L192 SmtUtils]: Spent 301.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 95 [2019-12-18 16:19:38,882 WARN L192 SmtUtils]: Spent 133.00 ms on a formula simplification that was a NOOP. DAG size: 93 [2019-12-18 16:19:38,916 INFO L206 etLargeBlockEncoding]: Checked pairs total: 91218 [2019-12-18 16:19:38,916 INFO L214 etLargeBlockEncoding]: Total number of compositions: 116 [2019-12-18 16:19:38,920 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 95 places, 105 transitions [2019-12-18 16:20:00,266 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 126452 states. [2019-12-18 16:20:00,268 INFO L276 IsEmpty]: Start isEmpty. Operand 126452 states. [2019-12-18 16:20:00,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-18 16:20:00,273 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:20:00,274 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-18 16:20:00,274 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:20:00,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:20:00,278 INFO L82 PathProgramCache]: Analyzing trace with hash 921826, now seen corresponding path program 1 times [2019-12-18 16:20:00,285 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:20:00,285 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [283912486] [2019-12-18 16:20:00,286 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:20:00,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:20:00,491 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 16:20:00,492 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [283912486] [2019-12-18 16:20:00,493 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:20:00,493 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 16:20:00,494 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [12905633] [2019-12-18 16:20:00,499 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 16:20:00,499 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:20:00,517 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 16:20:00,519 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 16:20:00,522 INFO L87 Difference]: Start difference. First operand 126452 states. Second operand 3 states. [2019-12-18 16:20:04,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:20:04,814 INFO L93 Difference]: Finished difference Result 125226 states and 534182 transitions. [2019-12-18 16:20:04,814 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 16:20:04,815 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-18 16:20:04,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:20:05,498 INFO L225 Difference]: With dead ends: 125226 [2019-12-18 16:20:05,498 INFO L226 Difference]: Without dead ends: 117946 [2019-12-18 16:20:05,500 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 16:20:11,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117946 states. [2019-12-18 16:20:14,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117946 to 117946. [2019-12-18 16:20:14,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117946 states. [2019-12-18 16:20:19,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117946 states to 117946 states and 502500 transitions. [2019-12-18 16:20:19,276 INFO L78 Accepts]: Start accepts. Automaton has 117946 states and 502500 transitions. Word has length 3 [2019-12-18 16:20:19,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:20:19,276 INFO L462 AbstractCegarLoop]: Abstraction has 117946 states and 502500 transitions. [2019-12-18 16:20:19,277 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 16:20:19,277 INFO L276 IsEmpty]: Start isEmpty. Operand 117946 states and 502500 transitions. [2019-12-18 16:20:19,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-18 16:20:19,281 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:20:19,281 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 16:20:19,282 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:20:19,282 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:20:19,282 INFO L82 PathProgramCache]: Analyzing trace with hash -2034548154, now seen corresponding path program 1 times [2019-12-18 16:20:19,283 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:20:19,283 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [571334368] [2019-12-18 16:20:19,283 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:20:19,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:20:19,377 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 16:20:19,378 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [571334368] [2019-12-18 16:20:19,378 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:20:19,378 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 16:20:19,379 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2057494344] [2019-12-18 16:20:19,380 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 16:20:19,380 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:20:19,381 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 16:20:19,381 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 16:20:19,381 INFO L87 Difference]: Start difference. First operand 117946 states and 502500 transitions. Second operand 4 states. [2019-12-18 16:20:20,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:20:20,577 INFO L93 Difference]: Finished difference Result 183040 states and 750092 transitions. [2019-12-18 16:20:20,577 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 16:20:20,578 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-18 16:20:20,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:20:26,934 INFO L225 Difference]: With dead ends: 183040 [2019-12-18 16:20:26,935 INFO L226 Difference]: Without dead ends: 182991 [2019-12-18 16:20:26,936 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 16:20:32,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182991 states. [2019-12-18 16:20:35,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182991 to 168271. [2019-12-18 16:20:35,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168271 states. [2019-12-18 16:20:43,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168271 states to 168271 states and 697811 transitions. [2019-12-18 16:20:43,928 INFO L78 Accepts]: Start accepts. Automaton has 168271 states and 697811 transitions. Word has length 11 [2019-12-18 16:20:43,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:20:43,929 INFO L462 AbstractCegarLoop]: Abstraction has 168271 states and 697811 transitions. [2019-12-18 16:20:43,929 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 16:20:43,929 INFO L276 IsEmpty]: Start isEmpty. Operand 168271 states and 697811 transitions. [2019-12-18 16:20:43,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-18 16:20:43,935 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:20:43,935 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 16:20:43,935 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:20:43,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:20:43,936 INFO L82 PathProgramCache]: Analyzing trace with hash -579003435, now seen corresponding path program 1 times [2019-12-18 16:20:43,936 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:20:43,936 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1603903379] [2019-12-18 16:20:43,936 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:20:43,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:20:44,000 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 16:20:44,000 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1603903379] [2019-12-18 16:20:44,001 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:20:44,001 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 16:20:44,001 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [209564518] [2019-12-18 16:20:44,001 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 16:20:44,001 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:20:44,002 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 16:20:44,002 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 16:20:44,002 INFO L87 Difference]: Start difference. First operand 168271 states and 697811 transitions. Second operand 3 states. [2019-12-18 16:20:44,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:20:44,176 INFO L93 Difference]: Finished difference Result 35531 states and 115505 transitions. [2019-12-18 16:20:44,177 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 16:20:44,177 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-18 16:20:44,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:20:44,266 INFO L225 Difference]: With dead ends: 35531 [2019-12-18 16:20:44,266 INFO L226 Difference]: Without dead ends: 35531 [2019-12-18 16:20:44,267 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 16:20:44,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35531 states. [2019-12-18 16:20:44,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35531 to 35531. [2019-12-18 16:20:44,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35531 states. [2019-12-18 16:20:44,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35531 states to 35531 states and 115505 transitions. [2019-12-18 16:20:44,959 INFO L78 Accepts]: Start accepts. Automaton has 35531 states and 115505 transitions. Word has length 13 [2019-12-18 16:20:44,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:20:44,959 INFO L462 AbstractCegarLoop]: Abstraction has 35531 states and 115505 transitions. [2019-12-18 16:20:44,960 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 16:20:44,960 INFO L276 IsEmpty]: Start isEmpty. Operand 35531 states and 115505 transitions. [2019-12-18 16:20:44,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-18 16:20:44,963 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:20:44,963 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 16:20:44,963 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:20:44,963 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:20:44,964 INFO L82 PathProgramCache]: Analyzing trace with hash -1458626840, now seen corresponding path program 1 times [2019-12-18 16:20:44,964 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:20:44,964 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [284587842] [2019-12-18 16:20:44,964 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:20:44,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:20:45,098 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 16:20:45,099 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [284587842] [2019-12-18 16:20:45,099 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:20:45,099 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 16:20:45,099 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [492944684] [2019-12-18 16:20:45,100 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 16:20:45,100 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:20:45,100 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 16:20:45,102 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-18 16:20:45,102 INFO L87 Difference]: Start difference. First operand 35531 states and 115505 transitions. Second operand 5 states. [2019-12-18 16:20:45,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:20:45,689 INFO L93 Difference]: Finished difference Result 49606 states and 159424 transitions. [2019-12-18 16:20:45,690 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 16:20:45,690 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2019-12-18 16:20:45,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:20:45,796 INFO L225 Difference]: With dead ends: 49606 [2019-12-18 16:20:45,796 INFO L226 Difference]: Without dead ends: 49606 [2019-12-18 16:20:45,797 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 16:20:46,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49606 states. [2019-12-18 16:20:47,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49606 to 42335. [2019-12-18 16:20:47,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42335 states. [2019-12-18 16:20:47,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42335 states to 42335 states and 137188 transitions. [2019-12-18 16:20:47,657 INFO L78 Accepts]: Start accepts. Automaton has 42335 states and 137188 transitions. Word has length 16 [2019-12-18 16:20:47,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:20:47,658 INFO L462 AbstractCegarLoop]: Abstraction has 42335 states and 137188 transitions. [2019-12-18 16:20:47,658 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 16:20:47,658 INFO L276 IsEmpty]: Start isEmpty. Operand 42335 states and 137188 transitions. [2019-12-18 16:20:47,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-18 16:20:47,670 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:20:47,670 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 16:20:47,670 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:20:47,670 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:20:47,670 INFO L82 PathProgramCache]: Analyzing trace with hash -311730194, now seen corresponding path program 1 times [2019-12-18 16:20:47,671 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:20:47,671 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [237628499] [2019-12-18 16:20:47,671 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:20:47,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:20:47,824 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 16:20:47,825 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [237628499] [2019-12-18 16:20:47,825 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:20:47,825 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 16:20:47,825 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [980244420] [2019-12-18 16:20:47,826 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 16:20:47,826 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:20:47,826 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 16:20:47,827 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-12-18 16:20:47,827 INFO L87 Difference]: Start difference. First operand 42335 states and 137188 transitions. Second operand 7 states. [2019-12-18 16:20:48,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:20:48,818 INFO L93 Difference]: Finished difference Result 68217 states and 214442 transitions. [2019-12-18 16:20:48,818 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-18 16:20:48,818 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 22 [2019-12-18 16:20:48,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:20:48,967 INFO L225 Difference]: With dead ends: 68217 [2019-12-18 16:20:48,967 INFO L226 Difference]: Without dead ends: 68203 [2019-12-18 16:20:48,968 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=144, Unknown=0, NotChecked=0, Total=210 [2019-12-18 16:20:49,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68203 states. [2019-12-18 16:20:50,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68203 to 42009. [2019-12-18 16:20:50,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42009 states. [2019-12-18 16:20:50,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42009 states to 42009 states and 135594 transitions. [2019-12-18 16:20:50,497 INFO L78 Accepts]: Start accepts. Automaton has 42009 states and 135594 transitions. Word has length 22 [2019-12-18 16:20:50,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:20:50,497 INFO L462 AbstractCegarLoop]: Abstraction has 42009 states and 135594 transitions. [2019-12-18 16:20:50,497 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 16:20:50,497 INFO L276 IsEmpty]: Start isEmpty. Operand 42009 states and 135594 transitions. [2019-12-18 16:20:50,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 16:20:50,514 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:20:50,514 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 16:20:50,514 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:20:50,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:20:50,515 INFO L82 PathProgramCache]: Analyzing trace with hash 573582081, now seen corresponding path program 1 times [2019-12-18 16:20:50,515 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:20:50,515 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2032355507] [2019-12-18 16:20:50,515 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:20:50,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:20:50,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 16:20:50,584 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2032355507] [2019-12-18 16:20:50,585 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:20:50,585 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 16:20:50,585 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1377644958] [2019-12-18 16:20:50,586 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 16:20:50,586 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:20:50,586 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 16:20:50,586 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 16:20:50,586 INFO L87 Difference]: Start difference. First operand 42009 states and 135594 transitions. Second operand 4 states. [2019-12-18 16:20:50,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:20:50,675 INFO L93 Difference]: Finished difference Result 16636 states and 50803 transitions. [2019-12-18 16:20:50,675 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 16:20:50,676 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2019-12-18 16:20:50,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:20:50,705 INFO L225 Difference]: With dead ends: 16636 [2019-12-18 16:20:50,705 INFO L226 Difference]: Without dead ends: 16636 [2019-12-18 16:20:50,705 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 16:20:50,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16636 states. [2019-12-18 16:20:50,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16636 to 16378. [2019-12-18 16:20:50,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16378 states. [2019-12-18 16:20:50,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16378 states to 16378 states and 50067 transitions. [2019-12-18 16:20:50,947 INFO L78 Accepts]: Start accepts. Automaton has 16378 states and 50067 transitions. Word has length 25 [2019-12-18 16:20:50,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:20:50,948 INFO L462 AbstractCegarLoop]: Abstraction has 16378 states and 50067 transitions. [2019-12-18 16:20:50,948 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 16:20:50,948 INFO L276 IsEmpty]: Start isEmpty. Operand 16378 states and 50067 transitions. [2019-12-18 16:20:50,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-18 16:20:50,963 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:20:50,963 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 16:20:50,963 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:20:50,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:20:50,964 INFO L82 PathProgramCache]: Analyzing trace with hash 574668024, now seen corresponding path program 1 times [2019-12-18 16:20:50,964 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:20:50,964 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1860122682] [2019-12-18 16:20:50,965 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:20:50,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:20:51,067 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 16:20:51,068 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1860122682] [2019-12-18 16:20:51,068 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:20:51,068 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 16:20:51,068 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1994072774] [2019-12-18 16:20:51,069 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 16:20:51,069 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:20:51,069 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 16:20:51,069 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-18 16:20:51,070 INFO L87 Difference]: Start difference. First operand 16378 states and 50067 transitions. Second operand 6 states. [2019-12-18 16:20:51,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:20:51,607 INFO L93 Difference]: Finished difference Result 23754 states and 70239 transitions. [2019-12-18 16:20:51,607 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-18 16:20:51,607 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2019-12-18 16:20:51,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:20:51,651 INFO L225 Difference]: With dead ends: 23754 [2019-12-18 16:20:51,651 INFO L226 Difference]: Without dead ends: 23754 [2019-12-18 16:20:51,651 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-12-18 16:20:51,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23754 states. [2019-12-18 16:20:52,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23754 to 19127. [2019-12-18 16:20:52,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19127 states. [2019-12-18 16:20:52,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19127 states to 19127 states and 57723 transitions. [2019-12-18 16:20:52,126 INFO L78 Accepts]: Start accepts. Automaton has 19127 states and 57723 transitions. Word has length 27 [2019-12-18 16:20:52,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:20:52,127 INFO L462 AbstractCegarLoop]: Abstraction has 19127 states and 57723 transitions. [2019-12-18 16:20:52,127 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 16:20:52,127 INFO L276 IsEmpty]: Start isEmpty. Operand 19127 states and 57723 transitions. [2019-12-18 16:20:52,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-18 16:20:52,165 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:20:52,165 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 16:20:52,165 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:20:52,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:20:52,166 INFO L82 PathProgramCache]: Analyzing trace with hash -1393723506, now seen corresponding path program 1 times [2019-12-18 16:20:52,166 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:20:52,166 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1725606780] [2019-12-18 16:20:52,166 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:20:52,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:20:52,271 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 16:20:52,272 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1725606780] [2019-12-18 16:20:52,272 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:20:52,272 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 16:20:52,272 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [145701074] [2019-12-18 16:20:52,273 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 16:20:52,273 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:20:52,273 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 16:20:52,274 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 16:20:52,274 INFO L87 Difference]: Start difference. First operand 19127 states and 57723 transitions. Second operand 5 states. [2019-12-18 16:20:52,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:20:52,736 INFO L93 Difference]: Finished difference Result 23902 states and 71215 transitions. [2019-12-18 16:20:52,736 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 16:20:52,736 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 33 [2019-12-18 16:20:52,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:20:52,775 INFO L225 Difference]: With dead ends: 23902 [2019-12-18 16:20:52,775 INFO L226 Difference]: Without dead ends: 23902 [2019-12-18 16:20:52,775 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 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 16:20:52,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23902 states. [2019-12-18 16:20:53,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23902 to 20179. [2019-12-18 16:20:53,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20179 states. [2019-12-18 16:20:53,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20179 states to 20179 states and 61180 transitions. [2019-12-18 16:20:53,577 INFO L78 Accepts]: Start accepts. Automaton has 20179 states and 61180 transitions. Word has length 33 [2019-12-18 16:20:53,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:20:53,577 INFO L462 AbstractCegarLoop]: Abstraction has 20179 states and 61180 transitions. [2019-12-18 16:20:53,577 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 16:20:53,577 INFO L276 IsEmpty]: Start isEmpty. Operand 20179 states and 61180 transitions. [2019-12-18 16:20:53,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-18 16:20:53,600 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:20:53,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] [2019-12-18 16:20:53,600 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:20:53,601 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:20:53,601 INFO L82 PathProgramCache]: Analyzing trace with hash 305072172, now seen corresponding path program 2 times [2019-12-18 16:20:53,601 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:20:53,601 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1427728469] [2019-12-18 16:20:53,602 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:20:53,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:20:53,707 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 16:20:53,708 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1427728469] [2019-12-18 16:20:53,708 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:20:53,708 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 16:20:53,708 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1762630621] [2019-12-18 16:20:53,711 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-18 16:20:53,711 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:20:53,712 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-18 16:20:53,712 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-12-18 16:20:53,712 INFO L87 Difference]: Start difference. First operand 20179 states and 61180 transitions. Second operand 8 states. [2019-12-18 16:20:55,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:20:55,053 INFO L93 Difference]: Finished difference Result 27626 states and 80996 transitions. [2019-12-18 16:20:55,054 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-12-18 16:20:55,054 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 33 [2019-12-18 16:20:55,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:20:55,095 INFO L225 Difference]: With dead ends: 27626 [2019-12-18 16:20:55,096 INFO L226 Difference]: Without dead ends: 27626 [2019-12-18 16:20:55,096 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=110, Invalid=352, Unknown=0, NotChecked=0, Total=462 [2019-12-18 16:20:55,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27626 states. [2019-12-18 16:20:55,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27626 to 17400. [2019-12-18 16:20:55,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17400 states. [2019-12-18 16:20:55,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17400 states to 17400 states and 52480 transitions. [2019-12-18 16:20:55,435 INFO L78 Accepts]: Start accepts. Automaton has 17400 states and 52480 transitions. Word has length 33 [2019-12-18 16:20:55,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:20:55,435 INFO L462 AbstractCegarLoop]: Abstraction has 17400 states and 52480 transitions. [2019-12-18 16:20:55,435 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-18 16:20:55,435 INFO L276 IsEmpty]: Start isEmpty. Operand 17400 states and 52480 transitions. [2019-12-18 16:20:55,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-18 16:20:55,456 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:20:55,456 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 16:20:55,457 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:20:55,457 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:20:55,457 INFO L82 PathProgramCache]: Analyzing trace with hash -1779229683, now seen corresponding path program 1 times [2019-12-18 16:20:55,457 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:20:55,457 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1727318434] [2019-12-18 16:20:55,457 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:20:55,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:20:55,538 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 16:20:55,538 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1727318434] [2019-12-18 16:20:55,538 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:20:55,539 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 16:20:55,539 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1302602995] [2019-12-18 16:20:55,539 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 16:20:55,539 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:20:55,539 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 16:20:55,540 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 16:20:55,541 INFO L87 Difference]: Start difference. First operand 17400 states and 52480 transitions. Second operand 3 states. [2019-12-18 16:20:55,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:20:55,596 INFO L93 Difference]: Finished difference Result 17399 states and 52478 transitions. [2019-12-18 16:20:55,596 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 16:20:55,596 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2019-12-18 16:20:55,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:20:55,620 INFO L225 Difference]: With dead ends: 17399 [2019-12-18 16:20:55,620 INFO L226 Difference]: Without dead ends: 17399 [2019-12-18 16:20:55,620 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 16:20:55,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17399 states. [2019-12-18 16:20:55,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17399 to 17399. [2019-12-18 16:20:55,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17399 states. [2019-12-18 16:20:55,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17399 states to 17399 states and 52478 transitions. [2019-12-18 16:20:55,873 INFO L78 Accepts]: Start accepts. Automaton has 17399 states and 52478 transitions. Word has length 39 [2019-12-18 16:20:55,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:20:55,873 INFO L462 AbstractCegarLoop]: Abstraction has 17399 states and 52478 transitions. [2019-12-18 16:20:55,873 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 16:20:55,873 INFO L276 IsEmpty]: Start isEmpty. Operand 17399 states and 52478 transitions. [2019-12-18 16:20:55,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-18 16:20:55,891 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:20:55,892 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 16:20:55,892 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:20:55,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:20:55,892 INFO L82 PathProgramCache]: Analyzing trace with hash 1175786798, now seen corresponding path program 1 times [2019-12-18 16:20:55,892 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:20:55,892 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1545213950] [2019-12-18 16:20:55,893 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:20:55,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:20:55,990 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 16:20:55,990 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1545213950] [2019-12-18 16:20:55,990 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:20:55,990 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 16:20:55,991 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [609290726] [2019-12-18 16:20:55,992 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 16:20:55,992 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:20:55,992 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 16:20:55,992 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-18 16:20:55,992 INFO L87 Difference]: Start difference. First operand 17399 states and 52478 transitions. Second operand 6 states. [2019-12-18 16:20:56,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:20:56,951 INFO L93 Difference]: Finished difference Result 34243 states and 103303 transitions. [2019-12-18 16:20:56,952 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-18 16:20:56,952 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 40 [2019-12-18 16:20:56,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:20:57,001 INFO L225 Difference]: With dead ends: 34243 [2019-12-18 16:20:57,001 INFO L226 Difference]: Without dead ends: 34243 [2019-12-18 16:20:57,002 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-12-18 16:20:57,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34243 states. [2019-12-18 16:20:57,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34243 to 22015. [2019-12-18 16:20:57,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22015 states. [2019-12-18 16:20:57,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22015 states to 22015 states and 66470 transitions. [2019-12-18 16:20:57,844 INFO L78 Accepts]: Start accepts. Automaton has 22015 states and 66470 transitions. Word has length 40 [2019-12-18 16:20:57,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:20:57,844 INFO L462 AbstractCegarLoop]: Abstraction has 22015 states and 66470 transitions. [2019-12-18 16:20:57,844 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 16:20:57,844 INFO L276 IsEmpty]: Start isEmpty. Operand 22015 states and 66470 transitions. [2019-12-18 16:20:57,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-18 16:20:57,866 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:20:57,866 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 16:20:57,867 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:20:57,867 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:20:57,867 INFO L82 PathProgramCache]: Analyzing trace with hash -93454286, now seen corresponding path program 2 times [2019-12-18 16:20:57,867 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:20:57,868 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [63091036] [2019-12-18 16:20:57,868 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:20:57,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:20:57,951 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 16:20:57,951 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [63091036] [2019-12-18 16:20:57,951 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:20:57,951 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 16:20:57,952 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1747776148] [2019-12-18 16:20:57,952 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 16:20:57,952 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:20:57,952 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 16:20:57,953 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 16:20:57,953 INFO L87 Difference]: Start difference. First operand 22015 states and 66470 transitions. Second operand 5 states. [2019-12-18 16:20:58,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:20:58,528 INFO L93 Difference]: Finished difference Result 30046 states and 90242 transitions. [2019-12-18 16:20:58,528 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 16:20:58,528 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 40 [2019-12-18 16:20:58,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:20:58,570 INFO L225 Difference]: With dead ends: 30046 [2019-12-18 16:20:58,570 INFO L226 Difference]: Without dead ends: 30046 [2019-12-18 16:20:58,570 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-18 16:20:58,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30046 states. [2019-12-18 16:20:58,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30046 to 26807. [2019-12-18 16:20:58,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26807 states. [2019-12-18 16:20:58,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26807 states to 26807 states and 81221 transitions. [2019-12-18 16:20:58,977 INFO L78 Accepts]: Start accepts. Automaton has 26807 states and 81221 transitions. Word has length 40 [2019-12-18 16:20:58,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:20:58,977 INFO L462 AbstractCegarLoop]: Abstraction has 26807 states and 81221 transitions. [2019-12-18 16:20:58,977 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 16:20:58,977 INFO L276 IsEmpty]: Start isEmpty. Operand 26807 states and 81221 transitions. [2019-12-18 16:20:59,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-18 16:20:59,011 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:20:59,012 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 16:20:59,014 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:20:59,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:20:59,015 INFO L82 PathProgramCache]: Analyzing trace with hash 152430908, now seen corresponding path program 3 times [2019-12-18 16:20:59,015 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:20:59,015 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1951832778] [2019-12-18 16:20:59,016 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:20:59,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:20:59,086 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 16:20:59,086 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1951832778] [2019-12-18 16:20:59,086 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:20:59,087 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 16:20:59,087 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [737740751] [2019-12-18 16:20:59,087 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 16:20:59,087 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:20:59,088 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 16:20:59,088 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-18 16:20:59,088 INFO L87 Difference]: Start difference. First operand 26807 states and 81221 transitions. Second operand 5 states. [2019-12-18 16:20:59,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:20:59,178 INFO L93 Difference]: Finished difference Result 25470 states and 78136 transitions. [2019-12-18 16:20:59,178 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 16:20:59,178 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 40 [2019-12-18 16:20:59,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:20:59,216 INFO L225 Difference]: With dead ends: 25470 [2019-12-18 16:20:59,217 INFO L226 Difference]: Without dead ends: 25470 [2019-12-18 16:20:59,217 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-18 16:20:59,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25470 states. [2019-12-18 16:20:59,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25470 to 24504. [2019-12-18 16:20:59,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24504 states. [2019-12-18 16:20:59,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24504 states to 24504 states and 75530 transitions. [2019-12-18 16:20:59,591 INFO L78 Accepts]: Start accepts. Automaton has 24504 states and 75530 transitions. Word has length 40 [2019-12-18 16:20:59,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:20:59,591 INFO L462 AbstractCegarLoop]: Abstraction has 24504 states and 75530 transitions. [2019-12-18 16:20:59,591 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 16:20:59,591 INFO L276 IsEmpty]: Start isEmpty. Operand 24504 states and 75530 transitions. [2019-12-18 16:20:59,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-18 16:20:59,623 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:20:59,623 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 16:20:59,623 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:20:59,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:20:59,624 INFO L82 PathProgramCache]: Analyzing trace with hash 974609302, now seen corresponding path program 1 times [2019-12-18 16:20:59,624 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:20:59,624 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1557534377] [2019-12-18 16:20:59,624 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:20:59,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:20:59,708 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 16:20:59,709 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1557534377] [2019-12-18 16:20:59,709 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:20:59,709 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 16:20:59,709 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [830423672] [2019-12-18 16:20:59,709 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 16:20:59,710 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:20:59,710 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 16:20:59,710 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 16:20:59,710 INFO L87 Difference]: Start difference. First operand 24504 states and 75530 transitions. Second operand 3 states. [2019-12-18 16:21:00,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:21:00,395 INFO L93 Difference]: Finished difference Result 34625 states and 106821 transitions. [2019-12-18 16:21:00,395 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 16:21:00,396 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 64 [2019-12-18 16:21:00,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:21:00,448 INFO L225 Difference]: With dead ends: 34625 [2019-12-18 16:21:00,448 INFO L226 Difference]: Without dead ends: 34625 [2019-12-18 16:21:00,448 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 16:21:00,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34625 states. [2019-12-18 16:21:00,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34625 to 27128. [2019-12-18 16:21:00,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27128 states. [2019-12-18 16:21:00,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27128 states to 27128 states and 84304 transitions. [2019-12-18 16:21:00,917 INFO L78 Accepts]: Start accepts. Automaton has 27128 states and 84304 transitions. Word has length 64 [2019-12-18 16:21:00,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:21:00,918 INFO L462 AbstractCegarLoop]: Abstraction has 27128 states and 84304 transitions. [2019-12-18 16:21:00,918 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 16:21:00,918 INFO L276 IsEmpty]: Start isEmpty. Operand 27128 states and 84304 transitions. [2019-12-18 16:21:00,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-18 16:21:00,949 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:21:00,949 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 16:21:00,950 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:21:00,950 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:21:00,950 INFO L82 PathProgramCache]: Analyzing trace with hash -1487362447, now seen corresponding path program 1 times [2019-12-18 16:21:00,950 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:21:00,950 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1297716267] [2019-12-18 16:21:00,951 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:21:00,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:21:01,038 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 16:21:01,039 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1297716267] [2019-12-18 16:21:01,039 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:21:01,039 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 16:21:01,039 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1360884010] [2019-12-18 16:21:01,040 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 16:21:01,040 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:21:01,040 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 16:21:01,040 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-18 16:21:01,041 INFO L87 Difference]: Start difference. First operand 27128 states and 84304 transitions. Second operand 7 states. [2019-12-18 16:21:01,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:21:01,663 INFO L93 Difference]: Finished difference Result 73273 states and 226524 transitions. [2019-12-18 16:21:01,663 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 16:21:01,665 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 64 [2019-12-18 16:21:01,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:21:01,769 INFO L225 Difference]: With dead ends: 73273 [2019-12-18 16:21:01,769 INFO L226 Difference]: Without dead ends: 55201 [2019-12-18 16:21:01,769 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2019-12-18 16:21:01,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55201 states. [2019-12-18 16:21:02,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55201 to 31445. [2019-12-18 16:21:02,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31445 states. [2019-12-18 16:21:02,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31445 states to 31445 states and 97708 transitions. [2019-12-18 16:21:02,453 INFO L78 Accepts]: Start accepts. Automaton has 31445 states and 97708 transitions. Word has length 64 [2019-12-18 16:21:02,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:21:02,453 INFO L462 AbstractCegarLoop]: Abstraction has 31445 states and 97708 transitions. [2019-12-18 16:21:02,453 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 16:21:02,453 INFO L276 IsEmpty]: Start isEmpty. Operand 31445 states and 97708 transitions. [2019-12-18 16:21:02,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-18 16:21:02,486 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:21:02,487 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 16:21:02,487 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:21:02,487 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:21:02,487 INFO L82 PathProgramCache]: Analyzing trace with hash 1007546921, now seen corresponding path program 2 times [2019-12-18 16:21:02,487 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:21:02,487 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1489475887] [2019-12-18 16:21:02,487 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:21:02,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:21:02,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 16:21:02,584 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1489475887] [2019-12-18 16:21:02,584 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:21:02,584 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 16:21:02,585 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1802897996] [2019-12-18 16:21:02,585 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 16:21:02,585 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:21:02,585 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 16:21:02,586 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-18 16:21:02,586 INFO L87 Difference]: Start difference. First operand 31445 states and 97708 transitions. Second operand 7 states. [2019-12-18 16:21:03,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:21:03,607 INFO L93 Difference]: Finished difference Result 81140 states and 248111 transitions. [2019-12-18 16:21:03,607 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 16:21:03,608 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 64 [2019-12-18 16:21:03,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:21:03,693 INFO L225 Difference]: With dead ends: 81140 [2019-12-18 16:21:03,693 INFO L226 Difference]: Without dead ends: 57495 [2019-12-18 16:21:03,694 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2019-12-18 16:21:03,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57495 states. [2019-12-18 16:21:04,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57495 to 35246. [2019-12-18 16:21:04,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35246 states. [2019-12-18 16:21:04,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35246 states to 35246 states and 109148 transitions. [2019-12-18 16:21:04,425 INFO L78 Accepts]: Start accepts. Automaton has 35246 states and 109148 transitions. Word has length 64 [2019-12-18 16:21:04,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:21:04,425 INFO L462 AbstractCegarLoop]: Abstraction has 35246 states and 109148 transitions. [2019-12-18 16:21:04,425 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 16:21:04,425 INFO L276 IsEmpty]: Start isEmpty. Operand 35246 states and 109148 transitions. [2019-12-18 16:21:04,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-18 16:21:04,463 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:21:04,464 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 16:21:04,464 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:21:04,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:21:04,464 INFO L82 PathProgramCache]: Analyzing trace with hash 1228276157, now seen corresponding path program 3 times [2019-12-18 16:21:04,464 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:21:04,465 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [260252507] [2019-12-18 16:21:04,465 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:21:04,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:21:04,576 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 16:21:04,577 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [260252507] [2019-12-18 16:21:04,577 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:21:04,577 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 16:21:04,577 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [491000424] [2019-12-18 16:21:04,578 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-18 16:21:04,579 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:21:04,579 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-18 16:21:04,579 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-12-18 16:21:04,579 INFO L87 Difference]: Start difference. First operand 35246 states and 109148 transitions. Second operand 8 states. [2019-12-18 16:21:05,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:21:05,690 INFO L93 Difference]: Finished difference Result 98595 states and 302496 transitions. [2019-12-18 16:21:05,690 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-12-18 16:21:05,691 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 64 [2019-12-18 16:21:05,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:21:05,819 INFO L225 Difference]: With dead ends: 98595 [2019-12-18 16:21:05,819 INFO L226 Difference]: Without dead ends: 87943 [2019-12-18 16:21:05,820 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=119, Invalid=343, Unknown=0, NotChecked=0, Total=462 [2019-12-18 16:21:06,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87943 states. [2019-12-18 16:21:07,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87943 to 35744. [2019-12-18 16:21:07,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35744 states. [2019-12-18 16:21:07,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35744 states to 35744 states and 111048 transitions. [2019-12-18 16:21:07,368 INFO L78 Accepts]: Start accepts. Automaton has 35744 states and 111048 transitions. Word has length 64 [2019-12-18 16:21:07,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:21:07,369 INFO L462 AbstractCegarLoop]: Abstraction has 35744 states and 111048 transitions. [2019-12-18 16:21:07,369 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-18 16:21:07,369 INFO L276 IsEmpty]: Start isEmpty. Operand 35744 states and 111048 transitions. [2019-12-18 16:21:07,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-18 16:21:07,405 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:21:07,405 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 16:21:07,406 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:21:07,406 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:21:07,406 INFO L82 PathProgramCache]: Analyzing trace with hash -2056816817, now seen corresponding path program 4 times [2019-12-18 16:21:07,406 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:21:07,406 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1830166459] [2019-12-18 16:21:07,406 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:21:07,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:21:07,514 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 16:21:07,514 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1830166459] [2019-12-18 16:21:07,515 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:21:07,515 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 16:21:07,515 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2122987666] [2019-12-18 16:21:07,515 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 16:21:07,515 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:21:07,516 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 16:21:07,516 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-18 16:21:07,516 INFO L87 Difference]: Start difference. First operand 35744 states and 111048 transitions. Second operand 9 states. [2019-12-18 16:21:09,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:21:09,071 INFO L93 Difference]: Finished difference Result 119468 states and 363005 transitions. [2019-12-18 16:21:09,071 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-18 16:21:09,071 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 64 [2019-12-18 16:21:09,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:21:09,229 INFO L225 Difference]: With dead ends: 119468 [2019-12-18 16:21:09,229 INFO L226 Difference]: Without dead ends: 105156 [2019-12-18 16:21:09,230 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 223 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=227, Invalid=703, Unknown=0, NotChecked=0, Total=930 [2019-12-18 16:21:09,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105156 states. [2019-12-18 16:21:10,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105156 to 35780. [2019-12-18 16:21:10,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35780 states. [2019-12-18 16:21:10,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35780 states to 35780 states and 111205 transitions. [2019-12-18 16:21:10,967 INFO L78 Accepts]: Start accepts. Automaton has 35780 states and 111205 transitions. Word has length 64 [2019-12-18 16:21:10,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:21:10,968 INFO L462 AbstractCegarLoop]: Abstraction has 35780 states and 111205 transitions. [2019-12-18 16:21:10,968 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 16:21:10,968 INFO L276 IsEmpty]: Start isEmpty. Operand 35780 states and 111205 transitions. [2019-12-18 16:21:11,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-18 16:21:11,004 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:21:11,004 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 16:21:11,004 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:21:11,004 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:21:11,004 INFO L82 PathProgramCache]: Analyzing trace with hash 836129701, now seen corresponding path program 5 times [2019-12-18 16:21:11,004 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:21:11,004 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [563053839] [2019-12-18 16:21:11,005 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:21:11,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:21:11,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 16:21:11,114 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [563053839] [2019-12-18 16:21:11,114 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:21:11,114 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 16:21:11,114 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1588235320] [2019-12-18 16:21:11,116 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 16:21:11,116 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:21:11,116 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 16:21:11,116 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-18 16:21:11,116 INFO L87 Difference]: Start difference. First operand 35780 states and 111205 transitions. Second operand 9 states. [2019-12-18 16:21:12,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:21:12,611 INFO L93 Difference]: Finished difference Result 131669 states and 399951 transitions. [2019-12-18 16:21:12,611 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-12-18 16:21:12,611 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 64 [2019-12-18 16:21:12,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:21:13,532 INFO L225 Difference]: With dead ends: 131669 [2019-12-18 16:21:13,532 INFO L226 Difference]: Without dead ends: 121803 [2019-12-18 16:21:13,533 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 209 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=235, Invalid=635, Unknown=0, NotChecked=0, Total=870 [2019-12-18 16:21:13,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121803 states. [2019-12-18 16:21:14,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121803 to 35817. [2019-12-18 16:21:14,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35817 states. [2019-12-18 16:21:14,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35817 states to 35817 states and 111367 transitions. [2019-12-18 16:21:14,682 INFO L78 Accepts]: Start accepts. Automaton has 35817 states and 111367 transitions. Word has length 64 [2019-12-18 16:21:14,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:21:14,682 INFO L462 AbstractCegarLoop]: Abstraction has 35817 states and 111367 transitions. [2019-12-18 16:21:14,682 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 16:21:14,682 INFO L276 IsEmpty]: Start isEmpty. Operand 35817 states and 111367 transitions. [2019-12-18 16:21:14,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-18 16:21:14,722 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:21:14,722 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 16:21:14,723 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:21:14,723 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:21:14,723 INFO L82 PathProgramCache]: Analyzing trace with hash -17789391, now seen corresponding path program 6 times [2019-12-18 16:21:14,723 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:21:14,723 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [180432873] [2019-12-18 16:21:14,723 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:21:14,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:21:14,792 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 16:21:14,792 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [180432873] [2019-12-18 16:21:14,792 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:21:14,792 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 16:21:14,792 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1305746304] [2019-12-18 16:21:14,793 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 16:21:14,793 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:21:14,793 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 16:21:14,793 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 16:21:14,794 INFO L87 Difference]: Start difference. First operand 35817 states and 111367 transitions. Second operand 3 states. [2019-12-18 16:21:15,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:21:15,015 INFO L93 Difference]: Finished difference Result 42547 states and 131537 transitions. [2019-12-18 16:21:15,015 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 16:21:15,015 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 64 [2019-12-18 16:21:15,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:21:15,076 INFO L225 Difference]: With dead ends: 42547 [2019-12-18 16:21:15,076 INFO L226 Difference]: Without dead ends: 42547 [2019-12-18 16:21:15,076 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 16:21:15,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42547 states. [2019-12-18 16:21:16,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42547 to 37071. [2019-12-18 16:21:16,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37071 states. [2019-12-18 16:21:16,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37071 states to 37071 states and 115326 transitions. [2019-12-18 16:21:16,294 INFO L78 Accepts]: Start accepts. Automaton has 37071 states and 115326 transitions. Word has length 64 [2019-12-18 16:21:16,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:21:16,294 INFO L462 AbstractCegarLoop]: Abstraction has 37071 states and 115326 transitions. [2019-12-18 16:21:16,295 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 16:21:16,295 INFO L276 IsEmpty]: Start isEmpty. Operand 37071 states and 115326 transitions. [2019-12-18 16:21:16,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 16:21:16,339 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:21:16,339 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 16:21:16,339 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:21:16,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:21:16,339 INFO L82 PathProgramCache]: Analyzing trace with hash 1046831716, now seen corresponding path program 1 times [2019-12-18 16:21:16,340 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:21:16,340 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1877205687] [2019-12-18 16:21:16,340 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:21:16,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:21:16,440 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 16:21:16,441 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1877205687] [2019-12-18 16:21:16,441 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:21:16,441 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 16:21:16,441 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [323313733] [2019-12-18 16:21:16,442 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-18 16:21:16,442 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:21:16,442 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-18 16:21:16,443 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-12-18 16:21:16,443 INFO L87 Difference]: Start difference. First operand 37071 states and 115326 transitions. Second operand 8 states. [2019-12-18 16:21:17,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:21:17,661 INFO L93 Difference]: Finished difference Result 111740 states and 339408 transitions. [2019-12-18 16:21:17,661 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-12-18 16:21:17,662 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 65 [2019-12-18 16:21:17,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:21:17,811 INFO L225 Difference]: With dead ends: 111740 [2019-12-18 16:21:17,811 INFO L226 Difference]: Without dead ends: 99733 [2019-12-18 16:21:17,812 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=119, Invalid=343, Unknown=0, NotChecked=0, Total=462 [2019-12-18 16:21:18,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99733 states. [2019-12-18 16:21:19,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99733 to 37073. [2019-12-18 16:21:19,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37073 states. [2019-12-18 16:21:19,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37073 states to 37073 states and 115341 transitions. [2019-12-18 16:21:19,539 INFO L78 Accepts]: Start accepts. Automaton has 37073 states and 115341 transitions. Word has length 65 [2019-12-18 16:21:19,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:21:19,540 INFO L462 AbstractCegarLoop]: Abstraction has 37073 states and 115341 transitions. [2019-12-18 16:21:19,540 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-18 16:21:19,540 INFO L276 IsEmpty]: Start isEmpty. Operand 37073 states and 115341 transitions. [2019-12-18 16:21:19,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 16:21:19,582 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:21:19,582 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 16:21:19,582 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:21:19,582 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:21:19,583 INFO L82 PathProgramCache]: Analyzing trace with hash 501635668, now seen corresponding path program 2 times [2019-12-18 16:21:19,583 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:21:19,583 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1052673412] [2019-12-18 16:21:19,583 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:21:19,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:21:19,694 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 16:21:19,695 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1052673412] [2019-12-18 16:21:19,695 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:21:19,695 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 16:21:19,695 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [628617773] [2019-12-18 16:21:19,696 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 16:21:19,696 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:21:19,696 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 16:21:19,696 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-18 16:21:19,697 INFO L87 Difference]: Start difference. First operand 37073 states and 115341 transitions. Second operand 9 states. [2019-12-18 16:21:21,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:21:21,268 INFO L93 Difference]: Finished difference Result 134194 states and 407074 transitions. [2019-12-18 16:21:21,268 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-12-18 16:21:21,268 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 65 [2019-12-18 16:21:21,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:21:21,461 INFO L225 Difference]: With dead ends: 134194 [2019-12-18 16:21:21,461 INFO L226 Difference]: Without dead ends: 122325 [2019-12-18 16:21:21,462 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 183 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=205, Invalid=607, Unknown=0, NotChecked=0, Total=812 [2019-12-18 16:21:21,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122325 states. [2019-12-18 16:21:23,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122325 to 37029. [2019-12-18 16:21:23,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37029 states. [2019-12-18 16:21:23,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37029 states to 37029 states and 115116 transitions. [2019-12-18 16:21:23,406 INFO L78 Accepts]: Start accepts. Automaton has 37029 states and 115116 transitions. Word has length 65 [2019-12-18 16:21:23,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:21:23,407 INFO L462 AbstractCegarLoop]: Abstraction has 37029 states and 115116 transitions. [2019-12-18 16:21:23,407 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 16:21:23,407 INFO L276 IsEmpty]: Start isEmpty. Operand 37029 states and 115116 transitions. [2019-12-18 16:21:23,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 16:21:23,447 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:21:23,447 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 16:21:23,447 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:21:23,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:21:23,448 INFO L82 PathProgramCache]: Analyzing trace with hash 1293437306, now seen corresponding path program 3 times [2019-12-18 16:21:23,448 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:21:23,448 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2069750203] [2019-12-18 16:21:23,448 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:21:23,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:21:23,547 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 16:21:23,547 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2069750203] [2019-12-18 16:21:23,548 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:21:23,548 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 16:21:23,548 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1702371962] [2019-12-18 16:21:23,548 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 16:21:23,548 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:21:23,549 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 16:21:23,549 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-18 16:21:23,549 INFO L87 Difference]: Start difference. First operand 37029 states and 115116 transitions. Second operand 9 states. [2019-12-18 16:21:26,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:21:26,134 INFO L93 Difference]: Finished difference Result 153077 states and 465403 transitions. [2019-12-18 16:21:26,135 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-18 16:21:26,135 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 65 [2019-12-18 16:21:26,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:21:26,338 INFO L225 Difference]: With dead ends: 153077 [2019-12-18 16:21:26,338 INFO L226 Difference]: Without dead ends: 125434 [2019-12-18 16:21:26,339 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 214 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=261, Invalid=669, Unknown=0, NotChecked=0, Total=930 [2019-12-18 16:21:26,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125434 states. [2019-12-18 16:21:27,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125434 to 40153. [2019-12-18 16:21:27,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40153 states. [2019-12-18 16:21:27,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40153 states to 40153 states and 125039 transitions. [2019-12-18 16:21:27,602 INFO L78 Accepts]: Start accepts. Automaton has 40153 states and 125039 transitions. Word has length 65 [2019-12-18 16:21:27,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:21:27,603 INFO L462 AbstractCegarLoop]: Abstraction has 40153 states and 125039 transitions. [2019-12-18 16:21:27,603 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 16:21:27,603 INFO L276 IsEmpty]: Start isEmpty. Operand 40153 states and 125039 transitions. [2019-12-18 16:21:27,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 16:21:27,647 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:21:27,647 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 16:21:27,647 INFO L410 AbstractCegarLoop]: === Iteration 24 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:21:27,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:21:27,648 INFO L82 PathProgramCache]: Analyzing trace with hash 1980366454, now seen corresponding path program 4 times [2019-12-18 16:21:27,648 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:21:27,648 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1857546423] [2019-12-18 16:21:27,648 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:21:27,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:21:27,744 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 16:21:27,744 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1857546423] [2019-12-18 16:21:27,745 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:21:27,745 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 16:21:27,745 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1255934399] [2019-12-18 16:21:27,745 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 16:21:27,746 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:21:27,746 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 16:21:27,746 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-18 16:21:27,746 INFO L87 Difference]: Start difference. First operand 40153 states and 125039 transitions. Second operand 7 states. [2019-12-18 16:21:29,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:21:29,891 INFO L93 Difference]: Finished difference Result 55596 states and 169227 transitions. [2019-12-18 16:21:29,892 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-18 16:21:29,892 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 65 [2019-12-18 16:21:29,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:21:30,030 INFO L225 Difference]: With dead ends: 55596 [2019-12-18 16:21:30,030 INFO L226 Difference]: Without dead ends: 55596 [2019-12-18 16:21:30,030 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=158, Unknown=0, NotChecked=0, Total=210 [2019-12-18 16:21:30,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55596 states. [2019-12-18 16:21:30,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55596 to 42525. [2019-12-18 16:21:30,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42525 states. [2019-12-18 16:21:31,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42525 states to 42525 states and 131689 transitions. [2019-12-18 16:21:31,026 INFO L78 Accepts]: Start accepts. Automaton has 42525 states and 131689 transitions. Word has length 65 [2019-12-18 16:21:31,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:21:31,027 INFO L462 AbstractCegarLoop]: Abstraction has 42525 states and 131689 transitions. [2019-12-18 16:21:31,027 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 16:21:31,027 INFO L276 IsEmpty]: Start isEmpty. Operand 42525 states and 131689 transitions. [2019-12-18 16:21:31,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 16:21:31,074 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:21:31,075 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 16:21:31,075 INFO L410 AbstractCegarLoop]: === Iteration 25 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:21:31,075 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:21:31,075 INFO L82 PathProgramCache]: Analyzing trace with hash -25014344, now seen corresponding path program 5 times [2019-12-18 16:21:31,075 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:21:31,076 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1894789716] [2019-12-18 16:21:31,076 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:21:31,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:21:31,192 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 16:21:31,192 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1894789716] [2019-12-18 16:21:31,193 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:21:31,193 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-18 16:21:31,193 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1689660263] [2019-12-18 16:21:31,193 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 16:21:31,194 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:21:31,194 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 16:21:31,194 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-12-18 16:21:31,194 INFO L87 Difference]: Start difference. First operand 42525 states and 131689 transitions. Second operand 9 states. [2019-12-18 16:21:33,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:21:33,890 INFO L93 Difference]: Finished difference Result 66164 states and 202890 transitions. [2019-12-18 16:21:33,891 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-12-18 16:21:33,891 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 65 [2019-12-18 16:21:33,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:21:33,988 INFO L225 Difference]: With dead ends: 66164 [2019-12-18 16:21:33,988 INFO L226 Difference]: Without dead ends: 66164 [2019-12-18 16:21:33,989 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 15 SyntacticMatches, 2 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 143 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=138, Invalid=512, Unknown=0, NotChecked=0, Total=650 [2019-12-18 16:21:34,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66164 states. [2019-12-18 16:21:34,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66164 to 41944. [2019-12-18 16:21:34,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41944 states. [2019-12-18 16:21:34,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41944 states to 41944 states and 130085 transitions. [2019-12-18 16:21:34,828 INFO L78 Accepts]: Start accepts. Automaton has 41944 states and 130085 transitions. Word has length 65 [2019-12-18 16:21:34,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:21:34,828 INFO L462 AbstractCegarLoop]: Abstraction has 41944 states and 130085 transitions. [2019-12-18 16:21:34,828 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 16:21:34,828 INFO L276 IsEmpty]: Start isEmpty. Operand 41944 states and 130085 transitions. [2019-12-18 16:21:34,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 16:21:34,876 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:21:34,876 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 16:21:34,876 INFO L410 AbstractCegarLoop]: === Iteration 26 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:21:34,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:21:34,876 INFO L82 PathProgramCache]: Analyzing trace with hash 373916454, now seen corresponding path program 1 times [2019-12-18 16:21:34,876 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:21:34,877 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1983938083] [2019-12-18 16:21:34,877 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:21:34,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:21:35,011 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 16:21:35,012 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1983938083] [2019-12-18 16:21:35,012 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:21:35,012 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-18 16:21:35,012 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2119913705] [2019-12-18 16:21:35,013 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 16:21:35,013 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:21:35,014 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 16:21:35,014 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-12-18 16:21:35,014 INFO L87 Difference]: Start difference. First operand 41944 states and 130085 transitions. Second operand 9 states. [2019-12-18 16:21:36,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:21:36,626 INFO L93 Difference]: Finished difference Result 55795 states and 168786 transitions. [2019-12-18 16:21:36,627 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-12-18 16:21:36,627 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 65 [2019-12-18 16:21:36,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:21:36,717 INFO L225 Difference]: With dead ends: 55795 [2019-12-18 16:21:36,717 INFO L226 Difference]: Without dead ends: 55795 [2019-12-18 16:21:36,717 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=112, Invalid=440, Unknown=0, NotChecked=0, Total=552 [2019-12-18 16:21:37,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55795 states. [2019-12-18 16:21:37,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55795 to 43437. [2019-12-18 16:21:37,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43437 states. [2019-12-18 16:21:37,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43437 states to 43437 states and 134338 transitions. [2019-12-18 16:21:37,826 INFO L78 Accepts]: Start accepts. Automaton has 43437 states and 134338 transitions. Word has length 65 [2019-12-18 16:21:37,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:21:37,826 INFO L462 AbstractCegarLoop]: Abstraction has 43437 states and 134338 transitions. [2019-12-18 16:21:37,827 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 16:21:37,827 INFO L276 IsEmpty]: Start isEmpty. Operand 43437 states and 134338 transitions. [2019-12-18 16:21:37,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 16:21:37,871 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:21:37,871 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 16:21:37,871 INFO L410 AbstractCegarLoop]: === Iteration 27 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:21:37,871 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:21:37,872 INFO L82 PathProgramCache]: Analyzing trace with hash 1193547640, now seen corresponding path program 2 times [2019-12-18 16:21:37,872 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:21:37,872 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [617189622] [2019-12-18 16:21:37,872 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:21:37,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:21:38,067 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 16:21:38,068 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [617189622] [2019-12-18 16:21:38,068 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:21:38,068 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 16:21:38,068 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [648291853] [2019-12-18 16:21:38,068 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 16:21:38,069 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:21:38,069 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 16:21:38,069 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-12-18 16:21:38,069 INFO L87 Difference]: Start difference. First operand 43437 states and 134338 transitions. Second operand 9 states. [2019-12-18 16:21:39,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:21:39,443 INFO L93 Difference]: Finished difference Result 66620 states and 204092 transitions. [2019-12-18 16:21:39,443 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-18 16:21:39,444 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 65 [2019-12-18 16:21:39,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:21:39,550 INFO L225 Difference]: With dead ends: 66620 [2019-12-18 16:21:39,550 INFO L226 Difference]: Without dead ends: 66620 [2019-12-18 16:21:39,551 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 4 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2019-12-18 16:21:39,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66620 states. [2019-12-18 16:21:40,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66620 to 43912. [2019-12-18 16:21:40,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43912 states. [2019-12-18 16:21:40,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43912 states to 43912 states and 136009 transitions. [2019-12-18 16:21:40,748 INFO L78 Accepts]: Start accepts. Automaton has 43912 states and 136009 transitions. Word has length 65 [2019-12-18 16:21:40,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:21:40,748 INFO L462 AbstractCegarLoop]: Abstraction has 43912 states and 136009 transitions. [2019-12-18 16:21:40,749 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 16:21:40,749 INFO L276 IsEmpty]: Start isEmpty. Operand 43912 states and 136009 transitions. [2019-12-18 16:21:40,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 16:21:40,799 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:21:40,799 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 16:21:40,799 INFO L410 AbstractCegarLoop]: === Iteration 28 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:21:40,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:21:40,800 INFO L82 PathProgramCache]: Analyzing trace with hash 1646807062, now seen corresponding path program 3 times [2019-12-18 16:21:40,800 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:21:40,800 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1376843755] [2019-12-18 16:21:40,800 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:21:40,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:21:40,960 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 16:21:40,961 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1376843755] [2019-12-18 16:21:40,961 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:21:40,961 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-18 16:21:40,961 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [119661036] [2019-12-18 16:21:40,961 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-18 16:21:40,962 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:21:40,962 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-18 16:21:40,962 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2019-12-18 16:21:40,962 INFO L87 Difference]: Start difference. First operand 43912 states and 136009 transitions. Second operand 10 states. [2019-12-18 16:21:43,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:21:43,621 INFO L93 Difference]: Finished difference Result 68090 states and 207818 transitions. [2019-12-18 16:21:43,621 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-12-18 16:21:43,621 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 65 [2019-12-18 16:21:43,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:21:43,725 INFO L225 Difference]: With dead ends: 68090 [2019-12-18 16:21:43,725 INFO L226 Difference]: Without dead ends: 68090 [2019-12-18 16:21:43,725 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 25 SyntacticMatches, 2 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 379 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=224, Invalid=1182, Unknown=0, NotChecked=0, Total=1406 [2019-12-18 16:21:43,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68090 states. [2019-12-18 16:21:44,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68090 to 39586. [2019-12-18 16:21:44,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39586 states. [2019-12-18 16:21:44,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39586 states to 39586 states and 123177 transitions. [2019-12-18 16:21:44,833 INFO L78 Accepts]: Start accepts. Automaton has 39586 states and 123177 transitions. Word has length 65 [2019-12-18 16:21:44,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:21:44,833 INFO L462 AbstractCegarLoop]: Abstraction has 39586 states and 123177 transitions. [2019-12-18 16:21:44,833 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-18 16:21:44,833 INFO L276 IsEmpty]: Start isEmpty. Operand 39586 states and 123177 transitions. [2019-12-18 16:21:44,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 16:21:44,877 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:21:44,877 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 16:21:44,878 INFO L410 AbstractCegarLoop]: === Iteration 29 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:21:44,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:21:44,878 INFO L82 PathProgramCache]: Analyzing trace with hash 1534293356, now seen corresponding path program 6 times [2019-12-18 16:21:44,878 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:21:44,878 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1042109672] [2019-12-18 16:21:44,878 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:21:44,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:21:44,952 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 16:21:44,953 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1042109672] [2019-12-18 16:21:44,953 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:21:44,953 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 16:21:44,953 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2091576025] [2019-12-18 16:21:44,954 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 16:21:44,954 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:21:44,954 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 16:21:44,954 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 16:21:44,954 INFO L87 Difference]: Start difference. First operand 39586 states and 123177 transitions. Second operand 4 states. [2019-12-18 16:21:45,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:21:45,271 INFO L93 Difference]: Finished difference Result 39586 states and 122905 transitions. [2019-12-18 16:21:45,272 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 16:21:45,272 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 65 [2019-12-18 16:21:45,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:21:45,370 INFO L225 Difference]: With dead ends: 39586 [2019-12-18 16:21:45,370 INFO L226 Difference]: Without dead ends: 39586 [2019-12-18 16:21:45,372 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 16:21:45,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39586 states. [2019-12-18 16:21:45,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39586 to 37695. [2019-12-18 16:21:45,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37695 states. [2019-12-18 16:21:45,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37695 states to 37695 states and 117130 transitions. [2019-12-18 16:21:45,996 INFO L78 Accepts]: Start accepts. Automaton has 37695 states and 117130 transitions. Word has length 65 [2019-12-18 16:21:45,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:21:45,996 INFO L462 AbstractCegarLoop]: Abstraction has 37695 states and 117130 transitions. [2019-12-18 16:21:45,996 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 16:21:45,996 INFO L276 IsEmpty]: Start isEmpty. Operand 37695 states and 117130 transitions. [2019-12-18 16:21:46,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 16:21:46,036 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:21:46,036 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 16:21:46,036 INFO L410 AbstractCegarLoop]: === Iteration 30 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:21:46,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:21:46,037 INFO L82 PathProgramCache]: Analyzing trace with hash -1521961444, now seen corresponding path program 4 times [2019-12-18 16:21:46,037 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:21:46,037 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1500964257] [2019-12-18 16:21:46,037 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:21:46,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:21:46,087 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 16:21:46,088 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1500964257] [2019-12-18 16:21:46,088 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:21:46,088 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 16:21:46,088 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [982503117] [2019-12-18 16:21:46,089 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 16:21:46,089 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:21:46,089 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 16:21:46,089 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 16:21:46,089 INFO L87 Difference]: Start difference. First operand 37695 states and 117130 transitions. Second operand 3 states. [2019-12-18 16:21:46,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:21:46,296 INFO L93 Difference]: Finished difference Result 37694 states and 117128 transitions. [2019-12-18 16:21:46,296 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 16:21:46,296 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-18 16:21:46,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:21:46,635 INFO L225 Difference]: With dead ends: 37694 [2019-12-18 16:21:46,636 INFO L226 Difference]: Without dead ends: 37694 [2019-12-18 16:21:46,638 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 16:21:46,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37694 states. [2019-12-18 16:21:47,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37694 to 29303. [2019-12-18 16:21:47,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29303 states. [2019-12-18 16:21:47,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29303 states to 29303 states and 93686 transitions. [2019-12-18 16:21:47,361 INFO L78 Accepts]: Start accepts. Automaton has 29303 states and 93686 transitions. Word has length 65 [2019-12-18 16:21:47,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:21:47,361 INFO L462 AbstractCegarLoop]: Abstraction has 29303 states and 93686 transitions. [2019-12-18 16:21:47,361 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 16:21:47,361 INFO L276 IsEmpty]: Start isEmpty. Operand 29303 states and 93686 transitions. [2019-12-18 16:21:47,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 16:21:47,396 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:21:47,396 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 16:21:47,396 INFO L410 AbstractCegarLoop]: === Iteration 31 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:21:47,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:21:47,396 INFO L82 PathProgramCache]: Analyzing trace with hash 392067852, now seen corresponding path program 1 times [2019-12-18 16:21:47,396 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:21:47,396 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2027335018] [2019-12-18 16:21:47,397 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:21:47,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:21:47,454 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 16:21:47,454 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2027335018] [2019-12-18 16:21:47,454 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:21:47,454 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 16:21:47,455 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1718891853] [2019-12-18 16:21:47,455 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 16:21:47,455 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:21:47,455 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 16:21:47,456 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 16:21:47,456 INFO L87 Difference]: Start difference. First operand 29303 states and 93686 transitions. Second operand 3 states. [2019-12-18 16:21:47,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:21:47,576 INFO L93 Difference]: Finished difference Result 24020 states and 75388 transitions. [2019-12-18 16:21:47,577 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 16:21:47,577 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-12-18 16:21:47,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:21:47,635 INFO L225 Difference]: With dead ends: 24020 [2019-12-18 16:21:47,635 INFO L226 Difference]: Without dead ends: 24020 [2019-12-18 16:21:47,636 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 16:21:47,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24020 states. [2019-12-18 16:21:48,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24020 to 22094. [2019-12-18 16:21:48,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22094 states. [2019-12-18 16:21:48,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22094 states to 22094 states and 69094 transitions. [2019-12-18 16:21:48,154 INFO L78 Accepts]: Start accepts. Automaton has 22094 states and 69094 transitions. Word has length 66 [2019-12-18 16:21:48,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:21:48,154 INFO L462 AbstractCegarLoop]: Abstraction has 22094 states and 69094 transitions. [2019-12-18 16:21:48,154 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 16:21:48,154 INFO L276 IsEmpty]: Start isEmpty. Operand 22094 states and 69094 transitions. [2019-12-18 16:21:48,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 16:21:48,177 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:21:48,177 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 16:21:48,177 INFO L410 AbstractCegarLoop]: === Iteration 32 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:21:48,177 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:21:48,177 INFO L82 PathProgramCache]: Analyzing trace with hash 2062742571, now seen corresponding path program 1 times [2019-12-18 16:21:48,177 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:21:48,178 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [677966011] [2019-12-18 16:21:48,178 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:21:48,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:21:48,286 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 16:21:48,286 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [677966011] [2019-12-18 16:21:48,286 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:21:48,286 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 16:21:48,287 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [25797749] [2019-12-18 16:21:48,287 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 16:21:48,287 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:21:48,287 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 16:21:48,287 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-12-18 16:21:48,288 INFO L87 Difference]: Start difference. First operand 22094 states and 69094 transitions. Second operand 9 states. [2019-12-18 16:21:49,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:21:49,939 INFO L93 Difference]: Finished difference Result 42939 states and 132861 transitions. [2019-12-18 16:21:49,940 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-12-18 16:21:49,940 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 67 [2019-12-18 16:21:49,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:21:49,991 INFO L225 Difference]: With dead ends: 42939 [2019-12-18 16:21:49,991 INFO L226 Difference]: Without dead ends: 35065 [2019-12-18 16:21:49,992 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=107, Invalid=399, Unknown=0, NotChecked=0, Total=506 [2019-12-18 16:21:50,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35065 states. [2019-12-18 16:21:50,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35065 to 22778. [2019-12-18 16:21:50,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22778 states. [2019-12-18 16:21:50,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22778 states to 22778 states and 70805 transitions. [2019-12-18 16:21:50,610 INFO L78 Accepts]: Start accepts. Automaton has 22778 states and 70805 transitions. Word has length 67 [2019-12-18 16:21:50,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:21:50,611 INFO L462 AbstractCegarLoop]: Abstraction has 22778 states and 70805 transitions. [2019-12-18 16:21:50,611 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 16:21:50,611 INFO L276 IsEmpty]: Start isEmpty. Operand 22778 states and 70805 transitions. [2019-12-18 16:21:50,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 16:21:50,638 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:21:50,638 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 16:21:50,639 INFO L410 AbstractCegarLoop]: === Iteration 33 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:21:50,639 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:21:50,639 INFO L82 PathProgramCache]: Analyzing trace with hash 1535531457, now seen corresponding path program 2 times [2019-12-18 16:21:50,639 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:21:50,639 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1922353941] [2019-12-18 16:21:50,639 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:21:50,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:21:50,774 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 16:21:50,775 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1922353941] [2019-12-18 16:21:50,775 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:21:50,775 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 16:21:50,775 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1484140706] [2019-12-18 16:21:50,776 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-18 16:21:50,776 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:21:50,776 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-18 16:21:50,776 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-12-18 16:21:50,776 INFO L87 Difference]: Start difference. First operand 22778 states and 70805 transitions. Second operand 10 states. [2019-12-18 16:21:51,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:21:51,724 INFO L93 Difference]: Finished difference Result 44683 states and 137584 transitions. [2019-12-18 16:21:51,724 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-12-18 16:21:51,724 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 67 [2019-12-18 16:21:51,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:21:51,785 INFO L225 Difference]: With dead ends: 44683 [2019-12-18 16:21:51,785 INFO L226 Difference]: Without dead ends: 42768 [2019-12-18 16:21:51,786 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 154 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=152, Invalid=604, Unknown=0, NotChecked=0, Total=756 [2019-12-18 16:21:51,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42768 states. [2019-12-18 16:21:52,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42768 to 26032. [2019-12-18 16:21:52,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26032 states. [2019-12-18 16:21:52,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26032 states to 26032 states and 80627 transitions. [2019-12-18 16:21:52,343 INFO L78 Accepts]: Start accepts. Automaton has 26032 states and 80627 transitions. Word has length 67 [2019-12-18 16:21:52,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:21:52,344 INFO L462 AbstractCegarLoop]: Abstraction has 26032 states and 80627 transitions. [2019-12-18 16:21:52,344 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-18 16:21:52,344 INFO L276 IsEmpty]: Start isEmpty. Operand 26032 states and 80627 transitions. [2019-12-18 16:21:52,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 16:21:52,376 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:21:52,376 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 16:21:52,376 INFO L410 AbstractCegarLoop]: === Iteration 34 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:21:52,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:21:52,377 INFO L82 PathProgramCache]: Analyzing trace with hash 1442171729, now seen corresponding path program 3 times [2019-12-18 16:21:52,377 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:21:52,377 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1662210281] [2019-12-18 16:21:52,377 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:21:52,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:21:52,494 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 16:21:52,495 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1662210281] [2019-12-18 16:21:52,495 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:21:52,495 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 16:21:52,496 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [729198093] [2019-12-18 16:21:52,496 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-18 16:21:52,496 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:21:52,496 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-18 16:21:52,496 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-12-18 16:21:52,497 INFO L87 Difference]: Start difference. First operand 26032 states and 80627 transitions. Second operand 10 states. [2019-12-18 16:21:53,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:21:53,357 INFO L93 Difference]: Finished difference Result 43340 states and 133082 transitions. [2019-12-18 16:21:53,358 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-18 16:21:53,358 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 67 [2019-12-18 16:21:53,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:21:53,408 INFO L225 Difference]: With dead ends: 43340 [2019-12-18 16:21:53,408 INFO L226 Difference]: Without dead ends: 36825 [2019-12-18 16:21:53,408 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=100, Invalid=362, Unknown=0, NotChecked=0, Total=462 [2019-12-18 16:21:53,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36825 states. [2019-12-18 16:21:53,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36825 to 22389. [2019-12-18 16:21:53,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22389 states. [2019-12-18 16:21:54,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22389 states to 22389 states and 69376 transitions. [2019-12-18 16:21:54,038 INFO L78 Accepts]: Start accepts. Automaton has 22389 states and 69376 transitions. Word has length 67 [2019-12-18 16:21:54,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:21:54,038 INFO L462 AbstractCegarLoop]: Abstraction has 22389 states and 69376 transitions. [2019-12-18 16:21:54,038 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-18 16:21:54,038 INFO L276 IsEmpty]: Start isEmpty. Operand 22389 states and 69376 transitions. [2019-12-18 16:21:54,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 16:21:54,064 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:21:54,064 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 16:21:54,064 INFO L410 AbstractCegarLoop]: === Iteration 35 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:21:54,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:21:54,064 INFO L82 PathProgramCache]: Analyzing trace with hash -2065446981, now seen corresponding path program 4 times [2019-12-18 16:21:54,064 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:21:54,065 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1678887385] [2019-12-18 16:21:54,065 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:21:54,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:21:54,225 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 16:21:54,225 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1678887385] [2019-12-18 16:21:54,225 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:21:54,226 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-18 16:21:54,226 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [193616001] [2019-12-18 16:21:54,226 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-18 16:21:54,226 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:21:54,226 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-18 16:21:54,227 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-18 16:21:54,227 INFO L87 Difference]: Start difference. First operand 22389 states and 69376 transitions. Second operand 11 states. [2019-12-18 16:21:55,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:21:55,282 INFO L93 Difference]: Finished difference Result 39336 states and 121084 transitions. [2019-12-18 16:21:55,282 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-12-18 16:21:55,282 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 67 [2019-12-18 16:21:55,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:21:55,341 INFO L225 Difference]: With dead ends: 39336 [2019-12-18 16:21:55,341 INFO L226 Difference]: Without dead ends: 38317 [2019-12-18 16:21:55,342 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 125 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=130, Invalid=572, Unknown=0, NotChecked=0, Total=702 [2019-12-18 16:21:55,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38317 states. [2019-12-18 16:21:55,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38317 to 24692. [2019-12-18 16:21:55,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24692 states. [2019-12-18 16:21:55,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24692 states to 24692 states and 76375 transitions. [2019-12-18 16:21:55,843 INFO L78 Accepts]: Start accepts. Automaton has 24692 states and 76375 transitions. Word has length 67 [2019-12-18 16:21:55,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:21:55,843 INFO L462 AbstractCegarLoop]: Abstraction has 24692 states and 76375 transitions. [2019-12-18 16:21:55,843 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-18 16:21:55,843 INFO L276 IsEmpty]: Start isEmpty. Operand 24692 states and 76375 transitions. [2019-12-18 16:21:55,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 16:21:55,872 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:21:55,872 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 16:21:55,873 INFO L410 AbstractCegarLoop]: === Iteration 36 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:21:55,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:21:55,873 INFO L82 PathProgramCache]: Analyzing trace with hash 2136160587, now seen corresponding path program 5 times [2019-12-18 16:21:55,873 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:21:55,873 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1650130474] [2019-12-18 16:21:55,873 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:21:55,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:21:56,025 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 16:21:56,025 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1650130474] [2019-12-18 16:21:56,025 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:21:56,025 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-18 16:21:56,026 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1688683512] [2019-12-18 16:21:56,026 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-18 16:21:56,026 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:21:56,026 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-18 16:21:56,026 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-18 16:21:56,027 INFO L87 Difference]: Start difference. First operand 24692 states and 76375 transitions. Second operand 11 states. [2019-12-18 16:21:56,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:21:56,945 INFO L93 Difference]: Finished difference Result 38879 states and 119266 transitions. [2019-12-18 16:21:56,945 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-12-18 16:21:56,945 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 67 [2019-12-18 16:21:56,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:21:56,997 INFO L225 Difference]: With dead ends: 38879 [2019-12-18 16:21:56,997 INFO L226 Difference]: Without dead ends: 35558 [2019-12-18 16:21:56,997 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=122, Invalid=478, Unknown=0, NotChecked=0, Total=600 [2019-12-18 16:21:57,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35558 states. [2019-12-18 16:21:57,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35558 to 21700. [2019-12-18 16:21:57,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21700 states. [2019-12-18 16:21:57,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21700 states to 21700 states and 67268 transitions. [2019-12-18 16:21:57,594 INFO L78 Accepts]: Start accepts. Automaton has 21700 states and 67268 transitions. Word has length 67 [2019-12-18 16:21:57,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:21:57,594 INFO L462 AbstractCegarLoop]: Abstraction has 21700 states and 67268 transitions. [2019-12-18 16:21:57,594 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-18 16:21:57,594 INFO L276 IsEmpty]: Start isEmpty. Operand 21700 states and 67268 transitions. [2019-12-18 16:21:57,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 16:21:57,618 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:21:57,618 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 16:21:57,618 INFO L410 AbstractCegarLoop]: === Iteration 37 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:21:57,618 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:21:57,618 INFO L82 PathProgramCache]: Analyzing trace with hash -1853423759, now seen corresponding path program 6 times [2019-12-18 16:21:57,619 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:21:57,619 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1516749519] [2019-12-18 16:21:57,619 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:21:57,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:21:57,788 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 16:21:57,788 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1516749519] [2019-12-18 16:21:57,789 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:21:57,789 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-18 16:21:57,789 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [419423067] [2019-12-18 16:21:57,789 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-18 16:21:57,789 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:21:57,790 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-18 16:21:57,790 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2019-12-18 16:21:57,790 INFO L87 Difference]: Start difference. First operand 21700 states and 67268 transitions. Second operand 12 states. [2019-12-18 16:21:58,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:21:58,744 INFO L93 Difference]: Finished difference Result 35737 states and 109819 transitions. [2019-12-18 16:21:58,744 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-18 16:21:58,744 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 67 [2019-12-18 16:21:58,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:21:58,794 INFO L225 Difference]: With dead ends: 35737 [2019-12-18 16:21:58,794 INFO L226 Difference]: Without dead ends: 35526 [2019-12-18 16:21:58,795 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=133, Invalid=569, Unknown=0, NotChecked=0, Total=702 [2019-12-18 16:21:58,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35526 states. [2019-12-18 16:21:59,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35526 to 21524. [2019-12-18 16:21:59,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21524 states. [2019-12-18 16:21:59,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21524 states to 21524 states and 66796 transitions. [2019-12-18 16:21:59,227 INFO L78 Accepts]: Start accepts. Automaton has 21524 states and 66796 transitions. Word has length 67 [2019-12-18 16:21:59,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:21:59,228 INFO L462 AbstractCegarLoop]: Abstraction has 21524 states and 66796 transitions. [2019-12-18 16:21:59,228 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-18 16:21:59,228 INFO L276 IsEmpty]: Start isEmpty. Operand 21524 states and 66796 transitions. [2019-12-18 16:21:59,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 16:21:59,250 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:21:59,251 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 16:21:59,251 INFO L410 AbstractCegarLoop]: === Iteration 38 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:21:59,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:21:59,251 INFO L82 PathProgramCache]: Analyzing trace with hash 594227727, now seen corresponding path program 7 times [2019-12-18 16:21:59,251 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:21:59,251 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [532729862] [2019-12-18 16:21:59,251 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:21:59,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 16:21:59,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 16:21:59,378 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-18 16:21:59,379 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-18 16:21:59,383 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [903] [903] ULTIMATE.startENTRY-->L837: Formula: (let ((.cse0 (store |v_#valid_65| 0 0))) (and (= v_~x~0_45 0) (= 0 v_~a$w_buff0_used~0_768) (= v_~y~0_18 0) (= 0 v_~a$r_buff1_thd1~0_150) (< |v_#StackHeapBarrier_16| |v_ULTIMATE.start_main_~#t257~0.base_33|) (= 0 v_~__unbuffered_p2_EAX~0_31) (= 0 v_~a$read_delayed_var~0.base_7) (= 0 v_~a$w_buff1_used~0_426) (= v_~main$tmp_guard0~0_29 0) (= v_~a$read_delayed_var~0.offset_7 0) (= 0 v_~a$w_buff1~0_200) (= v_~a$r_buff1_thd3~0_269 0) (< 0 |v_#StackHeapBarrier_16|) (= 0 v_~__unbuffered_p0_EAX~0_111) (= v_~a$r_buff0_thd3~0_320 0) (= v_~a~0_184 0) (= 0 |v_ULTIMATE.start_main_~#t257~0.offset_23|) (= 0 v_~__unbuffered_p1_EAX~0_34) (= v_~__unbuffered_cnt~0_102 0) (= (store |v_#length_22| |v_ULTIMATE.start_main_~#t257~0.base_33| 4) |v_#length_21|) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t257~0.base_33|)) (= 0 |v_#NULL.base_4|) (= v_~a$flush_delayed~0_25 0) (= v_~__unbuffered_p1_EBX~0_34 0) (= v_~a$r_buff0_thd0~0_107 0) (= v_~main$tmp_guard1~0_32 0) (= v_~a$r_buff1_thd0~0_160 0) (= (store |v_#memory_int_20| |v_ULTIMATE.start_main_~#t257~0.base_33| (store (select |v_#memory_int_20| |v_ULTIMATE.start_main_~#t257~0.base_33|) |v_ULTIMATE.start_main_~#t257~0.offset_23| 0)) |v_#memory_int_19|) (= v_~a$w_buff0~0_274 0) (= v_~z~0_21 0) (= |v_#NULL.offset_4| 0) (= v_~a$mem_tmp~0_14 0) (= 0 v_~a$r_buff0_thd1~0_184) (= 0 v_~a$r_buff1_thd2~0_145) (= v_~a$r_buff0_thd2~0_95 0) (= (store .cse0 |v_ULTIMATE.start_main_~#t257~0.base_33| 1) |v_#valid_63|) (= v_~weak$$choice2~0_110 0) (= v_~__unbuffered_p2_EBX~0_40 0) (= 0 v_~a$read_delayed~0_8) (= 0 v_~weak$$choice0~0_12))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_16|, #valid=|v_#valid_65|, #memory_int=|v_#memory_int_20|, #length=|v_#length_22|} OutVars{ULTIMATE.start_main_~#t258~0.offset=|v_ULTIMATE.start_main_~#t258~0.offset_19|, ~a$r_buff1_thd2~0=v_~a$r_buff1_thd2~0_145, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_67|, #NULL.offset=|v_#NULL.offset_4|, ULTIMATE.start_main_#t~ite49=|v_ULTIMATE.start_main_#t~ite49_471|, ~a$r_buff0_thd0~0=v_~a$r_buff0_thd0~0_107, ULTIMATE.start_main_#t~ite50=|v_ULTIMATE.start_main_#t~ite50_41|, ~a~0=v_~a~0_184, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_64|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_111, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_34, #length=|v_#length_21|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_31, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_40, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_10|, ~a$r_buff1_thd3~0=v_~a$r_buff1_thd3~0_269, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_768, ~a$r_buff0_thd1~0=v_~a$r_buff0_thd1~0_184, ~weak$$choice0~0=v_~weak$$choice0~0_12, #StackHeapBarrier=|v_#StackHeapBarrier_16|, ~a$read_delayed_var~0.offset=v_~a$read_delayed_var~0.offset_7, ~a$w_buff0~0=v_~a$w_buff0~0_274, ~a$r_buff1_thd0~0=v_~a$r_buff1_thd0~0_160, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_102, ~x~0=v_~x~0_45, ULTIMATE.start_main_~#t259~0.base=|v_ULTIMATE.start_main_~#t259~0.base_25|, ~a$read_delayed~0=v_~a$read_delayed~0_8, ~a$r_buff0_thd2~0=v_~a$r_buff0_thd2~0_95, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_32, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_69|, ULTIMATE.start_main_~#t257~0.offset=|v_ULTIMATE.start_main_~#t257~0.offset_23|, ~a$mem_tmp~0=v_~a$mem_tmp~0_14, ULTIMATE.start_main_#t~ite51=|v_ULTIMATE.start_main_#t~ite51_29|, ~a$w_buff1~0=v_~a$w_buff1~0_200, ~y~0=v_~y~0_18, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_34, ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_27|, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_9|, ~a$r_buff1_thd1~0=v_~a$r_buff1_thd1~0_150, ULTIMATE.start_main_~#t257~0.base=|v_ULTIMATE.start_main_~#t257~0.base_33|, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_320, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_29, #NULL.base=|v_#NULL.base_4|, ULTIMATE.start_main_~#t258~0.base=|v_ULTIMATE.start_main_~#t258~0.base_25|, ~a$flush_delayed~0=v_~a$flush_delayed~0_25, ULTIMATE.start_main_~#t259~0.offset=|v_ULTIMATE.start_main_~#t259~0.offset_19|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_21|, #valid=|v_#valid_63|, #memory_int=|v_#memory_int_19|, ~z~0=v_~z~0_21, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_426, ~weak$$choice2~0=v_~weak$$choice2~0_110, ~a$read_delayed_var~0.base=v_~a$read_delayed_var~0.base_7} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t258~0.offset, ~a$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite47, #NULL.offset, ULTIMATE.start_main_#t~ite49, ~a$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite50, ~a~0, ULTIMATE.start_main_#t~ite52, ~__unbuffered_p0_EAX~0, ~__unbuffered_p1_EAX~0, #length, ~__unbuffered_p2_EAX~0, ~__unbuffered_p2_EBX~0, ULTIMATE.start_main_#t~nondet45, ~a$r_buff1_thd3~0, ~a$w_buff0_used~0, ~a$r_buff0_thd1~0, ~weak$$choice0~0, ~a$read_delayed_var~0.offset, ~a$w_buff0~0, ~a$r_buff1_thd0~0, ~__unbuffered_cnt~0, ~x~0, ULTIMATE.start_main_~#t259~0.base, ~a$read_delayed~0, ~a$r_buff0_thd2~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite48, ULTIMATE.start_main_~#t257~0.offset, ~a$mem_tmp~0, ULTIMATE.start_main_#t~ite51, ~a$w_buff1~0, ~y~0, ~__unbuffered_p1_EBX~0, ULTIMATE.start_main_#t~nondet46, ULTIMATE.start_main_#t~nondet44, ~a$r_buff1_thd1~0, ULTIMATE.start_main_~#t257~0.base, ~a$r_buff0_thd3~0, ~main$tmp_guard0~0, #NULL.base, ULTIMATE.start_main_~#t258~0.base, ~a$flush_delayed~0, ULTIMATE.start_main_~#t259~0.offset, ULTIMATE.start_main_#res, #valid, #memory_int, ~z~0, ~a$w_buff1_used~0, ~weak$$choice2~0, ~a$read_delayed_var~0.base] because there is no mapped edge [2019-12-18 16:21:59,384 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [802] [802] P0ENTRY-->L4-3: Formula: (and (= v_P0Thread1of1ForFork1_~arg.offset_20 |v_P0Thread1of1ForFork1_#in~arg.offset_20|) (= 1 v_~a$w_buff0_used~0_240) (= (mod v_~a$w_buff1_used~0_130 256) 0) (= v_~a$w_buff0_used~0_241 v_~a$w_buff1_used~0_130) (= v_P0Thread1of1ForFork1___VERIFIER_assert_~expression_24 |v_P0Thread1of1ForFork1___VERIFIER_assert_#in~expression_20|) (= |v_P0Thread1of1ForFork1_#in~arg.base_20| v_P0Thread1of1ForFork1_~arg.base_20) (= 1 v_~a$w_buff0~0_55) (= v_~a$w_buff0~0_56 v_~a$w_buff1~0_50) (= 1 |v_P0Thread1of1ForFork1___VERIFIER_assert_#in~expression_20|)) InVars {P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_20|, ~a$w_buff0~0=v_~a$w_buff0~0_56, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_241, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_20|} OutVars{~a$w_buff1~0=v_~a$w_buff1~0_50, P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_20|, ~a$w_buff0~0=v_~a$w_buff0~0_55, P0Thread1of1ForFork1___VERIFIER_assert_~expression=v_P0Thread1of1ForFork1___VERIFIER_assert_~expression_24, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_240, P0Thread1of1ForFork1_~arg.offset=v_P0Thread1of1ForFork1_~arg.offset_20, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_130, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_20|, P0Thread1of1ForFork1___VERIFIER_assert_#in~expression=|v_P0Thread1of1ForFork1___VERIFIER_assert_#in~expression_20|, P0Thread1of1ForFork1_~arg.base=v_P0Thread1of1ForFork1_~arg.base_20} AuxVars[] AssignedVars[~a$w_buff1~0, ~a$w_buff0~0, P0Thread1of1ForFork1___VERIFIER_assert_~expression, ~a$w_buff0_used~0, P0Thread1of1ForFork1_~arg.offset, ~a$w_buff1_used~0, P0Thread1of1ForFork1___VERIFIER_assert_#in~expression, P0Thread1of1ForFork1_~arg.base] because there is no mapped edge [2019-12-18 16:21:59,385 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [872] [872] L837-1-->L839: Formula: (and (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t258~0.base_12| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t258~0.base_12|) |v_ULTIMATE.start_main_~#t258~0.offset_10| 1)) |v_#memory_int_13|) (= 0 (select |v_#valid_35| |v_ULTIMATE.start_main_~#t258~0.base_12|)) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t258~0.base_12|) (not (= 0 |v_ULTIMATE.start_main_~#t258~0.base_12|)) (= |v_#valid_34| (store |v_#valid_35| |v_ULTIMATE.start_main_~#t258~0.base_12| 1)) (= |v_ULTIMATE.start_main_~#t258~0.offset_10| 0) (= (store |v_#length_16| |v_ULTIMATE.start_main_~#t258~0.base_12| 4) |v_#length_15|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_35|, #memory_int=|v_#memory_int_14|, #length=|v_#length_16|} OutVars{ULTIMATE.start_main_~#t258~0.base=|v_ULTIMATE.start_main_~#t258~0.base_12|, #StackHeapBarrier=|v_#StackHeapBarrier_11|, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_4|, ULTIMATE.start_main_~#t258~0.offset=|v_ULTIMATE.start_main_~#t258~0.offset_10|, #valid=|v_#valid_34|, #memory_int=|v_#memory_int_13|, #length=|v_#length_15|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t258~0.base, ULTIMATE.start_main_#t~nondet44, ULTIMATE.start_main_~#t258~0.offset, #valid, #memory_int, #length] because there is no mapped edge [2019-12-18 16:21:59,386 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [871] [871] L839-1-->L841: Formula: (and (= (select |v_#valid_33| |v_ULTIMATE.start_main_~#t259~0.base_12|) 0) (= |v_ULTIMATE.start_main_~#t259~0.offset_10| 0) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t259~0.base_12| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t259~0.base_12|) |v_ULTIMATE.start_main_~#t259~0.offset_10| 2)) |v_#memory_int_11|) (< |v_#StackHeapBarrier_10| |v_ULTIMATE.start_main_~#t259~0.base_12|) (= (store |v_#length_14| |v_ULTIMATE.start_main_~#t259~0.base_12| 4) |v_#length_13|) (not (= 0 |v_ULTIMATE.start_main_~#t259~0.base_12|)) (= |v_#valid_32| (store |v_#valid_33| |v_ULTIMATE.start_main_~#t259~0.base_12| 1))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_33|, #memory_int=|v_#memory_int_12|, #length=|v_#length_14|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_10|, ULTIMATE.start_main_~#t259~0.base=|v_ULTIMATE.start_main_~#t259~0.base_12|, ULTIMATE.start_main_~#t259~0.offset=|v_ULTIMATE.start_main_~#t259~0.offset_10|, #valid=|v_#valid_32|, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_5|, #memory_int=|v_#memory_int_11|, #length=|v_#length_13|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t259~0.base, ULTIMATE.start_main_~#t259~0.offset, #valid, ULTIMATE.start_main_#t~nondet45, #memory_int, #length] because there is no mapped edge [2019-12-18 16:21:59,388 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [832] [832] L778-2-->L778-4: Formula: (let ((.cse0 (= (mod ~a$w_buff1_used~0_In881833603 256) 0)) (.cse1 (= 0 (mod ~a$r_buff1_thd2~0_In881833603 256)))) (or (and (not .cse0) (not .cse1) (= |P1Thread1of1ForFork2_#t~ite9_Out881833603| ~a$w_buff1~0_In881833603)) (and (or .cse0 .cse1) (= ~a~0_In881833603 |P1Thread1of1ForFork2_#t~ite9_Out881833603|)))) InVars {~a~0=~a~0_In881833603, ~a$w_buff1~0=~a$w_buff1~0_In881833603, ~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In881833603, ~a$w_buff1_used~0=~a$w_buff1_used~0_In881833603} OutVars{~a~0=~a~0_In881833603, P1Thread1of1ForFork2_#t~ite9=|P1Thread1of1ForFork2_#t~ite9_Out881833603|, ~a$w_buff1~0=~a$w_buff1~0_In881833603, ~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In881833603, ~a$w_buff1_used~0=~a$w_buff1_used~0_In881833603} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite9] because there is no mapped edge [2019-12-18 16:21:59,388 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [771] [771] L778-4-->L779: Formula: (= |v_P1Thread1of1ForFork2_#t~ite9_16| v_~a~0_33) InVars {P1Thread1of1ForFork2_#t~ite9=|v_P1Thread1of1ForFork2_#t~ite9_16|} OutVars{~a~0=v_~a~0_33, P1Thread1of1ForFork2_#t~ite9=|v_P1Thread1of1ForFork2_#t~ite9_15|, P1Thread1of1ForFork2_#t~ite10=|v_P1Thread1of1ForFork2_#t~ite10_23|} AuxVars[] AssignedVars[~a~0, P1Thread1of1ForFork2_#t~ite9, P1Thread1of1ForFork2_#t~ite10] because there is no mapped edge [2019-12-18 16:21:59,388 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [836] [836] L779-->L779-2: Formula: (let ((.cse0 (= 0 (mod ~a$r_buff0_thd2~0_In-1133726678 256))) (.cse1 (= 0 (mod ~a$w_buff0_used~0_In-1133726678 256)))) (or (and (= 0 |P1Thread1of1ForFork2_#t~ite11_Out-1133726678|) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= ~a$w_buff0_used~0_In-1133726678 |P1Thread1of1ForFork2_#t~ite11_Out-1133726678|)))) InVars {~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-1133726678, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1133726678} OutVars{~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-1133726678, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1133726678, P1Thread1of1ForFork2_#t~ite11=|P1Thread1of1ForFork2_#t~ite11_Out-1133726678|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite11] because there is no mapped edge [2019-12-18 16:21:59,390 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [834] [834] L753-->L753-2: Formula: (let ((.cse0 (= 0 (mod ~a$r_buff0_thd1~0_In438989030 256))) (.cse1 (= (mod ~a$w_buff0_used~0_In438989030 256) 0))) (or (and (= |P0Thread1of1ForFork1_#t~ite5_Out438989030| ~a$w_buff0_used~0_In438989030) (or .cse0 .cse1)) (and (= 0 |P0Thread1of1ForFork1_#t~ite5_Out438989030|) (not .cse0) (not .cse1)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In438989030, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In438989030} OutVars{P0Thread1of1ForFork1_#t~ite5=|P0Thread1of1ForFork1_#t~ite5_Out438989030|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In438989030, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In438989030} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite5] because there is no mapped edge [2019-12-18 16:21:59,391 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [849] [849] L754-->L754-2: Formula: (let ((.cse1 (= 0 (mod ~a$w_buff0_used~0_In-260816754 256))) (.cse0 (= (mod ~a$r_buff0_thd1~0_In-260816754 256) 0)) (.cse3 (= 0 (mod ~a$r_buff1_thd1~0_In-260816754 256))) (.cse2 (= (mod ~a$w_buff1_used~0_In-260816754 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P0Thread1of1ForFork1_#t~ite6_Out-260816754|)) (and (or .cse1 .cse0) (or .cse3 .cse2) (= ~a$w_buff1_used~0_In-260816754 |P0Thread1of1ForFork1_#t~ite6_Out-260816754|)))) InVars {~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In-260816754, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-260816754, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In-260816754, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-260816754} OutVars{P0Thread1of1ForFork1_#t~ite6=|P0Thread1of1ForFork1_#t~ite6_Out-260816754|, ~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In-260816754, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-260816754, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In-260816754, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-260816754} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite6] because there is no mapped edge [2019-12-18 16:21:59,392 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [842] [842] L755-->L756: Formula: (let ((.cse0 (= 0 (mod ~a$r_buff0_thd1~0_In1245794975 256))) (.cse1 (= (mod ~a$w_buff0_used~0_In1245794975 256) 0))) (or (and (not .cse0) (not .cse1) (= 0 ~a$r_buff0_thd1~0_Out1245794975)) (and (= ~a$r_buff0_thd1~0_Out1245794975 ~a$r_buff0_thd1~0_In1245794975) (or .cse0 .cse1)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In1245794975, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In1245794975} OutVars{P0Thread1of1ForFork1_#t~ite7=|P0Thread1of1ForFork1_#t~ite7_Out1245794975|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1245794975, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_Out1245794975} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite7, ~a$r_buff0_thd1~0] because there is no mapped edge [2019-12-18 16:21:59,392 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [850] [850] L756-->L756-2: Formula: (let ((.cse1 (= 0 (mod ~a$r_buff1_thd1~0_In722911257 256))) (.cse0 (= 0 (mod ~a$w_buff1_used~0_In722911257 256))) (.cse2 (= (mod ~a$w_buff0_used~0_In722911257 256) 0)) (.cse3 (= (mod ~a$r_buff0_thd1~0_In722911257 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P0Thread1of1ForFork1_#t~ite8_Out722911257| 0)) (and (= |P0Thread1of1ForFork1_#t~ite8_Out722911257| ~a$r_buff1_thd1~0_In722911257) (or .cse1 .cse0) (or .cse2 .cse3)))) InVars {~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In722911257, ~a$w_buff0_used~0=~a$w_buff0_used~0_In722911257, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In722911257, ~a$w_buff1_used~0=~a$w_buff1_used~0_In722911257} OutVars{P0Thread1of1ForFork1_#t~ite8=|P0Thread1of1ForFork1_#t~ite8_Out722911257|, ~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In722911257, ~a$w_buff0_used~0=~a$w_buff0_used~0_In722911257, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In722911257, ~a$w_buff1_used~0=~a$w_buff1_used~0_In722911257} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite8] because there is no mapped edge [2019-12-18 16:21:59,392 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [867] [867] L756-2-->P0EXIT: Formula: (and (= 0 |v_P0Thread1of1ForFork1_#res.offset_5|) (= v_~a$r_buff1_thd1~0_72 |v_P0Thread1of1ForFork1_#t~ite8_50|) (= 0 |v_P0Thread1of1ForFork1_#res.base_5|) (= (+ v_~__unbuffered_cnt~0_63 1) v_~__unbuffered_cnt~0_62)) InVars {P0Thread1of1ForFork1_#t~ite8=|v_P0Thread1of1ForFork1_#t~ite8_50|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_63} OutVars{P0Thread1of1ForFork1_#t~ite8=|v_P0Thread1of1ForFork1_#t~ite8_49|, P0Thread1of1ForFork1_#res.offset=|v_P0Thread1of1ForFork1_#res.offset_5|, ~a$r_buff1_thd1~0=v_~a$r_buff1_thd1~0_72, P0Thread1of1ForFork1_#res.base=|v_P0Thread1of1ForFork1_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_62} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite8, P0Thread1of1ForFork1_#res.offset, ~a$r_buff1_thd1~0, P0Thread1of1ForFork1_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-18 16:21:59,393 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [880] [880] L803-->L803-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In1294996226 256)))) (or (and (not .cse0) (= |P2Thread1of1ForFork0_#t~ite21_Out1294996226| ~a$w_buff0~0_In1294996226) (= |P2Thread1of1ForFork0_#t~ite20_In1294996226| |P2Thread1of1ForFork0_#t~ite20_Out1294996226|)) (and (= ~a$w_buff0~0_In1294996226 |P2Thread1of1ForFork0_#t~ite20_Out1294996226|) (= |P2Thread1of1ForFork0_#t~ite21_Out1294996226| |P2Thread1of1ForFork0_#t~ite20_Out1294996226|) .cse0 (let ((.cse1 (= (mod ~a$r_buff0_thd3~0_In1294996226 256) 0))) (or (and .cse1 (= (mod ~a$r_buff1_thd3~0_In1294996226 256) 0)) (and .cse1 (= 0 (mod ~a$w_buff1_used~0_In1294996226 256))) (= 0 (mod ~a$w_buff0_used~0_In1294996226 256))))))) InVars {~a$w_buff0~0=~a$w_buff0~0_In1294996226, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In1294996226, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1294996226, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In1294996226, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1294996226, P2Thread1of1ForFork0_#t~ite20=|P2Thread1of1ForFork0_#t~ite20_In1294996226|, ~weak$$choice2~0=~weak$$choice2~0_In1294996226} OutVars{P2Thread1of1ForFork0_#t~ite21=|P2Thread1of1ForFork0_#t~ite21_Out1294996226|, ~a$w_buff0~0=~a$w_buff0~0_In1294996226, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In1294996226, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1294996226, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In1294996226, P2Thread1of1ForFork0_#t~ite20=|P2Thread1of1ForFork0_#t~ite20_Out1294996226|, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1294996226, ~weak$$choice2~0=~weak$$choice2~0_In1294996226} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite21, P2Thread1of1ForFork0_#t~ite20] because there is no mapped edge [2019-12-18 16:21:59,395 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [881] [881] L805-->L805-8: Formula: (let ((.cse1 (= (mod ~weak$$choice2~0_In101374138 256) 0))) (or (and (let ((.cse0 (= (mod ~a$r_buff0_thd3~0_In101374138 256) 0))) (or (and .cse0 (= 0 (mod ~a$r_buff1_thd3~0_In101374138 256))) (and .cse0 (= (mod ~a$w_buff1_used~0_In101374138 256) 0)) (= 0 (mod ~a$w_buff0_used~0_In101374138 256)))) (= |P2Thread1of1ForFork0_#t~ite26_Out101374138| ~a$w_buff0_used~0_In101374138) (= |P2Thread1of1ForFork0_#t~ite27_Out101374138| |P2Thread1of1ForFork0_#t~ite26_Out101374138|) .cse1) (and (= |P2Thread1of1ForFork0_#t~ite27_Out101374138| ~a$w_buff0_used~0_In101374138) (= |P2Thread1of1ForFork0_#t~ite26_In101374138| |P2Thread1of1ForFork0_#t~ite26_Out101374138|) (not .cse1)))) InVars {P2Thread1of1ForFork0_#t~ite26=|P2Thread1of1ForFork0_#t~ite26_In101374138|, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In101374138, ~a$w_buff0_used~0=~a$w_buff0_used~0_In101374138, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In101374138, ~a$w_buff1_used~0=~a$w_buff1_used~0_In101374138, ~weak$$choice2~0=~weak$$choice2~0_In101374138} OutVars{P2Thread1of1ForFork0_#t~ite26=|P2Thread1of1ForFork0_#t~ite26_Out101374138|, P2Thread1of1ForFork0_#t~ite27=|P2Thread1of1ForFork0_#t~ite27_Out101374138|, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In101374138, ~a$w_buff0_used~0=~a$w_buff0_used~0_In101374138, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In101374138, ~a$w_buff1_used~0=~a$w_buff1_used~0_In101374138, ~weak$$choice2~0=~weak$$choice2~0_In101374138} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite26, P2Thread1of1ForFork0_#t~ite27] because there is no mapped edge [2019-12-18 16:21:59,397 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [762] [762] L807-->L808: Formula: (and (= v_~a$r_buff0_thd3~0_61 v_~a$r_buff0_thd3~0_60) (not (= 0 (mod v_~weak$$choice2~0_15 256)))) InVars {~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_61, ~weak$$choice2~0=v_~weak$$choice2~0_15} OutVars{P2Thread1of1ForFork0_#t~ite33=|v_P2Thread1of1ForFork0_#t~ite33_7|, P2Thread1of1ForFork0_#t~ite32=|v_P2Thread1of1ForFork0_#t~ite32_7|, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_60, P2Thread1of1ForFork0_#t~ite31=|v_P2Thread1of1ForFork0_#t~ite31_7|, ~weak$$choice2~0=v_~weak$$choice2~0_15} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite33, P2Thread1of1ForFork0_#t~ite32, ~a$r_buff0_thd3~0, P2Thread1of1ForFork0_#t~ite31] because there is no mapped edge [2019-12-18 16:21:59,398 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [761] [761] L810-->L814: Formula: (and (not (= (mod v_~a$flush_delayed~0_7 256) 0)) (= v_~a~0_20 v_~a$mem_tmp~0_4) (= v_~a$flush_delayed~0_6 0)) InVars {~a$mem_tmp~0=v_~a$mem_tmp~0_4, ~a$flush_delayed~0=v_~a$flush_delayed~0_7} OutVars{P2Thread1of1ForFork0_#t~ite37=|v_P2Thread1of1ForFork0_#t~ite37_7|, ~a~0=v_~a~0_20, ~a$mem_tmp~0=v_~a$mem_tmp~0_4, ~a$flush_delayed~0=v_~a$flush_delayed~0_6} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite37, ~a~0, ~a$flush_delayed~0] because there is no mapped edge [2019-12-18 16:21:59,399 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [838] [838] L814-2-->L814-5: Formula: (let ((.cse1 (= 0 (mod ~a$r_buff1_thd3~0_In-921043470 256))) (.cse0 (= 0 (mod ~a$w_buff1_used~0_In-921043470 256))) (.cse2 (= |P2Thread1of1ForFork0_#t~ite38_Out-921043470| |P2Thread1of1ForFork0_#t~ite39_Out-921043470|))) (or (and (or .cse0 .cse1) (= |P2Thread1of1ForFork0_#t~ite38_Out-921043470| ~a~0_In-921043470) .cse2) (and (not .cse1) (= |P2Thread1of1ForFork0_#t~ite38_Out-921043470| ~a$w_buff1~0_In-921043470) (not .cse0) .cse2))) InVars {~a~0=~a~0_In-921043470, ~a$w_buff1~0=~a$w_buff1~0_In-921043470, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-921043470, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-921043470} OutVars{~a~0=~a~0_In-921043470, P2Thread1of1ForFork0_#t~ite39=|P2Thread1of1ForFork0_#t~ite39_Out-921043470|, P2Thread1of1ForFork0_#t~ite38=|P2Thread1of1ForFork0_#t~ite38_Out-921043470|, ~a$w_buff1~0=~a$w_buff1~0_In-921043470, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-921043470, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-921043470} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite39, P2Thread1of1ForFork0_#t~ite38] because there is no mapped edge [2019-12-18 16:21:59,400 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [840] [840] L815-->L815-2: Formula: (let ((.cse1 (= 0 (mod ~a$w_buff0_used~0_In824984420 256))) (.cse0 (= (mod ~a$r_buff0_thd3~0_In824984420 256) 0))) (or (and (or .cse0 .cse1) (= ~a$w_buff0_used~0_In824984420 |P2Thread1of1ForFork0_#t~ite40_Out824984420|)) (and (= |P2Thread1of1ForFork0_#t~ite40_Out824984420| 0) (not .cse1) (not .cse0)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In824984420, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In824984420} OutVars{P2Thread1of1ForFork0_#t~ite40=|P2Thread1of1ForFork0_#t~ite40_Out824984420|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In824984420, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In824984420} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite40] because there is no mapped edge [2019-12-18 16:21:59,400 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [830] [830] L816-->L816-2: Formula: (let ((.cse1 (= 0 (mod ~a$r_buff0_thd3~0_In-1124184323 256))) (.cse0 (= 0 (mod ~a$w_buff0_used~0_In-1124184323 256))) (.cse3 (= (mod ~a$r_buff1_thd3~0_In-1124184323 256) 0)) (.cse2 (= (mod ~a$w_buff1_used~0_In-1124184323 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P2Thread1of1ForFork0_#t~ite41_Out-1124184323| ~a$w_buff1_used~0_In-1124184323)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2))) (= |P2Thread1of1ForFork0_#t~ite41_Out-1124184323| 0)))) InVars {~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-1124184323, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1124184323, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-1124184323, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1124184323} OutVars{~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-1124184323, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1124184323, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-1124184323, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1124184323, P2Thread1of1ForFork0_#t~ite41=|P2Thread1of1ForFork0_#t~ite41_Out-1124184323|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite41] because there is no mapped edge [2019-12-18 16:21:59,402 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [846] [846] L780-->L780-2: Formula: (let ((.cse3 (= (mod ~a$w_buff0_used~0_In114859259 256) 0)) (.cse2 (= 0 (mod ~a$r_buff0_thd2~0_In114859259 256))) (.cse1 (= 0 (mod ~a$r_buff1_thd2~0_In114859259 256))) (.cse0 (= 0 (mod ~a$w_buff1_used~0_In114859259 256)))) (or (and (= ~a$w_buff1_used~0_In114859259 |P1Thread1of1ForFork2_#t~ite12_Out114859259|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= 0 |P1Thread1of1ForFork2_#t~ite12_Out114859259|) (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0)))))) InVars {~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In114859259, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In114859259, ~a$w_buff0_used~0=~a$w_buff0_used~0_In114859259, ~a$w_buff1_used~0=~a$w_buff1_used~0_In114859259} OutVars{~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In114859259, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In114859259, ~a$w_buff0_used~0=~a$w_buff0_used~0_In114859259, P1Thread1of1ForFork2_#t~ite12=|P1Thread1of1ForFork2_#t~ite12_Out114859259|, ~a$w_buff1_used~0=~a$w_buff1_used~0_In114859259} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite12] because there is no mapped edge [2019-12-18 16:21:59,402 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [851] [851] L781-->L781-2: Formula: (let ((.cse1 (= 0 (mod ~a$w_buff0_used~0_In818616315 256))) (.cse0 (= 0 (mod ~a$r_buff0_thd2~0_In818616315 256)))) (or (and (= |P1Thread1of1ForFork2_#t~ite13_Out818616315| 0) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= |P1Thread1of1ForFork2_#t~ite13_Out818616315| ~a$r_buff0_thd2~0_In818616315)))) InVars {~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In818616315, ~a$w_buff0_used~0=~a$w_buff0_used~0_In818616315} OutVars{~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In818616315, ~a$w_buff0_used~0=~a$w_buff0_used~0_In818616315, P1Thread1of1ForFork2_#t~ite13=|P1Thread1of1ForFork2_#t~ite13_Out818616315|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite13] because there is no mapped edge [2019-12-18 16:21:59,403 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [852] [852] L782-->L782-2: Formula: (let ((.cse2 (= 0 (mod ~a$w_buff1_used~0_In-319927398 256))) (.cse3 (= (mod ~a$r_buff1_thd2~0_In-319927398 256) 0)) (.cse1 (= (mod ~a$r_buff0_thd2~0_In-319927398 256) 0)) (.cse0 (= 0 (mod ~a$w_buff0_used~0_In-319927398 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~a$r_buff1_thd2~0_In-319927398 |P1Thread1of1ForFork2_#t~ite14_Out-319927398|)) (and (= 0 |P1Thread1of1ForFork2_#t~ite14_Out-319927398|) (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0)))))) InVars {~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In-319927398, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-319927398, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-319927398, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-319927398} OutVars{~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In-319927398, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-319927398, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-319927398, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-319927398, P1Thread1of1ForFork2_#t~ite14=|P1Thread1of1ForFork2_#t~ite14_Out-319927398|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite14] because there is no mapped edge [2019-12-18 16:21:59,403 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [868] [868] L782-2-->P1EXIT: Formula: (and (= v_~__unbuffered_cnt~0_68 (+ v_~__unbuffered_cnt~0_69 1)) (= 0 |v_P1Thread1of1ForFork2_#res.offset_5|) (= 0 |v_P1Thread1of1ForFork2_#res.base_5|) (= |v_P1Thread1of1ForFork2_#t~ite14_36| v_~a$r_buff1_thd2~0_63)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_69, P1Thread1of1ForFork2_#t~ite14=|v_P1Thread1of1ForFork2_#t~ite14_36|} OutVars{P1Thread1of1ForFork2_#res.offset=|v_P1Thread1of1ForFork2_#res.offset_5|, ~a$r_buff1_thd2~0=v_~a$r_buff1_thd2~0_63, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_68, P1Thread1of1ForFork2_#t~ite14=|v_P1Thread1of1ForFork2_#t~ite14_35|, P1Thread1of1ForFork2_#res.base=|v_P1Thread1of1ForFork2_#res.base_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#res.offset, ~a$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork2_#t~ite14, P1Thread1of1ForFork2_#res.base] because there is no mapped edge [2019-12-18 16:21:59,404 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [831] [831] L817-->L817-2: Formula: (let ((.cse1 (= 0 (mod ~a$r_buff0_thd3~0_In1529706282 256))) (.cse0 (= (mod ~a$w_buff0_used~0_In1529706282 256) 0))) (or (and (not .cse0) (= |P2Thread1of1ForFork0_#t~ite42_Out1529706282| 0) (not .cse1)) (and (or .cse1 .cse0) (= |P2Thread1of1ForFork0_#t~ite42_Out1529706282| ~a$r_buff0_thd3~0_In1529706282)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In1529706282, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In1529706282} OutVars{~a$w_buff0_used~0=~a$w_buff0_used~0_In1529706282, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In1529706282, P2Thread1of1ForFork0_#t~ite42=|P2Thread1of1ForFork0_#t~ite42_Out1529706282|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite42] because there is no mapped edge [2019-12-18 16:21:59,404 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [841] [841] L818-->L818-2: Formula: (let ((.cse0 (= 0 (mod ~a$w_buff0_used~0_In1436144209 256))) (.cse1 (= (mod ~a$r_buff0_thd3~0_In1436144209 256) 0)) (.cse3 (= 0 (mod ~a$r_buff1_thd3~0_In1436144209 256))) (.cse2 (= 0 (mod ~a$w_buff1_used~0_In1436144209 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~a$r_buff1_thd3~0_In1436144209 |P2Thread1of1ForFork0_#t~ite43_Out1436144209|)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2))) (= 0 |P2Thread1of1ForFork0_#t~ite43_Out1436144209|)))) InVars {~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In1436144209, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1436144209, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In1436144209, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1436144209} OutVars{P2Thread1of1ForFork0_#t~ite43=|P2Thread1of1ForFork0_#t~ite43_Out1436144209|, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In1436144209, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1436144209, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In1436144209, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1436144209} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite43] because there is no mapped edge [2019-12-18 16:21:59,405 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [875] [875] L818-2-->P2EXIT: Formula: (and (= |v_P2Thread1of1ForFork0_#res.offset_5| 0) (= v_~a$r_buff1_thd3~0_149 |v_P2Thread1of1ForFork0_#t~ite43_38|) (= v_~__unbuffered_cnt~0_78 (+ v_~__unbuffered_cnt~0_79 1)) (= |v_P2Thread1of1ForFork0_#res.base_5| 0)) InVars {P2Thread1of1ForFork0_#t~ite43=|v_P2Thread1of1ForFork0_#t~ite43_38|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_79} OutVars{P2Thread1of1ForFork0_#res.base=|v_P2Thread1of1ForFork0_#res.base_5|, P2Thread1of1ForFork0_#t~ite43=|v_P2Thread1of1ForFork0_#t~ite43_37|, ~a$r_buff1_thd3~0=v_~a$r_buff1_thd3~0_149, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_78, P2Thread1of1ForFork0_#res.offset=|v_P2Thread1of1ForFork0_#res.offset_5|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#res.base, P2Thread1of1ForFork0_#t~ite43, ~a$r_buff1_thd3~0, ~__unbuffered_cnt~0, P2Thread1of1ForFork0_#res.offset] because there is no mapped edge [2019-12-18 16:21:59,405 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [801] [801] L841-1-->L847: Formula: (and (= 3 v_~__unbuffered_cnt~0_40) (= v_~main$tmp_guard0~0_9 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_40} OutVars{ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_40, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_9} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet46, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-18 16:21:59,406 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [835] [835] L847-2-->L847-4: Formula: (let ((.cse0 (= (mod ~a$w_buff1_used~0_In-1628770097 256) 0)) (.cse1 (= 0 (mod ~a$r_buff1_thd0~0_In-1628770097 256)))) (or (and (not .cse0) (not .cse1) (= ~a$w_buff1~0_In-1628770097 |ULTIMATE.start_main_#t~ite47_Out-1628770097|)) (and (= ~a~0_In-1628770097 |ULTIMATE.start_main_#t~ite47_Out-1628770097|) (or .cse0 .cse1)))) InVars {~a~0=~a~0_In-1628770097, ~a$w_buff1~0=~a$w_buff1~0_In-1628770097, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In-1628770097, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1628770097} OutVars{~a~0=~a~0_In-1628770097, ~a$w_buff1~0=~a$w_buff1~0_In-1628770097, ULTIMATE.start_main_#t~ite47=|ULTIMATE.start_main_#t~ite47_Out-1628770097|, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In-1628770097, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1628770097} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite47] because there is no mapped edge [2019-12-18 16:21:59,406 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [782] [782] L847-4-->L848: Formula: (= v_~a~0_39 |v_ULTIMATE.start_main_#t~ite47_15|) InVars {ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_15|} OutVars{~a~0=v_~a~0_39, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_14|, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_6|} AuxVars[] AssignedVars[~a~0, ULTIMATE.start_main_#t~ite47, ULTIMATE.start_main_#t~ite48] because there is no mapped edge [2019-12-18 16:21:59,406 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [839] [839] L848-->L848-2: Formula: (let ((.cse0 (= 0 (mod ~a$w_buff0_used~0_In-1362932148 256))) (.cse1 (= (mod ~a$r_buff0_thd0~0_In-1362932148 256) 0))) (or (and (= 0 |ULTIMATE.start_main_#t~ite49_Out-1362932148|) (not .cse0) (not .cse1)) (and (= ~a$w_buff0_used~0_In-1362932148 |ULTIMATE.start_main_#t~ite49_Out-1362932148|) (or .cse0 .cse1)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In-1362932148, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-1362932148} OutVars{~a$w_buff0_used~0=~a$w_buff0_used~0_In-1362932148, ULTIMATE.start_main_#t~ite49=|ULTIMATE.start_main_#t~ite49_Out-1362932148|, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-1362932148} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite49] because there is no mapped edge [2019-12-18 16:21:59,407 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [845] [845] L849-->L849-2: Formula: (let ((.cse0 (= 0 (mod ~a$w_buff0_used~0_In1009623919 256))) (.cse1 (= 0 (mod ~a$r_buff0_thd0~0_In1009623919 256))) (.cse2 (= (mod ~a$w_buff1_used~0_In1009623919 256) 0)) (.cse3 (= (mod ~a$r_buff1_thd0~0_In1009623919 256) 0))) (or (and (= ~a$w_buff1_used~0_In1009623919 |ULTIMATE.start_main_#t~ite50_Out1009623919|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite50_Out1009623919|)))) InVars {~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In1009623919, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1009623919, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In1009623919, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1009623919} OutVars{ULTIMATE.start_main_#t~ite50=|ULTIMATE.start_main_#t~ite50_Out1009623919|, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In1009623919, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1009623919, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In1009623919, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1009623919} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite50] because there is no mapped edge [2019-12-18 16:21:59,407 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [828] [828] L850-->L850-2: Formula: (let ((.cse0 (= 0 (mod ~a$r_buff0_thd0~0_In-1714678237 256))) (.cse1 (= (mod ~a$w_buff0_used~0_In-1714678237 256) 0))) (or (and (or .cse0 .cse1) (= ~a$r_buff0_thd0~0_In-1714678237 |ULTIMATE.start_main_#t~ite51_Out-1714678237|)) (and (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite51_Out-1714678237|) (not .cse1)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In-1714678237, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-1714678237} OutVars{ULTIMATE.start_main_#t~ite51=|ULTIMATE.start_main_#t~ite51_Out-1714678237|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1714678237, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-1714678237} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite51] because there is no mapped edge [2019-12-18 16:21:59,408 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [827] [827] L851-->L851-2: Formula: (let ((.cse0 (= 0 (mod ~a$r_buff0_thd0~0_In-211977962 256))) (.cse1 (= (mod ~a$w_buff0_used~0_In-211977962 256) 0)) (.cse3 (= (mod ~a$r_buff1_thd0~0_In-211977962 256) 0)) (.cse2 (= 0 (mod ~a$w_buff1_used~0_In-211977962 256)))) (or (and (or .cse0 .cse1) (= ~a$r_buff1_thd0~0_In-211977962 |ULTIMATE.start_main_#t~ite52_Out-211977962|) (or .cse2 .cse3)) (and (= 0 |ULTIMATE.start_main_#t~ite52_Out-211977962|) (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2)))))) InVars {~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In-211977962, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-211977962, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-211977962, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-211977962} OutVars{ULTIMATE.start_main_#t~ite52=|ULTIMATE.start_main_#t~ite52_Out-211977962|, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In-211977962, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-211977962, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-211977962, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-211977962} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52] because there is no mapped edge [2019-12-18 16:21:59,409 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [887] [887] L851-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= 1 v_~__unbuffered_p2_EAX~0_17) (= v_~__unbuffered_p1_EBX~0_17 0) (= 0 v_~__unbuffered_p0_EAX~0_39) (= v_~main$tmp_guard1~0_12 0) (= 1 v_~__unbuffered_p1_EAX~0_17) (= v_ULTIMATE.start___VERIFIER_assert_~expression_16 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_12|) (= |v_ULTIMATE.start_main_#t~ite52_30| v_~a$r_buff1_thd0~0_75) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_12| (mod v_~main$tmp_guard1~0_12 256)) (= v_~__unbuffered_p2_EBX~0_22 0)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_39, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_30|, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_17, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_22, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_17, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_17} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_39, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_29|, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_16, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_17, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_22, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_17, ~a$r_buff1_thd0~0=v_~a$r_buff1_thd0~0_75, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_12, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_17, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_12|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52, ULTIMATE.start___VERIFIER_assert_~expression, ~a$r_buff1_thd0~0, ~main$tmp_guard1~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-18 16:21:59,493 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.12 04:21:59 BasicIcfg [2019-12-18 16:21:59,493 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-18 16:21:59,495 INFO L168 Benchmark]: Toolchain (without parser) took 148278.80 ms. Allocated memory was 137.4 MB in the beginning and 4.2 GB in the end (delta: 4.1 GB). Free memory was 100.6 MB in the beginning and 1.2 GB in the end (delta: -1.1 GB). Peak memory consumption was 3.0 GB. Max. memory is 7.1 GB. [2019-12-18 16:21:59,496 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 137.4 MB. Free memory was 120.5 MB in the beginning and 120.3 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-12-18 16:21:59,496 INFO L168 Benchmark]: CACSL2BoogieTranslator took 754.23 ms. Allocated memory was 137.4 MB in the beginning and 201.3 MB in the end (delta: 64.0 MB). Free memory was 100.2 MB in the beginning and 154.4 MB in the end (delta: -54.2 MB). Peak memory consumption was 26.5 MB. Max. memory is 7.1 GB. [2019-12-18 16:21:59,497 INFO L168 Benchmark]: Boogie Procedure Inliner took 59.99 ms. Allocated memory is still 201.3 MB. Free memory was 154.4 MB in the beginning and 151.6 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. [2019-12-18 16:21:59,497 INFO L168 Benchmark]: Boogie Preprocessor took 54.86 ms. Allocated memory is still 201.3 MB. Free memory was 151.6 MB in the beginning and 149.5 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2019-12-18 16:21:59,497 INFO L168 Benchmark]: RCFGBuilder took 848.16 ms. Allocated memory is still 201.3 MB. Free memory was 149.5 MB in the beginning and 98.8 MB in the end (delta: 50.8 MB). Peak memory consumption was 50.8 MB. Max. memory is 7.1 GB. [2019-12-18 16:21:59,503 INFO L168 Benchmark]: TraceAbstraction took 146552.97 ms. Allocated memory was 201.3 MB in the beginning and 4.2 GB in the end (delta: 4.0 GB). Free memory was 98.1 MB in the beginning and 1.2 GB in the end (delta: -1.1 GB). Peak memory consumption was 2.9 GB. Max. memory is 7.1 GB. [2019-12-18 16:21:59,505 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.24 ms. Allocated memory is still 137.4 MB. Free memory was 120.5 MB in the beginning and 120.3 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 754.23 ms. Allocated memory was 137.4 MB in the beginning and 201.3 MB in the end (delta: 64.0 MB). Free memory was 100.2 MB in the beginning and 154.4 MB in the end (delta: -54.2 MB). Peak memory consumption was 26.5 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 59.99 ms. Allocated memory is still 201.3 MB. Free memory was 154.4 MB in the beginning and 151.6 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 54.86 ms. Allocated memory is still 201.3 MB. Free memory was 151.6 MB in the beginning and 149.5 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 848.16 ms. Allocated memory is still 201.3 MB. Free memory was 149.5 MB in the beginning and 98.8 MB in the end (delta: 50.8 MB). Peak memory consumption was 50.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 146552.97 ms. Allocated memory was 201.3 MB in the beginning and 4.2 GB in the end (delta: 4.0 GB). Free memory was 98.1 MB in the beginning and 1.2 GB in the end (delta: -1.1 GB). Peak memory consumption was 2.9 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 5.7s, 179 ProgramPointsBefore, 95 ProgramPointsAfterwards, 216 TransitionsBefore, 105 TransitionsAfterwards, 19004 CoEnabledTransitionPairs, 8 FixpointIterations, 36 TrivialSequentialCompositions, 48 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 32 ConcurrentYvCompositions, 31 ChoiceCompositions, 6646 VarBasedMoverChecksPositive, 237 VarBasedMoverChecksNegative, 59 SemBasedMoverChecksPositive, 236 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.4s, 0 MoverChecksTotal, 91218 CheckedPairsTotal, 116 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L837] FCALL, FORK 0 pthread_create(&t257, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L742] 1 a$r_buff1_thd0 = a$r_buff0_thd0 [L743] 1 a$r_buff1_thd1 = a$r_buff0_thd1 [L744] 1 a$r_buff1_thd2 = a$r_buff0_thd2 [L745] 1 a$r_buff1_thd3 = a$r_buff0_thd3 [L746] 1 a$r_buff0_thd1 = (_Bool)1 [L749] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L752] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L839] FCALL, FORK 0 pthread_create(&t258, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L766] 2 x = 1 [L769] 2 y = 1 [L772] 2 __unbuffered_p1_EAX = y [L775] 2 __unbuffered_p1_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L841] FCALL, FORK 0 pthread_create(&t259, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L778] 2 a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L792] 3 z = 1 [L795] 3 __unbuffered_p2_EAX = z [L798] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L799] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L800] 3 a$flush_delayed = weak$$choice2 [L801] 3 a$mem_tmp = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=1, z=1] [L802] EXPR 3 !a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff1) VAL [!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=1, z=1] [L752] 1 a = a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) [L753] 1 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L754] 1 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$w_buff1_used [L802] 3 a = !a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff1) [L803] 3 a$w_buff0 = weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff0)) [L804] EXPR 3 weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff1 : a$w_buff1)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff1 : a$w_buff1))=0, x=1, y=1, z=1] [L804] 3 a$w_buff1 = weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff1 : a$w_buff1)) [L805] 3 a$w_buff0_used = weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used)) [L806] EXPR 3 weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))=0, x=1, y=1, z=1] [L806] 3 a$w_buff1_used = weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L808] EXPR 3 weak$$choice2 ? a$r_buff1_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff1_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? a$r_buff1_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff1_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))=0, x=1, y=1, z=1] [L808] 3 a$r_buff1_thd3 = weak$$choice2 ? a$r_buff1_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff1_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L809] 3 __unbuffered_p2_EBX = a VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=1, z=1] [L814] EXPR 3 a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=1, z=1] [L814] 3 a = a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) [L815] 3 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used [L816] 3 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$w_buff1_used [L779] 2 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L780] 2 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used [L781] 2 a$r_buff0_thd2 = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L817] 3 a$r_buff0_thd3 = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3 [L847] 0 a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=1, z=1] [L848] 0 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L849] 0 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$w_buff1_used [L850] 0 a$r_buff0_thd0 = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 170 locations, 2 error locations. Result: UNSAFE, OverallTime: 146.2s, OverallIterations: 38, TraceHistogramMax: 1, AutomataDifference: 52.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 11031 SDtfs, 16890 SDslu, 41916 SDs, 0 SdLazy, 19939 SolverSat, 834 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 18.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 626 GetRequests, 96 SyntacticMatches, 26 SemanticMatches, 504 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2495 ImplicationChecksByTransitivity, 5.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=168271occurred in iteration=2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 61.4s AutomataMinimizationTime, 37 MinimizatonAttempts, 781241 StatesRemovedByMinimization, 34 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 3.0s InterpolantComputationTime, 1975 NumberOfCodeBlocks, 1975 NumberOfCodeBlocksAsserted, 38 NumberOfCheckSat, 1871 ConstructedInterpolants, 0 QuantifiedInterpolants, 426923 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 37 InterpolantComputations, 37 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...