/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/safe021_power.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-fae578e [2019-12-18 18:48:05,766 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-18 18:48:05,768 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-18 18:48:05,786 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-18 18:48:05,787 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-18 18:48:05,789 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-18 18:48:05,791 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-18 18:48:05,801 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-18 18:48:05,804 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-18 18:48:05,807 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-18 18:48:05,809 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-18 18:48:05,811 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-18 18:48:05,812 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-18 18:48:05,813 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-18 18:48:05,816 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-18 18:48:05,818 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-18 18:48:05,819 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-18 18:48:05,820 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-18 18:48:05,821 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-18 18:48:05,826 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-18 18:48:05,830 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-18 18:48:05,834 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-18 18:48:05,836 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-18 18:48:05,836 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-18 18:48:05,838 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-18 18:48:05,839 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-18 18:48:05,839 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-18 18:48:05,841 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-18 18:48:05,842 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-18 18:48:05,843 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-18 18:48:05,843 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-18 18:48:05,845 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-18 18:48:05,845 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-18 18:48:05,846 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-18 18:48:05,848 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-18 18:48:05,848 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-18 18:48:05,848 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-18 18:48:05,849 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-18 18:48:05,849 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-18 18:48:05,850 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-18 18:48:05,851 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-18 18:48:05,852 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 18:48:05,888 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-18 18:48:05,888 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-18 18:48:05,889 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-18 18:48:05,889 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-18 18:48:05,890 INFO L138 SettingsManager]: * Use SBE=true [2019-12-18 18:48:05,891 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-18 18:48:05,892 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-18 18:48:05,892 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-18 18:48:05,892 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-18 18:48:05,892 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-18 18:48:05,892 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-18 18:48:05,893 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-18 18:48:05,893 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-18 18:48:05,893 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-18 18:48:05,893 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-18 18:48:05,893 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-18 18:48:05,893 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-18 18:48:05,894 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-18 18:48:05,894 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-18 18:48:05,894 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-18 18:48:05,894 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-18 18:48:05,894 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 18:48:05,896 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-18 18:48:05,896 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-18 18:48:05,896 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-18 18:48:05,896 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-18 18:48:05,896 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-18 18:48:05,897 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-18 18:48:05,897 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-18 18:48:06,177 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-18 18:48:06,198 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-18 18:48:06,201 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-18 18:48:06,203 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-18 18:48:06,203 INFO L275 PluginConnector]: CDTParser initialized [2019-12-18 18:48:06,204 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe021_power.oepc.i [2019-12-18 18:48:06,276 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4ed381805/20576f7d5664413eb79ae7fe70fc59a7/FLAG17b36dee2 [2019-12-18 18:48:06,830 INFO L306 CDTParser]: Found 1 translation units. [2019-12-18 18:48:06,831 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe021_power.oepc.i [2019-12-18 18:48:06,860 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4ed381805/20576f7d5664413eb79ae7fe70fc59a7/FLAG17b36dee2 [2019-12-18 18:48:07,170 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4ed381805/20576f7d5664413eb79ae7fe70fc59a7 [2019-12-18 18:48:07,179 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-18 18:48:07,185 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-18 18:48:07,186 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-18 18:48:07,186 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-18 18:48:07,190 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-18 18:48:07,191 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 06:48:07" (1/1) ... [2019-12-18 18:48:07,194 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@13c8690e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 06:48:07, skipping insertion in model container [2019-12-18 18:48:07,194 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 06:48:07" (1/1) ... [2019-12-18 18:48:07,202 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-18 18:48:07,272 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-18 18:48:08,041 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 18:48:08,062 INFO L203 MainTranslator]: Completed pre-run [2019-12-18 18:48:08,156 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 18:48:08,235 INFO L208 MainTranslator]: Completed translation [2019-12-18 18:48:08,236 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 06:48:08 WrapperNode [2019-12-18 18:48:08,236 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-18 18:48:08,237 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-18 18:48:08,237 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-18 18:48:08,237 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-18 18:48:08,246 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 06:48:08" (1/1) ... [2019-12-18 18:48:08,279 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 06:48:08" (1/1) ... [2019-12-18 18:48:08,311 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-18 18:48:08,312 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-18 18:48:08,312 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-18 18:48:08,312 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-18 18:48:08,325 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 06:48:08" (1/1) ... [2019-12-18 18:48:08,325 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 06:48:08" (1/1) ... [2019-12-18 18:48:08,342 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 06:48:08" (1/1) ... [2019-12-18 18:48:08,342 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 06:48:08" (1/1) ... [2019-12-18 18:48:08,367 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 06:48:08" (1/1) ... [2019-12-18 18:48:08,371 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 06:48:08" (1/1) ... [2019-12-18 18:48:08,378 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 06:48:08" (1/1) ... [2019-12-18 18:48:08,383 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-18 18:48:08,383 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-18 18:48:08,384 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-18 18:48:08,390 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-18 18:48:08,391 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 06:48:08" (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 18:48:08,459 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-18 18:48:08,459 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-18 18:48:08,460 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-18 18:48:08,460 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-18 18:48:08,460 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-18 18:48:08,460 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-18 18:48:08,461 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-18 18:48:08,461 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-18 18:48:08,461 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-18 18:48:08,461 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-18 18:48:08,461 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-18 18:48:08,462 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-18 18:48:08,462 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-18 18:48:08,465 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 18:48:09,256 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-18 18:48:09,256 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-18 18:48:09,257 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 06:48:09 BoogieIcfgContainer [2019-12-18 18:48:09,258 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-18 18:48:09,260 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-18 18:48:09,260 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-18 18:48:09,265 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-18 18:48:09,265 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 06:48:07" (1/3) ... [2019-12-18 18:48:09,266 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b0128f7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 06:48:09, skipping insertion in model container [2019-12-18 18:48:09,268 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 06:48:08" (2/3) ... [2019-12-18 18:48:09,269 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b0128f7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 06:48:09, skipping insertion in model container [2019-12-18 18:48:09,269 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 06:48:09" (3/3) ... [2019-12-18 18:48:09,271 INFO L109 eAbstractionObserver]: Analyzing ICFG safe021_power.oepc.i [2019-12-18 18:48:09,282 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-18 18:48:09,282 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-18 18:48:09,294 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-18 18:48:09,295 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-18 18:48:09,336 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:09,336 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:09,336 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:09,336 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:09,337 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:09,337 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:09,337 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:09,352 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:09,354 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:09,354 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:09,354 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:09,354 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:09,355 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:09,355 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:09,355 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:09,355 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:09,356 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:09,356 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:09,356 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:09,356 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:09,357 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:09,357 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:09,357 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:09,357 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:09,357 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:09,358 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:09,358 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:09,358 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:09,358 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:09,359 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:09,359 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:09,359 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:09,359 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:09,359 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:09,360 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:09,360 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:09,360 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:09,360 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:09,361 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:09,361 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:09,361 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:09,361 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:09,362 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:09,362 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:09,362 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:09,362 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:09,363 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:09,363 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:09,363 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:09,363 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:09,363 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:09,364 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:09,364 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:09,364 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:09,364 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:09,364 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:09,365 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:09,365 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:09,365 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:09,365 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:09,365 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:09,366 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:09,366 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:09,366 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:09,367 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:09,367 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:09,367 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:09,368 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:09,368 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:09,368 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:09,368 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:09,368 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:09,369 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:09,369 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:09,369 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:09,369 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:09,370 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:09,370 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:09,370 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:09,370 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:09,370 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:09,371 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:09,371 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:09,371 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:09,371 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:09,371 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:09,372 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:09,372 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:09,372 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:09,372 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:09,372 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:09,373 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:09,373 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:09,373 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:09,373 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:09,373 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:09,374 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:09,374 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:09,374 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:09,374 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:09,374 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:09,375 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:09,375 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:09,375 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:09,375 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:09,376 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:09,376 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:09,376 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:09,376 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:09,376 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:09,377 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:09,377 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:09,377 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:09,377 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:09,377 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:09,378 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:09,378 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:09,378 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:09,378 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:09,378 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:09,379 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:09,379 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:09,379 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:09,379 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:09,380 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:09,380 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:09,380 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:09,380 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:09,380 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:09,381 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:09,381 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:09,381 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:09,381 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:09,381 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:09,382 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:09,382 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:09,382 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:09,382 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:09,383 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:09,383 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:09,383 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:09,383 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:09,383 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:09,383 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:09,384 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:09,384 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:09,384 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:09,384 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:09,387 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:09,387 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:09,387 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:09,387 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:09,388 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:09,388 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:09,388 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:09,388 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:09,388 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:09,388 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:09,388 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:09,388 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:09,389 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:09,389 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:09,389 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:09,389 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:09,389 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:09,390 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:09,390 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:09,390 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:09,390 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:09,390 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:09,391 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:09,391 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:09,392 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:09,392 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:09,392 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:09,392 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:09,393 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:09,393 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:09,393 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:09,393 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:09,394 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:09,394 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:09,397 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:09,397 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:09,398 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:09,398 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:09,398 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:09,398 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:09,398 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:09,399 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:09,399 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:09,399 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:09,399 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:09,399 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:09,402 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:09,402 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:09,403 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:09,403 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:09,403 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:09,403 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:09,403 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:09,403 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:09,404 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:09,404 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:09,406 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:09,406 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:09,406 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:09,407 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:09,407 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:09,407 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:09,407 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:09,407 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:09,407 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:09,408 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:09,408 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:09,408 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:09,408 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:09,408 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:09,409 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:09,409 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:09,409 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:09,409 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:09,409 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:09,410 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:09,410 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:09,410 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:09,410 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:09,410 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:09,411 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:09,411 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:09,411 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:09,411 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:09,412 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:09,412 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:09,412 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:09,412 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:09,412 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:48:09,432 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-18 18:48:09,452 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-18 18:48:09,453 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-18 18:48:09,453 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-18 18:48:09,453 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-18 18:48:09,453 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-18 18:48:09,453 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-18 18:48:09,454 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-18 18:48:09,454 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-18 18:48:09,471 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 175 places, 212 transitions [2019-12-18 18:48:09,473 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 175 places, 212 transitions [2019-12-18 18:48:09,562 INFO L126 PetriNetUnfolder]: 47/209 cut-off events. [2019-12-18 18:48:09,562 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 18:48:09,582 INFO L76 FinitePrefix]: Finished finitePrefix Result has 219 conditions, 209 events. 47/209 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 437 event pairs. 9/169 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-18 18:48:09,613 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 175 places, 212 transitions [2019-12-18 18:48:09,661 INFO L126 PetriNetUnfolder]: 47/209 cut-off events. [2019-12-18 18:48:09,661 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 18:48:09,671 INFO L76 FinitePrefix]: Finished finitePrefix Result has 219 conditions, 209 events. 47/209 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 437 event pairs. 9/169 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-18 18:48:09,698 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 19004 [2019-12-18 18:48:09,699 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-18 18:48:15,236 WARN L192 SmtUtils]: Spent 265.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 87 [2019-12-18 18:48:15,362 WARN L192 SmtUtils]: Spent 123.00 ms on a formula simplification that was a NOOP. DAG size: 85 [2019-12-18 18:48:15,710 INFO L206 etLargeBlockEncoding]: Checked pairs total: 125946 [2019-12-18 18:48:15,710 INFO L214 etLargeBlockEncoding]: Total number of compositions: 121 [2019-12-18 18:48:15,714 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 92 places, 102 transitions [2019-12-18 18:48:34,250 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 111572 states. [2019-12-18 18:48:34,252 INFO L276 IsEmpty]: Start isEmpty. Operand 111572 states. [2019-12-18 18:48:34,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-18 18:48:34,257 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:48:34,257 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-18 18:48:34,258 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 18:48:34,263 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:48:34,263 INFO L82 PathProgramCache]: Analyzing trace with hash 912834, now seen corresponding path program 1 times [2019-12-18 18:48:34,270 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:48:34,270 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [162570660] [2019-12-18 18:48:34,271 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:48:34,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:48:34,484 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 18:48:34,484 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [162570660] [2019-12-18 18:48:34,485 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:48:34,485 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 18:48:34,486 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1747597584] [2019-12-18 18:48:34,491 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 18:48:34,491 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:48:34,506 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 18:48:34,507 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 18:48:34,509 INFO L87 Difference]: Start difference. First operand 111572 states. Second operand 3 states. [2019-12-18 18:48:38,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:48:38,133 INFO L93 Difference]: Finished difference Result 110910 states and 474711 transitions. [2019-12-18 18:48:38,133 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 18:48:38,135 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-18 18:48:38,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:48:38,809 INFO L225 Difference]: With dead ends: 110910 [2019-12-18 18:48:38,809 INFO L226 Difference]: Without dead ends: 98066 [2019-12-18 18:48:38,811 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 18:48:42,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98066 states. [2019-12-18 18:48:44,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98066 to 98066. [2019-12-18 18:48:44,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98066 states. [2019-12-18 18:48:48,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98066 states to 98066 states and 418629 transitions. [2019-12-18 18:48:48,679 INFO L78 Accepts]: Start accepts. Automaton has 98066 states and 418629 transitions. Word has length 3 [2019-12-18 18:48:48,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:48:48,679 INFO L462 AbstractCegarLoop]: Abstraction has 98066 states and 418629 transitions. [2019-12-18 18:48:48,679 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 18:48:48,679 INFO L276 IsEmpty]: Start isEmpty. Operand 98066 states and 418629 transitions. [2019-12-18 18:48:48,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-18 18:48:48,683 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:48:48,683 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 18:48:48,684 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 18:48:48,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:48:48,684 INFO L82 PathProgramCache]: Analyzing trace with hash 1027484309, now seen corresponding path program 1 times [2019-12-18 18:48:48,685 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:48:48,685 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1645277507] [2019-12-18 18:48:48,685 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:48:48,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:48:48,808 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 18:48:48,808 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1645277507] [2019-12-18 18:48:48,810 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:48:48,810 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 18:48:48,811 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1964019622] [2019-12-18 18:48:48,812 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 18:48:48,813 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:48:48,813 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 18:48:48,813 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 18:48:48,813 INFO L87 Difference]: Start difference. First operand 98066 states and 418629 transitions. Second operand 4 states. [2019-12-18 18:48:53,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:48:53,764 INFO L93 Difference]: Finished difference Result 156656 states and 639635 transitions. [2019-12-18 18:48:53,764 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 18:48:53,764 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-18 18:48:53,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:48:54,405 INFO L225 Difference]: With dead ends: 156656 [2019-12-18 18:48:54,405 INFO L226 Difference]: Without dead ends: 156558 [2019-12-18 18:48:54,406 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 18:48:58,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156558 states. [2019-12-18 18:49:02,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156558 to 142946. [2019-12-18 18:49:02,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142946 states. [2019-12-18 18:49:02,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142946 states to 142946 states and 591329 transitions. [2019-12-18 18:49:02,605 INFO L78 Accepts]: Start accepts. Automaton has 142946 states and 591329 transitions. Word has length 11 [2019-12-18 18:49:02,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:49:02,605 INFO L462 AbstractCegarLoop]: Abstraction has 142946 states and 591329 transitions. [2019-12-18 18:49:02,605 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 18:49:02,605 INFO L276 IsEmpty]: Start isEmpty. Operand 142946 states and 591329 transitions. [2019-12-18 18:49:02,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-18 18:49:02,610 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:49:02,611 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 18:49:02,611 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 18:49:02,611 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:49:02,611 INFO L82 PathProgramCache]: Analyzing trace with hash 1461043352, now seen corresponding path program 1 times [2019-12-18 18:49:02,611 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:49:02,612 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [640261727] [2019-12-18 18:49:02,612 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:49:02,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:49:02,675 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 18:49:02,676 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [640261727] [2019-12-18 18:49:02,676 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:49:02,676 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 18:49:02,676 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2060455207] [2019-12-18 18:49:02,676 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 18:49:02,677 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:49:02,677 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 18:49:02,677 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 18:49:02,677 INFO L87 Difference]: Start difference. First operand 142946 states and 591329 transitions. Second operand 3 states. [2019-12-18 18:49:06,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:49:06,972 INFO L93 Difference]: Finished difference Result 31386 states and 102018 transitions. [2019-12-18 18:49:06,972 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 18:49:06,972 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-18 18:49:06,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:49:07,023 INFO L225 Difference]: With dead ends: 31386 [2019-12-18 18:49:07,024 INFO L226 Difference]: Without dead ends: 31386 [2019-12-18 18:49:07,024 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 18:49:07,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31386 states. [2019-12-18 18:49:07,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31386 to 31386. [2019-12-18 18:49:07,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31386 states. [2019-12-18 18:49:07,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31386 states to 31386 states and 102018 transitions. [2019-12-18 18:49:07,581 INFO L78 Accepts]: Start accepts. Automaton has 31386 states and 102018 transitions. Word has length 13 [2019-12-18 18:49:07,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:49:07,581 INFO L462 AbstractCegarLoop]: Abstraction has 31386 states and 102018 transitions. [2019-12-18 18:49:07,582 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 18:49:07,582 INFO L276 IsEmpty]: Start isEmpty. Operand 31386 states and 102018 transitions. [2019-12-18 18:49:07,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-18 18:49:07,584 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:49:07,584 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 18:49:07,585 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 18:49:07,585 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:49:07,585 INFO L82 PathProgramCache]: Analyzing trace with hash -876468662, now seen corresponding path program 1 times [2019-12-18 18:49:07,585 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:49:07,586 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [630852777] [2019-12-18 18:49:07,586 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:49:07,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:49:07,681 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 18:49:07,682 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [630852777] [2019-12-18 18:49:07,682 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:49:07,682 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 18:49:07,682 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [141208816] [2019-12-18 18:49:07,683 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 18:49:07,683 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:49:07,683 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 18:49:07,683 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-18 18:49:07,684 INFO L87 Difference]: Start difference. First operand 31386 states and 102018 transitions. Second operand 5 states. [2019-12-18 18:49:08,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:49:08,211 INFO L93 Difference]: Finished difference Result 43205 states and 138515 transitions. [2019-12-18 18:49:08,212 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 18:49:08,212 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2019-12-18 18:49:08,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:49:08,276 INFO L225 Difference]: With dead ends: 43205 [2019-12-18 18:49:08,276 INFO L226 Difference]: Without dead ends: 43205 [2019-12-18 18:49:08,276 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 18:49:08,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43205 states. [2019-12-18 18:49:09,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43205 to 36470. [2019-12-18 18:49:09,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36470 states. [2019-12-18 18:49:09,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36470 states to 36470 states and 117941 transitions. [2019-12-18 18:49:09,214 INFO L78 Accepts]: Start accepts. Automaton has 36470 states and 117941 transitions. Word has length 16 [2019-12-18 18:49:09,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:49:09,215 INFO L462 AbstractCegarLoop]: Abstraction has 36470 states and 117941 transitions. [2019-12-18 18:49:09,215 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 18:49:09,216 INFO L276 IsEmpty]: Start isEmpty. Operand 36470 states and 117941 transitions. [2019-12-18 18:49:09,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-18 18:49:09,225 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:49:09,225 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 18:49:09,226 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 18:49:09,226 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:49:09,226 INFO L82 PathProgramCache]: Analyzing trace with hash -1783143627, now seen corresponding path program 1 times [2019-12-18 18:49:09,226 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:49:09,227 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [505832649] [2019-12-18 18:49:09,227 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:49:09,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:49:09,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 18:49:09,377 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [505832649] [2019-12-18 18:49:09,378 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:49:09,378 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 18:49:09,378 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2033946811] [2019-12-18 18:49:09,378 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 18:49:09,379 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:49:09,380 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 18:49:09,380 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-18 18:49:09,380 INFO L87 Difference]: Start difference. First operand 36470 states and 117941 transitions. Second operand 6 states. [2019-12-18 18:49:10,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:49:10,365 INFO L93 Difference]: Finished difference Result 56051 states and 176371 transitions. [2019-12-18 18:49:10,365 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 18:49:10,365 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2019-12-18 18:49:10,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:49:10,455 INFO L225 Difference]: With dead ends: 56051 [2019-12-18 18:49:10,455 INFO L226 Difference]: Without dead ends: 56037 [2019-12-18 18:49:10,455 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2019-12-18 18:49:10,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56037 states. [2019-12-18 18:49:11,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56037 to 37420. [2019-12-18 18:49:11,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37420 states. [2019-12-18 18:49:11,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37420 states to 37420 states and 120221 transitions. [2019-12-18 18:49:11,469 INFO L78 Accepts]: Start accepts. Automaton has 37420 states and 120221 transitions. Word has length 22 [2019-12-18 18:49:11,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:49:11,470 INFO L462 AbstractCegarLoop]: Abstraction has 37420 states and 120221 transitions. [2019-12-18 18:49:11,470 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 18:49:11,470 INFO L276 IsEmpty]: Start isEmpty. Operand 37420 states and 120221 transitions. [2019-12-18 18:49:11,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 18:49:11,484 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:49:11,484 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 18:49:11,484 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 18:49:11,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:49:11,484 INFO L82 PathProgramCache]: Analyzing trace with hash 1148876988, now seen corresponding path program 1 times [2019-12-18 18:49:11,485 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:49:11,485 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1285857728] [2019-12-18 18:49:11,485 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:49:11,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:49:11,548 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 18:49:11,549 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1285857728] [2019-12-18 18:49:11,549 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:49:11,549 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 18:49:11,550 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [799792125] [2019-12-18 18:49:11,550 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 18:49:11,550 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:49:11,550 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 18:49:11,551 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 18:49:11,551 INFO L87 Difference]: Start difference. First operand 37420 states and 120221 transitions. Second operand 4 states. [2019-12-18 18:49:11,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:49:11,609 INFO L93 Difference]: Finished difference Result 15281 states and 46378 transitions. [2019-12-18 18:49:11,609 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 18:49:11,609 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2019-12-18 18:49:11,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:49:11,629 INFO L225 Difference]: With dead ends: 15281 [2019-12-18 18:49:11,630 INFO L226 Difference]: Without dead ends: 15281 [2019-12-18 18:49:11,630 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 18:49:11,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15281 states. [2019-12-18 18:49:11,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15281 to 15023. [2019-12-18 18:49:11,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15023 states. [2019-12-18 18:49:11,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15023 states to 15023 states and 45642 transitions. [2019-12-18 18:49:11,851 INFO L78 Accepts]: Start accepts. Automaton has 15023 states and 45642 transitions. Word has length 25 [2019-12-18 18:49:11,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:49:11,852 INFO L462 AbstractCegarLoop]: Abstraction has 15023 states and 45642 transitions. [2019-12-18 18:49:11,852 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 18:49:11,852 INFO L276 IsEmpty]: Start isEmpty. Operand 15023 states and 45642 transitions. [2019-12-18 18:49:11,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-18 18:49:11,862 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:49:11,862 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 18:49:11,862 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 18:49:11,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:49:11,863 INFO L82 PathProgramCache]: Analyzing trace with hash -1026533913, now seen corresponding path program 1 times [2019-12-18 18:49:11,863 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:49:11,863 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1384392149] [2019-12-18 18:49:11,863 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:49:11,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:49:11,959 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 18:49:11,960 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1384392149] [2019-12-18 18:49:11,960 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:49:11,960 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 18:49:11,960 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2124354540] [2019-12-18 18:49:11,961 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 18:49:11,961 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:49:11,961 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 18:49:11,962 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-18 18:49:11,962 INFO L87 Difference]: Start difference. First operand 15023 states and 45642 transitions. Second operand 6 states. [2019-12-18 18:49:12,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:49:12,646 INFO L93 Difference]: Finished difference Result 21679 states and 63968 transitions. [2019-12-18 18:49:12,646 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-18 18:49:12,646 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2019-12-18 18:49:12,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:49:12,679 INFO L225 Difference]: With dead ends: 21679 [2019-12-18 18:49:12,679 INFO L226 Difference]: Without dead ends: 21679 [2019-12-18 18:49:12,680 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 18:49:12,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21679 states. [2019-12-18 18:49:12,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21679 to 17339. [2019-12-18 18:49:12,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17339 states. [2019-12-18 18:49:12,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17339 states to 17339 states and 52223 transitions. [2019-12-18 18:49:12,963 INFO L78 Accepts]: Start accepts. Automaton has 17339 states and 52223 transitions. Word has length 27 [2019-12-18 18:49:12,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:49:12,964 INFO L462 AbstractCegarLoop]: Abstraction has 17339 states and 52223 transitions. [2019-12-18 18:49:12,964 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 18:49:12,964 INFO L276 IsEmpty]: Start isEmpty. Operand 17339 states and 52223 transitions. [2019-12-18 18:49:12,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-18 18:49:12,980 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:49:12,981 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 18:49:12,981 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 18:49:12,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:49:12,981 INFO L82 PathProgramCache]: Analyzing trace with hash 1079552274, now seen corresponding path program 1 times [2019-12-18 18:49:12,981 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:49:12,981 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1536142966] [2019-12-18 18:49:12,982 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:49:13,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:49:13,097 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 18:49:13,097 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1536142966] [2019-12-18 18:49:13,098 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:49:13,098 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 18:49:13,098 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1837129599] [2019-12-18 18:49:13,098 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 18:49:13,099 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:49:13,099 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 18:49:13,099 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-18 18:49:13,099 INFO L87 Difference]: Start difference. First operand 17339 states and 52223 transitions. Second operand 7 states. [2019-12-18 18:49:14,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:49:14,371 INFO L93 Difference]: Finished difference Result 24589 states and 72044 transitions. [2019-12-18 18:49:14,372 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-18 18:49:14,372 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 33 [2019-12-18 18:49:14,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:49:14,404 INFO L225 Difference]: With dead ends: 24589 [2019-12-18 18:49:14,404 INFO L226 Difference]: Without dead ends: 24589 [2019-12-18 18:49:14,404 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=90, Invalid=252, Unknown=0, NotChecked=0, Total=342 [2019-12-18 18:49:14,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24589 states. [2019-12-18 18:49:14,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24589 to 16666. [2019-12-18 18:49:14,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16666 states. [2019-12-18 18:49:14,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16666 states to 16666 states and 50150 transitions. [2019-12-18 18:49:14,697 INFO L78 Accepts]: Start accepts. Automaton has 16666 states and 50150 transitions. Word has length 33 [2019-12-18 18:49:14,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:49:14,697 INFO L462 AbstractCegarLoop]: Abstraction has 16666 states and 50150 transitions. [2019-12-18 18:49:14,697 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 18:49:14,697 INFO L276 IsEmpty]: Start isEmpty. Operand 16666 states and 50150 transitions. [2019-12-18 18:49:14,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-18 18:49:14,719 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:49:14,719 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 18:49:14,719 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 18:49:14,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:49:14,720 INFO L82 PathProgramCache]: Analyzing trace with hash 1641373212, now seen corresponding path program 1 times [2019-12-18 18:49:14,720 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:49:14,720 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [66632229] [2019-12-18 18:49:14,720 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:49:14,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:49:15,003 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 18:49:15,003 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [66632229] [2019-12-18 18:49:15,003 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:49:15,004 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 18:49:15,004 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1902526686] [2019-12-18 18:49:15,004 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 18:49:15,004 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:49:15,005 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 18:49:15,006 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 18:49:15,006 INFO L87 Difference]: Start difference. First operand 16666 states and 50150 transitions. Second operand 3 states. [2019-12-18 18:49:15,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:49:15,076 INFO L93 Difference]: Finished difference Result 16665 states and 50148 transitions. [2019-12-18 18:49:15,077 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 18:49:15,077 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2019-12-18 18:49:15,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:49:15,106 INFO L225 Difference]: With dead ends: 16665 [2019-12-18 18:49:15,106 INFO L226 Difference]: Without dead ends: 16665 [2019-12-18 18:49:15,106 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 18:49:15,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16665 states. [2019-12-18 18:49:15,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16665 to 16665. [2019-12-18 18:49:15,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16665 states. [2019-12-18 18:49:15,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16665 states to 16665 states and 50148 transitions. [2019-12-18 18:49:15,371 INFO L78 Accepts]: Start accepts. Automaton has 16665 states and 50148 transitions. Word has length 39 [2019-12-18 18:49:15,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:49:15,372 INFO L462 AbstractCegarLoop]: Abstraction has 16665 states and 50148 transitions. [2019-12-18 18:49:15,372 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 18:49:15,372 INFO L276 IsEmpty]: Start isEmpty. Operand 16665 states and 50148 transitions. [2019-12-18 18:49:15,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-18 18:49:15,395 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:49:15,395 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 18:49:15,396 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 18:49:15,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:49:15,396 INFO L82 PathProgramCache]: Analyzing trace with hash 1450973103, now seen corresponding path program 1 times [2019-12-18 18:49:15,396 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:49:15,396 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [861550660] [2019-12-18 18:49:15,396 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:49:15,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:49:15,465 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 18:49:15,466 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [861550660] [2019-12-18 18:49:15,466 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:49:15,466 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 18:49:15,467 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1813559949] [2019-12-18 18:49:15,467 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 18:49:15,467 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:49:15,467 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 18:49:15,468 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 18:49:15,468 INFO L87 Difference]: Start difference. First operand 16665 states and 50148 transitions. Second operand 4 states. [2019-12-18 18:49:15,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:49:15,611 INFO L93 Difference]: Finished difference Result 31503 states and 94864 transitions. [2019-12-18 18:49:15,611 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 18:49:15,611 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 40 [2019-12-18 18:49:15,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:49:15,647 INFO L225 Difference]: With dead ends: 31503 [2019-12-18 18:49:15,647 INFO L226 Difference]: Without dead ends: 16332 [2019-12-18 18:49:15,647 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 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 18:49:15,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16332 states. [2019-12-18 18:49:15,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16332 to 16328. [2019-12-18 18:49:15,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16328 states. [2019-12-18 18:49:15,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16328 states to 16328 states and 48458 transitions. [2019-12-18 18:49:15,961 INFO L78 Accepts]: Start accepts. Automaton has 16328 states and 48458 transitions. Word has length 40 [2019-12-18 18:49:15,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:49:15,961 INFO L462 AbstractCegarLoop]: Abstraction has 16328 states and 48458 transitions. [2019-12-18 18:49:15,961 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 18:49:15,961 INFO L276 IsEmpty]: Start isEmpty. Operand 16328 states and 48458 transitions. [2019-12-18 18:49:15,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-18 18:49:15,979 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:49:15,979 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 18:49:15,979 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 18:49:15,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:49:15,979 INFO L82 PathProgramCache]: Analyzing trace with hash -1753570543, now seen corresponding path program 2 times [2019-12-18 18:49:15,980 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:49:15,980 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [426516365] [2019-12-18 18:49:15,980 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:49:15,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:49:16,088 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 18:49:16,089 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [426516365] [2019-12-18 18:49:16,089 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:49:16,089 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 18:49:16,090 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [567652367] [2019-12-18 18:49:16,090 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 18:49:16,090 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:49:16,091 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 18:49:16,091 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 18:49:16,091 INFO L87 Difference]: Start difference. First operand 16328 states and 48458 transitions. Second operand 5 states. [2019-12-18 18:49:16,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:49:16,710 INFO L93 Difference]: Finished difference Result 22499 states and 66522 transitions. [2019-12-18 18:49:16,711 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 18:49:16,711 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 40 [2019-12-18 18:49:16,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:49:16,742 INFO L225 Difference]: With dead ends: 22499 [2019-12-18 18:49:16,742 INFO L226 Difference]: Without dead ends: 22499 [2019-12-18 18:49:16,743 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-18 18:49:16,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22499 states. [2019-12-18 18:49:17,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22499 to 21006. [2019-12-18 18:49:17,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21006 states. [2019-12-18 18:49:17,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21006 states to 21006 states and 62454 transitions. [2019-12-18 18:49:17,226 INFO L78 Accepts]: Start accepts. Automaton has 21006 states and 62454 transitions. Word has length 40 [2019-12-18 18:49:17,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:49:17,226 INFO L462 AbstractCegarLoop]: Abstraction has 21006 states and 62454 transitions. [2019-12-18 18:49:17,226 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 18:49:17,227 INFO L276 IsEmpty]: Start isEmpty. Operand 21006 states and 62454 transitions. [2019-12-18 18:49:17,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-18 18:49:17,246 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:49:17,246 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 18:49:17,246 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 18:49:17,246 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:49:17,247 INFO L82 PathProgramCache]: Analyzing trace with hash 1960596885, now seen corresponding path program 3 times [2019-12-18 18:49:17,247 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:49:17,247 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1270187588] [2019-12-18 18:49:17,247 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:49:17,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:49:17,308 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 18:49:17,309 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1270187588] [2019-12-18 18:49:17,309 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:49:17,309 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 18:49:17,309 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1113228311] [2019-12-18 18:49:17,310 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 18:49:17,310 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:49:17,310 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 18:49:17,310 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-18 18:49:17,310 INFO L87 Difference]: Start difference. First operand 21006 states and 62454 transitions. Second operand 5 states. [2019-12-18 18:49:17,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:49:17,413 INFO L93 Difference]: Finished difference Result 19781 states and 59627 transitions. [2019-12-18 18:49:17,413 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 18:49:17,413 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 40 [2019-12-18 18:49:17,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:49:17,447 INFO L225 Difference]: With dead ends: 19781 [2019-12-18 18:49:17,447 INFO L226 Difference]: Without dead ends: 19287 [2019-12-18 18:49:17,448 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 18:49:17,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19287 states. [2019-12-18 18:49:17,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19287 to 18447. [2019-12-18 18:49:17,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18447 states. [2019-12-18 18:49:17,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18447 states to 18447 states and 56396 transitions. [2019-12-18 18:49:17,729 INFO L78 Accepts]: Start accepts. Automaton has 18447 states and 56396 transitions. Word has length 40 [2019-12-18 18:49:17,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:49:17,730 INFO L462 AbstractCegarLoop]: Abstraction has 18447 states and 56396 transitions. [2019-12-18 18:49:17,730 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 18:49:17,730 INFO L276 IsEmpty]: Start isEmpty. Operand 18447 states and 56396 transitions. [2019-12-18 18:49:17,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-18 18:49:17,750 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:49:17,751 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 18:49:17,751 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 18:49:17,751 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:49:17,751 INFO L82 PathProgramCache]: Analyzing trace with hash -48564843, now seen corresponding path program 1 times [2019-12-18 18:49:17,751 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:49:17,752 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1659466848] [2019-12-18 18:49:17,752 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:49:17,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:49:17,795 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 18:49:17,795 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1659466848] [2019-12-18 18:49:17,795 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:49:17,795 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 18:49:17,796 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1813661416] [2019-12-18 18:49:17,796 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 18:49:17,796 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:49:17,796 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 18:49:17,797 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 18:49:17,797 INFO L87 Difference]: Start difference. First operand 18447 states and 56396 transitions. Second operand 3 states. [2019-12-18 18:49:17,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:49:17,921 INFO L93 Difference]: Finished difference Result 27408 states and 83933 transitions. [2019-12-18 18:49:17,921 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 18:49:17,922 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 64 [2019-12-18 18:49:17,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:49:17,958 INFO L225 Difference]: With dead ends: 27408 [2019-12-18 18:49:17,958 INFO L226 Difference]: Without dead ends: 27408 [2019-12-18 18:49:17,958 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 18:49:18,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27408 states. [2019-12-18 18:49:18,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27408 to 20833. [2019-12-18 18:49:18,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20833 states. [2019-12-18 18:49:18,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20833 states to 20833 states and 64483 transitions. [2019-12-18 18:49:18,312 INFO L78 Accepts]: Start accepts. Automaton has 20833 states and 64483 transitions. Word has length 64 [2019-12-18 18:49:18,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:49:18,312 INFO L462 AbstractCegarLoop]: Abstraction has 20833 states and 64483 transitions. [2019-12-18 18:49:18,313 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 18:49:18,313 INFO L276 IsEmpty]: Start isEmpty. Operand 20833 states and 64483 transitions. [2019-12-18 18:49:18,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-18 18:49:18,342 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:49:18,342 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 18:49:18,342 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 18:49:18,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:49:18,343 INFO L82 PathProgramCache]: Analyzing trace with hash -1559426519, now seen corresponding path program 1 times [2019-12-18 18:49:18,343 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:49:18,343 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1931413231] [2019-12-18 18:49:18,343 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:49:18,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:49:18,473 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 18:49:18,473 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1931413231] [2019-12-18 18:49:18,473 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:49:18,474 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 18:49:18,474 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [355882877] [2019-12-18 18:49:18,474 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 18:49:18,474 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:49:18,475 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 18:49:18,475 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-18 18:49:18,475 INFO L87 Difference]: Start difference. First operand 20833 states and 64483 transitions. Second operand 7 states. [2019-12-18 18:49:19,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:49:19,143 INFO L93 Difference]: Finished difference Result 61323 states and 187457 transitions. [2019-12-18 18:49:19,144 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 18:49:19,144 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 64 [2019-12-18 18:49:19,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:49:19,203 INFO L225 Difference]: With dead ends: 61323 [2019-12-18 18:49:19,203 INFO L226 Difference]: Without dead ends: 42147 [2019-12-18 18:49:19,204 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2019-12-18 18:49:19,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42147 states. [2019-12-18 18:49:19,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42147 to 23713. [2019-12-18 18:49:19,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23713 states. [2019-12-18 18:49:19,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23713 states to 23713 states and 73274 transitions. [2019-12-18 18:49:19,697 INFO L78 Accepts]: Start accepts. Automaton has 23713 states and 73274 transitions. Word has length 64 [2019-12-18 18:49:19,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:49:19,698 INFO L462 AbstractCegarLoop]: Abstraction has 23713 states and 73274 transitions. [2019-12-18 18:49:19,698 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 18:49:19,698 INFO L276 IsEmpty]: Start isEmpty. Operand 23713 states and 73274 transitions. [2019-12-18 18:49:19,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-18 18:49:19,725 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:49:19,725 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 18:49:19,725 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 18:49:19,725 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:49:19,725 INFO L82 PathProgramCache]: Analyzing trace with hash 1388462743, now seen corresponding path program 2 times [2019-12-18 18:49:19,725 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:49:19,725 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2042050801] [2019-12-18 18:49:19,726 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:49:19,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:49:19,822 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 18:49:19,822 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2042050801] [2019-12-18 18:49:19,823 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:49:19,823 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 18:49:19,823 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1468873661] [2019-12-18 18:49:19,823 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 18:49:19,823 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:49:19,824 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 18:49:19,824 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-18 18:49:19,824 INFO L87 Difference]: Start difference. First operand 23713 states and 73274 transitions. Second operand 7 states. [2019-12-18 18:49:20,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:49:20,508 INFO L93 Difference]: Finished difference Result 68574 states and 211095 transitions. [2019-12-18 18:49:20,508 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-18 18:49:20,508 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 64 [2019-12-18 18:49:20,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:49:20,618 INFO L225 Difference]: With dead ends: 68574 [2019-12-18 18:49:20,618 INFO L226 Difference]: Without dead ends: 51641 [2019-12-18 18:49:20,620 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=53, Invalid=157, Unknown=0, NotChecked=0, Total=210 [2019-12-18 18:49:20,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51641 states. [2019-12-18 18:49:21,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51641 to 27716. [2019-12-18 18:49:21,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27716 states. [2019-12-18 18:49:21,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27716 states to 27716 states and 86140 transitions. [2019-12-18 18:49:21,461 INFO L78 Accepts]: Start accepts. Automaton has 27716 states and 86140 transitions. Word has length 64 [2019-12-18 18:49:21,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:49:21,461 INFO L462 AbstractCegarLoop]: Abstraction has 27716 states and 86140 transitions. [2019-12-18 18:49:21,461 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 18:49:21,461 INFO L276 IsEmpty]: Start isEmpty. Operand 27716 states and 86140 transitions. [2019-12-18 18:49:21,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-18 18:49:21,490 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:49:21,490 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 18:49:21,490 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 18:49:21,491 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:49:21,491 INFO L82 PathProgramCache]: Analyzing trace with hash -317627445, now seen corresponding path program 3 times [2019-12-18 18:49:21,491 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:49:21,491 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [901636460] [2019-12-18 18:49:21,491 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:49:21,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:49:21,575 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 18:49:21,575 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [901636460] [2019-12-18 18:49:21,578 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:49:21,578 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 18:49:21,578 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [96947247] [2019-12-18 18:49:21,579 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 18:49:21,579 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:49:21,579 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 18:49:21,579 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-18 18:49:21,579 INFO L87 Difference]: Start difference. First operand 27716 states and 86140 transitions. Second operand 7 states. [2019-12-18 18:49:22,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:49:22,101 INFO L93 Difference]: Finished difference Result 58876 states and 180784 transitions. [2019-12-18 18:49:22,101 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-18 18:49:22,101 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 64 [2019-12-18 18:49:22,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:49:22,178 INFO L225 Difference]: With dead ends: 58876 [2019-12-18 18:49:22,178 INFO L226 Difference]: Without dead ends: 51661 [2019-12-18 18:49:22,178 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2019-12-18 18:49:22,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51661 states. [2019-12-18 18:49:22,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51661 to 28024. [2019-12-18 18:49:22,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28024 states. [2019-12-18 18:49:23,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28024 states to 28024 states and 87091 transitions. [2019-12-18 18:49:23,181 INFO L78 Accepts]: Start accepts. Automaton has 28024 states and 87091 transitions. Word has length 64 [2019-12-18 18:49:23,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:49:23,181 INFO L462 AbstractCegarLoop]: Abstraction has 28024 states and 87091 transitions. [2019-12-18 18:49:23,181 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 18:49:23,181 INFO L276 IsEmpty]: Start isEmpty. Operand 28024 states and 87091 transitions. [2019-12-18 18:49:23,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-18 18:49:23,208 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:49:23,208 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 18:49:23,208 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 18:49:23,209 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:49:23,209 INFO L82 PathProgramCache]: Analyzing trace with hash -1087297877, now seen corresponding path program 4 times [2019-12-18 18:49:23,209 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:49:23,209 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [343973874] [2019-12-18 18:49:23,209 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:49:23,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:49:23,283 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 18:49:23,284 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [343973874] [2019-12-18 18:49:23,284 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:49:23,284 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 18:49:23,284 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [163086892] [2019-12-18 18:49:23,285 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 18:49:23,285 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:49:23,286 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 18:49:23,286 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 18:49:23,286 INFO L87 Difference]: Start difference. First operand 28024 states and 87091 transitions. Second operand 3 states. [2019-12-18 18:49:23,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:49:23,501 INFO L93 Difference]: Finished difference Result 33789 states and 104171 transitions. [2019-12-18 18:49:23,502 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 18:49:23,502 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 64 [2019-12-18 18:49:23,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:49:23,589 INFO L225 Difference]: With dead ends: 33789 [2019-12-18 18:49:23,589 INFO L226 Difference]: Without dead ends: 33789 [2019-12-18 18:49:23,590 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 18:49:23,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33789 states. [2019-12-18 18:49:24,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33789 to 29603. [2019-12-18 18:49:24,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29603 states. [2019-12-18 18:49:24,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29603 states to 29603 states and 91943 transitions. [2019-12-18 18:49:24,477 INFO L78 Accepts]: Start accepts. Automaton has 29603 states and 91943 transitions. Word has length 64 [2019-12-18 18:49:24,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:49:24,477 INFO L462 AbstractCegarLoop]: Abstraction has 29603 states and 91943 transitions. [2019-12-18 18:49:24,477 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 18:49:24,478 INFO L276 IsEmpty]: Start isEmpty. Operand 29603 states and 91943 transitions. [2019-12-18 18:49:24,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 18:49:24,528 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:49:24,528 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 18:49:24,529 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 18:49:24,529 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:49:24,529 INFO L82 PathProgramCache]: Analyzing trace with hash -181535548, now seen corresponding path program 1 times [2019-12-18 18:49:24,529 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:49:24,529 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1127263599] [2019-12-18 18:49:24,530 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:49:24,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:49:24,594 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 18:49:24,594 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1127263599] [2019-12-18 18:49:24,595 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:49:24,595 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 18:49:24,595 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [175577364] [2019-12-18 18:49:24,595 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 18:49:24,595 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:49:24,596 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 18:49:24,596 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 18:49:24,596 INFO L87 Difference]: Start difference. First operand 29603 states and 91943 transitions. Second operand 4 states. [2019-12-18 18:49:24,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:49:24,952 INFO L93 Difference]: Finished difference Result 45817 states and 143094 transitions. [2019-12-18 18:49:24,952 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 18:49:24,952 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 65 [2019-12-18 18:49:24,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:49:25,019 INFO L225 Difference]: With dead ends: 45817 [2019-12-18 18:49:25,019 INFO L226 Difference]: Without dead ends: 45817 [2019-12-18 18:49:25,019 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 18:49:25,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45817 states. [2019-12-18 18:49:25,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45817 to 31959. [2019-12-18 18:49:25,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31959 states. [2019-12-18 18:49:25,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31959 states to 31959 states and 100397 transitions. [2019-12-18 18:49:25,876 INFO L78 Accepts]: Start accepts. Automaton has 31959 states and 100397 transitions. Word has length 65 [2019-12-18 18:49:25,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:49:25,877 INFO L462 AbstractCegarLoop]: Abstraction has 31959 states and 100397 transitions. [2019-12-18 18:49:25,877 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 18:49:25,877 INFO L276 IsEmpty]: Start isEmpty. Operand 31959 states and 100397 transitions. [2019-12-18 18:49:25,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 18:49:25,911 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:49:25,911 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 18:49:25,911 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 18:49:25,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:49:25,911 INFO L82 PathProgramCache]: Analyzing trace with hash -701292531, now seen corresponding path program 1 times [2019-12-18 18:49:25,912 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:49:25,912 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1721091239] [2019-12-18 18:49:25,912 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:49:25,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:49:26,007 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 18:49:26,007 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1721091239] [2019-12-18 18:49:26,007 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:49:26,007 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 18:49:26,008 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [929310230] [2019-12-18 18:49:26,008 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 18:49:26,009 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:49:26,009 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 18:49:26,009 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-18 18:49:26,009 INFO L87 Difference]: Start difference. First operand 31959 states and 100397 transitions. Second operand 7 states. [2019-12-18 18:49:26,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:49:26,541 INFO L93 Difference]: Finished difference Result 69632 states and 216004 transitions. [2019-12-18 18:49:26,541 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-18 18:49:26,542 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 65 [2019-12-18 18:49:26,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:49:26,640 INFO L225 Difference]: With dead ends: 69632 [2019-12-18 18:49:26,640 INFO L226 Difference]: Without dead ends: 63631 [2019-12-18 18:49:26,640 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2019-12-18 18:49:26,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63631 states. [2019-12-18 18:49:27,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63631 to 31991. [2019-12-18 18:49:27,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31991 states. [2019-12-18 18:49:27,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31991 states to 31991 states and 100515 transitions. [2019-12-18 18:49:27,358 INFO L78 Accepts]: Start accepts. Automaton has 31991 states and 100515 transitions. Word has length 65 [2019-12-18 18:49:27,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:49:27,358 INFO L462 AbstractCegarLoop]: Abstraction has 31991 states and 100515 transitions. [2019-12-18 18:49:27,358 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 18:49:27,358 INFO L276 IsEmpty]: Start isEmpty. Operand 31991 states and 100515 transitions. [2019-12-18 18:49:27,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 18:49:27,719 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:49:27,719 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 18:49:27,719 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 18:49:27,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:49:27,719 INFO L82 PathProgramCache]: Analyzing trace with hash -1336640005, now seen corresponding path program 2 times [2019-12-18 18:49:27,719 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:49:27,719 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [180704860] [2019-12-18 18:49:27,720 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:49:27,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:49:27,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 18:49:27,824 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [180704860] [2019-12-18 18:49:27,824 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:49:27,825 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 18:49:27,825 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1869757003] [2019-12-18 18:49:27,825 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 18:49:27,826 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:49:27,826 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 18:49:27,826 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-12-18 18:49:27,826 INFO L87 Difference]: Start difference. First operand 31991 states and 100515 transitions. Second operand 7 states. [2019-12-18 18:49:28,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:49:28,607 INFO L93 Difference]: Finished difference Result 44848 states and 139960 transitions. [2019-12-18 18:49:28,607 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-18 18:49:28,607 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 65 [2019-12-18 18:49:28,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:49:28,673 INFO L225 Difference]: With dead ends: 44848 [2019-12-18 18:49:28,673 INFO L226 Difference]: Without dead ends: 44844 [2019-12-18 18:49:28,674 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2019-12-18 18:49:28,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44844 states. [2019-12-18 18:49:29,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44844 to 32249. [2019-12-18 18:49:29,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32249 states. [2019-12-18 18:49:29,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32249 states to 32249 states and 99750 transitions. [2019-12-18 18:49:29,273 INFO L78 Accepts]: Start accepts. Automaton has 32249 states and 99750 transitions. Word has length 65 [2019-12-18 18:49:29,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:49:29,273 INFO L462 AbstractCegarLoop]: Abstraction has 32249 states and 99750 transitions. [2019-12-18 18:49:29,273 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 18:49:29,273 INFO L276 IsEmpty]: Start isEmpty. Operand 32249 states and 99750 transitions. [2019-12-18 18:49:29,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 18:49:29,309 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:49:29,309 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 18:49:29,309 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 18:49:29,309 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:49:29,309 INFO L82 PathProgramCache]: Analyzing trace with hash -152741241, now seen corresponding path program 1 times [2019-12-18 18:49:29,309 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:49:29,309 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2114142514] [2019-12-18 18:49:29,310 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:49:29,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:49:29,354 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 18:49:29,354 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2114142514] [2019-12-18 18:49:29,354 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:49:29,355 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 18:49:29,355 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1160831153] [2019-12-18 18:49:29,355 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 18:49:29,355 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:49:29,356 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 18:49:29,356 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 18:49:29,356 INFO L87 Difference]: Start difference. First operand 32249 states and 99750 transitions. Second operand 3 states. [2019-12-18 18:49:29,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:49:29,623 INFO L93 Difference]: Finished difference Result 43160 states and 132643 transitions. [2019-12-18 18:49:29,623 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 18:49:29,624 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-18 18:49:29,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:49:29,694 INFO L225 Difference]: With dead ends: 43160 [2019-12-18 18:49:29,694 INFO L226 Difference]: Without dead ends: 43160 [2019-12-18 18:49:29,695 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 18:49:29,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43160 states. [2019-12-18 18:49:30,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43160 to 32489. [2019-12-18 18:49:30,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32489 states. [2019-12-18 18:49:30,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32489 states to 32489 states and 100545 transitions. [2019-12-18 18:49:30,503 INFO L78 Accepts]: Start accepts. Automaton has 32489 states and 100545 transitions. Word has length 65 [2019-12-18 18:49:30,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:49:30,503 INFO L462 AbstractCegarLoop]: Abstraction has 32489 states and 100545 transitions. [2019-12-18 18:49:30,503 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 18:49:30,503 INFO L276 IsEmpty]: Start isEmpty. Operand 32489 states and 100545 transitions. [2019-12-18 18:49:30,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 18:49:30,550 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:49:30,551 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 18:49:30,551 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 18:49:30,551 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:49:30,551 INFO L82 PathProgramCache]: Analyzing trace with hash -422803263, now seen corresponding path program 2 times [2019-12-18 18:49:30,551 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:49:30,552 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [802401240] [2019-12-18 18:49:30,552 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:49:30,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:49:30,647 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 18:49:30,647 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [802401240] [2019-12-18 18:49:30,647 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:49:30,647 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 18:49:30,648 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1252837390] [2019-12-18 18:49:30,648 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 18:49:30,648 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:49:30,648 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 18:49:30,649 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-18 18:49:30,651 INFO L87 Difference]: Start difference. First operand 32489 states and 100545 transitions. Second operand 7 states. [2019-12-18 18:49:31,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:49:31,297 INFO L93 Difference]: Finished difference Result 52071 states and 162140 transitions. [2019-12-18 18:49:31,297 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-18 18:49:31,297 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 65 [2019-12-18 18:49:31,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:49:31,376 INFO L225 Difference]: With dead ends: 52071 [2019-12-18 18:49:31,376 INFO L226 Difference]: Without dead ends: 52071 [2019-12-18 18:49:31,376 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2019-12-18 18:49:31,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52071 states. [2019-12-18 18:49:31,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52071 to 33507. [2019-12-18 18:49:31,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33507 states. [2019-12-18 18:49:32,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33507 states to 33507 states and 103713 transitions. [2019-12-18 18:49:32,044 INFO L78 Accepts]: Start accepts. Automaton has 33507 states and 103713 transitions. Word has length 65 [2019-12-18 18:49:32,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:49:32,044 INFO L462 AbstractCegarLoop]: Abstraction has 33507 states and 103713 transitions. [2019-12-18 18:49:32,044 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 18:49:32,044 INFO L276 IsEmpty]: Start isEmpty. Operand 33507 states and 103713 transitions. [2019-12-18 18:49:32,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 18:49:32,080 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:49:32,080 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 18:49:32,080 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 18:49:32,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:49:32,081 INFO L82 PathProgramCache]: Analyzing trace with hash 1008271868, now seen corresponding path program 1 times [2019-12-18 18:49:32,081 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:49:32,081 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1617288824] [2019-12-18 18:49:32,081 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:49:32,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:49:32,140 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 18:49:32,140 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1617288824] [2019-12-18 18:49:32,141 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:49:32,141 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 18:49:32,141 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1929648168] [2019-12-18 18:49:32,141 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 18:49:32,141 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:49:32,142 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 18:49:32,145 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 18:49:32,146 INFO L87 Difference]: Start difference. First operand 33507 states and 103713 transitions. Second operand 4 states. [2019-12-18 18:49:32,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:49:32,529 INFO L93 Difference]: Finished difference Result 33507 states and 103505 transitions. [2019-12-18 18:49:32,530 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 18:49:32,530 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 65 [2019-12-18 18:49:32,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:49:32,575 INFO L225 Difference]: With dead ends: 33507 [2019-12-18 18:49:32,575 INFO L226 Difference]: Without dead ends: 33507 [2019-12-18 18:49:32,575 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 18:49:32,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33507 states. [2019-12-18 18:49:32,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33507 to 28069. [2019-12-18 18:49:32,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28069 states. [2019-12-18 18:49:33,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28069 states to 28069 states and 85930 transitions. [2019-12-18 18:49:33,039 INFO L78 Accepts]: Start accepts. Automaton has 28069 states and 85930 transitions. Word has length 65 [2019-12-18 18:49:33,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:49:33,039 INFO L462 AbstractCegarLoop]: Abstraction has 28069 states and 85930 transitions. [2019-12-18 18:49:33,039 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 18:49:33,039 INFO L276 IsEmpty]: Start isEmpty. Operand 28069 states and 85930 transitions. [2019-12-18 18:49:33,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 18:49:33,070 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:49:33,070 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 18:49:33,071 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 18:49:33,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:49:33,071 INFO L82 PathProgramCache]: Analyzing trace with hash 148182117, now seen corresponding path program 1 times [2019-12-18 18:49:33,071 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:49:33,071 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [673454258] [2019-12-18 18:49:33,071 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:49:33,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:49:33,145 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 18:49:33,146 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [673454258] [2019-12-18 18:49:33,146 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:49:33,146 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 18:49:33,146 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1911658146] [2019-12-18 18:49:33,148 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 18:49:33,148 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:49:33,148 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 18:49:33,149 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 18:49:33,149 INFO L87 Difference]: Start difference. First operand 28069 states and 85930 transitions. Second operand 5 states. [2019-12-18 18:49:33,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:49:33,845 INFO L93 Difference]: Finished difference Result 40500 states and 121827 transitions. [2019-12-18 18:49:33,845 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 18:49:33,845 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 65 [2019-12-18 18:49:33,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:49:33,943 INFO L225 Difference]: With dead ends: 40500 [2019-12-18 18:49:33,943 INFO L226 Difference]: Without dead ends: 40276 [2019-12-18 18:49:33,944 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-18 18:49:34,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40276 states. [2019-12-18 18:49:34,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40276 to 32300. [2019-12-18 18:49:34,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32300 states. [2019-12-18 18:49:34,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32300 states to 32300 states and 98642 transitions. [2019-12-18 18:49:34,871 INFO L78 Accepts]: Start accepts. Automaton has 32300 states and 98642 transitions. Word has length 65 [2019-12-18 18:49:34,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:49:34,872 INFO L462 AbstractCegarLoop]: Abstraction has 32300 states and 98642 transitions. [2019-12-18 18:49:34,872 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 18:49:34,872 INFO L276 IsEmpty]: Start isEmpty. Operand 32300 states and 98642 transitions. [2019-12-18 18:49:34,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 18:49:34,935 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:49:34,935 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 18:49:34,935 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 18:49:34,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:49:34,936 INFO L82 PathProgramCache]: Analyzing trace with hash -272998531, now seen corresponding path program 2 times [2019-12-18 18:49:34,936 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:49:34,936 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [686398778] [2019-12-18 18:49:34,936 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:49:34,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:49:35,030 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 18:49:35,031 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [686398778] [2019-12-18 18:49:35,031 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:49:35,031 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 18:49:35,031 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1743711563] [2019-12-18 18:49:35,032 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 18:49:35,032 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:49:35,032 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 18:49:35,032 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 18:49:35,032 INFO L87 Difference]: Start difference. First operand 32300 states and 98642 transitions. Second operand 3 states. [2019-12-18 18:49:35,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:49:35,163 INFO L93 Difference]: Finished difference Result 32300 states and 98641 transitions. [2019-12-18 18:49:35,163 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 18:49:35,163 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-18 18:49:35,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:49:35,463 INFO L225 Difference]: With dead ends: 32300 [2019-12-18 18:49:35,463 INFO L226 Difference]: Without dead ends: 32300 [2019-12-18 18:49:35,464 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 18:49:35,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32300 states. [2019-12-18 18:49:35,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32300 to 27219. [2019-12-18 18:49:35,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27219 states. [2019-12-18 18:49:35,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27219 states to 27219 states and 84448 transitions. [2019-12-18 18:49:35,893 INFO L78 Accepts]: Start accepts. Automaton has 27219 states and 84448 transitions. Word has length 65 [2019-12-18 18:49:35,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:49:35,893 INFO L462 AbstractCegarLoop]: Abstraction has 27219 states and 84448 transitions. [2019-12-18 18:49:35,893 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 18:49:35,893 INFO L276 IsEmpty]: Start isEmpty. Operand 27219 states and 84448 transitions. [2019-12-18 18:49:35,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 18:49:35,926 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:49:35,926 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 18:49:35,926 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 18:49:35,926 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:49:35,926 INFO L82 PathProgramCache]: Analyzing trace with hash 1560089001, now seen corresponding path program 1 times [2019-12-18 18:49:35,927 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:49:35,927 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1138026381] [2019-12-18 18:49:35,927 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:49:35,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:49:36,132 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 18:49:36,132 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1138026381] [2019-12-18 18:49:36,132 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:49:36,132 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-18 18:49:36,133 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [617120828] [2019-12-18 18:49:36,134 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-18 18:49:36,134 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:49:36,135 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-18 18:49:36,135 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2019-12-18 18:49:36,135 INFO L87 Difference]: Start difference. First operand 27219 states and 84448 transitions. Second operand 11 states. [2019-12-18 18:49:38,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:49:38,359 INFO L93 Difference]: Finished difference Result 47410 states and 144475 transitions. [2019-12-18 18:49:38,359 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-18 18:49:38,359 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 66 [2019-12-18 18:49:38,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:49:38,429 INFO L225 Difference]: With dead ends: 47410 [2019-12-18 18:49:38,429 INFO L226 Difference]: Without dead ends: 47307 [2019-12-18 18:49:38,430 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 2 SyntacticMatches, 4 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=123, Invalid=429, Unknown=0, NotChecked=0, Total=552 [2019-12-18 18:49:38,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47307 states. [2019-12-18 18:49:39,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47307 to 30562. [2019-12-18 18:49:39,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30562 states. [2019-12-18 18:49:39,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30562 states to 30562 states and 95092 transitions. [2019-12-18 18:49:39,332 INFO L78 Accepts]: Start accepts. Automaton has 30562 states and 95092 transitions. Word has length 66 [2019-12-18 18:49:39,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:49:39,332 INFO L462 AbstractCegarLoop]: Abstraction has 30562 states and 95092 transitions. [2019-12-18 18:49:39,332 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-18 18:49:39,333 INFO L276 IsEmpty]: Start isEmpty. Operand 30562 states and 95092 transitions. [2019-12-18 18:49:39,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 18:49:39,368 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:49:39,368 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 18:49:39,368 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 18:49:39,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:49:39,369 INFO L82 PathProgramCache]: Analyzing trace with hash -353775189, now seen corresponding path program 2 times [2019-12-18 18:49:39,369 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:49:39,369 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [313193037] [2019-12-18 18:49:39,369 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:49:39,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:49:39,426 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 18:49:39,426 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [313193037] [2019-12-18 18:49:39,427 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:49:39,427 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 18:49:39,427 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1074754917] [2019-12-18 18:49:39,427 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 18:49:39,427 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:49:39,428 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 18:49:39,428 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 18:49:39,428 INFO L87 Difference]: Start difference. First operand 30562 states and 95092 transitions. Second operand 3 states. [2019-12-18 18:49:39,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:49:39,537 INFO L93 Difference]: Finished difference Result 24016 states and 73346 transitions. [2019-12-18 18:49:39,537 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 18:49:39,537 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-12-18 18:49:39,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:49:39,581 INFO L225 Difference]: With dead ends: 24016 [2019-12-18 18:49:39,581 INFO L226 Difference]: Without dead ends: 24016 [2019-12-18 18:49:39,581 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 18:49:39,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24016 states. [2019-12-18 18:49:39,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24016 to 22836. [2019-12-18 18:49:39,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22836 states. [2019-12-18 18:49:40,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22836 states to 22836 states and 69658 transitions. [2019-12-18 18:49:40,029 INFO L78 Accepts]: Start accepts. Automaton has 22836 states and 69658 transitions. Word has length 66 [2019-12-18 18:49:40,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:49:40,029 INFO L462 AbstractCegarLoop]: Abstraction has 22836 states and 69658 transitions. [2019-12-18 18:49:40,029 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 18:49:40,030 INFO L276 IsEmpty]: Start isEmpty. Operand 22836 states and 69658 transitions. [2019-12-18 18:49:40,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 18:49:40,054 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:49:40,055 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 18:49:40,055 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 18:49:40,055 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:49:40,055 INFO L82 PathProgramCache]: Analyzing trace with hash -2007326845, now seen corresponding path program 1 times [2019-12-18 18:49:40,055 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:49:40,055 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2083838007] [2019-12-18 18:49:40,056 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:49:40,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:49:40,553 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 18:49:40,554 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2083838007] [2019-12-18 18:49:40,554 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:49:40,554 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-18 18:49:40,554 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [838201737] [2019-12-18 18:49:40,555 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-18 18:49:40,555 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:49:40,555 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-18 18:49:40,555 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=195, Unknown=0, NotChecked=0, Total=240 [2019-12-18 18:49:40,556 INFO L87 Difference]: Start difference. First operand 22836 states and 69658 transitions. Second operand 16 states. [2019-12-18 18:49:44,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:49:44,227 INFO L93 Difference]: Finished difference Result 34393 states and 103666 transitions. [2019-12-18 18:49:44,228 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2019-12-18 18:49:44,228 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 67 [2019-12-18 18:49:44,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:49:44,268 INFO L225 Difference]: With dead ends: 34393 [2019-12-18 18:49:44,268 INFO L226 Difference]: Without dead ends: 29716 [2019-12-18 18:49:44,269 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 0 SyntacticMatches, 3 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 669 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=461, Invalid=1989, Unknown=0, NotChecked=0, Total=2450 [2019-12-18 18:49:44,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29716 states. [2019-12-18 18:49:44,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29716 to 23539. [2019-12-18 18:49:44,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23539 states. [2019-12-18 18:49:44,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23539 states to 23539 states and 71481 transitions. [2019-12-18 18:49:44,835 INFO L78 Accepts]: Start accepts. Automaton has 23539 states and 71481 transitions. Word has length 67 [2019-12-18 18:49:44,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:49:44,835 INFO L462 AbstractCegarLoop]: Abstraction has 23539 states and 71481 transitions. [2019-12-18 18:49:44,836 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-18 18:49:44,836 INFO L276 IsEmpty]: Start isEmpty. Operand 23539 states and 71481 transitions. [2019-12-18 18:49:44,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 18:49:44,862 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:49:44,862 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 18:49:44,862 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 18:49:44,862 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:49:44,863 INFO L82 PathProgramCache]: Analyzing trace with hash -1473001563, now seen corresponding path program 2 times [2019-12-18 18:49:44,863 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:49:44,863 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [484846639] [2019-12-18 18:49:44,863 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:49:44,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:49:45,366 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 18:49:45,366 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [484846639] [2019-12-18 18:49:45,366 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:49:45,366 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-18 18:49:45,367 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [537771768] [2019-12-18 18:49:45,367 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-18 18:49:45,367 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:49:45,368 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-18 18:49:45,368 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2019-12-18 18:49:45,369 INFO L87 Difference]: Start difference. First operand 23539 states and 71481 transitions. Second operand 15 states. [2019-12-18 18:49:50,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:49:50,556 INFO L93 Difference]: Finished difference Result 44793 states and 134878 transitions. [2019-12-18 18:49:50,557 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2019-12-18 18:49:50,557 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 67 [2019-12-18 18:49:50,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:49:50,611 INFO L225 Difference]: With dead ends: 44793 [2019-12-18 18:49:50,611 INFO L226 Difference]: Without dead ends: 40226 [2019-12-18 18:49:50,613 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 0 SyntacticMatches, 3 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1208 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=620, Invalid=3412, Unknown=0, NotChecked=0, Total=4032 [2019-12-18 18:49:50,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40226 states. [2019-12-18 18:49:51,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40226 to 23513. [2019-12-18 18:49:51,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23513 states. [2019-12-18 18:49:51,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23513 states to 23513 states and 71383 transitions. [2019-12-18 18:49:51,263 INFO L78 Accepts]: Start accepts. Automaton has 23513 states and 71383 transitions. Word has length 67 [2019-12-18 18:49:51,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:49:51,264 INFO L462 AbstractCegarLoop]: Abstraction has 23513 states and 71383 transitions. [2019-12-18 18:49:51,264 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-18 18:49:51,264 INFO L276 IsEmpty]: Start isEmpty. Operand 23513 states and 71383 transitions. [2019-12-18 18:49:51,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 18:49:51,285 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:49:51,286 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 18:49:51,286 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 18:49:51,286 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:49:51,286 INFO L82 PathProgramCache]: Analyzing trace with hash -1156108883, now seen corresponding path program 3 times [2019-12-18 18:49:51,286 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:49:51,286 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [436844536] [2019-12-18 18:49:51,286 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:49:51,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:49:51,752 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 18:49:51,753 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [436844536] [2019-12-18 18:49:51,753 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:49:51,753 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-18 18:49:51,753 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [714461868] [2019-12-18 18:49:51,754 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-18 18:49:51,754 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:49:51,754 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-18 18:49:51,754 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=199, Unknown=0, NotChecked=0, Total=240 [2019-12-18 18:49:51,754 INFO L87 Difference]: Start difference. First operand 23513 states and 71383 transitions. Second operand 16 states. [2019-12-18 18:49:54,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:49:54,968 INFO L93 Difference]: Finished difference Result 29837 states and 89217 transitions. [2019-12-18 18:49:54,968 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2019-12-18 18:49:54,968 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 67 [2019-12-18 18:49:54,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:49:55,008 INFO L225 Difference]: With dead ends: 29837 [2019-12-18 18:49:55,008 INFO L226 Difference]: Without dead ends: 29498 [2019-12-18 18:49:55,010 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 0 SyntacticMatches, 3 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 615 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=436, Invalid=1820, Unknown=0, NotChecked=0, Total=2256 [2019-12-18 18:49:55,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29498 states. [2019-12-18 18:49:55,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29498 to 23273. [2019-12-18 18:49:55,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23273 states. [2019-12-18 18:49:55,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23273 states to 23273 states and 70719 transitions. [2019-12-18 18:49:55,371 INFO L78 Accepts]: Start accepts. Automaton has 23273 states and 70719 transitions. Word has length 67 [2019-12-18 18:49:55,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:49:55,372 INFO L462 AbstractCegarLoop]: Abstraction has 23273 states and 70719 transitions. [2019-12-18 18:49:55,372 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-18 18:49:55,372 INFO L276 IsEmpty]: Start isEmpty. Operand 23273 states and 70719 transitions. [2019-12-18 18:49:55,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 18:49:55,394 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:49:55,394 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 18:49:55,394 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 18:49:55,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:49:55,395 INFO L82 PathProgramCache]: Analyzing trace with hash -1816499453, now seen corresponding path program 4 times [2019-12-18 18:49:55,395 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:49:55,395 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1579161578] [2019-12-18 18:49:55,395 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:49:55,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:49:55,565 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 18:49:55,566 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1579161578] [2019-12-18 18:49:55,566 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:49:55,566 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 18:49:55,566 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [207229359] [2019-12-18 18:49:55,567 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-18 18:49:55,567 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:49:55,567 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-18 18:49:55,567 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-12-18 18:49:55,568 INFO L87 Difference]: Start difference. First operand 23273 states and 70719 transitions. Second operand 10 states. [2019-12-18 18:49:56,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:49:56,715 INFO L93 Difference]: Finished difference Result 46974 states and 143564 transitions. [2019-12-18 18:49:56,715 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-12-18 18:49:56,715 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 67 [2019-12-18 18:49:56,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:49:56,775 INFO L225 Difference]: With dead ends: 46974 [2019-12-18 18:49:56,775 INFO L226 Difference]: Without dead ends: 45059 [2019-12-18 18:49:56,776 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 154 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=152, Invalid=604, Unknown=0, NotChecked=0, Total=756 [2019-12-18 18:49:56,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45059 states. [2019-12-18 18:49:57,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45059 to 28773. [2019-12-18 18:49:57,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28773 states. [2019-12-18 18:49:57,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28773 states to 28773 states and 87955 transitions. [2019-12-18 18:49:57,302 INFO L78 Accepts]: Start accepts. Automaton has 28773 states and 87955 transitions. Word has length 67 [2019-12-18 18:49:57,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:49:57,302 INFO L462 AbstractCegarLoop]: Abstraction has 28773 states and 87955 transitions. [2019-12-18 18:49:57,302 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-18 18:49:57,302 INFO L276 IsEmpty]: Start isEmpty. Operand 28773 states and 87955 transitions. [2019-12-18 18:49:57,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 18:49:57,333 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:49:57,333 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 18:49:57,333 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 18:49:57,334 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:49:57,334 INFO L82 PathProgramCache]: Analyzing trace with hash 1315765029, now seen corresponding path program 5 times [2019-12-18 18:49:57,334 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:49:57,334 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [444997481] [2019-12-18 18:49:57,334 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:49:57,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:49:57,478 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 18:49:57,478 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [444997481] [2019-12-18 18:49:57,478 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:49:57,478 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 18:49:57,478 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2019373114] [2019-12-18 18:49:57,479 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-18 18:49:57,479 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:49:57,479 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-18 18:49:57,479 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-12-18 18:49:57,479 INFO L87 Difference]: Start difference. First operand 28773 states and 87955 transitions. Second operand 10 states. [2019-12-18 18:49:58,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:49:58,313 INFO L93 Difference]: Finished difference Result 45979 states and 139712 transitions. [2019-12-18 18:49:58,313 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-18 18:49:58,313 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 67 [2019-12-18 18:49:58,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:49:58,363 INFO L225 Difference]: With dead ends: 45979 [2019-12-18 18:49:58,363 INFO L226 Difference]: Without dead ends: 35979 [2019-12-18 18:49:58,364 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 18:49:58,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35979 states. [2019-12-18 18:49:58,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35979 to 23063. [2019-12-18 18:49:58,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23063 states. [2019-12-18 18:49:58,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23063 states to 23063 states and 69733 transitions. [2019-12-18 18:49:58,780 INFO L78 Accepts]: Start accepts. Automaton has 23063 states and 69733 transitions. Word has length 67 [2019-12-18 18:49:58,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:49:58,781 INFO L462 AbstractCegarLoop]: Abstraction has 23063 states and 69733 transitions. [2019-12-18 18:49:58,781 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-18 18:49:58,781 INFO L276 IsEmpty]: Start isEmpty. Operand 23063 states and 69733 transitions. [2019-12-18 18:49:58,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 18:49:58,803 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:49:58,803 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 18:49:58,803 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 18:49:58,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:49:58,803 INFO L82 PathProgramCache]: Analyzing trace with hash 1885964539, now seen corresponding path program 6 times [2019-12-18 18:49:58,804 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:49:58,804 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [942837367] [2019-12-18 18:49:58,804 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:49:58,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:49:58,985 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 18:49:58,985 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [942837367] [2019-12-18 18:49:58,985 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:49:58,985 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-18 18:49:58,986 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1352812208] [2019-12-18 18:49:58,986 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-18 18:49:58,986 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:49:58,986 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-18 18:49:58,986 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-18 18:49:58,987 INFO L87 Difference]: Start difference. First operand 23063 states and 69733 transitions. Second operand 11 states. [2019-12-18 18:50:00,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:50:00,314 INFO L93 Difference]: Finished difference Result 39934 states and 121455 transitions. [2019-12-18 18:50:00,314 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-12-18 18:50:00,314 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 67 [2019-12-18 18:50:00,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:50:00,363 INFO L225 Difference]: With dead ends: 39934 [2019-12-18 18:50:00,363 INFO L226 Difference]: Without dead ends: 38915 [2019-12-18 18:50:00,364 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 126 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=130, Invalid=572, Unknown=0, NotChecked=0, Total=702 [2019-12-18 18:50:00,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38915 states. [2019-12-18 18:50:00,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38915 to 27097. [2019-12-18 18:50:00,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27097 states. [2019-12-18 18:50:00,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27097 states to 27097 states and 82392 transitions. [2019-12-18 18:50:00,862 INFO L78 Accepts]: Start accepts. Automaton has 27097 states and 82392 transitions. Word has length 67 [2019-12-18 18:50:00,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:50:00,862 INFO L462 AbstractCegarLoop]: Abstraction has 27097 states and 82392 transitions. [2019-12-18 18:50:00,862 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-18 18:50:00,862 INFO L276 IsEmpty]: Start isEmpty. Operand 27097 states and 82392 transitions. [2019-12-18 18:50:00,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 18:50:00,896 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:50:00,897 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 18:50:00,897 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 18:50:00,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:50:00,897 INFO L82 PathProgramCache]: Analyzing trace with hash 723261725, now seen corresponding path program 7 times [2019-12-18 18:50:00,897 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:50:00,897 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [158013142] [2019-12-18 18:50:00,897 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:50:00,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:50:01,075 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 18:50:01,076 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [158013142] [2019-12-18 18:50:01,081 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:50:01,082 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-18 18:50:01,082 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [276849154] [2019-12-18 18:50:01,083 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-18 18:50:01,083 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:50:01,083 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-18 18:50:01,084 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-18 18:50:01,084 INFO L87 Difference]: Start difference. First operand 27097 states and 82392 transitions. Second operand 11 states. [2019-12-18 18:50:02,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:50:02,095 INFO L93 Difference]: Finished difference Result 39772 states and 120241 transitions. [2019-12-18 18:50:02,095 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-12-18 18:50:02,095 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 67 [2019-12-18 18:50:02,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:50:02,142 INFO L225 Difference]: With dead ends: 39772 [2019-12-18 18:50:02,142 INFO L226 Difference]: Without dead ends: 34878 [2019-12-18 18:50:02,142 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=122, Invalid=478, Unknown=0, NotChecked=0, Total=600 [2019-12-18 18:50:02,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34878 states. [2019-12-18 18:50:02,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34878 to 22769. [2019-12-18 18:50:02,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22769 states. [2019-12-18 18:50:02,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22769 states to 22769 states and 68749 transitions. [2019-12-18 18:50:02,548 INFO L78 Accepts]: Start accepts. Automaton has 22769 states and 68749 transitions. Word has length 67 [2019-12-18 18:50:02,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:50:02,548 INFO L462 AbstractCegarLoop]: Abstraction has 22769 states and 68749 transitions. [2019-12-18 18:50:02,548 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-18 18:50:02,548 INFO L276 IsEmpty]: Start isEmpty. Operand 22769 states and 68749 transitions. [2019-12-18 18:50:02,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 18:50:02,569 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:50:02,569 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 18:50:02,569 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 18:50:02,569 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:50:02,569 INFO L82 PathProgramCache]: Analyzing trace with hash 204518299, now seen corresponding path program 8 times [2019-12-18 18:50:02,570 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:50:02,570 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [363646760] [2019-12-18 18:50:02,570 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:50:02,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:50:02,670 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 18:50:02,671 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [363646760] [2019-12-18 18:50:02,671 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:50:02,671 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 18:50:02,671 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1121348245] [2019-12-18 18:50:02,672 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 18:50:02,672 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:50:02,672 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 18:50:02,672 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-12-18 18:50:02,672 INFO L87 Difference]: Start difference. First operand 22769 states and 68749 transitions. Second operand 9 states. [2019-12-18 18:50:03,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:50:03,751 INFO L93 Difference]: Finished difference Result 30180 states and 89758 transitions. [2019-12-18 18:50:03,751 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-12-18 18:50:03,751 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 67 [2019-12-18 18:50:03,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:50:03,789 INFO L225 Difference]: With dead ends: 30180 [2019-12-18 18:50:03,790 INFO L226 Difference]: Without dead ends: 29387 [2019-12-18 18:50:03,790 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=214, Unknown=0, NotChecked=0, Total=272 [2019-12-18 18:50:03,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29387 states. [2019-12-18 18:50:04,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29387 to 22215. [2019-12-18 18:50:04,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22215 states. [2019-12-18 18:50:04,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22215 states to 22215 states and 67229 transitions. [2019-12-18 18:50:04,286 INFO L78 Accepts]: Start accepts. Automaton has 22215 states and 67229 transitions. Word has length 67 [2019-12-18 18:50:04,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:50:04,286 INFO L462 AbstractCegarLoop]: Abstraction has 22215 states and 67229 transitions. [2019-12-18 18:50:04,286 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 18:50:04,286 INFO L276 IsEmpty]: Start isEmpty. Operand 22215 states and 67229 transitions. [2019-12-18 18:50:04,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 18:50:04,310 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:50:04,310 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 18:50:04,310 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 18:50:04,310 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:50:04,310 INFO L82 PathProgramCache]: Analyzing trace with hash -2101838907, now seen corresponding path program 9 times [2019-12-18 18:50:04,310 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:50:04,311 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1273549887] [2019-12-18 18:50:04,311 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:50:04,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 18:50:04,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 18:50:04,416 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-18 18:50:04,417 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-18 18:50:04,421 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [894] [894] ULTIMATE.startENTRY-->L820: Formula: (let ((.cse0 (store |v_#valid_71| 0 0))) (and (= v_~z$w_buff0_used~0_958 0) (= v_~y~0_23 0) (= v_~z$r_buff0_thd2~0_111 0) (= v_~x~0_76 0) (= |v_#NULL.offset_6| 0) (= v_~z~0_178 0) (= (store |v_#length_24| |v_ULTIMATE.start_main_~#t2281~0.base_26| 4) |v_#length_23|) (= 0 v_~__unbuffered_p2_EAX~0_45) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t2281~0.base_26|)) (= v_~z$w_buff1_used~0_531 0) (= v_~z$r_buff0_thd1~0_132 0) (= v_~z$r_buff1_thd1~0_108 0) (= |v_ULTIMATE.start_main_~#t2281~0.offset_19| 0) (= v_~z$read_delayed_var~0.offset_7 0) (= v_~main$tmp_guard1~0_43 0) (= |v_#valid_69| (store .cse0 |v_ULTIMATE.start_main_~#t2281~0.base_26| 1)) (= v_~z$w_buff0~0_487 0) (< 0 |v_#StackHeapBarrier_18|) (= 0 v_~z$flush_delayed~0_28) (= v_~z$r_buff1_thd2~0_104 0) (= v_~z$mem_tmp~0_17 0) (= v_~z$w_buff1~0_307 0) (= 0 v_~z$r_buff1_thd3~0_237) (= 0 |v_#NULL.base_6|) (= v_~z$r_buff0_thd0~0_141 0) (= v_~z$read_delayed_var~0.base_7 0) (= v_~z$read_delayed~0_7 0) (= 0 v_~weak$$choice0~0_16) (= 0 v_~__unbuffered_cnt~0_91) (= v_~weak$$choice2~0_111 0) (= 0 v_~z$r_buff0_thd3~0_332) (= v_~main$tmp_guard0~0_26 0) (= v_~__unbuffered_p2_EBX~0_57 0) (= v_~z$r_buff1_thd0~0_133 0) (= (store |v_#memory_int_22| |v_ULTIMATE.start_main_~#t2281~0.base_26| (store (select |v_#memory_int_22| |v_ULTIMATE.start_main_~#t2281~0.base_26|) |v_ULTIMATE.start_main_~#t2281~0.offset_19| 0)) |v_#memory_int_21|) (< |v_#StackHeapBarrier_18| |v_ULTIMATE.start_main_~#t2281~0.base_26|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_18|, #valid=|v_#valid_71|, #memory_int=|v_#memory_int_22|, #length=|v_#length_24|} OutVars{~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_104, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_31|, #NULL.offset=|v_#NULL.offset_6|, ULTIMATE.start_main_#t~ite49=|v_ULTIMATE.start_main_#t~ite49_287|, ULTIMATE.start_main_~#t2283~0.base=|v_ULTIMATE.start_main_~#t2283~0.base_16|, ULTIMATE.start_main_#t~ite50=|v_ULTIMATE.start_main_#t~ite50_41|, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_93|, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_141, ULTIMATE.start_main_~#t2281~0.offset=|v_ULTIMATE.start_main_~#t2281~0.offset_19|, #length=|v_#length_23|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_45, ~z$mem_tmp~0=v_~z$mem_tmp~0_17, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_57, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_8|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_531, ULTIMATE.start_main_~#t2283~0.offset=|v_ULTIMATE.start_main_~#t2283~0.offset_12|, ~z$flush_delayed~0=v_~z$flush_delayed~0_28, ~weak$$choice0~0=v_~weak$$choice0~0_16, #StackHeapBarrier=|v_#StackHeapBarrier_18|, ULTIMATE.start_main_~#t2282~0.base=|v_ULTIMATE.start_main_~#t2282~0.base_23|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_108, ~z$read_delayed_var~0.base=v_~z$read_delayed_var~0.base_7, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_332, ULTIMATE.start_main_~#t2282~0.offset=|v_ULTIMATE.start_main_~#t2282~0.offset_19|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_91, ~x~0=v_~x~0_76, ~z$read_delayed~0=v_~z$read_delayed~0_7, ~z$w_buff1~0=v_~z$w_buff1~0_307, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_43, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_35|, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_7, ULTIMATE.start_main_#t~ite51=|v_ULTIMATE.start_main_#t~ite51_35|, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_133, ULTIMATE.start_main_~#t2281~0.base=|v_ULTIMATE.start_main_~#t2281~0.base_26|, ~y~0=v_~y~0_23, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_111, ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_23|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_958, ~z$w_buff0~0=v_~z$w_buff0~0_487, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_7|, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_237, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_26, #NULL.base=|v_#NULL.base_6|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_24|, #valid=|v_#valid_69|, #memory_int=|v_#memory_int_21|, ~z~0=v_~z~0_178, ~weak$$choice2~0=v_~weak$$choice2~0_111, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_132} AuxVars[] AssignedVars[~z$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite47, ~z$read_delayed~0, #NULL.offset, ~z$w_buff1~0, ULTIMATE.start_main_#t~ite49, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite48, ~z$read_delayed_var~0.offset, ULTIMATE.start_main_~#t2283~0.base, ULTIMATE.start_main_#t~ite50, ULTIMATE.start_main_#t~ite52, ~z$r_buff0_thd0~0, ULTIMATE.start_main_~#t2281~0.offset, ULTIMATE.start_main_#t~ite51, ~z$r_buff1_thd0~0, #length, ~__unbuffered_p2_EAX~0, ULTIMATE.start_main_~#t2281~0.base, ~y~0, ~z$r_buff0_thd2~0, ~z$mem_tmp~0, ~__unbuffered_p2_EBX~0, ULTIMATE.start_main_#t~nondet46, ~z$w_buff0_used~0, ~z$w_buff0~0, ULTIMATE.start_main_#t~nondet44, ~z$r_buff1_thd3~0, ULTIMATE.start_main_#t~nondet45, ~z$w_buff1_used~0, ULTIMATE.start_main_~#t2283~0.offset, ~z$flush_delayed~0, ~main$tmp_guard0~0, #NULL.base, ~weak$$choice0~0, ULTIMATE.start_main_~#t2282~0.base, ULTIMATE.start_main_#res, ~z$r_buff1_thd1~0, #valid, #memory_int, ~z$read_delayed_var~0.base, ~z$r_buff0_thd3~0, ULTIMATE.start_main_~#t2282~0.offset, ~__unbuffered_cnt~0, ~z~0, ~weak$$choice2~0, ~z$r_buff0_thd1~0, ~x~0] because there is no mapped edge [2019-12-18 18:50:04,422 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [850] [850] L820-1-->L822: Formula: (and (< |v_#StackHeapBarrier_10| |v_ULTIMATE.start_main_~#t2282~0.base_9|) (not (= 0 |v_ULTIMATE.start_main_~#t2282~0.base_9|)) (= |v_#length_13| (store |v_#length_14| |v_ULTIMATE.start_main_~#t2282~0.base_9| 4)) (= 0 (select |v_#valid_34| |v_ULTIMATE.start_main_~#t2282~0.base_9|)) (= |v_#memory_int_11| (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t2282~0.base_9| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t2282~0.base_9|) |v_ULTIMATE.start_main_~#t2282~0.offset_8| 1))) (= |v_#valid_33| (store |v_#valid_34| |v_ULTIMATE.start_main_~#t2282~0.base_9| 1)) (= 0 |v_ULTIMATE.start_main_~#t2282~0.offset_8|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_34|, #memory_int=|v_#memory_int_12|, #length=|v_#length_14|} OutVars{ULTIMATE.start_main_~#t2282~0.base=|v_ULTIMATE.start_main_~#t2282~0.base_9|, #StackHeapBarrier=|v_#StackHeapBarrier_10|, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_3|, #valid=|v_#valid_33|, #memory_int=|v_#memory_int_11|, ULTIMATE.start_main_~#t2282~0.offset=|v_ULTIMATE.start_main_~#t2282~0.offset_8|, #length=|v_#length_13|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2282~0.base, ULTIMATE.start_main_#t~nondet44, #valid, #memory_int, ULTIMATE.start_main_~#t2282~0.offset, #length] because there is no mapped edge [2019-12-18 18:50:04,422 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [874] [874] P0ENTRY-->L4-3: Formula: (and (= (mod ~z$w_buff1_used~0_Out-746962730 256) 0) (= |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_Out-746962730| 1) (= ~z$w_buff1~0_Out-746962730 ~z$w_buff0~0_In-746962730) (= ~z$w_buff0~0_Out-746962730 1) (= |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_Out-746962730| P0Thread1of1ForFork0___VERIFIER_assert_~expression_Out-746962730) (= |P0Thread1of1ForFork0_#in~arg.offset_In-746962730| P0Thread1of1ForFork0_~arg.offset_Out-746962730) (= ~z$w_buff1_used~0_Out-746962730 ~z$w_buff0_used~0_In-746962730) (= P0Thread1of1ForFork0_~arg.base_Out-746962730 |P0Thread1of1ForFork0_#in~arg.base_In-746962730|) (= ~z$w_buff0_used~0_Out-746962730 1)) InVars {P0Thread1of1ForFork0_#in~arg.offset=|P0Thread1of1ForFork0_#in~arg.offset_In-746962730|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-746962730, ~z$w_buff0~0=~z$w_buff0~0_In-746962730, P0Thread1of1ForFork0_#in~arg.base=|P0Thread1of1ForFork0_#in~arg.base_In-746962730|} OutVars{P0Thread1of1ForFork0_#in~arg.offset=|P0Thread1of1ForFork0_#in~arg.offset_In-746962730|, ~z$w_buff0_used~0=~z$w_buff0_used~0_Out-746962730, ~z$w_buff0~0=~z$w_buff0~0_Out-746962730, ~z$w_buff1_used~0=~z$w_buff1_used~0_Out-746962730, P0Thread1of1ForFork0___VERIFIER_assert_~expression=P0Thread1of1ForFork0___VERIFIER_assert_~expression_Out-746962730, P0Thread1of1ForFork0_#in~arg.base=|P0Thread1of1ForFork0_#in~arg.base_In-746962730|, ~z$w_buff1~0=~z$w_buff1~0_Out-746962730, P0Thread1of1ForFork0_~arg.base=P0Thread1of1ForFork0_~arg.base_Out-746962730, P0Thread1of1ForFork0___VERIFIER_assert_#in~expression=|P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_Out-746962730|, P0Thread1of1ForFork0_~arg.offset=P0Thread1of1ForFork0_~arg.offset_Out-746962730} AuxVars[] AssignedVars[~z$w_buff0_used~0, ~z$w_buff0~0, ~z$w_buff1_used~0, P0Thread1of1ForFork0___VERIFIER_assert_~expression, ~z$w_buff1~0, P0Thread1of1ForFork0_~arg.base, P0Thread1of1ForFork0___VERIFIER_assert_#in~expression, P0Thread1of1ForFork0_~arg.offset] because there is no mapped edge [2019-12-18 18:50:04,424 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [872] [872] L822-1-->L824: Formula: (and (= 0 |v_ULTIMATE.start_main_~#t2283~0.offset_9|) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t2283~0.base_11| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t2283~0.base_11|) |v_ULTIMATE.start_main_~#t2283~0.offset_9| 2)) |v_#memory_int_15|) (not (= |v_ULTIMATE.start_main_~#t2283~0.base_11| 0)) (= (store |v_#valid_41| |v_ULTIMATE.start_main_~#t2283~0.base_11| 1) |v_#valid_40|) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t2283~0.base_11|) (= (store |v_#length_18| |v_ULTIMATE.start_main_~#t2283~0.base_11| 4) |v_#length_17|) (= 0 (select |v_#valid_41| |v_ULTIMATE.start_main_~#t2283~0.base_11|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_41|, #memory_int=|v_#memory_int_16|, #length=|v_#length_18|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_40|, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_5|, #memory_int=|v_#memory_int_15|, ULTIMATE.start_main_~#t2283~0.offset=|v_ULTIMATE.start_main_~#t2283~0.offset_9|, #length=|v_#length_17|, ULTIMATE.start_main_~#t2283~0.base=|v_ULTIMATE.start_main_~#t2283~0.base_11|} AuxVars[] AssignedVars[#valid, ULTIMATE.start_main_#t~nondet45, #memory_int, ULTIMATE.start_main_~#t2283~0.offset, #length, ULTIMATE.start_main_~#t2283~0.base] because there is no mapped edge [2019-12-18 18:50:04,426 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [817] [817] L764-2-->L764-5: Formula: (let ((.cse0 (= |P1Thread1of1ForFork1_#t~ite10_Out1145716113| |P1Thread1of1ForFork1_#t~ite9_Out1145716113|)) (.cse1 (= 0 (mod ~z$w_buff1_used~0_In1145716113 256))) (.cse2 (= 0 (mod ~z$r_buff1_thd2~0_In1145716113 256)))) (or (and .cse0 (not .cse1) (not .cse2) (= ~z$w_buff1~0_In1145716113 |P1Thread1of1ForFork1_#t~ite9_Out1145716113|)) (and (= ~z~0_In1145716113 |P1Thread1of1ForFork1_#t~ite9_Out1145716113|) .cse0 (or .cse1 .cse2)))) InVars {~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In1145716113, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1145716113, ~z$w_buff1~0=~z$w_buff1~0_In1145716113, ~z~0=~z~0_In1145716113} OutVars{P1Thread1of1ForFork1_#t~ite9=|P1Thread1of1ForFork1_#t~ite9_Out1145716113|, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In1145716113, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1145716113, P1Thread1of1ForFork1_#t~ite10=|P1Thread1of1ForFork1_#t~ite10_Out1145716113|, ~z$w_buff1~0=~z$w_buff1~0_In1145716113, ~z~0=~z~0_In1145716113} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite9, P1Thread1of1ForFork1_#t~ite10] because there is no mapped edge [2019-12-18 18:50:04,427 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [836] [836] L765-->L765-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In-1701532323 256))) (.cse0 (= 0 (mod ~z$r_buff0_thd2~0_In-1701532323 256)))) (or (and (or .cse0 .cse1) (= |P1Thread1of1ForFork1_#t~ite11_Out-1701532323| ~z$w_buff0_used~0_In-1701532323)) (and (= |P1Thread1of1ForFork1_#t~ite11_Out-1701532323| 0) (not .cse1) (not .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1701532323, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1701532323} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1701532323, P1Thread1of1ForFork1_#t~ite11=|P1Thread1of1ForFork1_#t~ite11_Out-1701532323|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1701532323} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite11] because there is no mapped edge [2019-12-18 18:50:04,429 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [828] [828] L766-->L766-2: Formula: (let ((.cse2 (= 0 (mod ~z$r_buff1_thd2~0_In-885845570 256))) (.cse3 (= 0 (mod ~z$w_buff1_used~0_In-885845570 256))) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In-885845570 256))) (.cse0 (= (mod ~z$r_buff0_thd2~0_In-885845570 256) 0))) (or (and (= |P1Thread1of1ForFork1_#t~ite12_Out-885845570| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse2 .cse3) (= |P1Thread1of1ForFork1_#t~ite12_Out-885845570| ~z$w_buff1_used~0_In-885845570) (or .cse1 .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-885845570, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-885845570, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-885845570, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-885845570} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-885845570, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-885845570, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-885845570, P1Thread1of1ForFork1_#t~ite12=|P1Thread1of1ForFork1_#t~ite12_Out-885845570|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-885845570} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite12] because there is no mapped edge [2019-12-18 18:50:04,430 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [841] [841] L767-->L767-2: Formula: (let ((.cse1 (= (mod ~z$r_buff0_thd2~0_In-1235968731 256) 0)) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In-1235968731 256)))) (or (and (not .cse0) (= |P1Thread1of1ForFork1_#t~ite13_Out-1235968731| 0) (not .cse1)) (and (= |P1Thread1of1ForFork1_#t~ite13_Out-1235968731| ~z$r_buff0_thd2~0_In-1235968731) (or .cse1 .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1235968731, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1235968731} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1235968731, P1Thread1of1ForFork1_#t~ite13=|P1Thread1of1ForFork1_#t~ite13_Out-1235968731|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1235968731} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite13] because there is no mapped edge [2019-12-18 18:50:04,431 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [873] [873] L787-->L787-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In-1889061877 256) 0))) (or (and (= ~z$w_buff1~0_In-1889061877 |P2Thread1of1ForFork2_#t~ite24_Out-1889061877|) (= |P2Thread1of1ForFork2_#t~ite23_In-1889061877| |P2Thread1of1ForFork2_#t~ite23_Out-1889061877|) (not .cse0)) (and (let ((.cse1 (= (mod ~z$r_buff0_thd3~0_In-1889061877 256) 0))) (or (and (= (mod ~z$r_buff1_thd3~0_In-1889061877 256) 0) .cse1) (= (mod ~z$w_buff0_used~0_In-1889061877 256) 0) (and (= (mod ~z$w_buff1_used~0_In-1889061877 256) 0) .cse1))) (= |P2Thread1of1ForFork2_#t~ite23_Out-1889061877| ~z$w_buff1~0_In-1889061877) .cse0 (= |P2Thread1of1ForFork2_#t~ite23_Out-1889061877| |P2Thread1of1ForFork2_#t~ite24_Out-1889061877|)))) InVars {P2Thread1of1ForFork2_#t~ite23=|P2Thread1of1ForFork2_#t~ite23_In-1889061877|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1889061877, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1889061877, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1889061877, ~z$w_buff1~0=~z$w_buff1~0_In-1889061877, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1889061877, ~weak$$choice2~0=~weak$$choice2~0_In-1889061877} OutVars{P2Thread1of1ForFork2_#t~ite23=|P2Thread1of1ForFork2_#t~ite23_Out-1889061877|, P2Thread1of1ForFork2_#t~ite24=|P2Thread1of1ForFork2_#t~ite24_Out-1889061877|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1889061877, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1889061877, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1889061877, ~z$w_buff1~0=~z$w_buff1~0_In-1889061877, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1889061877, ~weak$$choice2~0=~weak$$choice2~0_In-1889061877} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite23, P2Thread1of1ForFork2_#t~ite24] because there is no mapped edge [2019-12-18 18:50:04,431 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [875] [875] L788-->L788-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In43605026 256)))) (or (and (= ~z$w_buff0_used~0_In43605026 |P2Thread1of1ForFork2_#t~ite26_Out43605026|) (= |P2Thread1of1ForFork2_#t~ite27_Out43605026| |P2Thread1of1ForFork2_#t~ite26_Out43605026|) .cse0 (let ((.cse1 (= (mod ~z$r_buff0_thd3~0_In43605026 256) 0))) (or (and .cse1 (= 0 (mod ~z$r_buff1_thd3~0_In43605026 256))) (and .cse1 (= 0 (mod ~z$w_buff1_used~0_In43605026 256))) (= (mod ~z$w_buff0_used~0_In43605026 256) 0)))) (and (not .cse0) (= |P2Thread1of1ForFork2_#t~ite26_In43605026| |P2Thread1of1ForFork2_#t~ite26_Out43605026|) (= |P2Thread1of1ForFork2_#t~ite27_Out43605026| ~z$w_buff0_used~0_In43605026)))) InVars {P2Thread1of1ForFork2_#t~ite26=|P2Thread1of1ForFork2_#t~ite26_In43605026|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In43605026, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In43605026, ~z$w_buff1_used~0=~z$w_buff1_used~0_In43605026, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In43605026, ~weak$$choice2~0=~weak$$choice2~0_In43605026} OutVars{P2Thread1of1ForFork2_#t~ite26=|P2Thread1of1ForFork2_#t~ite26_Out43605026|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In43605026, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In43605026, ~z$w_buff1_used~0=~z$w_buff1_used~0_In43605026, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In43605026, ~weak$$choice2~0=~weak$$choice2~0_In43605026, P2Thread1of1ForFork2_#t~ite27=|P2Thread1of1ForFork2_#t~ite27_Out43605026|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite26, P2Thread1of1ForFork2_#t~ite27] because there is no mapped edge [2019-12-18 18:50:04,432 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [827] [827] L768-->L768-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff1_thd2~0_In-2092370542 256))) (.cse0 (= 0 (mod ~z$w_buff1_used~0_In-2092370542 256))) (.cse3 (= (mod ~z$r_buff0_thd2~0_In-2092370542 256) 0)) (.cse2 (= (mod ~z$w_buff0_used~0_In-2092370542 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P1Thread1of1ForFork1_#t~ite14_Out-2092370542|)) (and (= ~z$r_buff1_thd2~0_In-2092370542 |P1Thread1of1ForFork1_#t~ite14_Out-2092370542|) (or .cse1 .cse0) (or .cse3 .cse2)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-2092370542, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-2092370542, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-2092370542, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-2092370542} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-2092370542, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-2092370542, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-2092370542, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_Out-2092370542|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-2092370542} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite14] because there is no mapped edge [2019-12-18 18:50:04,432 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [848] [848] L768-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork1_#res.base_5|) (= |v_P1Thread1of1ForFork1_#t~ite14_28| v_~z$r_buff1_thd2~0_55) (= |v_P1Thread1of1ForFork1_#res.offset_5| 0) (= (+ v_~__unbuffered_cnt~0_40 1) v_~__unbuffered_cnt~0_39)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_40, P1Thread1of1ForFork1_#t~ite14=|v_P1Thread1of1ForFork1_#t~ite14_28|} OutVars{P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_5|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_55, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_39, P1Thread1of1ForFork1_#t~ite14=|v_P1Thread1of1ForFork1_#t~ite14_27|, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#res.offset, ~z$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#t~ite14, P1Thread1of1ForFork1_#res.base] because there is no mapped edge [2019-12-18 18:50:04,433 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [876] [876] L789-->L789-8: Formula: (let ((.cse1 (= (mod ~weak$$choice2~0_In-1535870353 256) 0))) (or (and (= |P2Thread1of1ForFork2_#t~ite30_Out-1535870353| |P2Thread1of1ForFork2_#t~ite29_Out-1535870353|) (let ((.cse0 (= (mod ~z$r_buff0_thd3~0_In-1535870353 256) 0))) (or (and (= 0 (mod ~z$r_buff1_thd3~0_In-1535870353 256)) .cse0) (= (mod ~z$w_buff0_used~0_In-1535870353 256) 0) (and (= (mod ~z$w_buff1_used~0_In-1535870353 256) 0) .cse0))) (= ~z$w_buff1_used~0_In-1535870353 |P2Thread1of1ForFork2_#t~ite29_Out-1535870353|) .cse1) (and (= |P2Thread1of1ForFork2_#t~ite29_In-1535870353| |P2Thread1of1ForFork2_#t~ite29_Out-1535870353|) (not .cse1) (= |P2Thread1of1ForFork2_#t~ite30_Out-1535870353| ~z$w_buff1_used~0_In-1535870353)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1535870353, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1535870353, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1535870353, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1535870353, ~weak$$choice2~0=~weak$$choice2~0_In-1535870353, P2Thread1of1ForFork2_#t~ite29=|P2Thread1of1ForFork2_#t~ite29_In-1535870353|} OutVars{P2Thread1of1ForFork2_#t~ite30=|P2Thread1of1ForFork2_#t~ite30_Out-1535870353|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1535870353, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1535870353, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1535870353, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1535870353, ~weak$$choice2~0=~weak$$choice2~0_In-1535870353, P2Thread1of1ForFork2_#t~ite29=|P2Thread1of1ForFork2_#t~ite29_Out-1535870353|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite30, P2Thread1of1ForFork2_#t~ite29] because there is no mapped edge [2019-12-18 18:50:04,434 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [779] [779] L790-->L791: Formula: (and (= v_~z$r_buff0_thd3~0_68 v_~z$r_buff0_thd3~0_67) (not (= 0 (mod v_~weak$$choice2~0_15 256)))) InVars {~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_68, ~weak$$choice2~0=v_~weak$$choice2~0_15} OutVars{P2Thread1of1ForFork2_#t~ite31=|v_P2Thread1of1ForFork2_#t~ite31_8|, P2Thread1of1ForFork2_#t~ite33=|v_P2Thread1of1ForFork2_#t~ite33_9|, P2Thread1of1ForFork2_#t~ite32=|v_P2Thread1of1ForFork2_#t~ite32_9|, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_67, ~weak$$choice2~0=v_~weak$$choice2~0_15} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite31, P2Thread1of1ForFork2_#t~ite33, P2Thread1of1ForFork2_#t~ite32, ~z$r_buff0_thd3~0] because there is no mapped edge [2019-12-18 18:50:04,435 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [761] [761] L793-->L797: Formula: (and (= 0 v_~z$flush_delayed~0_6) (= v_~z~0_25 v_~z$mem_tmp~0_5) (not (= 0 (mod v_~z$flush_delayed~0_7 256)))) InVars {~z$mem_tmp~0=v_~z$mem_tmp~0_5, ~z$flush_delayed~0=v_~z$flush_delayed~0_7} OutVars{~z$mem_tmp~0=v_~z$mem_tmp~0_5, P2Thread1of1ForFork2_#t~ite37=|v_P2Thread1of1ForFork2_#t~ite37_7|, ~z$flush_delayed~0=v_~z$flush_delayed~0_6, ~z~0=v_~z~0_25} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite37, ~z$flush_delayed~0, ~z~0] because there is no mapped edge [2019-12-18 18:50:04,436 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [839] [839] L745-->L745-2: Formula: (let ((.cse0 (= (mod ~z$w_buff0_used~0_In1123886033 256) 0)) (.cse1 (= (mod ~z$r_buff0_thd1~0_In1123886033 256) 0))) (or (and (or .cse0 .cse1) (= |P0Thread1of1ForFork0_#t~ite5_Out1123886033| ~z$w_buff0_used~0_In1123886033)) (and (not .cse0) (not .cse1) (= 0 |P0Thread1of1ForFork0_#t~ite5_Out1123886033|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1123886033, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In1123886033} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out1123886033|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1123886033, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In1123886033} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-18 18:50:04,437 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [818] [818] L746-->L746-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd1~0_In450004587 256))) (.cse0 (= (mod ~z$w_buff0_used~0_In450004587 256) 0)) (.cse2 (= (mod ~z$w_buff1_used~0_In450004587 256) 0)) (.cse3 (= (mod ~z$r_buff1_thd1~0_In450004587 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P0Thread1of1ForFork0_#t~ite6_Out450004587| ~z$w_buff1_used~0_In450004587)) (and (= |P0Thread1of1ForFork0_#t~ite6_Out450004587| 0) (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3)))))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In450004587, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In450004587, ~z$w_buff1_used~0=~z$w_buff1_used~0_In450004587, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In450004587} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out450004587|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In450004587, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In450004587, ~z$w_buff1_used~0=~z$w_buff1_used~0_In450004587, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In450004587} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-18 18:50:04,437 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [837] [837] L747-->L748: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In1369180009 256))) (.cse1 (= (mod ~z$r_buff0_thd1~0_In1369180009 256) 0))) (or (and (= 0 ~z$r_buff0_thd1~0_Out1369180009) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= ~z$r_buff0_thd1~0_In1369180009 ~z$r_buff0_thd1~0_Out1369180009)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1369180009, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In1369180009} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1369180009, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out1369180009|, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_Out1369180009} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-18 18:50:04,438 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [838] [838] L748-->L748-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In1444549271 256))) (.cse0 (= (mod ~z$r_buff0_thd1~0_In1444549271 256) 0)) (.cse3 (= (mod ~z$r_buff1_thd1~0_In1444549271 256) 0)) (.cse2 (= (mod ~z$w_buff1_used~0_In1444549271 256) 0))) (or (and (= |P0Thread1of1ForFork0_#t~ite8_Out1444549271| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse1 .cse0) (= |P0Thread1of1ForFork0_#t~ite8_Out1444549271| ~z$r_buff1_thd1~0_In1444549271) (or .cse3 .cse2)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1444549271, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In1444549271, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1444549271, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In1444549271} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1444549271, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out1444549271|, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In1444549271, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1444549271, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In1444549271} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-18 18:50:04,438 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [861] [861] L748-2-->P0EXIT: Formula: (and (= v_~__unbuffered_cnt~0_73 (+ v_~__unbuffered_cnt~0_74 1)) (= 0 |v_P0Thread1of1ForFork0_#res.base_5|) (= v_~z$r_buff1_thd1~0_68 |v_P0Thread1of1ForFork0_#t~ite8_44|) (= |v_P0Thread1of1ForFork0_#res.offset_5| 0)) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_44|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_74} OutVars{P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_5|, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_43|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_68, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_73} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#t~ite8, ~z$r_buff1_thd1~0, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-18 18:50:04,438 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [829] [829] L797-2-->L797-5: Formula: (let ((.cse0 (= |P2Thread1of1ForFork2_#t~ite39_Out-703743591| |P2Thread1of1ForFork2_#t~ite38_Out-703743591|)) (.cse2 (= 0 (mod ~z$w_buff1_used~0_In-703743591 256))) (.cse1 (= 0 (mod ~z$r_buff1_thd3~0_In-703743591 256)))) (or (and (= ~z~0_In-703743591 |P2Thread1of1ForFork2_#t~ite38_Out-703743591|) .cse0 (or .cse1 .cse2)) (and .cse0 (not .cse2) (not .cse1) (= ~z$w_buff1~0_In-703743591 |P2Thread1of1ForFork2_#t~ite38_Out-703743591|)))) InVars {~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-703743591, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-703743591, ~z$w_buff1~0=~z$w_buff1~0_In-703743591, ~z~0=~z~0_In-703743591} OutVars{~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-703743591, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-703743591, ~z$w_buff1~0=~z$w_buff1~0_In-703743591, ~z~0=~z~0_In-703743591, P2Thread1of1ForFork2_#t~ite39=|P2Thread1of1ForFork2_#t~ite39_Out-703743591|, P2Thread1of1ForFork2_#t~ite38=|P2Thread1of1ForFork2_#t~ite38_Out-703743591|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite39, P2Thread1of1ForFork2_#t~ite38] because there is no mapped edge [2019-12-18 18:50:04,439 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [832] [832] L798-->L798-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In802213325 256))) (.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In802213325 256)))) (or (and (or .cse0 .cse1) (= ~z$w_buff0_used~0_In802213325 |P2Thread1of1ForFork2_#t~ite40_Out802213325|)) (and (= 0 |P2Thread1of1ForFork2_#t~ite40_Out802213325|) (not .cse0) (not .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In802213325, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In802213325} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In802213325, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In802213325, P2Thread1of1ForFork2_#t~ite40=|P2Thread1of1ForFork2_#t~ite40_Out802213325|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite40] because there is no mapped edge [2019-12-18 18:50:04,439 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [819] [819] L799-->L799-2: Formula: (let ((.cse2 (= 0 (mod ~z$r_buff1_thd3~0_In739226199 256))) (.cse3 (= 0 (mod ~z$w_buff1_used~0_In739226199 256))) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In739226199 256))) (.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In739226199 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~z$w_buff1_used~0_In739226199 |P2Thread1of1ForFork2_#t~ite41_Out739226199|)) (and (= 0 |P2Thread1of1ForFork2_#t~ite41_Out739226199|) (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1)))))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In739226199, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In739226199, ~z$w_buff1_used~0=~z$w_buff1_used~0_In739226199, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In739226199} OutVars{P2Thread1of1ForFork2_#t~ite41=|P2Thread1of1ForFork2_#t~ite41_Out739226199|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In739226199, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In739226199, ~z$w_buff1_used~0=~z$w_buff1_used~0_In739226199, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In739226199} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite41] because there is no mapped edge [2019-12-18 18:50:04,440 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [815] [815] L800-->L800-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In-1789215141 256))) (.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In-1789215141 256)))) (or (and (= |P2Thread1of1ForFork2_#t~ite42_Out-1789215141| 0) (not .cse0) (not .cse1)) (and (= |P2Thread1of1ForFork2_#t~ite42_Out-1789215141| ~z$r_buff0_thd3~0_In-1789215141) (or .cse0 .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1789215141, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1789215141} OutVars{P2Thread1of1ForFork2_#t~ite42=|P2Thread1of1ForFork2_#t~ite42_Out-1789215141|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1789215141, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1789215141} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite42] because there is no mapped edge [2019-12-18 18:50:04,441 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [834] [834] L801-->L801-2: Formula: (let ((.cse2 (= 0 (mod ~z$w_buff0_used~0_In-1798081145 256))) (.cse3 (= 0 (mod ~z$r_buff0_thd3~0_In-1798081145 256))) (.cse1 (= (mod ~z$w_buff1_used~0_In-1798081145 256) 0)) (.cse0 (= (mod ~z$r_buff1_thd3~0_In-1798081145 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P2Thread1of1ForFork2_#t~ite43_Out-1798081145| 0)) (and (or .cse2 .cse3) (or .cse1 .cse0) (= ~z$r_buff1_thd3~0_In-1798081145 |P2Thread1of1ForFork2_#t~ite43_Out-1798081145|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1798081145, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1798081145, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1798081145, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1798081145} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1798081145, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1798081145, P2Thread1of1ForFork2_#t~ite43=|P2Thread1of1ForFork2_#t~ite43_Out-1798081145|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1798081145, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1798081145} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite43] because there is no mapped edge [2019-12-18 18:50:04,441 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [859] [859] L801-2-->P2EXIT: Formula: (and (= 0 |v_P2Thread1of1ForFork2_#res.base_5|) (= v_~z$r_buff1_thd3~0_136 |v_P2Thread1of1ForFork2_#t~ite43_30|) (= |v_P2Thread1of1ForFork2_#res.offset_5| 0) (= (+ v_~__unbuffered_cnt~0_56 1) v_~__unbuffered_cnt~0_55)) InVars {P2Thread1of1ForFork2_#t~ite43=|v_P2Thread1of1ForFork2_#t~ite43_30|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_56} OutVars{~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_136, P2Thread1of1ForFork2_#t~ite43=|v_P2Thread1of1ForFork2_#t~ite43_29|, P2Thread1of1ForFork2_#res.base=|v_P2Thread1of1ForFork2_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_55, P2Thread1of1ForFork2_#res.offset=|v_P2Thread1of1ForFork2_#res.offset_5|} AuxVars[] AssignedVars[~z$r_buff1_thd3~0, P2Thread1of1ForFork2_#t~ite43, P2Thread1of1ForFork2_#res.base, ~__unbuffered_cnt~0, P2Thread1of1ForFork2_#res.offset] because there is no mapped edge [2019-12-18 18:50:04,441 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [781] [781] L824-1-->L830: Formula: (and (= v_~main$tmp_guard0~0_7 1) (= 3 v_~__unbuffered_cnt~0_13)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_13} OutVars{ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_13, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet46, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-18 18:50:04,442 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [825] [825] L830-2-->L830-5: Formula: (let ((.cse0 (= |ULTIMATE.start_main_#t~ite47_Out-2045110141| |ULTIMATE.start_main_#t~ite48_Out-2045110141|)) (.cse2 (= 0 (mod ~z$r_buff1_thd0~0_In-2045110141 256))) (.cse1 (= 0 (mod ~z$w_buff1_used~0_In-2045110141 256)))) (or (and .cse0 (not .cse1) (= |ULTIMATE.start_main_#t~ite47_Out-2045110141| ~z$w_buff1~0_In-2045110141) (not .cse2)) (and .cse0 (= |ULTIMATE.start_main_#t~ite47_Out-2045110141| ~z~0_In-2045110141) (or .cse2 .cse1)))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-2045110141, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-2045110141, ~z$w_buff1~0=~z$w_buff1~0_In-2045110141, ~z~0=~z~0_In-2045110141} OutVars{~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-2045110141, ULTIMATE.start_main_#t~ite47=|ULTIMATE.start_main_#t~ite47_Out-2045110141|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-2045110141, ~z$w_buff1~0=~z$w_buff1~0_In-2045110141, ULTIMATE.start_main_#t~ite48=|ULTIMATE.start_main_#t~ite48_Out-2045110141|, ~z~0=~z~0_In-2045110141} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite47, ULTIMATE.start_main_#t~ite48] because there is no mapped edge [2019-12-18 18:50:04,443 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [821] [821] L831-->L831-2: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In-652679437 256) 0)) (.cse0 (= 0 (mod ~z$r_buff0_thd0~0_In-652679437 256)))) (or (and (= |ULTIMATE.start_main_#t~ite49_Out-652679437| 0) (not .cse0) (not .cse1)) (and (= |ULTIMATE.start_main_#t~ite49_Out-652679437| ~z$w_buff0_used~0_In-652679437) (or .cse1 .cse0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-652679437, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-652679437} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-652679437, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-652679437, ULTIMATE.start_main_#t~ite49=|ULTIMATE.start_main_#t~ite49_Out-652679437|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite49] because there is no mapped edge [2019-12-18 18:50:04,443 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [840] [840] L832-->L832-2: Formula: (let ((.cse2 (= 0 (mod ~z$r_buff1_thd0~0_In-512995163 256))) (.cse3 (= (mod ~z$w_buff1_used~0_In-512995163 256) 0)) (.cse0 (= (mod ~z$w_buff0_used~0_In-512995163 256) 0)) (.cse1 (= (mod ~z$r_buff0_thd0~0_In-512995163 256) 0))) (or (and (= ~z$w_buff1_used~0_In-512995163 |ULTIMATE.start_main_#t~ite50_Out-512995163|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= 0 |ULTIMATE.start_main_#t~ite50_Out-512995163|) (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1)))))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-512995163, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-512995163, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-512995163, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-512995163} OutVars{ULTIMATE.start_main_#t~ite50=|ULTIMATE.start_main_#t~ite50_Out-512995163|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-512995163, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-512995163, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-512995163, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-512995163} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite50] because there is no mapped edge [2019-12-18 18:50:04,444 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [831] [831] L833-->L833-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff0_thd0~0_In-1237234641 256))) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In-1237234641 256)))) (or (and (= |ULTIMATE.start_main_#t~ite51_Out-1237234641| 0) (not .cse0) (not .cse1)) (and (= ~z$r_buff0_thd0~0_In-1237234641 |ULTIMATE.start_main_#t~ite51_Out-1237234641|) (or .cse0 .cse1)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1237234641, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1237234641} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1237234641, ULTIMATE.start_main_#t~ite51=|ULTIMATE.start_main_#t~ite51_Out-1237234641|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1237234641} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite51] because there is no mapped edge [2019-12-18 18:50:04,445 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [820] [820] L834-->L834-2: Formula: (let ((.cse2 (= (mod ~z$r_buff1_thd0~0_In396282251 256) 0)) (.cse3 (= 0 (mod ~z$w_buff1_used~0_In396282251 256))) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In396282251 256))) (.cse0 (= 0 (mod ~z$r_buff0_thd0~0_In396282251 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite52_Out396282251| 0)) (and (or .cse2 .cse3) (or .cse1 .cse0) (= ~z$r_buff1_thd0~0_In396282251 |ULTIMATE.start_main_#t~ite52_Out396282251|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In396282251, ~z$w_buff0_used~0=~z$w_buff0_used~0_In396282251, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In396282251, ~z$w_buff1_used~0=~z$w_buff1_used~0_In396282251} OutVars{ULTIMATE.start_main_#t~ite52=|ULTIMATE.start_main_#t~ite52_Out396282251|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In396282251, ~z$w_buff0_used~0=~z$w_buff0_used~0_In396282251, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In396282251, ~z$w_buff1_used~0=~z$w_buff1_used~0_In396282251} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52] because there is no mapped edge [2019-12-18 18:50:04,445 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [883] [883] L834-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_10| (mod v_~main$tmp_guard1~0_23 256)) (= |v_ULTIMATE.start_main_#t~ite52_54| v_~z$r_buff1_thd0~0_96) (= v_~x~0_49 2) (= v_ULTIMATE.start___VERIFIER_assert_~expression_15 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_10|) (= v_~main$tmp_guard1~0_23 0) (= v_~__unbuffered_p2_EBX~0_30 0) (= 1 v_~__unbuffered_p2_EAX~0_25)) InVars {ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_54|, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_30, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_25, ~x~0=v_~x~0_49} OutVars{ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_53|, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_15, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_30, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_96, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_23, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_25, ~x~0=v_~x~0_49, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52, ULTIMATE.start___VERIFIER_assert_~expression, ~z$r_buff1_thd0~0, ~main$tmp_guard1~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-18 18:50:04,543 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.12 06:50:04 BasicIcfg [2019-12-18 18:50:04,543 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-18 18:50:04,546 INFO L168 Benchmark]: Toolchain (without parser) took 117365.67 ms. Allocated memory was 140.0 MB in the beginning and 3.0 GB in the end (delta: 2.9 GB). Free memory was 102.9 MB in the beginning and 1.7 GB in the end (delta: -1.6 GB). Peak memory consumption was 1.3 GB. Max. memory is 7.1 GB. [2019-12-18 18:50:04,547 INFO L168 Benchmark]: CDTParser took 0.49 ms. Allocated memory is still 140.0 MB. Free memory was 123.2 MB in the beginning and 123.0 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. [2019-12-18 18:50:04,547 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1050.11 ms. Allocated memory was 140.0 MB in the beginning and 207.6 MB in the end (delta: 67.6 MB). Free memory was 102.5 MB in the beginning and 159.4 MB in the end (delta: -56.9 MB). Peak memory consumption was 24.6 MB. Max. memory is 7.1 GB. [2019-12-18 18:50:04,547 INFO L168 Benchmark]: Boogie Procedure Inliner took 75.08 ms. Allocated memory is still 207.6 MB. Free memory was 159.4 MB in the beginning and 156.7 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-12-18 18:50:04,548 INFO L168 Benchmark]: Boogie Preprocessor took 70.79 ms. Allocated memory is still 207.6 MB. Free memory was 156.7 MB in the beginning and 154.1 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-12-18 18:50:04,550 INFO L168 Benchmark]: RCFGBuilder took 874.70 ms. Allocated memory is still 207.6 MB. Free memory was 154.1 MB in the beginning and 104.5 MB in the end (delta: 49.7 MB). Peak memory consumption was 49.7 MB. Max. memory is 7.1 GB. [2019-12-18 18:50:04,551 INFO L168 Benchmark]: TraceAbstraction took 115283.34 ms. Allocated memory was 207.6 MB in the beginning and 3.0 GB in the end (delta: 2.8 GB). Free memory was 103.8 MB in the beginning and 1.7 GB in the end (delta: -1.6 GB). Peak memory consumption was 1.2 GB. Max. memory is 7.1 GB. [2019-12-18 18:50:04,555 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.49 ms. Allocated memory is still 140.0 MB. Free memory was 123.2 MB in the beginning and 123.0 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 1050.11 ms. Allocated memory was 140.0 MB in the beginning and 207.6 MB in the end (delta: 67.6 MB). Free memory was 102.5 MB in the beginning and 159.4 MB in the end (delta: -56.9 MB). Peak memory consumption was 24.6 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 75.08 ms. Allocated memory is still 207.6 MB. Free memory was 159.4 MB in the beginning and 156.7 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 70.79 ms. Allocated memory is still 207.6 MB. Free memory was 156.7 MB in the beginning and 154.1 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 874.70 ms. Allocated memory is still 207.6 MB. Free memory was 154.1 MB in the beginning and 104.5 MB in the end (delta: 49.7 MB). Peak memory consumption was 49.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 115283.34 ms. Allocated memory was 207.6 MB in the beginning and 3.0 GB in the end (delta: 2.8 GB). Free memory was 103.8 MB in the beginning and 1.7 GB in the end (delta: -1.6 GB). Peak memory consumption was 1.2 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 6.2s, 175 ProgramPointsBefore, 92 ProgramPointsAfterwards, 212 TransitionsBefore, 102 TransitionsAfterwards, 19004 CoEnabledTransitionPairs, 12 FixpointIterations, 32 TrivialSequentialCompositions, 54 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 35 ConcurrentYvCompositions, 31 ChoiceCompositions, 7185 VarBasedMoverChecksPositive, 382 VarBasedMoverChecksNegative, 188 SemBasedMoverChecksPositive, 288 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 2.1s, 0 MoverChecksTotal, 125946 CheckedPairsTotal, 121 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L820] FCALL, FORK 0 pthread_create(&t2281, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L734] 1 z$r_buff1_thd0 = z$r_buff0_thd0 [L735] 1 z$r_buff1_thd1 = z$r_buff0_thd1 [L736] 1 z$r_buff1_thd2 = z$r_buff0_thd2 [L737] 1 z$r_buff1_thd3 = z$r_buff0_thd3 [L738] 1 z$r_buff0_thd1 = (_Bool)1 [L741] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L744] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L822] FCALL, FORK 0 pthread_create(&t2282, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L824] FCALL, FORK 0 pthread_create(&t2283, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L758] 2 x = 2 [L761] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L764] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L764] 2 z = z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L778] 3 __unbuffered_p2_EAX = y [L781] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L782] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L783] 3 z$flush_delayed = weak$$choice2 [L784] 3 z$mem_tmp = z VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L785] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) VAL [!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L785] 3 z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L765] 2 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L786] EXPR 3 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0))=1, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L766] 2 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L786] 3 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L787] 3 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L767] 2 z$r_buff0_thd2 = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L788] 3 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L789] 3 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L791] EXPR 3 weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))=0, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L791] 3 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L792] 3 __unbuffered_p2_EBX = z VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L797] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L744] 1 z = z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L745] 1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L746] 1 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L797] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L798] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L799] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L800] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L830] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L830] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L831] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L832] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L833] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 166 locations, 2 error locations. Result: UNSAFE, OverallTime: 114.9s, OverallIterations: 36, TraceHistogramMax: 1, AutomataDifference: 46.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 8300 SDtfs, 11338 SDslu, 31710 SDs, 0 SdLazy, 20457 SolverSat, 560 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 17.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 508 GetRequests, 55 SyntacticMatches, 28 SemanticMatches, 425 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3240 ImplicationChecksByTransitivity, 6.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=142946occurred in iteration=2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 37.0s AutomataMinimizationTime, 35 MinimizatonAttempts, 343743 StatesRemovedByMinimization, 32 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 4.0s InterpolantComputationTime, 1884 NumberOfCodeBlocks, 1884 NumberOfCodeBlocksAsserted, 36 NumberOfCheckSat, 1782 ConstructedInterpolants, 0 QuantifiedInterpolants, 411024 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 35 InterpolantComputations, 35 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...