/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/mix055_tso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-fae578e [2019-12-18 17:54:30,513 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-18 17:54:30,516 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-18 17:54:30,535 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-18 17:54:30,535 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-18 17:54:30,537 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-18 17:54:30,539 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-18 17:54:30,548 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-18 17:54:30,552 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-18 17:54:30,555 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-18 17:54:30,557 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-18 17:54:30,558 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-18 17:54:30,559 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-18 17:54:30,560 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-18 17:54:30,563 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-18 17:54:30,564 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-18 17:54:30,565 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-18 17:54:30,566 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-18 17:54:30,567 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-18 17:54:30,572 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-18 17:54:30,576 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-18 17:54:30,580 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-18 17:54:30,582 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-18 17:54:30,582 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-18 17:54:30,584 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-18 17:54:30,585 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-18 17:54:30,585 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-18 17:54:30,586 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-18 17:54:30,588 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-18 17:54:30,589 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-18 17:54:30,589 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-18 17:54:30,590 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-18 17:54:30,590 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-18 17:54:30,591 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-18 17:54:30,592 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-18 17:54:30,593 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-18 17:54:30,593 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-18 17:54:30,593 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-18 17:54:30,594 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-18 17:54:30,594 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-18 17:54:30,596 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-18 17:54:30,596 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 17:54:30,615 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-18 17:54:30,615 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-18 17:54:30,617 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-18 17:54:30,617 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-18 17:54:30,617 INFO L138 SettingsManager]: * Use SBE=true [2019-12-18 17:54:30,617 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-18 17:54:30,617 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-18 17:54:30,622 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-18 17:54:30,623 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-18 17:54:30,623 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-18 17:54:30,623 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-18 17:54:30,623 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-18 17:54:30,623 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-18 17:54:30,624 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-18 17:54:30,624 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-18 17:54:30,624 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-18 17:54:30,624 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-18 17:54:30,624 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-18 17:54:30,625 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-18 17:54:30,625 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-18 17:54:30,625 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-18 17:54:30,625 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 17:54:30,625 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-18 17:54:30,626 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-18 17:54:30,626 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-18 17:54:30,626 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-18 17:54:30,626 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-18 17:54:30,626 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-18 17:54:30,627 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-18 17:54:30,890 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-18 17:54:30,907 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-18 17:54:30,910 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-18 17:54:30,911 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-18 17:54:30,912 INFO L275 PluginConnector]: CDTParser initialized [2019-12-18 17:54:30,912 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix055_tso.opt.i [2019-12-18 17:54:30,972 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/df4b381ca/9e4745def0b64b43aa5ebb326d5dd9c1/FLAGd9780afd9 [2019-12-18 17:54:31,566 INFO L306 CDTParser]: Found 1 translation units. [2019-12-18 17:54:31,567 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix055_tso.opt.i [2019-12-18 17:54:31,591 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/df4b381ca/9e4745def0b64b43aa5ebb326d5dd9c1/FLAGd9780afd9 [2019-12-18 17:54:31,823 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/df4b381ca/9e4745def0b64b43aa5ebb326d5dd9c1 [2019-12-18 17:54:31,833 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-18 17:54:31,835 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-18 17:54:31,836 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-18 17:54:31,836 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-18 17:54:31,839 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-18 17:54:31,840 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 05:54:31" (1/1) ... [2019-12-18 17:54:31,843 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@bb00da7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:54:31, skipping insertion in model container [2019-12-18 17:54:31,844 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 05:54:31" (1/1) ... [2019-12-18 17:54:31,851 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-18 17:54:31,898 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-18 17:54:32,416 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 17:54:32,435 INFO L203 MainTranslator]: Completed pre-run [2019-12-18 17:54:32,517 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 17:54:32,591 INFO L208 MainTranslator]: Completed translation [2019-12-18 17:54:32,592 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:54:32 WrapperNode [2019-12-18 17:54:32,592 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-18 17:54:32,593 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-18 17:54:32,593 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-18 17:54:32,593 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-18 17:54:32,602 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:54:32" (1/1) ... [2019-12-18 17:54:32,623 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:54:32" (1/1) ... [2019-12-18 17:54:32,664 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-18 17:54:32,664 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-18 17:54:32,664 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-18 17:54:32,665 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-18 17:54:32,675 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:54:32" (1/1) ... [2019-12-18 17:54:32,675 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:54:32" (1/1) ... [2019-12-18 17:54:32,680 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:54:32" (1/1) ... [2019-12-18 17:54:32,680 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:54:32" (1/1) ... [2019-12-18 17:54:32,691 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:54:32" (1/1) ... [2019-12-18 17:54:32,695 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:54:32" (1/1) ... [2019-12-18 17:54:32,699 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:54:32" (1/1) ... [2019-12-18 17:54:32,705 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-18 17:54:32,705 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-18 17:54:32,705 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-18 17:54:32,705 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-18 17:54:32,706 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:54:32" (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 17:54:32,767 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-18 17:54:32,767 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-18 17:54:32,767 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-18 17:54:32,767 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-18 17:54:32,768 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-18 17:54:32,768 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-18 17:54:32,768 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-18 17:54:32,768 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-18 17:54:32,768 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-18 17:54:32,768 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-18 17:54:32,769 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2019-12-18 17:54:32,769 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2019-12-18 17:54:32,769 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-18 17:54:32,769 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-18 17:54:32,769 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-18 17:54:32,772 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 17:54:33,490 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-18 17:54:33,491 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-18 17:54:33,492 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 05:54:33 BoogieIcfgContainer [2019-12-18 17:54:33,492 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-18 17:54:33,494 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-18 17:54:33,494 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-18 17:54:33,497 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-18 17:54:33,498 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 05:54:31" (1/3) ... [2019-12-18 17:54:33,499 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a751b31 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 05:54:33, skipping insertion in model container [2019-12-18 17:54:33,499 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:54:32" (2/3) ... [2019-12-18 17:54:33,499 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a751b31 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 05:54:33, skipping insertion in model container [2019-12-18 17:54:33,500 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 05:54:33" (3/3) ... [2019-12-18 17:54:33,501 INFO L109 eAbstractionObserver]: Analyzing ICFG mix055_tso.opt.i [2019-12-18 17:54:33,512 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-18 17:54:33,513 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-18 17:54:33,521 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-18 17:54:33,522 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-18 17:54:33,564 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:54:33,564 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:54:33,565 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:54:33,565 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:54:33,566 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:54:33,566 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:54:33,568 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:54:33,568 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:54:33,568 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:54:33,569 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:54:33,569 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:54:33,569 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:54:33,570 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:54:33,571 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:54:33,571 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:54:33,571 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:54:33,571 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:54:33,572 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:54:33,572 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:54:33,572 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:54:33,572 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:54:33,573 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:54:33,573 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:54:33,573 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:54:33,574 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:54:33,574 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:54:33,574 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:54:33,574 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:54:33,574 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:54:33,575 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:54:33,575 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:54:33,575 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:54:33,575 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:54:33,576 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:54:33,576 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:54:33,577 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:54:33,577 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:54:33,578 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:54:33,579 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:54:33,580 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:54:33,580 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:54:33,581 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:54:33,584 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:54:33,584 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:54:33,585 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:54:33,585 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:54:33,585 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:54:33,585 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:54:33,586 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:54:33,586 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:54:33,586 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:54:33,586 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:54:33,587 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:54:33,587 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:54:33,587 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:54:33,587 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:54:33,588 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:54:33,588 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:54:33,588 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:54:33,588 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:54:33,589 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:54:33,589 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:54:33,589 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:54:33,589 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:54:33,590 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:54:33,590 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:54:33,590 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:54:33,591 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:54:33,591 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:54:33,591 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:54:33,591 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:54:33,592 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:54:33,592 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:54:33,607 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:54:33,608 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:54:33,608 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:54:33,612 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:54:33,613 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:54:33,613 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:54:33,613 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:54:33,615 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:54:33,616 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:54:33,616 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:54:33,617 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:54:33,622 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:54:33,623 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:54:33,623 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:54:33,623 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:54:33,623 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:54:33,623 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:54:33,624 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:54:33,624 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:54:33,624 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:54:33,624 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:54:33,627 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:54:33,627 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:54:33,628 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:54:33,628 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:54:33,628 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:54:33,628 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:54:33,628 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:54:33,629 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:54:33,629 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:54:33,629 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:54:33,629 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:54:33,629 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:54:33,647 INFO L249 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2019-12-18 17:54:33,673 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-18 17:54:33,673 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-18 17:54:33,673 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-18 17:54:33,674 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-18 17:54:33,674 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-18 17:54:33,674 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-18 17:54:33,674 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-18 17:54:33,674 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-18 17:54:33,699 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 179 places, 207 transitions [2019-12-18 17:54:33,701 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 179 places, 207 transitions [2019-12-18 17:54:33,791 INFO L126 PetriNetUnfolder]: 41/203 cut-off events. [2019-12-18 17:54:33,791 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 17:54:33,807 INFO L76 FinitePrefix]: Finished finitePrefix Result has 216 conditions, 203 events. 41/203 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 267 event pairs. 12/172 useless extension candidates. Maximal degree in co-relation 172. Up to 2 conditions per place. [2019-12-18 17:54:33,829 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 179 places, 207 transitions [2019-12-18 17:54:33,883 INFO L126 PetriNetUnfolder]: 41/203 cut-off events. [2019-12-18 17:54:33,884 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 17:54:33,893 INFO L76 FinitePrefix]: Finished finitePrefix Result has 216 conditions, 203 events. 41/203 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 267 event pairs. 12/172 useless extension candidates. Maximal degree in co-relation 172. Up to 2 conditions per place. [2019-12-18 17:54:33,910 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 12668 [2019-12-18 17:54:33,911 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-18 17:54:39,138 WARN L192 SmtUtils]: Spent 263.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 93 [2019-12-18 17:54:39,305 WARN L192 SmtUtils]: Spent 164.00 ms on a formula simplification that was a NOOP. DAG size: 91 [2019-12-18 17:54:39,332 INFO L206 etLargeBlockEncoding]: Checked pairs total: 50860 [2019-12-18 17:54:39,333 INFO L214 etLargeBlockEncoding]: Total number of compositions: 120 [2019-12-18 17:54:39,336 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 91 places, 97 transitions [2019-12-18 17:54:41,468 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 34622 states. [2019-12-18 17:54:41,470 INFO L276 IsEmpty]: Start isEmpty. Operand 34622 states. [2019-12-18 17:54:41,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-12-18 17:54:41,478 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:54:41,479 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 17:54:41,480 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:54:41,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:54:41,486 INFO L82 PathProgramCache]: Analyzing trace with hash 1893967926, now seen corresponding path program 1 times [2019-12-18 17:54:41,496 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:54:41,496 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2031763583] [2019-12-18 17:54:41,497 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:54:41,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:54:41,797 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 17:54:41,798 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2031763583] [2019-12-18 17:54:41,799 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:54:41,799 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 17:54:41,800 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1166728039] [2019-12-18 17:54:41,805 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 17:54:41,805 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:54:41,820 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 17:54:41,821 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 17:54:41,822 INFO L87 Difference]: Start difference. First operand 34622 states. Second operand 3 states. [2019-12-18 17:54:43,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:54:43,268 INFO L93 Difference]: Finished difference Result 34366 states and 145832 transitions. [2019-12-18 17:54:43,268 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 17:54:43,270 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2019-12-18 17:54:43,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:54:43,647 INFO L225 Difference]: With dead ends: 34366 [2019-12-18 17:54:43,648 INFO L226 Difference]: Without dead ends: 33694 [2019-12-18 17:54:43,649 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 17:54:44,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33694 states. [2019-12-18 17:54:45,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33694 to 33694. [2019-12-18 17:54:45,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33694 states. [2019-12-18 17:54:45,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33694 states to 33694 states and 143088 transitions. [2019-12-18 17:54:45,573 INFO L78 Accepts]: Start accepts. Automaton has 33694 states and 143088 transitions. Word has length 9 [2019-12-18 17:54:45,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:54:45,575 INFO L462 AbstractCegarLoop]: Abstraction has 33694 states and 143088 transitions. [2019-12-18 17:54:45,575 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 17:54:45,577 INFO L276 IsEmpty]: Start isEmpty. Operand 33694 states and 143088 transitions. [2019-12-18 17:54:45,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-18 17:54:45,590 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:54:45,591 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 17:54:45,591 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:54:45,591 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:54:45,591 INFO L82 PathProgramCache]: Analyzing trace with hash 706074371, now seen corresponding path program 1 times [2019-12-18 17:54:45,592 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:54:45,592 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [449869474] [2019-12-18 17:54:45,592 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:54:45,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:54:45,724 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 17:54:45,725 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [449869474] [2019-12-18 17:54:45,725 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:54:45,725 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 17:54:45,726 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1651280676] [2019-12-18 17:54:45,727 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 17:54:45,727 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:54:45,728 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 17:54:45,728 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 17:54:45,728 INFO L87 Difference]: Start difference. First operand 33694 states and 143088 transitions. Second operand 4 states. [2019-12-18 17:54:48,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:54:48,080 INFO L93 Difference]: Finished difference Result 52350 states and 214840 transitions. [2019-12-18 17:54:48,080 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 17:54:48,081 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2019-12-18 17:54:48,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:54:48,362 INFO L225 Difference]: With dead ends: 52350 [2019-12-18 17:54:48,363 INFO L226 Difference]: Without dead ends: 52322 [2019-12-18 17:54:48,367 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 17:54:48,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52322 states. [2019-12-18 17:54:50,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52322 to 47546. [2019-12-18 17:54:50,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47546 states. [2019-12-18 17:54:50,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47546 states to 47546 states and 197076 transitions. [2019-12-18 17:54:50,499 INFO L78 Accepts]: Start accepts. Automaton has 47546 states and 197076 transitions. Word has length 15 [2019-12-18 17:54:50,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:54:50,500 INFO L462 AbstractCegarLoop]: Abstraction has 47546 states and 197076 transitions. [2019-12-18 17:54:50,500 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 17:54:50,500 INFO L276 IsEmpty]: Start isEmpty. Operand 47546 states and 197076 transitions. [2019-12-18 17:54:50,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-18 17:54:50,503 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:54:50,504 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 17:54:50,504 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:54:50,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:54:50,504 INFO L82 PathProgramCache]: Analyzing trace with hash -1899832342, now seen corresponding path program 1 times [2019-12-18 17:54:50,505 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:54:50,505 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1138729381] [2019-12-18 17:54:50,505 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:54:50,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:54:50,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 17:54:50,576 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1138729381] [2019-12-18 17:54:50,576 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:54:50,577 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 17:54:50,577 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [501215958] [2019-12-18 17:54:50,577 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 17:54:50,578 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:54:50,578 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 17:54:50,578 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 17:54:50,578 INFO L87 Difference]: Start difference. First operand 47546 states and 197076 transitions. Second operand 4 states. [2019-12-18 17:54:52,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:54:52,980 INFO L93 Difference]: Finished difference Result 58566 states and 240916 transitions. [2019-12-18 17:54:52,981 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 17:54:52,981 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2019-12-18 17:54:52,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:54:53,431 INFO L225 Difference]: With dead ends: 58566 [2019-12-18 17:54:53,432 INFO L226 Difference]: Without dead ends: 58566 [2019-12-18 17:54:53,432 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 17:54:53,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58566 states. [2019-12-18 17:54:55,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58566 to 52262. [2019-12-18 17:54:55,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52262 states. [2019-12-18 17:54:55,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52262 states to 52262 states and 216300 transitions. [2019-12-18 17:54:55,557 INFO L78 Accepts]: Start accepts. Automaton has 52262 states and 216300 transitions. Word has length 15 [2019-12-18 17:54:55,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:54:55,558 INFO L462 AbstractCegarLoop]: Abstraction has 52262 states and 216300 transitions. [2019-12-18 17:54:55,558 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 17:54:55,558 INFO L276 IsEmpty]: Start isEmpty. Operand 52262 states and 216300 transitions. [2019-12-18 17:54:55,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-18 17:54:55,572 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:54:55,573 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 17:54:55,573 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:54:55,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:54:55,573 INFO L82 PathProgramCache]: Analyzing trace with hash -1099673125, now seen corresponding path program 1 times [2019-12-18 17:54:55,574 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:54:55,574 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [221409330] [2019-12-18 17:54:55,574 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:54:55,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:54:55,662 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 17:54:55,663 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [221409330] [2019-12-18 17:54:55,663 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:54:55,663 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 17:54:55,663 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1410158666] [2019-12-18 17:54:55,664 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 17:54:55,664 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:54:55,664 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 17:54:55,665 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 17:54:55,666 INFO L87 Difference]: Start difference. First operand 52262 states and 216300 transitions. Second operand 4 states. [2019-12-18 17:54:55,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:54:55,871 INFO L93 Difference]: Finished difference Result 41984 states and 159713 transitions. [2019-12-18 17:54:55,872 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 17:54:55,872 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 21 [2019-12-18 17:54:55,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:54:55,994 INFO L225 Difference]: With dead ends: 41984 [2019-12-18 17:54:55,995 INFO L226 Difference]: Without dead ends: 40876 [2019-12-18 17:54:55,995 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 17:54:56,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40876 states. [2019-12-18 17:54:58,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40876 to 40876. [2019-12-18 17:54:58,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40876 states. [2019-12-18 17:54:58,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40876 states to 40876 states and 156237 transitions. [2019-12-18 17:54:58,890 INFO L78 Accepts]: Start accepts. Automaton has 40876 states and 156237 transitions. Word has length 21 [2019-12-18 17:54:58,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:54:58,891 INFO L462 AbstractCegarLoop]: Abstraction has 40876 states and 156237 transitions. [2019-12-18 17:54:58,891 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 17:54:58,891 INFO L276 IsEmpty]: Start isEmpty. Operand 40876 states and 156237 transitions. [2019-12-18 17:54:58,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-18 17:54:58,901 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:54:58,901 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 17:54:58,901 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:54:58,902 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:54:58,902 INFO L82 PathProgramCache]: Analyzing trace with hash 637645513, now seen corresponding path program 1 times [2019-12-18 17:54:58,902 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:54:58,902 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [84518495] [2019-12-18 17:54:58,903 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:54:58,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:54:58,987 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 17:54:58,987 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [84518495] [2019-12-18 17:54:58,988 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:54:58,988 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 17:54:58,988 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1577192992] [2019-12-18 17:54:58,988 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 17:54:58,989 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:54:58,989 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 17:54:58,989 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 17:54:58,989 INFO L87 Difference]: Start difference. First operand 40876 states and 156237 transitions. Second operand 5 states. [2019-12-18 17:54:59,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:54:59,686 INFO L93 Difference]: Finished difference Result 54396 states and 204140 transitions. [2019-12-18 17:54:59,686 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-18 17:54:59,686 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-12-18 17:54:59,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:54:59,804 INFO L225 Difference]: With dead ends: 54396 [2019-12-18 17:54:59,804 INFO L226 Difference]: Without dead ends: 54375 [2019-12-18 17:54:59,804 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-18 17:55:00,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54375 states. [2019-12-18 17:55:01,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54375 to 41122. [2019-12-18 17:55:01,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41122 states. [2019-12-18 17:55:01,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41122 states to 41122 states and 156869 transitions. [2019-12-18 17:55:01,155 INFO L78 Accepts]: Start accepts. Automaton has 41122 states and 156869 transitions. Word has length 22 [2019-12-18 17:55:01,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:55:01,155 INFO L462 AbstractCegarLoop]: Abstraction has 41122 states and 156869 transitions. [2019-12-18 17:55:01,156 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 17:55:01,156 INFO L276 IsEmpty]: Start isEmpty. Operand 41122 states and 156869 transitions. [2019-12-18 17:55:01,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-12-18 17:55:01,187 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:55:01,187 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 17:55:01,187 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:55:01,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:55:01,188 INFO L82 PathProgramCache]: Analyzing trace with hash -2027557007, now seen corresponding path program 1 times [2019-12-18 17:55:01,188 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:55:01,188 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1954413020] [2019-12-18 17:55:01,188 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:55:01,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:55:01,235 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 17:55:01,236 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1954413020] [2019-12-18 17:55:01,236 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:55:01,236 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 17:55:01,236 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1800507974] [2019-12-18 17:55:01,237 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 17:55:01,237 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:55:01,237 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 17:55:01,237 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 17:55:01,238 INFO L87 Difference]: Start difference. First operand 41122 states and 156869 transitions. Second operand 3 states. [2019-12-18 17:55:02,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:55:02,908 INFO L93 Difference]: Finished difference Result 51974 states and 196153 transitions. [2019-12-18 17:55:02,909 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 17:55:02,909 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2019-12-18 17:55:02,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:55:03,023 INFO L225 Difference]: With dead ends: 51974 [2019-12-18 17:55:03,024 INFO L226 Difference]: Without dead ends: 51974 [2019-12-18 17:55:03,024 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 17:55:03,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51974 states. [2019-12-18 17:55:03,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51974 to 45309. [2019-12-18 17:55:03,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45309 states. [2019-12-18 17:55:04,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45309 states to 45309 states and 172388 transitions. [2019-12-18 17:55:04,333 INFO L78 Accepts]: Start accepts. Automaton has 45309 states and 172388 transitions. Word has length 30 [2019-12-18 17:55:04,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:55:04,334 INFO L462 AbstractCegarLoop]: Abstraction has 45309 states and 172388 transitions. [2019-12-18 17:55:04,334 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 17:55:04,335 INFO L276 IsEmpty]: Start isEmpty. Operand 45309 states and 172388 transitions. [2019-12-18 17:55:04,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-12-18 17:55:04,363 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:55:04,364 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 17:55:04,364 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:55:04,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:55:04,365 INFO L82 PathProgramCache]: Analyzing trace with hash -2027793723, now seen corresponding path program 1 times [2019-12-18 17:55:04,367 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:55:04,367 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [992661880] [2019-12-18 17:55:04,368 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:55:04,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:55:04,447 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 17:55:04,448 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [992661880] [2019-12-18 17:55:04,448 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:55:04,448 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 17:55:04,448 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1469612920] [2019-12-18 17:55:04,449 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 17:55:04,449 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:55:04,449 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 17:55:04,449 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-18 17:55:04,450 INFO L87 Difference]: Start difference. First operand 45309 states and 172388 transitions. Second operand 5 states. [2019-12-18 17:55:04,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:55:04,579 INFO L93 Difference]: Finished difference Result 19765 states and 62245 transitions. [2019-12-18 17:55:04,580 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 17:55:04,580 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 30 [2019-12-18 17:55:04,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:55:04,617 INFO L225 Difference]: With dead ends: 19765 [2019-12-18 17:55:04,617 INFO L226 Difference]: Without dead ends: 18889 [2019-12-18 17:55:04,617 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 17:55:04,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18889 states. [2019-12-18 17:55:04,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18889 to 18889. [2019-12-18 17:55:04,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18889 states. [2019-12-18 17:55:04,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18889 states to 18889 states and 59447 transitions. [2019-12-18 17:55:04,898 INFO L78 Accepts]: Start accepts. Automaton has 18889 states and 59447 transitions. Word has length 30 [2019-12-18 17:55:04,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:55:04,898 INFO L462 AbstractCegarLoop]: Abstraction has 18889 states and 59447 transitions. [2019-12-18 17:55:04,898 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 17:55:04,898 INFO L276 IsEmpty]: Start isEmpty. Operand 18889 states and 59447 transitions. [2019-12-18 17:55:04,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-12-18 17:55:04,908 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:55:04,908 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 17:55:04,909 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:55:04,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:55:04,909 INFO L82 PathProgramCache]: Analyzing trace with hash -1945851485, now seen corresponding path program 1 times [2019-12-18 17:55:04,909 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:55:04,909 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1539774618] [2019-12-18 17:55:04,909 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:55:04,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:55:05,025 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 17:55:05,025 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1539774618] [2019-12-18 17:55:05,025 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:55:05,026 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 17:55:05,026 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1274371377] [2019-12-18 17:55:05,026 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 17:55:05,026 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:55:05,028 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 17:55:05,028 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-18 17:55:05,028 INFO L87 Difference]: Start difference. First operand 18889 states and 59447 transitions. Second operand 6 states. [2019-12-18 17:55:05,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:55:05,117 INFO L93 Difference]: Finished difference Result 3470 states and 8793 transitions. [2019-12-18 17:55:05,117 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 17:55:05,118 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 31 [2019-12-18 17:55:05,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:55:05,122 INFO L225 Difference]: With dead ends: 3470 [2019-12-18 17:55:05,122 INFO L226 Difference]: Without dead ends: 3101 [2019-12-18 17:55:05,122 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2019-12-18 17:55:05,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3101 states. [2019-12-18 17:55:05,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3101 to 3101. [2019-12-18 17:55:05,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3101 states. [2019-12-18 17:55:05,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3101 states to 3101 states and 7755 transitions. [2019-12-18 17:55:05,156 INFO L78 Accepts]: Start accepts. Automaton has 3101 states and 7755 transitions. Word has length 31 [2019-12-18 17:55:05,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:55:05,157 INFO L462 AbstractCegarLoop]: Abstraction has 3101 states and 7755 transitions. [2019-12-18 17:55:05,157 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 17:55:05,157 INFO L276 IsEmpty]: Start isEmpty. Operand 3101 states and 7755 transitions. [2019-12-18 17:55:05,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-12-18 17:55:05,160 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:55:05,160 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 17:55:05,161 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:55:05,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:55:05,161 INFO L82 PathProgramCache]: Analyzing trace with hash -476238483, now seen corresponding path program 1 times [2019-12-18 17:55:05,161 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:55:05,162 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [280692640] [2019-12-18 17:55:05,162 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:55:05,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:55:05,266 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 17:55:05,266 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [280692640] [2019-12-18 17:55:05,266 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:55:05,267 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 17:55:05,267 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1856537909] [2019-12-18 17:55:05,267 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 17:55:05,267 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:55:05,268 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 17:55:05,268 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-12-18 17:55:05,268 INFO L87 Difference]: Start difference. First operand 3101 states and 7755 transitions. Second operand 7 states. [2019-12-18 17:55:05,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:55:05,374 INFO L93 Difference]: Finished difference Result 1342 states and 3750 transitions. [2019-12-18 17:55:05,375 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 17:55:05,375 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 43 [2019-12-18 17:55:05,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:55:05,377 INFO L225 Difference]: With dead ends: 1342 [2019-12-18 17:55:05,377 INFO L226 Difference]: Without dead ends: 1293 [2019-12-18 17:55:05,378 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2019-12-18 17:55:05,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1293 states. [2019-12-18 17:55:05,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1293 to 1181. [2019-12-18 17:55:05,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1181 states. [2019-12-18 17:55:05,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1181 states to 1181 states and 3334 transitions. [2019-12-18 17:55:05,391 INFO L78 Accepts]: Start accepts. Automaton has 1181 states and 3334 transitions. Word has length 43 [2019-12-18 17:55:05,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:55:05,392 INFO L462 AbstractCegarLoop]: Abstraction has 1181 states and 3334 transitions. [2019-12-18 17:55:05,392 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 17:55:05,392 INFO L276 IsEmpty]: Start isEmpty. Operand 1181 states and 3334 transitions. [2019-12-18 17:55:05,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-18 17:55:05,394 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:55:05,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] [2019-12-18 17:55:05,394 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:55:05,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:55:05,395 INFO L82 PathProgramCache]: Analyzing trace with hash -409088440, now seen corresponding path program 1 times [2019-12-18 17:55:05,395 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:55:05,395 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [789163311] [2019-12-18 17:55:05,395 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:55:05,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:55:05,559 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 17:55:05,559 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [789163311] [2019-12-18 17:55:05,560 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:55:05,560 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 17:55:05,560 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [514802000] [2019-12-18 17:55:05,562 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 17:55:05,562 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:55:05,562 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 17:55:05,562 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 17:55:05,562 INFO L87 Difference]: Start difference. First operand 1181 states and 3334 transitions. Second operand 5 states. [2019-12-18 17:55:05,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:55:05,818 INFO L93 Difference]: Finished difference Result 1666 states and 4696 transitions. [2019-12-18 17:55:05,818 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 17:55:05,818 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 58 [2019-12-18 17:55:05,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:55:05,821 INFO L225 Difference]: With dead ends: 1666 [2019-12-18 17:55:05,821 INFO L226 Difference]: Without dead ends: 1666 [2019-12-18 17:55:05,822 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 17:55:05,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1666 states. [2019-12-18 17:55:05,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1666 to 1470. [2019-12-18 17:55:05,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1470 states. [2019-12-18 17:55:05,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1470 states to 1470 states and 4144 transitions. [2019-12-18 17:55:05,843 INFO L78 Accepts]: Start accepts. Automaton has 1470 states and 4144 transitions. Word has length 58 [2019-12-18 17:55:05,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:55:05,843 INFO L462 AbstractCegarLoop]: Abstraction has 1470 states and 4144 transitions. [2019-12-18 17:55:05,844 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 17:55:05,844 INFO L276 IsEmpty]: Start isEmpty. Operand 1470 states and 4144 transitions. [2019-12-18 17:55:05,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-18 17:55:05,846 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:55:05,847 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 17:55:05,847 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:55:05,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:55:05,847 INFO L82 PathProgramCache]: Analyzing trace with hash -2087231872, now seen corresponding path program 2 times [2019-12-18 17:55:05,847 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:55:05,847 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [917586976] [2019-12-18 17:55:05,848 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:55:05,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:55:05,948 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 17:55:05,949 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [917586976] [2019-12-18 17:55:05,949 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:55:05,949 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 17:55:05,949 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1959211214] [2019-12-18 17:55:05,950 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 17:55:05,950 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:55:05,950 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 17:55:05,950 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-18 17:55:05,951 INFO L87 Difference]: Start difference. First operand 1470 states and 4144 transitions. Second operand 6 states. [2019-12-18 17:55:06,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:55:06,361 INFO L93 Difference]: Finished difference Result 1745 states and 4788 transitions. [2019-12-18 17:55:06,361 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 17:55:06,361 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 58 [2019-12-18 17:55:06,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:55:06,366 INFO L225 Difference]: With dead ends: 1745 [2019-12-18 17:55:06,366 INFO L226 Difference]: Without dead ends: 1745 [2019-12-18 17:55:06,367 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-18 17:55:06,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1745 states. [2019-12-18 17:55:06,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1745 to 1522. [2019-12-18 17:55:06,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1522 states. [2019-12-18 17:55:06,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1522 states to 1522 states and 4220 transitions. [2019-12-18 17:55:06,398 INFO L78 Accepts]: Start accepts. Automaton has 1522 states and 4220 transitions. Word has length 58 [2019-12-18 17:55:06,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:55:06,398 INFO L462 AbstractCegarLoop]: Abstraction has 1522 states and 4220 transitions. [2019-12-18 17:55:06,398 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 17:55:06,399 INFO L276 IsEmpty]: Start isEmpty. Operand 1522 states and 4220 transitions. [2019-12-18 17:55:06,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-18 17:55:06,402 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:55:06,402 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 17:55:06,402 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:55:06,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:55:06,403 INFO L82 PathProgramCache]: Analyzing trace with hash -893148506, now seen corresponding path program 3 times [2019-12-18 17:55:06,403 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:55:06,403 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [663723121] [2019-12-18 17:55:06,403 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:55:06,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:55:06,474 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 17:55:06,475 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [663723121] [2019-12-18 17:55:06,475 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:55:06,475 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 17:55:06,475 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [693230803] [2019-12-18 17:55:06,476 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 17:55:06,476 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:55:06,476 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 17:55:06,476 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 17:55:06,477 INFO L87 Difference]: Start difference. First operand 1522 states and 4220 transitions. Second operand 3 states. [2019-12-18 17:55:06,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:55:06,495 INFO L93 Difference]: Finished difference Result 1414 states and 3884 transitions. [2019-12-18 17:55:06,495 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 17:55:06,495 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 58 [2019-12-18 17:55:06,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:55:06,498 INFO L225 Difference]: With dead ends: 1414 [2019-12-18 17:55:06,498 INFO L226 Difference]: Without dead ends: 1414 [2019-12-18 17:55:06,498 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 17:55:06,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1414 states. [2019-12-18 17:55:06,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1414 to 1414. [2019-12-18 17:55:06,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1414 states. [2019-12-18 17:55:06,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1414 states to 1414 states and 3884 transitions. [2019-12-18 17:55:06,520 INFO L78 Accepts]: Start accepts. Automaton has 1414 states and 3884 transitions. Word has length 58 [2019-12-18 17:55:06,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:55:06,520 INFO L462 AbstractCegarLoop]: Abstraction has 1414 states and 3884 transitions. [2019-12-18 17:55:06,520 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 17:55:06,520 INFO L276 IsEmpty]: Start isEmpty. Operand 1414 states and 3884 transitions. [2019-12-18 17:55:06,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-18 17:55:06,523 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:55:06,524 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 17:55:06,524 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:55:06,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:55:06,524 INFO L82 PathProgramCache]: Analyzing trace with hash -465324325, now seen corresponding path program 1 times [2019-12-18 17:55:06,524 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:55:06,525 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [773438184] [2019-12-18 17:55:06,525 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:55:06,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:55:06,609 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 17:55:06,610 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [773438184] [2019-12-18 17:55:06,610 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:55:06,610 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 17:55:06,611 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [711766919] [2019-12-18 17:55:06,611 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 17:55:06,611 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:55:06,611 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 17:55:06,612 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 17:55:06,612 INFO L87 Difference]: Start difference. First operand 1414 states and 3884 transitions. Second operand 3 states. [2019-12-18 17:55:06,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:55:06,661 INFO L93 Difference]: Finished difference Result 1413 states and 3882 transitions. [2019-12-18 17:55:06,661 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 17:55:06,661 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 59 [2019-12-18 17:55:06,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:55:06,664 INFO L225 Difference]: With dead ends: 1413 [2019-12-18 17:55:06,664 INFO L226 Difference]: Without dead ends: 1413 [2019-12-18 17:55:06,665 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 17:55:06,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1413 states. [2019-12-18 17:55:06,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1413 to 1160. [2019-12-18 17:55:06,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1160 states. [2019-12-18 17:55:06,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1160 states to 1160 states and 3188 transitions. [2019-12-18 17:55:06,685 INFO L78 Accepts]: Start accepts. Automaton has 1160 states and 3188 transitions. Word has length 59 [2019-12-18 17:55:06,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:55:06,685 INFO L462 AbstractCegarLoop]: Abstraction has 1160 states and 3188 transitions. [2019-12-18 17:55:06,685 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 17:55:06,685 INFO L276 IsEmpty]: Start isEmpty. Operand 1160 states and 3188 transitions. [2019-12-18 17:55:06,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-12-18 17:55:06,688 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:55:06,688 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 17:55:06,688 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:55:06,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:55:06,689 INFO L82 PathProgramCache]: Analyzing trace with hash 1056994783, now seen corresponding path program 1 times [2019-12-18 17:55:06,689 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:55:06,689 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1206938114] [2019-12-18 17:55:06,690 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:55:06,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:55:06,806 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 17:55:06,807 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1206938114] [2019-12-18 17:55:06,807 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:55:06,807 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 17:55:06,807 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1132932183] [2019-12-18 17:55:06,808 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 17:55:06,808 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:55:06,808 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 17:55:06,808 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-18 17:55:06,809 INFO L87 Difference]: Start difference. First operand 1160 states and 3188 transitions. Second operand 6 states. [2019-12-18 17:55:06,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:55:06,867 INFO L93 Difference]: Finished difference Result 1631 states and 4216 transitions. [2019-12-18 17:55:06,867 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 17:55:06,867 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 60 [2019-12-18 17:55:06,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:55:06,869 INFO L225 Difference]: With dead ends: 1631 [2019-12-18 17:55:06,869 INFO L226 Difference]: Without dead ends: 1020 [2019-12-18 17:55:06,870 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-18 17:55:06,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1020 states. [2019-12-18 17:55:06,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1020 to 1020. [2019-12-18 17:55:06,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1020 states. [2019-12-18 17:55:06,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1020 states to 1020 states and 2717 transitions. [2019-12-18 17:55:06,882 INFO L78 Accepts]: Start accepts. Automaton has 1020 states and 2717 transitions. Word has length 60 [2019-12-18 17:55:06,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:55:06,882 INFO L462 AbstractCegarLoop]: Abstraction has 1020 states and 2717 transitions. [2019-12-18 17:55:06,882 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 17:55:06,882 INFO L276 IsEmpty]: Start isEmpty. Operand 1020 states and 2717 transitions. [2019-12-18 17:55:06,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-12-18 17:55:06,884 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:55:06,884 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 17:55:06,884 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:55:06,885 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:55:06,885 INFO L82 PathProgramCache]: Analyzing trace with hash 1968443931, now seen corresponding path program 2 times [2019-12-18 17:55:06,885 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:55:06,885 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1399605971] [2019-12-18 17:55:06,885 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:55:06,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:55:07,095 WARN L192 SmtUtils]: Spent 136.00 ms on a formula simplification that was a NOOP. DAG size: 3 [2019-12-18 17:55:07,159 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 17:55:07,160 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1399605971] [2019-12-18 17:55:07,160 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:55:07,160 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 17:55:07,161 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [673892011] [2019-12-18 17:55:07,161 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 17:55:07,161 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:55:07,161 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 17:55:07,162 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-18 17:55:07,162 INFO L87 Difference]: Start difference. First operand 1020 states and 2717 transitions. Second operand 6 states. [2019-12-18 17:55:07,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:55:07,231 INFO L93 Difference]: Finished difference Result 1390 states and 3454 transitions. [2019-12-18 17:55:07,232 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 17:55:07,232 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 60 [2019-12-18 17:55:07,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:55:07,233 INFO L225 Difference]: With dead ends: 1390 [2019-12-18 17:55:07,234 INFO L226 Difference]: Without dead ends: 808 [2019-12-18 17:55:07,234 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-12-18 17:55:07,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 808 states. [2019-12-18 17:55:07,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 808 to 748. [2019-12-18 17:55:07,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 748 states. [2019-12-18 17:55:07,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 748 states to 748 states and 1739 transitions. [2019-12-18 17:55:07,247 INFO L78 Accepts]: Start accepts. Automaton has 748 states and 1739 transitions. Word has length 60 [2019-12-18 17:55:07,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:55:07,248 INFO L462 AbstractCegarLoop]: Abstraction has 748 states and 1739 transitions. [2019-12-18 17:55:07,248 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 17:55:07,248 INFO L276 IsEmpty]: Start isEmpty. Operand 748 states and 1739 transitions. [2019-12-18 17:55:07,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-12-18 17:55:07,249 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:55:07,250 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 17:55:07,250 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:55:07,250 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:55:07,250 INFO L82 PathProgramCache]: Analyzing trace with hash 1783112387, now seen corresponding path program 3 times [2019-12-18 17:55:07,250 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:55:07,251 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2102220037] [2019-12-18 17:55:07,251 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:55:07,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:55:07,370 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 17:55:07,370 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2102220037] [2019-12-18 17:55:07,372 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:55:07,373 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 17:55:07,373 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [738281108] [2019-12-18 17:55:07,373 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 17:55:07,374 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:55:07,374 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 17:55:07,374 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-18 17:55:07,374 INFO L87 Difference]: Start difference. First operand 748 states and 1739 transitions. Second operand 6 states. [2019-12-18 17:55:07,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:55:07,439 INFO L93 Difference]: Finished difference Result 922 states and 2035 transitions. [2019-12-18 17:55:07,439 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 17:55:07,439 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 60 [2019-12-18 17:55:07,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:55:07,440 INFO L225 Difference]: With dead ends: 922 [2019-12-18 17:55:07,441 INFO L226 Difference]: Without dead ends: 215 [2019-12-18 17:55:07,441 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-18 17:55:07,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2019-12-18 17:55:07,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 215. [2019-12-18 17:55:07,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 215 states. [2019-12-18 17:55:07,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 364 transitions. [2019-12-18 17:55:07,446 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 364 transitions. Word has length 60 [2019-12-18 17:55:07,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:55:07,447 INFO L462 AbstractCegarLoop]: Abstraction has 215 states and 364 transitions. [2019-12-18 17:55:07,447 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 17:55:07,447 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 364 transitions. [2019-12-18 17:55:07,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-12-18 17:55:07,448 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:55:07,448 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 17:55:07,449 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:55:07,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:55:07,449 INFO L82 PathProgramCache]: Analyzing trace with hash 424334393, now seen corresponding path program 4 times [2019-12-18 17:55:07,450 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:55:07,450 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [836582531] [2019-12-18 17:55:07,451 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:55:07,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:55:07,847 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 17:55:07,847 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [836582531] [2019-12-18 17:55:07,848 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:55:07,848 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-18 17:55:07,848 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [376162579] [2019-12-18 17:55:07,848 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-18 17:55:07,849 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:55:07,849 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-18 17:55:07,849 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2019-12-18 17:55:07,849 INFO L87 Difference]: Start difference. First operand 215 states and 364 transitions. Second operand 13 states. [2019-12-18 17:55:08,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:55:08,304 INFO L93 Difference]: Finished difference Result 374 states and 624 transitions. [2019-12-18 17:55:08,304 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-18 17:55:08,305 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 60 [2019-12-18 17:55:08,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:55:08,305 INFO L225 Difference]: With dead ends: 374 [2019-12-18 17:55:08,305 INFO L226 Difference]: Without dead ends: 341 [2019-12-18 17:55:08,306 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=90, Invalid=372, Unknown=0, NotChecked=0, Total=462 [2019-12-18 17:55:08,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 341 states. [2019-12-18 17:55:08,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 341 to 323. [2019-12-18 17:55:08,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 323 states. [2019-12-18 17:55:08,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 323 states to 323 states and 549 transitions. [2019-12-18 17:55:08,310 INFO L78 Accepts]: Start accepts. Automaton has 323 states and 549 transitions. Word has length 60 [2019-12-18 17:55:08,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:55:08,311 INFO L462 AbstractCegarLoop]: Abstraction has 323 states and 549 transitions. [2019-12-18 17:55:08,311 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-18 17:55:08,311 INFO L276 IsEmpty]: Start isEmpty. Operand 323 states and 549 transitions. [2019-12-18 17:55:08,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-12-18 17:55:08,312 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:55:08,312 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 17:55:08,312 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:55:08,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:55:08,313 INFO L82 PathProgramCache]: Analyzing trace with hash -1750352957, now seen corresponding path program 5 times [2019-12-18 17:55:08,313 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:55:08,313 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [369333401] [2019-12-18 17:55:08,313 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:55:08,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 17:55:08,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 17:55:08,431 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-18 17:55:08,432 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-18 17:55:08,436 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [783] [783] ULTIMATE.startENTRY-->L823: Formula: (let ((.cse0 (store |v_#valid_72| 0 0))) (and (= v_~z$w_buff0~0_106 0) (= v_~z$r_buff0_thd2~0_89 0) (= v_~main$tmp_guard0~0_30 0) (= |v_#NULL.offset_6| 0) (= 0 v_~z$r_buff1_thd1~0_90) (< 0 |v_#StackHeapBarrier_21|) (= v_~a~0_108 0) (= v_~z$w_buff0_used~0_517 0) (= |v_#valid_70| (store .cse0 |v_ULTIMATE.start_main_~#t1485~0.base_22| 1)) (= v_~z$r_buff0_thd0~0_321 0) (= 0 v_~__unbuffered_p1_EAX~0_34) (= v_~z$read_delayed_var~0.offset_7 0) (= v_~z$r_buff1_thd0~0_244 0) (= 0 v_~z$w_buff1~0_99) (= 0 |v_#NULL.base_6|) (< |v_#StackHeapBarrier_21| |v_ULTIMATE.start_main_~#t1485~0.base_22|) (= 0 v_~z$r_buff1_thd2~0_90) (= v_~z$read_delayed_var~0.base_7 0) (= 0 v_~z$flush_delayed~0_47) (= v_~z$read_delayed~0_7 0) (= 0 v_~z$r_buff0_thd3~0_147) (= 0 v_~z$r_buff1_thd4~0_142) (= 0 v_~z$r_buff1_thd3~0_154) (= 0 v_~weak$$choice0~0_24) (= v_~__unbuffered_cnt~0_141 0) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t1485~0.base_22|)) (= v_~z$w_buff1_used~0_308 0) (= 0 v_~__unbuffered_p3_EAX~0_99) (= (store |v_#memory_int_28| |v_ULTIMATE.start_main_~#t1485~0.base_22| (store (select |v_#memory_int_28| |v_ULTIMATE.start_main_~#t1485~0.base_22|) |v_ULTIMATE.start_main_~#t1485~0.offset_17| 0)) |v_#memory_int_27|) (= v_~weak$$choice2~0_108 0) (= v_~z$r_buff0_thd1~0_89 0) (= 0 v_~z$r_buff0_thd4~0_241) (= 0 |v_ULTIMATE.start_main_~#t1485~0.offset_17|) (= v_~z~0_160 0) (= v_~z$mem_tmp~0_28 0) (= v_~y~0_41 0) (= v_~x~0_54 0) (= |v_#length_31| (store |v_#length_32| |v_ULTIMATE.start_main_~#t1485~0.base_22| 4)) (= v_~main$tmp_guard1~0_22 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_21|, #valid=|v_#valid_72|, #memory_int=|v_#memory_int_28|, #length=|v_#length_32|} OutVars{ULTIMATE.start_main_#t~ite28=|v_ULTIMATE.start_main_#t~ite28_33|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_90, ULTIMATE.start_main_#t~ite24=|v_ULTIMATE.start_main_#t~ite24_55|, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_38|, #NULL.offset=|v_#NULL.offset_6|, ULTIMATE.start_main_#t~ite20=|v_ULTIMATE.start_main_#t~ite20_30|, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_19|, ULTIMATE.start_main_#t~ite22=|v_ULTIMATE.start_main_#t~ite22_35|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_42|, ~a~0=v_~a~0_108, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_321, ULTIMATE.start_main_~#t1485~0.base=|v_ULTIMATE.start_main_~#t1485~0.base_22|, ULTIMATE.start_main_~#t1488~0.base=|v_ULTIMATE.start_main_~#t1488~0.base_20|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_34, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_241, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_99, #length=|v_#length_31|, ULTIMATE.start_main_~#t1486~0.offset=|v_ULTIMATE.start_main_~#t1486~0.offset_18|, ~z$mem_tmp~0=v_~z$mem_tmp~0_28, ULTIMATE.start_main_~#t1485~0.offset=|v_ULTIMATE.start_main_~#t1485~0.offset_17|, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_96|, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_33|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_308, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_30|, ~z$flush_delayed~0=v_~z$flush_delayed~0_47, ULTIMATE.start_main_#t~ite31=|v_ULTIMATE.start_main_#t~ite31_33|, ULTIMATE.start_main_#t~ite33=|v_ULTIMATE.start_main_#t~ite33_32|, ~weak$$choice0~0=v_~weak$$choice0~0_24, #StackHeapBarrier=|v_#StackHeapBarrier_21|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_141|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_90, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_9|, ~z$read_delayed_var~0.base=v_~z$read_delayed_var~0.base_7, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_147, ULTIMATE.start_main_#t~nondet17=|v_ULTIMATE.start_main_#t~nondet17_10|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_141, ~x~0=v_~x~0_54, ~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_142, ULTIMATE.start_main_#t~ite29=|v_ULTIMATE.start_main_#t~ite29_40|, ~z$read_delayed~0=v_~z$read_delayed~0_7, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_35|, ~z$w_buff1~0=v_~z$w_buff1~0_99, ULTIMATE.start_main_~#t1487~0.offset=|v_ULTIMATE.start_main_~#t1487~0.offset_17|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_22, ULTIMATE.start_main_#t~ite27=|v_ULTIMATE.start_main_#t~ite27_29|, ULTIMATE.start_main_~#t1487~0.base=|v_ULTIMATE.start_main_~#t1487~0.base_20|, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_7, ULTIMATE.start_main_#t~ite21=|v_ULTIMATE.start_main_#t~ite21_105|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_33|, ULTIMATE.start_main_#t~ite23=|v_ULTIMATE.start_main_#t~ite23_39|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_35|, ULTIMATE.start_main_#t~ite30=|v_ULTIMATE.start_main_#t~ite30_40|, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_244, ULTIMATE.start_main_#t~nondet26=|v_ULTIMATE.start_main_#t~nondet26_41|, ~y~0=v_~y~0_41, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_89, ULTIMATE.start_main_~#t1486~0.base=|v_ULTIMATE.start_main_~#t1486~0.base_23|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_517, ~z$w_buff0~0=v_~z$w_buff0~0_106, ULTIMATE.start_main_#t~ite19=|v_ULTIMATE.start_main_#t~ite19_33|, ULTIMATE.start_main_#t~nondet25=|v_ULTIMATE.start_main_#t~nondet25_41|, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_154, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_31|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_91|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_30, ULTIMATE.start_main_#t~ite32=|v_ULTIMATE.start_main_#t~ite32_30|, #NULL.base=|v_#NULL.base_6|, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_34|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_27|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_17|, #valid=|v_#valid_70|, #memory_int=|v_#memory_int_27|, ULTIMATE.start_main_#t~nondet16=|v_ULTIMATE.start_main_#t~nondet16_9|, ULTIMATE.start_main_~#t1488~0.offset=|v_ULTIMATE.start_main_~#t1488~0.offset_16|, ULTIMATE.start_main_#t~nondet18=|v_ULTIMATE.start_main_#t~nondet18_20|, ~z~0=v_~z~0_160, ~weak$$choice2~0=v_~weak$$choice2~0_108, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_89} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite28, ~z$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite24, ULTIMATE.start_main_#t~ite47, #NULL.offset, ULTIMATE.start_main_#t~ite20, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite22, ULTIMATE.start_main_#t~ite45, ~a~0, ~z$r_buff0_thd0~0, ULTIMATE.start_main_~#t1485~0.base, ULTIMATE.start_main_~#t1488~0.base, ~__unbuffered_p1_EAX~0, ~z$r_buff0_thd4~0, ~__unbuffered_p3_EAX~0, #length, ULTIMATE.start_main_~#t1486~0.offset, ~z$mem_tmp~0, ULTIMATE.start_main_~#t1485~0.offset, ULTIMATE.start_main_#t~ite39, ULTIMATE.start_main_#t~ite35, ~z$w_buff1_used~0, ULTIMATE.start_main_#t~ite37, ~z$flush_delayed~0, ULTIMATE.start_main_#t~ite31, ULTIMATE.start_main_#t~ite33, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite40, ~z$r_buff1_thd1~0, ULTIMATE.start_main_#t~nondet15, ~z$read_delayed_var~0.base, ~z$r_buff0_thd3~0, ULTIMATE.start_main_#t~nondet17, ~__unbuffered_cnt~0, ~x~0, ~z$r_buff1_thd4~0, ULTIMATE.start_main_#t~ite29, ~z$read_delayed~0, ULTIMATE.start_main_#t~ite46, ~z$w_buff1~0, ULTIMATE.start_main_~#t1487~0.offset, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite27, ULTIMATE.start_main_~#t1487~0.base, ~z$read_delayed_var~0.offset, ULTIMATE.start_main_#t~ite21, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite23, ULTIMATE.start_main_#t~ite44, ULTIMATE.start_main_#t~ite30, ~z$r_buff1_thd0~0, ULTIMATE.start_main_#t~nondet26, ~y~0, ~z$r_buff0_thd2~0, ULTIMATE.start_main_~#t1486~0.base, ~z$w_buff0_used~0, ~z$w_buff0~0, ULTIMATE.start_main_#t~ite19, ULTIMATE.start_main_#t~nondet25, ~z$r_buff1_thd3~0, ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite38, ~main$tmp_guard0~0, ULTIMATE.start_main_#t~ite32, #NULL.base, ULTIMATE.start_main_#t~ite34, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#res, #valid, #memory_int, ULTIMATE.start_main_#t~nondet16, ULTIMATE.start_main_~#t1488~0.offset, ULTIMATE.start_main_#t~nondet18, ~z~0, ~weak$$choice2~0, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-18 17:55:08,437 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [750] [750] L823-1-->L825: Formula: (and (= |v_#length_23| (store |v_#length_24| |v_ULTIMATE.start_main_~#t1486~0.base_13| 4)) (< |v_#StackHeapBarrier_15| |v_ULTIMATE.start_main_~#t1486~0.base_13|) (not (= 0 |v_ULTIMATE.start_main_~#t1486~0.base_13|)) (= |v_#valid_46| (store |v_#valid_47| |v_ULTIMATE.start_main_~#t1486~0.base_13| 1)) (= 0 (select |v_#valid_47| |v_ULTIMATE.start_main_~#t1486~0.base_13|)) (= (store |v_#memory_int_20| |v_ULTIMATE.start_main_~#t1486~0.base_13| (store (select |v_#memory_int_20| |v_ULTIMATE.start_main_~#t1486~0.base_13|) |v_ULTIMATE.start_main_~#t1486~0.offset_11| 1)) |v_#memory_int_19|) (= 0 |v_ULTIMATE.start_main_~#t1486~0.offset_11|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_15|, #valid=|v_#valid_47|, #memory_int=|v_#memory_int_20|, #length=|v_#length_24|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_15|, ULTIMATE.start_main_~#t1486~0.base=|v_ULTIMATE.start_main_~#t1486~0.base_13|, #valid=|v_#valid_46|, #memory_int=|v_#memory_int_19|, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_5|, #length=|v_#length_23|, ULTIMATE.start_main_~#t1486~0.offset=|v_ULTIMATE.start_main_~#t1486~0.offset_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1486~0.base, #valid, #memory_int, ULTIMATE.start_main_#t~nondet15, #length, ULTIMATE.start_main_~#t1486~0.offset] because there is no mapped edge [2019-12-18 17:55:08,438 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [745] [745] L825-1-->L827: Formula: (and (= 0 (select |v_#valid_41| |v_ULTIMATE.start_main_~#t1487~0.base_10|)) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t1487~0.base_10|) (= |v_#length_19| (store |v_#length_20| |v_ULTIMATE.start_main_~#t1487~0.base_10| 4)) (= (store |v_#valid_41| |v_ULTIMATE.start_main_~#t1487~0.base_10| 1) |v_#valid_40|) (not (= |v_ULTIMATE.start_main_~#t1487~0.base_10| 0)) (= 0 |v_ULTIMATE.start_main_~#t1487~0.offset_10|) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1487~0.base_10| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1487~0.base_10|) |v_ULTIMATE.start_main_~#t1487~0.offset_10| 2)) |v_#memory_int_15|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_41|, #memory_int=|v_#memory_int_16|, #length=|v_#length_20|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_40|, #memory_int=|v_#memory_int_15|, ULTIMATE.start_main_#t~nondet16=|v_ULTIMATE.start_main_#t~nondet16_5|, ULTIMATE.start_main_~#t1487~0.offset=|v_ULTIMATE.start_main_~#t1487~0.offset_10|, #length=|v_#length_19|, ULTIMATE.start_main_~#t1487~0.base=|v_ULTIMATE.start_main_~#t1487~0.base_10|} AuxVars[] AssignedVars[#valid, #memory_int, ULTIMATE.start_main_#t~nondet16, ULTIMATE.start_main_~#t1487~0.offset, #length, ULTIMATE.start_main_~#t1487~0.base] because there is no mapped edge [2019-12-18 17:55:08,438 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [749] [749] L827-1-->L829: Formula: (and (= (select |v_#valid_45| |v_ULTIMATE.start_main_~#t1488~0.base_11|) 0) (= |v_#length_21| (store |v_#length_22| |v_ULTIMATE.start_main_~#t1488~0.base_11| 4)) (= |v_#valid_44| (store |v_#valid_45| |v_ULTIMATE.start_main_~#t1488~0.base_11| 1)) (not (= |v_ULTIMATE.start_main_~#t1488~0.base_11| 0)) (= 0 |v_ULTIMATE.start_main_~#t1488~0.offset_10|) (< |v_#StackHeapBarrier_14| |v_ULTIMATE.start_main_~#t1488~0.base_11|) (= |v_#memory_int_17| (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1488~0.base_11| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1488~0.base_11|) |v_ULTIMATE.start_main_~#t1488~0.offset_10| 3)))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_14|, #valid=|v_#valid_45|, #memory_int=|v_#memory_int_18|, #length=|v_#length_22|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_14|, ULTIMATE.start_main_~#t1488~0.base=|v_ULTIMATE.start_main_~#t1488~0.base_11|, #valid=|v_#valid_44|, #memory_int=|v_#memory_int_17|, ULTIMATE.start_main_~#t1488~0.offset=|v_ULTIMATE.start_main_~#t1488~0.offset_10|, #length=|v_#length_21|, ULTIMATE.start_main_#t~nondet17=|v_ULTIMATE.start_main_#t~nondet17_6|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1488~0.base, #valid, #memory_int, ULTIMATE.start_main_~#t1488~0.offset, #length, ULTIMATE.start_main_#t~nondet17] because there is no mapped edge [2019-12-18 17:55:08,440 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [766] [766] L4-->L800: Formula: (and (= ~z$r_buff1_thd4~0_Out-1941536753 ~z$r_buff0_thd4~0_In-1941536753) (= ~z$r_buff0_thd2~0_In-1941536753 ~z$r_buff1_thd2~0_Out-1941536753) (= ~z$r_buff0_thd0~0_In-1941536753 ~z$r_buff1_thd0~0_Out-1941536753) (= ~a~0_In-1941536753 ~__unbuffered_p3_EAX~0_Out-1941536753) (= ~z$r_buff0_thd3~0_In-1941536753 ~z$r_buff1_thd3~0_Out-1941536753) (not (= 0 P3Thread1of1ForFork3___VERIFIER_assert_~expression_In-1941536753)) (= ~z$r_buff0_thd4~0_Out-1941536753 1) (= ~z$r_buff1_thd1~0_Out-1941536753 ~z$r_buff0_thd1~0_In-1941536753)) InVars {~a~0=~a~0_In-1941536753, P3Thread1of1ForFork3___VERIFIER_assert_~expression=P3Thread1of1ForFork3___VERIFIER_assert_~expression_In-1941536753, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1941536753, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-1941536753, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1941536753, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-1941536753, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1941536753} OutVars{P3Thread1of1ForFork3___VERIFIER_assert_~expression=P3Thread1of1ForFork3___VERIFIER_assert_~expression_In-1941536753, ~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_Out-1941536753, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_Out-1941536753, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_Out-1941536753, ~a~0=~a~0_In-1941536753, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1941536753, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_Out-1941536753, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_Out-1941536753, ~__unbuffered_p3_EAX~0=~__unbuffered_p3_EAX~0_Out-1941536753, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_Out-1941536753, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1941536753, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-1941536753, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1941536753} AuxVars[] AssignedVars[~z$r_buff1_thd4~0, ~z$r_buff1_thd3~0, ~z$r_buff1_thd0~0, ~z$r_buff1_thd2~0, ~z$r_buff1_thd1~0, ~__unbuffered_p3_EAX~0, ~z$r_buff0_thd4~0] because there is no mapped edge [2019-12-18 17:55:08,441 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [738] [738] P0ENTRY-->P0EXIT: Formula: (and (= 0 |v_P0Thread1of1ForFork0_#res.base_9|) (= |v_P0Thread1of1ForFork0_#res.offset_9| 0) (= v_P0Thread1of1ForFork0_~arg.base_19 |v_P0Thread1of1ForFork0_#in~arg.base_19|) (= (+ v_~__unbuffered_cnt~0_81 1) v_~__unbuffered_cnt~0_80) (= v_~x~0_32 1) (= v_~a~0_41 1) (= v_P0Thread1of1ForFork0_~arg.offset_19 |v_P0Thread1of1ForFork0_#in~arg.offset_19|)) InVars {P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_19|, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_19|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_81} OutVars{~a~0=v_~a~0_41, P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_19|, P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_9|, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_19|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_9|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_80, P0Thread1of1ForFork0_~arg.base=v_P0Thread1of1ForFork0_~arg.base_19, ~x~0=v_~x~0_32, P0Thread1of1ForFork0_~arg.offset=v_P0Thread1of1ForFork0_~arg.offset_19} AuxVars[] AssignedVars[~a~0, P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0, P0Thread1of1ForFork0_~arg.base, ~x~0, P0Thread1of1ForFork0_~arg.offset] because there is no mapped edge [2019-12-18 17:55:08,441 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [748] [748] P1ENTRY-->P1EXIT: Formula: (and (= v_~y~0_32 v_~__unbuffered_p1_EAX~0_23) (= |v_P1Thread1of1ForFork1_#res.offset_11| 0) (= v_P1Thread1of1ForFork1_~arg.base_19 |v_P1Thread1of1ForFork1_#in~arg.base_19|) (= 0 |v_P1Thread1of1ForFork1_#res.base_11|) (= v_~x~0_41 2) (= v_~__unbuffered_cnt~0_115 (+ v_~__unbuffered_cnt~0_116 1)) (= |v_P1Thread1of1ForFork1_#in~arg.offset_19| v_P1Thread1of1ForFork1_~arg.offset_19)) InVars {P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_19|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_19|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_116, ~y~0=v_~y~0_32} OutVars{P1Thread1of1ForFork1_~arg.offset=v_P1Thread1of1ForFork1_~arg.offset_19, P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_11|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_23, P1Thread1of1ForFork1_~arg.base=v_P1Thread1of1ForFork1_~arg.base_19, P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_19|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_19|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_115, ~y~0=v_~y~0_32, ~x~0=v_~x~0_41, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_11|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_~arg.offset, P1Thread1of1ForFork1_#res.offset, ~__unbuffered_p1_EAX~0, P1Thread1of1ForFork1_~arg.base, ~__unbuffered_cnt~0, ~x~0, P1Thread1of1ForFork1_#res.base] because there is no mapped edge [2019-12-18 17:55:08,443 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [722] [722] L801-->L801-2: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In336629324 256) 0)) (.cse0 (= (mod ~z$r_buff0_thd4~0_In336629324 256) 0))) (or (and (not .cse0) (not .cse1) (= 0 |P3Thread1of1ForFork3_#t~ite11_Out336629324|)) (and (= ~z$w_buff0_used~0_In336629324 |P3Thread1of1ForFork3_#t~ite11_Out336629324|) (or .cse1 .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In336629324, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In336629324} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In336629324, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In336629324, P3Thread1of1ForFork3_#t~ite11=|P3Thread1of1ForFork3_#t~ite11_Out336629324|} AuxVars[] AssignedVars[P3Thread1of1ForFork3_#t~ite11] because there is no mapped edge [2019-12-18 17:55:08,444 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [710] [710] L770-2-->L770-4: Formula: (let ((.cse1 (= (mod ~z$w_buff1_used~0_In741615504 256) 0)) (.cse0 (= (mod ~z$r_buff1_thd3~0_In741615504 256) 0))) (or (and (= |P2Thread1of1ForFork2_#t~ite3_Out741615504| ~z~0_In741615504) (or .cse0 .cse1)) (and (not .cse1) (= ~z$w_buff1~0_In741615504 |P2Thread1of1ForFork2_#t~ite3_Out741615504|) (not .cse0)))) InVars {~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In741615504, ~z$w_buff1_used~0=~z$w_buff1_used~0_In741615504, ~z$w_buff1~0=~z$w_buff1~0_In741615504, ~z~0=~z~0_In741615504} OutVars{P2Thread1of1ForFork2_#t~ite3=|P2Thread1of1ForFork2_#t~ite3_Out741615504|, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In741615504, ~z$w_buff1_used~0=~z$w_buff1_used~0_In741615504, ~z$w_buff1~0=~z$w_buff1~0_In741615504, ~z~0=~z~0_In741615504} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite3] because there is no mapped edge [2019-12-18 17:55:08,444 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [693] [693] L770-4-->L771: Formula: (= |v_P2Thread1of1ForFork2_#t~ite3_14| v_~z~0_35) InVars {P2Thread1of1ForFork2_#t~ite3=|v_P2Thread1of1ForFork2_#t~ite3_14|} OutVars{P2Thread1of1ForFork2_#t~ite4=|v_P2Thread1of1ForFork2_#t~ite4_13|, P2Thread1of1ForFork2_#t~ite3=|v_P2Thread1of1ForFork2_#t~ite3_13|, ~z~0=v_~z~0_35} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite4, P2Thread1of1ForFork2_#t~ite3, ~z~0] because there is no mapped edge [2019-12-18 17:55:08,445 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [724] [724] L802-->L802-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff1_thd4~0_In2144500171 256))) (.cse1 (= 0 (mod ~z$w_buff1_used~0_In2144500171 256))) (.cse2 (= 0 (mod ~z$r_buff0_thd4~0_In2144500171 256))) (.cse3 (= 0 (mod ~z$w_buff0_used~0_In2144500171 256)))) (or (and (= |P3Thread1of1ForFork3_#t~ite12_Out2144500171| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P3Thread1of1ForFork3_#t~ite12_Out2144500171| ~z$w_buff1_used~0_In2144500171)))) InVars {~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In2144500171, ~z$w_buff0_used~0=~z$w_buff0_used~0_In2144500171, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In2144500171, ~z$w_buff1_used~0=~z$w_buff1_used~0_In2144500171} OutVars{~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In2144500171, ~z$w_buff0_used~0=~z$w_buff0_used~0_In2144500171, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In2144500171, ~z$w_buff1_used~0=~z$w_buff1_used~0_In2144500171, P3Thread1of1ForFork3_#t~ite12=|P3Thread1of1ForFork3_#t~ite12_Out2144500171|} AuxVars[] AssignedVars[P3Thread1of1ForFork3_#t~ite12] because there is no mapped edge [2019-12-18 17:55:08,445 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [707] [707] L803-->L804: Formula: (let ((.cse1 (= (mod ~z$r_buff0_thd4~0_In343504573 256) 0)) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In343504573 256)))) (or (and (= ~z$r_buff0_thd4~0_In343504573 ~z$r_buff0_thd4~0_Out343504573) (or .cse0 .cse1)) (and (not .cse1) (= 0 ~z$r_buff0_thd4~0_Out343504573) (not .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In343504573, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In343504573} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In343504573, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_Out343504573, P3Thread1of1ForFork3_#t~ite13=|P3Thread1of1ForFork3_#t~ite13_Out343504573|} AuxVars[] AssignedVars[~z$r_buff0_thd4~0, P3Thread1of1ForFork3_#t~ite13] because there is no mapped edge [2019-12-18 17:55:08,446 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [721] [721] L804-->L804-2: Formula: (let ((.cse0 (= (mod ~z$w_buff1_used~0_In180144359 256) 0)) (.cse1 (= 0 (mod ~z$r_buff1_thd4~0_In180144359 256))) (.cse2 (= (mod ~z$r_buff0_thd4~0_In180144359 256) 0)) (.cse3 (= (mod ~z$w_buff0_used~0_In180144359 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P3Thread1of1ForFork3_#t~ite14_Out180144359|)) (and (= |P3Thread1of1ForFork3_#t~ite14_Out180144359| ~z$r_buff1_thd4~0_In180144359) (or .cse0 .cse1) (or .cse2 .cse3)))) InVars {~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In180144359, ~z$w_buff0_used~0=~z$w_buff0_used~0_In180144359, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In180144359, ~z$w_buff1_used~0=~z$w_buff1_used~0_In180144359} OutVars{~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In180144359, ~z$w_buff0_used~0=~z$w_buff0_used~0_In180144359, P3Thread1of1ForFork3_#t~ite14=|P3Thread1of1ForFork3_#t~ite14_Out180144359|, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In180144359, ~z$w_buff1_used~0=~z$w_buff1_used~0_In180144359} AuxVars[] AssignedVars[P3Thread1of1ForFork3_#t~ite14] because there is no mapped edge [2019-12-18 17:55:08,446 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [747] [747] L804-2-->P3EXIT: Formula: (and (= v_~__unbuffered_cnt~0_109 (+ v_~__unbuffered_cnt~0_110 1)) (= 0 |v_P3Thread1of1ForFork3_#res.offset_5|) (= 0 |v_P3Thread1of1ForFork3_#res.base_5|) (= |v_P3Thread1of1ForFork3_#t~ite14_46| v_~z$r_buff1_thd4~0_84)) InVars {P3Thread1of1ForFork3_#t~ite14=|v_P3Thread1of1ForFork3_#t~ite14_46|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_110} OutVars{~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_84, P3Thread1of1ForFork3_#t~ite14=|v_P3Thread1of1ForFork3_#t~ite14_45|, P3Thread1of1ForFork3_#res.base=|v_P3Thread1of1ForFork3_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_109, P3Thread1of1ForFork3_#res.offset=|v_P3Thread1of1ForFork3_#res.offset_5|} AuxVars[] AssignedVars[~z$r_buff1_thd4~0, P3Thread1of1ForFork3_#t~ite14, P3Thread1of1ForFork3_#res.base, ~__unbuffered_cnt~0, P3Thread1of1ForFork3_#res.offset] because there is no mapped edge [2019-12-18 17:55:08,446 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [717] [717] L771-->L771-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff0_thd3~0_In1022476146 256))) (.cse1 (= (mod ~z$w_buff0_used~0_In1022476146 256) 0))) (or (and (not .cse0) (= |P2Thread1of1ForFork2_#t~ite5_Out1022476146| 0) (not .cse1)) (and (or .cse0 .cse1) (= ~z$w_buff0_used~0_In1022476146 |P2Thread1of1ForFork2_#t~ite5_Out1022476146|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1022476146, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1022476146} OutVars{P2Thread1of1ForFork2_#t~ite5=|P2Thread1of1ForFork2_#t~ite5_Out1022476146|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1022476146, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1022476146} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite5] because there is no mapped edge [2019-12-18 17:55:08,447 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [713] [713] L772-->L772-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff1_used~0_In880249609 256))) (.cse1 (= 0 (mod ~z$r_buff1_thd3~0_In880249609 256))) (.cse3 (= 0 (mod ~z$w_buff0_used~0_In880249609 256))) (.cse2 (= 0 (mod ~z$r_buff0_thd3~0_In880249609 256)))) (or (and (= |P2Thread1of1ForFork2_#t~ite6_Out880249609| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse0 .cse1) (or .cse3 .cse2) (= |P2Thread1of1ForFork2_#t~ite6_Out880249609| ~z$w_buff1_used~0_In880249609)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In880249609, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In880249609, ~z$w_buff1_used~0=~z$w_buff1_used~0_In880249609, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In880249609} OutVars{P2Thread1of1ForFork2_#t~ite6=|P2Thread1of1ForFork2_#t~ite6_Out880249609|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In880249609, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In880249609, ~z$w_buff1_used~0=~z$w_buff1_used~0_In880249609, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In880249609} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite6] because there is no mapped edge [2019-12-18 17:55:08,448 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [714] [714] L773-->L773-2: Formula: (let ((.cse0 (= (mod ~z$w_buff0_used~0_In-924210417 256) 0)) (.cse1 (= (mod ~z$r_buff0_thd3~0_In-924210417 256) 0))) (or (and (= |P2Thread1of1ForFork2_#t~ite7_Out-924210417| ~z$r_buff0_thd3~0_In-924210417) (or .cse0 .cse1)) (and (not .cse0) (not .cse1) (= 0 |P2Thread1of1ForFork2_#t~ite7_Out-924210417|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-924210417, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-924210417} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-924210417, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-924210417, P2Thread1of1ForFork2_#t~ite7=|P2Thread1of1ForFork2_#t~ite7_Out-924210417|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite7] because there is no mapped edge [2019-12-18 17:55:08,449 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [712] [712] L774-->L774-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In-1270628404 256))) (.cse0 (= (mod ~z$r_buff0_thd3~0_In-1270628404 256) 0)) (.cse2 (= 0 (mod ~z$w_buff1_used~0_In-1270628404 256))) (.cse3 (= (mod ~z$r_buff1_thd3~0_In-1270628404 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P2Thread1of1ForFork2_#t~ite8_Out-1270628404|)) (and (or .cse1 .cse0) (or .cse2 .cse3) (= ~z$r_buff1_thd3~0_In-1270628404 |P2Thread1of1ForFork2_#t~ite8_Out-1270628404|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1270628404, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1270628404, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1270628404, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1270628404} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1270628404, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1270628404, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1270628404, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1270628404, P2Thread1of1ForFork2_#t~ite8=|P2Thread1of1ForFork2_#t~ite8_Out-1270628404|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite8] because there is no mapped edge [2019-12-18 17:55:08,449 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [761] [761] L774-2-->P2EXIT: Formula: (and (= 0 |v_P2Thread1of1ForFork2_#res.base_5|) (= v_~__unbuffered_cnt~0_125 (+ v_~__unbuffered_cnt~0_126 1)) (= |v_P2Thread1of1ForFork2_#t~ite8_44| v_~z$r_buff1_thd3~0_126) (= |v_P2Thread1of1ForFork2_#res.offset_5| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_126, P2Thread1of1ForFork2_#t~ite8=|v_P2Thread1of1ForFork2_#t~ite8_44|} OutVars{~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_126, P2Thread1of1ForFork2_#res.base=|v_P2Thread1of1ForFork2_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_125, P2Thread1of1ForFork2_#res.offset=|v_P2Thread1of1ForFork2_#res.offset_5|, P2Thread1of1ForFork2_#t~ite8=|v_P2Thread1of1ForFork2_#t~ite8_43|} AuxVars[] AssignedVars[~z$r_buff1_thd3~0, P2Thread1of1ForFork2_#res.base, ~__unbuffered_cnt~0, P2Thread1of1ForFork2_#res.offset, P2Thread1of1ForFork2_#t~ite8] because there is no mapped edge [2019-12-18 17:55:08,450 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [652] [652] L833-->L835-2: Formula: (and (or (= 0 (mod v_~z$w_buff0_used~0_104 256)) (= (mod v_~z$r_buff0_thd0~0_62 256) 0)) (not (= 0 (mod v_~main$tmp_guard0~0_5 256)))) InVars {~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_62, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_104, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_5} OutVars{~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_62, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_104, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_5} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-18 17:55:08,450 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [708] [708] L835-2-->L835-4: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff1_used~0_In-874690425 256))) (.cse1 (= (mod ~z$r_buff1_thd0~0_In-874690425 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite19_Out-874690425| ~z$w_buff1~0_In-874690425) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite19_Out-874690425| ~z~0_In-874690425)))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-874690425, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-874690425, ~z$w_buff1~0=~z$w_buff1~0_In-874690425, ~z~0=~z~0_In-874690425} OutVars{ULTIMATE.start_main_#t~ite19=|ULTIMATE.start_main_#t~ite19_Out-874690425|, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-874690425, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-874690425, ~z$w_buff1~0=~z$w_buff1~0_In-874690425, ~z~0=~z~0_In-874690425} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite19] because there is no mapped edge [2019-12-18 17:55:08,450 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [671] [671] L835-4-->L836: Formula: (= v_~z~0_32 |v_ULTIMATE.start_main_#t~ite19_7|) InVars {ULTIMATE.start_main_#t~ite19=|v_ULTIMATE.start_main_#t~ite19_7|} OutVars{ULTIMATE.start_main_#t~ite19=|v_ULTIMATE.start_main_#t~ite19_6|, ~z~0=v_~z~0_32, ULTIMATE.start_main_#t~ite20=|v_ULTIMATE.start_main_#t~ite20_7|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite19, ~z~0, ULTIMATE.start_main_#t~ite20] because there is no mapped edge [2019-12-18 17:55:08,450 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [716] [716] L836-->L836-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff0_thd0~0_In-162567048 256))) (.cse1 (= (mod ~z$w_buff0_used~0_In-162567048 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite21_Out-162567048| ~z$w_buff0_used~0_In-162567048) (or .cse0 .cse1)) (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite21_Out-162567048| 0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-162567048, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-162567048} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-162567048, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-162567048, ULTIMATE.start_main_#t~ite21=|ULTIMATE.start_main_#t~ite21_Out-162567048|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite21] because there is no mapped edge [2019-12-18 17:55:08,451 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [718] [718] L837-->L837-2: Formula: (let ((.cse3 (= (mod ~z$r_buff1_thd0~0_In-1808285257 256) 0)) (.cse2 (= (mod ~z$w_buff1_used~0_In-1808285257 256) 0)) (.cse1 (= (mod ~z$w_buff0_used~0_In-1808285257 256) 0)) (.cse0 (= (mod ~z$r_buff0_thd0~0_In-1808285257 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite22_Out-1808285257|)) (and (or .cse3 .cse2) (or .cse1 .cse0) (= ~z$w_buff1_used~0_In-1808285257 |ULTIMATE.start_main_#t~ite22_Out-1808285257|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1808285257, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1808285257, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1808285257, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1808285257} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1808285257, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1808285257, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1808285257, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1808285257, ULTIMATE.start_main_#t~ite22=|ULTIMATE.start_main_#t~ite22_Out-1808285257|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite22] because there is no mapped edge [2019-12-18 17:55:08,452 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [723] [723] L838-->L838-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In674479118 256))) (.cse0 (= 0 (mod ~z$r_buff0_thd0~0_In674479118 256)))) (or (and (= 0 |ULTIMATE.start_main_#t~ite23_Out674479118|) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= |ULTIMATE.start_main_#t~ite23_Out674479118| ~z$r_buff0_thd0~0_In674479118)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In674479118, ~z$w_buff0_used~0=~z$w_buff0_used~0_In674479118} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In674479118, ~z$w_buff0_used~0=~z$w_buff0_used~0_In674479118, ULTIMATE.start_main_#t~ite23=|ULTIMATE.start_main_#t~ite23_Out674479118|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite23] because there is no mapped edge [2019-12-18 17:55:08,453 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [720] [720] L839-->L839-2: Formula: (let ((.cse3 (= (mod ~z$r_buff0_thd0~0_In-1310542212 256) 0)) (.cse2 (= 0 (mod ~z$w_buff0_used~0_In-1310542212 256))) (.cse0 (= 0 (mod ~z$w_buff1_used~0_In-1310542212 256))) (.cse1 (= 0 (mod ~z$r_buff1_thd0~0_In-1310542212 256)))) (or (and (= |ULTIMATE.start_main_#t~ite24_Out-1310542212| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse3 .cse2) (= ~z$r_buff1_thd0~0_In-1310542212 |ULTIMATE.start_main_#t~ite24_Out-1310542212|) (or .cse0 .cse1)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1310542212, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1310542212, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1310542212, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1310542212} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1310542212, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1310542212, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1310542212, ULTIMATE.start_main_#t~ite24=|ULTIMATE.start_main_#t~ite24_Out-1310542212|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1310542212} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite24] because there is no mapped edge [2019-12-18 17:55:08,457 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [767] [767] L848-->L848-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In-221225204 256) 0))) (or (and (= ~z$w_buff1~0_In-221225204 |ULTIMATE.start_main_#t~ite33_Out-221225204|) (= |ULTIMATE.start_main_#t~ite34_Out-221225204| |ULTIMATE.start_main_#t~ite33_Out-221225204|) .cse0 (let ((.cse1 (= (mod ~z$r_buff0_thd0~0_In-221225204 256) 0))) (or (= 0 (mod ~z$w_buff0_used~0_In-221225204 256)) (and .cse1 (= (mod ~z$w_buff1_used~0_In-221225204 256) 0)) (and (= 0 (mod ~z$r_buff1_thd0~0_In-221225204 256)) .cse1)))) (and (not .cse0) (= |ULTIMATE.start_main_#t~ite34_Out-221225204| ~z$w_buff1~0_In-221225204) (= |ULTIMATE.start_main_#t~ite33_In-221225204| |ULTIMATE.start_main_#t~ite33_Out-221225204|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-221225204, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-221225204, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-221225204, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-221225204, ~z$w_buff1~0=~z$w_buff1~0_In-221225204, ~weak$$choice2~0=~weak$$choice2~0_In-221225204, ULTIMATE.start_main_#t~ite33=|ULTIMATE.start_main_#t~ite33_In-221225204|} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-221225204, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-221225204, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-221225204, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-221225204, ~z$w_buff1~0=~z$w_buff1~0_In-221225204, ~weak$$choice2~0=~weak$$choice2~0_In-221225204, ULTIMATE.start_main_#t~ite33=|ULTIMATE.start_main_#t~ite33_Out-221225204|, ULTIMATE.start_main_#t~ite34=|ULTIMATE.start_main_#t~ite34_Out-221225204|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite33, ULTIMATE.start_main_#t~ite34] because there is no mapped edge [2019-12-18 17:55:08,460 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [764] [764] L850-->L850-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In789367406 256)))) (or (and (= |ULTIMATE.start_main_#t~ite39_In789367406| |ULTIMATE.start_main_#t~ite39_Out789367406|) (not .cse0) (= ~z$w_buff1_used~0_In789367406 |ULTIMATE.start_main_#t~ite40_Out789367406|)) (and (= |ULTIMATE.start_main_#t~ite39_Out789367406| |ULTIMATE.start_main_#t~ite40_Out789367406|) (= ~z$w_buff1_used~0_In789367406 |ULTIMATE.start_main_#t~ite39_Out789367406|) (let ((.cse1 (= 0 (mod ~z$r_buff0_thd0~0_In789367406 256)))) (or (and (= (mod ~z$w_buff1_used~0_In789367406 256) 0) .cse1) (= 0 (mod ~z$w_buff0_used~0_In789367406 256)) (and (= (mod ~z$r_buff1_thd0~0_In789367406 256) 0) .cse1))) .cse0))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In789367406, ~z$w_buff0_used~0=~z$w_buff0_used~0_In789367406, ULTIMATE.start_main_#t~ite39=|ULTIMATE.start_main_#t~ite39_In789367406|, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In789367406, ~z$w_buff1_used~0=~z$w_buff1_used~0_In789367406, ~weak$$choice2~0=~weak$$choice2~0_In789367406} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In789367406, ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out789367406|, ULTIMATE.start_main_#t~ite39=|ULTIMATE.start_main_#t~ite39_Out789367406|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In789367406, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In789367406, ~z$w_buff1_used~0=~z$w_buff1_used~0_In789367406, ~weak$$choice2~0=~weak$$choice2~0_In789367406} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite40, ULTIMATE.start_main_#t~ite39] because there is no mapped edge [2019-12-18 17:55:08,461 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [705] [705] L851-->L852: Formula: (and (= v_~z$r_buff0_thd0~0_135 v_~z$r_buff0_thd0~0_134) (not (= (mod v_~weak$$choice2~0_41 256) 0))) InVars {~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_135, ~weak$$choice2~0=v_~weak$$choice2~0_41} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_14|, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_134, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_9|, ~weak$$choice2~0=v_~weak$$choice2~0_41, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_12|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ~z$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-18 17:55:08,461 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [765] [765] L852-->L852-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-1262656785 256)))) (or (and .cse0 (let ((.cse1 (= 0 (mod ~z$r_buff0_thd0~0_In-1262656785 256)))) (or (and (= 0 (mod ~z$w_buff1_used~0_In-1262656785 256)) .cse1) (and (= 0 (mod ~z$r_buff1_thd0~0_In-1262656785 256)) .cse1) (= 0 (mod ~z$w_buff0_used~0_In-1262656785 256)))) (= |ULTIMATE.start_main_#t~ite45_Out-1262656785| ~z$r_buff1_thd0~0_In-1262656785) (= |ULTIMATE.start_main_#t~ite46_Out-1262656785| |ULTIMATE.start_main_#t~ite45_Out-1262656785|)) (and (not .cse0) (= |ULTIMATE.start_main_#t~ite45_In-1262656785| |ULTIMATE.start_main_#t~ite45_Out-1262656785|) (= |ULTIMATE.start_main_#t~ite46_Out-1262656785| ~z$r_buff1_thd0~0_In-1262656785)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1262656785, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1262656785, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1262656785, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1262656785, ~weak$$choice2~0=~weak$$choice2~0_In-1262656785, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_In-1262656785|} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1262656785, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1262656785, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1262656785, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1262656785, ULTIMATE.start_main_#t~ite46=|ULTIMATE.start_main_#t~ite46_Out-1262656785|, ~weak$$choice2~0=~weak$$choice2~0_In-1262656785, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out-1262656785|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite46, ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-12-18 17:55:08,462 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [762] [762] L854-->L4: Formula: (and (= 0 v_~z$flush_delayed~0_38) (not (= (mod v_~z$flush_delayed~0_39 256) 0)) (= v_~z$mem_tmp~0_25 v_~z~0_127) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_7| (mod v_~main$tmp_guard1~0_12 256))) InVars {~z$mem_tmp~0=v_~z$mem_tmp~0_25, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_12, ~z$flush_delayed~0=v_~z$flush_delayed~0_39} OutVars{~z$mem_tmp~0=v_~z$mem_tmp~0_25, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_11, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_24|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_12, ~z$flush_delayed~0=v_~z$flush_delayed~0_38, ~z~0=v_~z~0_127, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_7|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ULTIMATE.start_main_#t~ite47, ~z$flush_delayed~0, ~z~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-18 17:55:08,462 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [758] [758] L4-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_10 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_10 0)) InVars {ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_10, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression] because there is no mapped edge [2019-12-18 17:55:08,570 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.12 05:55:08 BasicIcfg [2019-12-18 17:55:08,570 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-18 17:55:08,572 INFO L168 Benchmark]: Toolchain (without parser) took 36737.83 ms. Allocated memory was 145.2 MB in the beginning and 1.9 GB in the end (delta: 1.7 GB). Free memory was 101.7 MB in the beginning and 1.3 GB in the end (delta: -1.2 GB). Peak memory consumption was 563.3 MB. Max. memory is 7.1 GB. [2019-12-18 17:55:08,573 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 145.2 MB. Free memory was 121.5 MB in the beginning and 121.3 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. [2019-12-18 17:55:08,574 INFO L168 Benchmark]: CACSL2BoogieTranslator took 756.79 ms. Allocated memory was 145.2 MB in the beginning and 203.4 MB in the end (delta: 58.2 MB). Free memory was 101.2 MB in the beginning and 156.7 MB in the end (delta: -55.4 MB). Peak memory consumption was 21.8 MB. Max. memory is 7.1 GB. [2019-12-18 17:55:08,575 INFO L168 Benchmark]: Boogie Procedure Inliner took 70.99 ms. Allocated memory is still 203.4 MB. Free memory was 156.7 MB in the beginning and 153.4 MB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 7.1 GB. [2019-12-18 17:55:08,575 INFO L168 Benchmark]: Boogie Preprocessor took 40.55 ms. Allocated memory is still 203.4 MB. Free memory was 153.4 MB in the beginning and 151.4 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2019-12-18 17:55:08,576 INFO L168 Benchmark]: RCFGBuilder took 787.51 ms. Allocated memory is still 203.4 MB. Free memory was 151.4 MB in the beginning and 102.0 MB in the end (delta: 49.4 MB). Peak memory consumption was 49.4 MB. Max. memory is 7.1 GB. [2019-12-18 17:55:08,577 INFO L168 Benchmark]: TraceAbstraction took 35076.61 ms. Allocated memory was 203.4 MB in the beginning and 1.9 GB in the end (delta: 1.7 GB). Free memory was 102.0 MB in the beginning and 1.3 GB in the end (delta: -1.2 GB). Peak memory consumption was 505.4 MB. Max. memory is 7.1 GB. [2019-12-18 17:55:08,580 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.17 ms. Allocated memory is still 145.2 MB. Free memory was 121.5 MB in the beginning and 121.3 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 756.79 ms. Allocated memory was 145.2 MB in the beginning and 203.4 MB in the end (delta: 58.2 MB). Free memory was 101.2 MB in the beginning and 156.7 MB in the end (delta: -55.4 MB). Peak memory consumption was 21.8 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 70.99 ms. Allocated memory is still 203.4 MB. Free memory was 156.7 MB in the beginning and 153.4 MB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 40.55 ms. Allocated memory is still 203.4 MB. Free memory was 153.4 MB in the beginning and 151.4 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 787.51 ms. Allocated memory is still 203.4 MB. Free memory was 151.4 MB in the beginning and 102.0 MB in the end (delta: 49.4 MB). Peak memory consumption was 49.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 35076.61 ms. Allocated memory was 203.4 MB in the beginning and 1.9 GB in the end (delta: 1.7 GB). Free memory was 102.0 MB in the beginning and 1.3 GB in the end (delta: -1.2 GB). Peak memory consumption was 505.4 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 5.6s, 179 ProgramPointsBefore, 91 ProgramPointsAfterwards, 207 TransitionsBefore, 97 TransitionsAfterwards, 12668 CoEnabledTransitionPairs, 7 FixpointIterations, 35 TrivialSequentialCompositions, 50 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 35 ConcurrentYvCompositions, 27 ChoiceCompositions, 4846 VarBasedMoverChecksPositive, 179 VarBasedMoverChecksNegative, 25 SemBasedMoverChecksPositive, 208 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.4s, 0 MoverChecksTotal, 50860 CheckedPairsTotal, 120 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L823] FCALL, FORK 0 pthread_create(&t1485, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L825] FCALL, FORK 0 pthread_create(&t1486, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L827] FCALL, FORK 0 pthread_create(&t1487, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L829] FCALL, FORK 0 pthread_create(&t1488, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L784] 4 z$w_buff1 = z$w_buff0 [L785] 4 z$w_buff0 = 2 [L786] 4 z$w_buff1_used = z$w_buff0_used [L787] 4 z$w_buff0_used = (_Bool)1 [L800] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L764] 3 y = 1 [L767] 3 z = 1 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L800] 4 z = z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L770] 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L801] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L802] 4 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L771] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L772] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L773] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L831] 0 main$tmp_guard0 = __unbuffered_cnt == 4 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L836] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L837] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L838] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L839] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L842] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L843] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L844] 0 z$flush_delayed = weak$$choice2 [L845] 0 z$mem_tmp = z VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=2, y=1, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L846] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=2, y=1, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L846] 0 z = !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L847] EXPR 0 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=2, y=1, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L847] 0 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L848] 0 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L849] EXPR 0 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=2, y=1, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L849] 0 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L850] 0 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L852] 0 z$r_buff1_thd0 = weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L853] 0 main$tmp_guard1 = !(x == 2 && z == 2 && __unbuffered_p1_EAX == 0 && __unbuffered_p3_EAX == 0) VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=2, y=1, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 167 locations, 2 error locations. Result: UNSAFE, OverallTime: 34.7s, OverallIterations: 18, TraceHistogramMax: 1, AutomataDifference: 12.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1957 SDtfs, 2225 SDslu, 4054 SDs, 0 SdLazy, 1554 SolverSat, 177 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 121 GetRequests, 22 SyntacticMatches, 8 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 1.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=52262occurred in iteration=3, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 12.1s AutomataMinimizationTime, 17 MinimizatonAttempts, 31860 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 1.5s InterpolantComputationTime, 749 NumberOfCodeBlocks, 749 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 672 ConstructedInterpolants, 0 QuantifiedInterpolants, 111724 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 17 InterpolantComputations, 17 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...