./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/pthread-wmm/thin002_pso.opt_true-unreach-call.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 2e94e6aa Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/svcomp/c/pthread-wmm/thin002_pso.opt_true-unreach-call.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 3a238e4c65f6f90150e83e20c60818e231a48e90 ...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-2e94e6a [2019-01-01 00:59:23,952 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-01 00:59:23,954 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-01 00:59:23,967 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-01 00:59:23,967 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-01 00:59:23,968 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-01 00:59:23,970 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-01 00:59:23,972 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-01 00:59:23,974 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-01 00:59:23,974 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-01 00:59:23,976 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-01 00:59:23,976 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-01 00:59:23,977 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-01 00:59:23,978 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-01 00:59:23,980 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-01 00:59:23,980 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-01 00:59:23,982 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-01 00:59:23,983 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-01 00:59:23,986 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-01 00:59:23,987 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-01 00:59:23,989 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-01 00:59:23,990 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-01 00:59:23,993 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-01 00:59:23,993 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-01 00:59:23,994 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-01 00:59:23,995 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-01 00:59:23,996 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-01 00:59:23,997 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-01 00:59:23,998 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-01 00:59:23,999 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-01 00:59:24,000 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-01 00:59:24,001 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-01 00:59:24,001 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-01 00:59:24,001 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-01 00:59:24,002 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-01 00:59:24,003 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-01 00:59:24,004 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-01-01 00:59:24,019 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-01 00:59:24,019 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-01 00:59:24,021 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-01 00:59:24,021 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-01 00:59:24,021 INFO L133 SettingsManager]: * Use SBE=true [2019-01-01 00:59:24,021 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-01 00:59:24,021 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-01 00:59:24,022 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-01 00:59:24,023 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-01 00:59:24,023 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-01 00:59:24,023 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-01 00:59:24,023 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-01 00:59:24,023 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-01 00:59:24,023 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-01 00:59:24,024 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-01 00:59:24,024 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-01 00:59:24,025 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-01 00:59:24,025 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-01 00:59:24,025 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-01 00:59:24,025 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-01 00:59:24,025 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-01 00:59:24,025 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-01 00:59:24,026 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-01 00:59:24,026 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-01 00:59:24,026 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-01 00:59:24,026 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-01 00:59:24,026 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-01 00:59:24,027 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-01-01 00:59:24,027 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 3a238e4c65f6f90150e83e20c60818e231a48e90 [2019-01-01 00:59:24,063 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-01 00:59:24,076 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-01 00:59:24,080 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-01 00:59:24,081 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-01 00:59:24,082 INFO L276 PluginConnector]: CDTParser initialized [2019-01-01 00:59:24,082 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/pthread-wmm/thin002_pso.opt_true-unreach-call.i [2019-01-01 00:59:24,136 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fdf4e73e5/1ca34f38848448a4a11e2a79b1af563f/FLAG1b3f59be6 [2019-01-01 00:59:24,689 INFO L307 CDTParser]: Found 1 translation units. [2019-01-01 00:59:24,690 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/pthread-wmm/thin002_pso.opt_true-unreach-call.i [2019-01-01 00:59:24,712 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fdf4e73e5/1ca34f38848448a4a11e2a79b1af563f/FLAG1b3f59be6 [2019-01-01 00:59:24,941 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fdf4e73e5/1ca34f38848448a4a11e2a79b1af563f [2019-01-01 00:59:24,948 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-01 00:59:24,950 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-01 00:59:24,951 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-01 00:59:24,953 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-01 00:59:24,957 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-01 00:59:24,959 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.01 12:59:24" (1/1) ... [2019-01-01 00:59:24,963 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@230d0e0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 12:59:24, skipping insertion in model container [2019-01-01 00:59:24,964 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.01 12:59:24" (1/1) ... [2019-01-01 00:59:24,974 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-01 00:59:25,044 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-01 00:59:25,470 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-01 00:59:25,485 INFO L191 MainTranslator]: Completed pre-run [2019-01-01 00:59:25,674 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-01 00:59:25,764 INFO L195 MainTranslator]: Completed translation [2019-01-01 00:59:25,764 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 12:59:25 WrapperNode [2019-01-01 00:59:25,765 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-01 00:59:25,765 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-01 00:59:25,766 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-01 00:59:25,766 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-01 00:59:25,775 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 12:59:25" (1/1) ... [2019-01-01 00:59:25,798 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 12:59:25" (1/1) ... [2019-01-01 00:59:25,822 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-01 00:59:25,822 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-01 00:59:25,822 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-01 00:59:25,823 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-01 00:59:25,833 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 12:59:25" (1/1) ... [2019-01-01 00:59:25,834 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 12:59:25" (1/1) ... [2019-01-01 00:59:25,838 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 12:59:25" (1/1) ... [2019-01-01 00:59:25,838 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 12:59:25" (1/1) ... [2019-01-01 00:59:25,849 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 12:59:25" (1/1) ... [2019-01-01 00:59:25,856 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 12:59:25" (1/1) ... [2019-01-01 00:59:25,861 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 12:59:25" (1/1) ... [2019-01-01 00:59:25,865 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-01 00:59:25,867 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-01 00:59:25,867 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-01 00:59:25,868 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-01 00:59:25,868 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 12:59:25" (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-01-01 00:59:25,942 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-01-01 00:59:25,942 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-01-01 00:59:25,942 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-01 00:59:25,943 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-01-01 00:59:25,943 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-01-01 00:59:25,943 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-01-01 00:59:25,944 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-01-01 00:59:25,944 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-01-01 00:59:25,944 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-01-01 00:59:25,944 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-01-01 00:59:25,944 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2019-01-01 00:59:25,944 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2019-01-01 00:59:25,945 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-01-01 00:59:25,945 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-01 00:59:25,945 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-01 00:59:25,948 WARN L198 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-01-01 00:59:26,549 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-01 00:59:26,549 INFO L280 CfgBuilder]: Removed 6 assue(true) statements. [2019-01-01 00:59:26,550 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 12:59:26 BoogieIcfgContainer [2019-01-01 00:59:26,550 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-01 00:59:26,552 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-01 00:59:26,552 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-01 00:59:26,556 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-01 00:59:26,556 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 01.01 12:59:24" (1/3) ... [2019-01-01 00:59:26,557 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@77b24ce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.01 12:59:26, skipping insertion in model container [2019-01-01 00:59:26,557 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 12:59:25" (2/3) ... [2019-01-01 00:59:26,558 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@77b24ce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.01 12:59:26, skipping insertion in model container [2019-01-01 00:59:26,558 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 12:59:26" (3/3) ... [2019-01-01 00:59:26,559 INFO L112 eAbstractionObserver]: Analyzing ICFG thin002_pso.opt_true-unreach-call.i [2019-01-01 00:59:26,597 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:59:26,598 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:59:26,598 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:59:26,598 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:59:26,598 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet3.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:59:26,599 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet3.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:59:26,599 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:59:26,599 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:59:26,599 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet3.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:59:26,599 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet3.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:59:26,600 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:59:26,600 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:59:26,600 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:59:26,600 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:59:26,601 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet4.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:59:26,601 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet4.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:59:26,601 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:59:26,601 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:59:26,601 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet4.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:59:26,602 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet4.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:59:26,602 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:59:26,602 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:59:26,602 WARN L317 ript$VariableManager]: TermVariabe Thread2_P2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:59:26,602 WARN L317 ript$VariableManager]: TermVariabe Thread2_P2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:59:26,603 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#t~nondet5.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:59:26,603 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#t~nondet5.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:59:26,603 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:59:26,603 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:59:26,603 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#t~nondet5.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:59:26,603 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#t~nondet5.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:59:26,604 WARN L317 ript$VariableManager]: TermVariabe |Thread3_P3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:59:26,604 WARN L317 ript$VariableManager]: TermVariabe |Thread3_P3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:59:26,604 WARN L317 ript$VariableManager]: TermVariabe Thread3_P3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:59:26,604 WARN L317 ript$VariableManager]: TermVariabe Thread3_P3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:59:26,605 WARN L317 ript$VariableManager]: TermVariabe |Thread3_P3_#t~nondet6.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:59:26,605 WARN L317 ript$VariableManager]: TermVariabe |Thread3_P3_#t~nondet6.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:59:26,605 WARN L317 ript$VariableManager]: TermVariabe |Thread3_P3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:59:26,605 WARN L317 ript$VariableManager]: TermVariabe |Thread3_P3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:59:26,605 WARN L317 ript$VariableManager]: TermVariabe |Thread3_P3_#t~nondet6.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:59:26,605 WARN L317 ript$VariableManager]: TermVariabe |Thread3_P3_#t~nondet6.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:59:26,626 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-01-01 00:59:26,627 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-01 00:59:26,635 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-01-01 00:59:26,652 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-01-01 00:59:26,678 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-01 00:59:26,679 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-01 00:59:26,679 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-01 00:59:26,679 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-01 00:59:26,679 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-01 00:59:26,680 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-01 00:59:26,680 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-01 00:59:26,681 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-01 00:59:26,681 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-01 00:59:26,692 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 70places, 66 transitions [2019-01-01 00:59:27,635 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 13138 states. [2019-01-01 00:59:27,637 INFO L276 IsEmpty]: Start isEmpty. Operand 13138 states. [2019-01-01 00:59:27,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-01-01 00:59:27,670 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 00:59:27,671 INFO L402 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] [2019-01-01 00:59:27,673 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-01 00:59:27,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 00:59:27,680 INFO L82 PathProgramCache]: Analyzing trace with hash -1445141644, now seen corresponding path program 1 times [2019-01-01 00:59:27,682 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 00:59:27,683 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 00:59:27,761 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:59:27,761 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 00:59:27,761 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:59:27,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 00:59:28,139 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 00:59:28,144 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 00:59:28,144 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-01 00:59:28,150 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-01 00:59:28,168 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-01 00:59:28,168 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-01 00:59:28,171 INFO L87 Difference]: Start difference. First operand 13138 states. Second operand 4 states. [2019-01-01 00:59:28,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 00:59:28,567 INFO L93 Difference]: Finished difference Result 13744 states and 55795 transitions. [2019-01-01 00:59:28,568 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-01 00:59:28,570 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 37 [2019-01-01 00:59:28,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 00:59:28,789 INFO L225 Difference]: With dead ends: 13744 [2019-01-01 00:59:28,789 INFO L226 Difference]: Without dead ends: 5631 [2019-01-01 00:59:28,792 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-01 00:59:28,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5631 states. [2019-01-01 00:59:29,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5631 to 5631. [2019-01-01 00:59:29,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5631 states. [2019-01-01 00:59:29,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5631 states to 5631 states and 22354 transitions. [2019-01-01 00:59:29,158 INFO L78 Accepts]: Start accepts. Automaton has 5631 states and 22354 transitions. Word has length 37 [2019-01-01 00:59:29,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 00:59:29,159 INFO L480 AbstractCegarLoop]: Abstraction has 5631 states and 22354 transitions. [2019-01-01 00:59:29,159 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-01 00:59:29,159 INFO L276 IsEmpty]: Start isEmpty. Operand 5631 states and 22354 transitions. [2019-01-01 00:59:29,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-01-01 00:59:29,168 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 00:59:29,169 INFO L402 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] [2019-01-01 00:59:29,169 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-01 00:59:29,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 00:59:29,169 INFO L82 PathProgramCache]: Analyzing trace with hash 1883999228, now seen corresponding path program 1 times [2019-01-01 00:59:29,170 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 00:59:29,170 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 00:59:29,184 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:59:29,184 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 00:59:29,185 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:59:29,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 00:59:29,483 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 00:59:29,484 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 00:59:29,484 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-01 00:59:29,485 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-01 00:59:29,486 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-01 00:59:29,486 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-01-01 00:59:29,486 INFO L87 Difference]: Start difference. First operand 5631 states and 22354 transitions. Second operand 5 states. [2019-01-01 00:59:30,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 00:59:30,027 INFO L93 Difference]: Finished difference Result 6143 states and 23834 transitions. [2019-01-01 00:59:30,028 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-01 00:59:30,029 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 38 [2019-01-01 00:59:30,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 00:59:30,079 INFO L225 Difference]: With dead ends: 6143 [2019-01-01 00:59:30,080 INFO L226 Difference]: Without dead ends: 5519 [2019-01-01 00:59:30,080 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-01-01 00:59:30,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5519 states. [2019-01-01 00:59:30,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5519 to 5519. [2019-01-01 00:59:30,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5519 states. [2019-01-01 00:59:30,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5519 states to 5519 states and 21822 transitions. [2019-01-01 00:59:30,280 INFO L78 Accepts]: Start accepts. Automaton has 5519 states and 21822 transitions. Word has length 38 [2019-01-01 00:59:30,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 00:59:30,281 INFO L480 AbstractCegarLoop]: Abstraction has 5519 states and 21822 transitions. [2019-01-01 00:59:30,282 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-01 00:59:30,282 INFO L276 IsEmpty]: Start isEmpty. Operand 5519 states and 21822 transitions. [2019-01-01 00:59:30,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-01-01 00:59:30,293 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 00:59:30,293 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 00:59:30,294 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-01 00:59:30,294 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 00:59:30,294 INFO L82 PathProgramCache]: Analyzing trace with hash 1586589234, now seen corresponding path program 1 times [2019-01-01 00:59:30,294 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 00:59:30,294 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 00:59:30,306 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:59:30,306 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 00:59:30,306 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:59:30,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 00:59:30,532 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 00:59:30,533 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 00:59:30,533 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-01 00:59:30,533 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-01 00:59:30,533 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-01 00:59:30,534 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-01-01 00:59:30,535 INFO L87 Difference]: Start difference. First operand 5519 states and 21822 transitions. Second operand 6 states. [2019-01-01 00:59:30,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 00:59:30,792 INFO L93 Difference]: Finished difference Result 5455 states and 20830 transitions. [2019-01-01 00:59:30,796 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-01 00:59:30,796 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 39 [2019-01-01 00:59:30,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 00:59:30,833 INFO L225 Difference]: With dead ends: 5455 [2019-01-01 00:59:30,834 INFO L226 Difference]: Without dead ends: 4847 [2019-01-01 00:59:30,834 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2019-01-01 00:59:30,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4847 states. [2019-01-01 00:59:30,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4847 to 4847. [2019-01-01 00:59:30,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4847 states. [2019-01-01 00:59:30,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4847 states to 4847 states and 18798 transitions. [2019-01-01 00:59:30,983 INFO L78 Accepts]: Start accepts. Automaton has 4847 states and 18798 transitions. Word has length 39 [2019-01-01 00:59:30,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 00:59:30,984 INFO L480 AbstractCegarLoop]: Abstraction has 4847 states and 18798 transitions. [2019-01-01 00:59:30,984 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-01 00:59:30,984 INFO L276 IsEmpty]: Start isEmpty. Operand 4847 states and 18798 transitions. [2019-01-01 00:59:30,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-01-01 00:59:30,992 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 00:59:30,992 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 00:59:30,992 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-01 00:59:30,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 00:59:30,993 INFO L82 PathProgramCache]: Analyzing trace with hash 2117960818, now seen corresponding path program 1 times [2019-01-01 00:59:30,993 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 00:59:30,993 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 00:59:30,997 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:59:30,998 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 00:59:30,998 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:59:31,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 00:59:31,167 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 00:59:31,168 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 00:59:31,168 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-01 00:59:31,169 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-01 00:59:31,169 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-01 00:59:31,169 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-01-01 00:59:31,170 INFO L87 Difference]: Start difference. First operand 4847 states and 18798 transitions. Second operand 7 states. [2019-01-01 00:59:31,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 00:59:31,679 INFO L93 Difference]: Finished difference Result 3567 states and 13038 transitions. [2019-01-01 00:59:31,681 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-01 00:59:31,681 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 40 [2019-01-01 00:59:31,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 00:59:31,695 INFO L225 Difference]: With dead ends: 3567 [2019-01-01 00:59:31,695 INFO L226 Difference]: Without dead ends: 3055 [2019-01-01 00:59:31,696 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2019-01-01 00:59:31,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3055 states. [2019-01-01 00:59:31,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3055 to 3055. [2019-01-01 00:59:31,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3055 states. [2019-01-01 00:59:31,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3055 states to 3055 states and 11182 transitions. [2019-01-01 00:59:31,811 INFO L78 Accepts]: Start accepts. Automaton has 3055 states and 11182 transitions. Word has length 40 [2019-01-01 00:59:31,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 00:59:31,812 INFO L480 AbstractCegarLoop]: Abstraction has 3055 states and 11182 transitions. [2019-01-01 00:59:31,812 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-01 00:59:31,812 INFO L276 IsEmpty]: Start isEmpty. Operand 3055 states and 11182 transitions. [2019-01-01 00:59:31,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-01-01 00:59:31,822 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 00:59:31,822 INFO L402 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] [2019-01-01 00:59:31,822 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-01 00:59:31,822 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 00:59:31,822 INFO L82 PathProgramCache]: Analyzing trace with hash -2066804268, now seen corresponding path program 1 times [2019-01-01 00:59:31,823 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 00:59:31,823 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 00:59:31,825 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:59:31,825 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 00:59:31,825 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:59:31,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 00:59:32,354 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 00:59:32,355 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 00:59:32,355 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-01-01 00:59:32,355 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-01 00:59:32,356 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-01 00:59:32,356 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2019-01-01 00:59:32,356 INFO L87 Difference]: Start difference. First operand 3055 states and 11182 transitions. Second operand 12 states. [2019-01-01 00:59:32,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 00:59:32,894 INFO L93 Difference]: Finished difference Result 5279 states and 19302 transitions. [2019-01-01 00:59:32,894 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-01-01 00:59:32,895 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 41 [2019-01-01 00:59:32,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 00:59:32,906 INFO L225 Difference]: With dead ends: 5279 [2019-01-01 00:59:32,906 INFO L226 Difference]: Without dead ends: 3003 [2019-01-01 00:59:32,907 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=57, Invalid=215, Unknown=0, NotChecked=0, Total=272 [2019-01-01 00:59:32,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3003 states. [2019-01-01 00:59:32,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3003 to 3003. [2019-01-01 00:59:32,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3003 states. [2019-01-01 00:59:32,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3003 states to 3003 states and 11022 transitions. [2019-01-01 00:59:32,991 INFO L78 Accepts]: Start accepts. Automaton has 3003 states and 11022 transitions. Word has length 41 [2019-01-01 00:59:32,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 00:59:32,992 INFO L480 AbstractCegarLoop]: Abstraction has 3003 states and 11022 transitions. [2019-01-01 00:59:32,992 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-01 00:59:32,992 INFO L276 IsEmpty]: Start isEmpty. Operand 3003 states and 11022 transitions. [2019-01-01 00:59:32,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-01-01 00:59:32,998 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 00:59:32,998 INFO L402 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] [2019-01-01 00:59:32,999 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-01 00:59:32,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 00:59:32,999 INFO L82 PathProgramCache]: Analyzing trace with hash -994845904, now seen corresponding path program 2 times [2019-01-01 00:59:32,999 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 00:59:32,999 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 00:59:33,002 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:59:33,002 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 00:59:33,002 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:59:33,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 00:59:33,297 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 00:59:33,297 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 00:59:33,298 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-01 00:59:33,298 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-01 00:59:33,298 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-01 00:59:33,298 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-01-01 00:59:33,298 INFO L87 Difference]: Start difference. First operand 3003 states and 11022 transitions. Second operand 7 states. [2019-01-01 00:59:33,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 00:59:33,450 INFO L93 Difference]: Finished difference Result 4923 states and 18158 transitions. [2019-01-01 00:59:33,451 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-01 00:59:33,451 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 41 [2019-01-01 00:59:33,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 00:59:33,461 INFO L225 Difference]: With dead ends: 4923 [2019-01-01 00:59:33,462 INFO L226 Difference]: Without dead ends: 2663 [2019-01-01 00:59:33,462 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2019-01-01 00:59:33,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2663 states. [2019-01-01 00:59:33,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2663 to 2663. [2019-01-01 00:59:33,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2663 states. [2019-01-01 00:59:33,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2663 states to 2663 states and 9870 transitions. [2019-01-01 00:59:33,534 INFO L78 Accepts]: Start accepts. Automaton has 2663 states and 9870 transitions. Word has length 41 [2019-01-01 00:59:33,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 00:59:33,535 INFO L480 AbstractCegarLoop]: Abstraction has 2663 states and 9870 transitions. [2019-01-01 00:59:33,535 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-01 00:59:33,535 INFO L276 IsEmpty]: Start isEmpty. Operand 2663 states and 9870 transitions. [2019-01-01 00:59:33,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-01-01 00:59:33,540 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 00:59:33,540 INFO L402 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] [2019-01-01 00:59:33,540 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-01 00:59:33,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 00:59:33,540 INFO L82 PathProgramCache]: Analyzing trace with hash 2040016274, now seen corresponding path program 3 times [2019-01-01 00:59:33,540 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 00:59:33,541 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 00:59:33,543 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:59:33,543 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 00:59:33,543 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:59:33,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 00:59:33,716 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 00:59:33,717 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 00:59:33,717 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-01 00:59:33,717 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-01 00:59:33,717 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-01 00:59:33,718 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-01-01 00:59:33,718 INFO L87 Difference]: Start difference. First operand 2663 states and 9870 transitions. Second operand 7 states. [2019-01-01 00:59:33,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 00:59:33,911 INFO L93 Difference]: Finished difference Result 4263 states and 15966 transitions. [2019-01-01 00:59:33,911 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-01 00:59:33,911 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 41 [2019-01-01 00:59:33,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 00:59:33,919 INFO L225 Difference]: With dead ends: 4263 [2019-01-01 00:59:33,919 INFO L226 Difference]: Without dead ends: 2263 [2019-01-01 00:59:33,920 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2019-01-01 00:59:33,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2263 states. [2019-01-01 00:59:33,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2263 to 2263. [2019-01-01 00:59:33,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2263 states. [2019-01-01 00:59:33,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2263 states to 2263 states and 8530 transitions. [2019-01-01 00:59:33,983 INFO L78 Accepts]: Start accepts. Automaton has 2263 states and 8530 transitions. Word has length 41 [2019-01-01 00:59:33,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 00:59:33,983 INFO L480 AbstractCegarLoop]: Abstraction has 2263 states and 8530 transitions. [2019-01-01 00:59:33,983 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-01 00:59:33,983 INFO L276 IsEmpty]: Start isEmpty. Operand 2263 states and 8530 transitions. [2019-01-01 00:59:33,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-01-01 00:59:33,988 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 00:59:33,988 INFO L402 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] [2019-01-01 00:59:33,988 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-01 00:59:33,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 00:59:33,988 INFO L82 PathProgramCache]: Analyzing trace with hash -390113582, now seen corresponding path program 4 times [2019-01-01 00:59:33,989 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 00:59:33,989 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 00:59:33,992 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:59:33,992 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 00:59:33,992 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:59:34,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 00:59:34,326 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 00:59:34,326 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 00:59:34,326 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-01-01 00:59:34,327 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-01 00:59:34,327 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-01 00:59:34,327 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2019-01-01 00:59:34,327 INFO L87 Difference]: Start difference. First operand 2263 states and 8530 transitions. Second operand 12 states. [2019-01-01 00:59:34,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 00:59:34,617 INFO L93 Difference]: Finished difference Result 3879 states and 14666 transitions. [2019-01-01 00:59:34,618 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-01-01 00:59:34,618 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 41 [2019-01-01 00:59:34,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 00:59:34,624 INFO L225 Difference]: With dead ends: 3879 [2019-01-01 00:59:34,624 INFO L226 Difference]: Without dead ends: 2243 [2019-01-01 00:59:34,625 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=57, Invalid=215, Unknown=0, NotChecked=0, Total=272 [2019-01-01 00:59:34,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2243 states. [2019-01-01 00:59:34,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2243 to 2243. [2019-01-01 00:59:34,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2243 states. [2019-01-01 00:59:34,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2243 states to 2243 states and 8490 transitions. [2019-01-01 00:59:34,685 INFO L78 Accepts]: Start accepts. Automaton has 2243 states and 8490 transitions. Word has length 41 [2019-01-01 00:59:34,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 00:59:34,685 INFO L480 AbstractCegarLoop]: Abstraction has 2243 states and 8490 transitions. [2019-01-01 00:59:34,685 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-01 00:59:34,686 INFO L276 IsEmpty]: Start isEmpty. Operand 2243 states and 8490 transitions. [2019-01-01 00:59:34,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-01-01 00:59:34,688 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 00:59:34,689 INFO L402 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] [2019-01-01 00:59:34,689 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-01 00:59:34,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 00:59:34,689 INFO L82 PathProgramCache]: Analyzing trace with hash -663323788, now seen corresponding path program 5 times [2019-01-01 00:59:34,689 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 00:59:34,689 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 00:59:34,691 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:59:34,691 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 00:59:34,691 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:59:34,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 00:59:34,936 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 00:59:34,936 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 00:59:34,936 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-01-01 00:59:34,937 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-01 00:59:34,937 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-01 00:59:34,937 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-01-01 00:59:34,938 INFO L87 Difference]: Start difference. First operand 2243 states and 8490 transitions. Second operand 8 states. [2019-01-01 00:59:35,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 00:59:35,314 INFO L93 Difference]: Finished difference Result 1731 states and 6442 transitions. [2019-01-01 00:59:35,314 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-01 00:59:35,314 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 41 [2019-01-01 00:59:35,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 00:59:35,314 INFO L225 Difference]: With dead ends: 1731 [2019-01-01 00:59:35,314 INFO L226 Difference]: Without dead ends: 0 [2019-01-01 00:59:35,316 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=47, Invalid=109, Unknown=0, NotChecked=0, Total=156 [2019-01-01 00:59:35,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-01-01 00:59:35,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-01-01 00:59:35,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-01-01 00:59:35,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-01-01 00:59:35,317 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 41 [2019-01-01 00:59:35,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 00:59:35,317 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-01 00:59:35,317 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-01 00:59:35,317 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-01-01 00:59:35,317 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-01 00:59:35,323 INFO L305 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2019-01-01 00:59:35,325 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.01 12:59:35 BasicIcfg [2019-01-01 00:59:35,325 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-01 00:59:35,326 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-01 00:59:35,326 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-01 00:59:35,326 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-01 00:59:35,326 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 12:59:26" (3/4) ... [2019-01-01 00:59:35,332 INFO L144 WitnessPrinter]: Generating witness for correct program [2019-01-01 00:59:35,340 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure P0 [2019-01-01 00:59:35,340 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure P1 [2019-01-01 00:59:35,340 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure P2 [2019-01-01 00:59:35,340 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure P3 [2019-01-01 00:59:35,346 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2019-01-01 00:59:35,347 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2019-01-01 00:59:35,404 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-01 00:59:35,404 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-01 00:59:35,407 INFO L168 Benchmark]: Toolchain (without parser) took 10458.23 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 338.2 MB). Free memory was 947.3 MB in the beginning and 904.0 MB in the end (delta: 43.3 MB). Peak memory consumption was 381.4 MB. Max. memory is 11.5 GB. [2019-01-01 00:59:35,409 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 00:59:35,409 INFO L168 Benchmark]: CACSL2BoogieTranslator took 813.45 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 153.6 MB). Free memory was 947.3 MB in the beginning and 1.1 GB in the end (delta: -180.4 MB). Peak memory consumption was 30.6 MB. Max. memory is 11.5 GB. [2019-01-01 00:59:35,410 INFO L168 Benchmark]: Boogie Procedure Inliner took 56.66 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. [2019-01-01 00:59:35,412 INFO L168 Benchmark]: Boogie Preprocessor took 44.48 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 00:59:35,412 INFO L168 Benchmark]: RCFGBuilder took 683.43 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 25.9 MB). Peak memory consumption was 25.9 MB. Max. memory is 11.5 GB. [2019-01-01 00:59:35,413 INFO L168 Benchmark]: TraceAbstraction took 8773.29 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 184.5 MB). Free memory was 1.1 GB in the beginning and 914.0 MB in the end (delta: 181.0 MB). Peak memory consumption was 365.6 MB. Max. memory is 11.5 GB. [2019-01-01 00:59:35,414 INFO L168 Benchmark]: Witness Printer took 80.01 ms. Allocated memory is still 1.4 GB. Free memory was 914.0 MB in the beginning and 904.0 MB in the end (delta: 9.9 MB). Peak memory consumption was 9.9 MB. Max. memory is 11.5 GB. [2019-01-01 00:59:35,419 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 813.45 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 153.6 MB). Free memory was 947.3 MB in the beginning and 1.1 GB in the end (delta: -180.4 MB). Peak memory consumption was 30.6 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 56.66 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 44.48 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 683.43 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 25.9 MB). Peak memory consumption was 25.9 MB. Max. memory is 11.5 GB. * TraceAbstraction took 8773.29 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 184.5 MB). Free memory was 1.1 GB in the beginning and 914.0 MB in the end (delta: 181.0 MB). Peak memory consumption was 365.6 MB. Max. memory is 11.5 GB. * Witness Printer took 80.01 ms. Allocated memory is still 1.4 GB. Free memory was 914.0 MB in the beginning and 904.0 MB in the end (delta: 9.9 MB). Peak memory consumption was 9.9 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 4]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 9 procedures, 90 locations, 1 error locations. SAFE Result, 8.6s OverallTime, 9 OverallIterations, 1 TraceHistogramMax, 3.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 712 SDtfs, 1189 SDslu, 3012 SDs, 0 SdLazy, 410 SolverSat, 102 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 102 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 2.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=13138occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 1.0s AutomataMinimizationTime, 9 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 2.3s InterpolantComputationTime, 359 NumberOfCodeBlocks, 359 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 350 ConstructedInterpolants, 0 QuantifiedInterpolants, 50470 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...