./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/forester-heap/sll-01_false-unreach-call_false-valid-deref.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 0ed9222f 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/forester-heap/sll-01_false-unreach-call_false-valid-deref.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 31de2fb67e84e52bb7705ac8720e6b139fef2d91 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.24-0ed9222-m [2019-01-12 09:35:37,149 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-12 09:35:37,150 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-12 09:35:37,165 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-12 09:35:37,165 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-12 09:35:37,166 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-12 09:35:37,167 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-12 09:35:37,169 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-12 09:35:37,171 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-12 09:35:37,172 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-12 09:35:37,173 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-12 09:35:37,173 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-12 09:35:37,174 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-12 09:35:37,175 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-12 09:35:37,176 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-12 09:35:37,177 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-12 09:35:37,178 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-12 09:35:37,179 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-12 09:35:37,181 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-12 09:35:37,183 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-12 09:35:37,184 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-12 09:35:37,185 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-12 09:35:37,188 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-12 09:35:37,188 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-12 09:35:37,188 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-12 09:35:37,189 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-12 09:35:37,190 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-12 09:35:37,191 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-12 09:35:37,192 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-12 09:35:37,193 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-12 09:35:37,194 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-12 09:35:37,194 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-12 09:35:37,194 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-12 09:35:37,195 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-12 09:35:37,196 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-12 09:35:37,197 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-12 09:35:37,197 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-01-12 09:35:37,225 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-12 09:35:37,226 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-12 09:35:37,228 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-12 09:35:37,229 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-12 09:35:37,229 INFO L133 SettingsManager]: * Use SBE=true [2019-01-12 09:35:37,229 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-12 09:35:37,230 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-12 09:35:37,231 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-12 09:35:37,231 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-12 09:35:37,231 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-12 09:35:37,231 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-12 09:35:37,231 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-12 09:35:37,231 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-12 09:35:37,232 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-12 09:35:37,232 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-12 09:35:37,233 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-12 09:35:37,233 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-12 09:35:37,233 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-12 09:35:37,233 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-12 09:35:37,233 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-12 09:35:37,234 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-12 09:35:37,234 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-12 09:35:37,234 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-12 09:35:37,234 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-12 09:35:37,234 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-12 09:35:37,234 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-12 09:35:37,235 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-12 09:35:37,235 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-01-12 09:35:37,235 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 -> 31de2fb67e84e52bb7705ac8720e6b139fef2d91 [2019-01-12 09:35:37,301 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-12 09:35:37,315 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-12 09:35:37,321 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-12 09:35:37,323 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-12 09:35:37,323 INFO L276 PluginConnector]: CDTParser initialized [2019-01-12 09:35:37,324 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/forester-heap/sll-01_false-unreach-call_false-valid-deref.i [2019-01-12 09:35:37,380 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4ad057922/36fdcdcdf4f04bf19555b8b079d69c08/FLAGe9f030aaf [2019-01-12 09:35:37,898 INFO L307 CDTParser]: Found 1 translation units. [2019-01-12 09:35:37,898 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/forester-heap/sll-01_false-unreach-call_false-valid-deref.i [2019-01-12 09:35:37,911 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4ad057922/36fdcdcdf4f04bf19555b8b079d69c08/FLAGe9f030aaf [2019-01-12 09:35:38,194 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4ad057922/36fdcdcdf4f04bf19555b8b079d69c08 [2019-01-12 09:35:38,198 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-12 09:35:38,199 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-12 09:35:38,200 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-12 09:35:38,200 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-12 09:35:38,203 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-12 09:35:38,204 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.01 09:35:38" (1/1) ... [2019-01-12 09:35:38,207 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2f534001 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:35:38, skipping insertion in model container [2019-01-12 09:35:38,207 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.01 09:35:38" (1/1) ... [2019-01-12 09:35:38,215 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-12 09:35:38,262 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-12 09:35:38,681 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-12 09:35:38,697 INFO L191 MainTranslator]: Completed pre-run [2019-01-12 09:35:38,857 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-12 09:35:38,908 INFO L195 MainTranslator]: Completed translation [2019-01-12 09:35:38,909 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:35:38 WrapperNode [2019-01-12 09:35:38,909 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-12 09:35:38,912 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-12 09:35:38,912 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-12 09:35:38,912 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-12 09:35:38,921 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:35:38" (1/1) ... [2019-01-12 09:35:38,940 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:35:38" (1/1) ... [2019-01-12 09:35:38,970 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-12 09:35:38,971 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-12 09:35:38,971 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-12 09:35:38,971 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-12 09:35:38,980 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:35:38" (1/1) ... [2019-01-12 09:35:38,980 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:35:38" (1/1) ... [2019-01-12 09:35:38,986 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:35:38" (1/1) ... [2019-01-12 09:35:38,986 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:35:38" (1/1) ... [2019-01-12 09:35:39,008 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:35:38" (1/1) ... [2019-01-12 09:35:39,019 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:35:38" (1/1) ... [2019-01-12 09:35:39,022 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:35:38" (1/1) ... [2019-01-12 09:35:39,026 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-12 09:35:39,026 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-12 09:35:39,026 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-12 09:35:39,026 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-12 09:35:39,027 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:35:38" (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-12 09:35:39,089 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-01-12 09:35:39,089 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-01-12 09:35:39,089 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-01-12 09:35:39,090 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-01-12 09:35:39,090 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-12 09:35:39,090 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-12 09:35:40,024 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-12 09:35:40,025 INFO L286 CfgBuilder]: Removed 34 assue(true) statements. [2019-01-12 09:35:40,026 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 09:35:40 BoogieIcfgContainer [2019-01-12 09:35:40,026 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-12 09:35:40,027 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-12 09:35:40,027 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-12 09:35:40,030 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-12 09:35:40,031 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.01 09:35:38" (1/3) ... [2019-01-12 09:35:40,031 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@47d60f0b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.01 09:35:40, skipping insertion in model container [2019-01-12 09:35:40,032 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:35:38" (2/3) ... [2019-01-12 09:35:40,032 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@47d60f0b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.01 09:35:40, skipping insertion in model container [2019-01-12 09:35:40,032 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 09:35:40" (3/3) ... [2019-01-12 09:35:40,034 INFO L112 eAbstractionObserver]: Analyzing ICFG sll-01_false-unreach-call_false-valid-deref.i [2019-01-12 09:35:40,044 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-12 09:35:40,053 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 13 error locations. [2019-01-12 09:35:40,069 INFO L257 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2019-01-12 09:35:40,098 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-12 09:35:40,099 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-12 09:35:40,099 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-12 09:35:40,099 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-12 09:35:40,100 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-12 09:35:40,100 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-12 09:35:40,101 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-12 09:35:40,101 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-12 09:35:40,101 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-12 09:35:40,117 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states. [2019-01-12 09:35:40,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-12 09:35:40,123 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 09:35:40,124 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-12 09:35:40,126 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 09:35:40,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 09:35:40,133 INFO L82 PathProgramCache]: Analyzing trace with hash 925700, now seen corresponding path program 1 times [2019-01-12 09:35:40,135 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 09:35:40,135 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 09:35:40,199 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 09:35:40,199 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 09:35:40,199 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 09:35:40,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 09:35:40,293 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-12 09:35:40,296 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 09:35:40,297 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 09:35:40,300 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 09:35:40,313 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 09:35:40,314 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 09:35:40,317 INFO L87 Difference]: Start difference. First operand 84 states. Second operand 3 states. [2019-01-12 09:35:40,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 09:35:40,420 INFO L93 Difference]: Finished difference Result 182 states and 300 transitions. [2019-01-12 09:35:40,421 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 09:35:40,422 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2019-01-12 09:35:40,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 09:35:40,434 INFO L225 Difference]: With dead ends: 182 [2019-01-12 09:35:40,434 INFO L226 Difference]: Without dead ends: 96 [2019-01-12 09:35:40,439 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-01-12 09:35:40,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2019-01-12 09:35:40,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 78. [2019-01-12 09:35:40,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2019-01-12 09:35:40,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 88 transitions. [2019-01-12 09:35:40,478 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 88 transitions. Word has length 4 [2019-01-12 09:35:40,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 09:35:40,479 INFO L480 AbstractCegarLoop]: Abstraction has 78 states and 88 transitions. [2019-01-12 09:35:40,479 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 09:35:40,479 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 88 transitions. [2019-01-12 09:35:40,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-01-12 09:35:40,480 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 09:35:40,480 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 09:35:40,481 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 09:35:40,481 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 09:35:40,481 INFO L82 PathProgramCache]: Analyzing trace with hash 261454926, now seen corresponding path program 1 times [2019-01-12 09:35:40,482 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 09:35:40,482 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 09:35:40,484 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 09:35:40,484 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 09:35:40,484 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 09:35:40,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 09:35:40,563 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-12 09:35:40,563 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 09:35:40,564 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 09:35:40,565 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 09:35:40,565 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 09:35:40,566 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 09:35:40,566 INFO L87 Difference]: Start difference. First operand 78 states and 88 transitions. Second operand 3 states. [2019-01-12 09:35:40,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 09:35:40,644 INFO L93 Difference]: Finished difference Result 81 states and 91 transitions. [2019-01-12 09:35:40,645 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 09:35:40,645 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2019-01-12 09:35:40,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 09:35:40,647 INFO L225 Difference]: With dead ends: 81 [2019-01-12 09:35:40,647 INFO L226 Difference]: Without dead ends: 79 [2019-01-12 09:35:40,648 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-01-12 09:35:40,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2019-01-12 09:35:40,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2019-01-12 09:35:40,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2019-01-12 09:35:40,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 89 transitions. [2019-01-12 09:35:40,658 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 89 transitions. Word has length 10 [2019-01-12 09:35:40,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 09:35:40,659 INFO L480 AbstractCegarLoop]: Abstraction has 79 states and 89 transitions. [2019-01-12 09:35:40,659 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 09:35:40,659 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 89 transitions. [2019-01-12 09:35:40,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-01-12 09:35:40,660 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 09:35:40,660 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 09:35:40,661 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 09:35:40,661 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 09:35:40,661 INFO L82 PathProgramCache]: Analyzing trace with hash 261456848, now seen corresponding path program 1 times [2019-01-12 09:35:40,661 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 09:35:40,661 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 09:35:40,663 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 09:35:40,664 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 09:35:40,664 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 09:35:40,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 09:35:40,747 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-12 09:35:40,747 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 09:35:40,747 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 09:35:40,748 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 09:35:40,748 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 09:35:40,749 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 09:35:40,749 INFO L87 Difference]: Start difference. First operand 79 states and 89 transitions. Second operand 4 states. [2019-01-12 09:35:40,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 09:35:40,876 INFO L93 Difference]: Finished difference Result 80 states and 90 transitions. [2019-01-12 09:35:40,877 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 09:35:40,877 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2019-01-12 09:35:40,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 09:35:40,878 INFO L225 Difference]: With dead ends: 80 [2019-01-12 09:35:40,878 INFO L226 Difference]: Without dead ends: 78 [2019-01-12 09:35:40,879 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 09:35:40,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2019-01-12 09:35:40,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 76. [2019-01-12 09:35:40,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2019-01-12 09:35:40,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 86 transitions. [2019-01-12 09:35:40,887 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 86 transitions. Word has length 10 [2019-01-12 09:35:40,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 09:35:40,887 INFO L480 AbstractCegarLoop]: Abstraction has 76 states and 86 transitions. [2019-01-12 09:35:40,887 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 09:35:40,887 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 86 transitions. [2019-01-12 09:35:40,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-01-12 09:35:40,888 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 09:35:40,888 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 09:35:40,889 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 09:35:40,889 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 09:35:40,889 INFO L82 PathProgramCache]: Analyzing trace with hash 1712619113, now seen corresponding path program 1 times [2019-01-12 09:35:40,889 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 09:35:40,890 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 09:35:40,891 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 09:35:40,892 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 09:35:40,892 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 09:35:40,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 09:35:40,939 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-12 09:35:40,940 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 09:35:40,940 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 09:35:40,940 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 09:35:40,940 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 09:35:40,941 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 09:35:40,941 INFO L87 Difference]: Start difference. First operand 76 states and 86 transitions. Second operand 3 states. [2019-01-12 09:35:41,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 09:35:41,244 INFO L93 Difference]: Finished difference Result 79 states and 90 transitions. [2019-01-12 09:35:41,245 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 09:35:41,245 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2019-01-12 09:35:41,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 09:35:41,246 INFO L225 Difference]: With dead ends: 79 [2019-01-12 09:35:41,246 INFO L226 Difference]: Without dead ends: 75 [2019-01-12 09:35:41,247 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-01-12 09:35:41,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2019-01-12 09:35:41,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 72. [2019-01-12 09:35:41,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2019-01-12 09:35:41,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 82 transitions. [2019-01-12 09:35:41,254 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 82 transitions. Word has length 15 [2019-01-12 09:35:41,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 09:35:41,254 INFO L480 AbstractCegarLoop]: Abstraction has 72 states and 82 transitions. [2019-01-12 09:35:41,254 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 09:35:41,254 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 82 transitions. [2019-01-12 09:35:41,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-01-12 09:35:41,255 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 09:35:41,255 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 09:35:41,256 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 09:35:41,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 09:35:41,256 INFO L82 PathProgramCache]: Analyzing trace with hash 1551589151, now seen corresponding path program 1 times [2019-01-12 09:35:41,256 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 09:35:41,257 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 09:35:41,258 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 09:35:41,258 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 09:35:41,259 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 09:35:41,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 09:35:41,337 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-12 09:35:41,337 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 09:35:41,337 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 09:35:41,338 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 09:35:41,338 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 09:35:41,339 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-12 09:35:41,339 INFO L87 Difference]: Start difference. First operand 72 states and 82 transitions. Second operand 4 states. [2019-01-12 09:35:41,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 09:35:41,696 INFO L93 Difference]: Finished difference Result 190 states and 215 transitions. [2019-01-12 09:35:41,697 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 09:35:41,697 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-01-12 09:35:41,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 09:35:41,703 INFO L225 Difference]: With dead ends: 190 [2019-01-12 09:35:41,703 INFO L226 Difference]: Without dead ends: 126 [2019-01-12 09:35:41,704 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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-01-12 09:35:41,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2019-01-12 09:35:41,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 74. [2019-01-12 09:35:41,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2019-01-12 09:35:41,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 84 transitions. [2019-01-12 09:35:41,722 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 84 transitions. Word has length 16 [2019-01-12 09:35:41,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 09:35:41,723 INFO L480 AbstractCegarLoop]: Abstraction has 74 states and 84 transitions. [2019-01-12 09:35:41,723 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 09:35:41,723 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 84 transitions. [2019-01-12 09:35:41,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-01-12 09:35:41,730 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 09:35:41,730 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 09:35:41,730 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 09:35:41,731 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 09:35:41,731 INFO L82 PathProgramCache]: Analyzing trace with hash -2063319775, now seen corresponding path program 1 times [2019-01-12 09:35:41,731 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 09:35:41,731 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 09:35:41,736 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 09:35:41,738 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 09:35:41,738 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 09:35:41,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 09:35:41,944 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-12 09:35:41,945 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 09:35:41,945 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 09:35:41,945 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 09:35:41,946 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 09:35:41,946 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-12 09:35:41,946 INFO L87 Difference]: Start difference. First operand 74 states and 84 transitions. Second operand 4 states. [2019-01-12 09:35:42,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 09:35:42,121 INFO L93 Difference]: Finished difference Result 134 states and 150 transitions. [2019-01-12 09:35:42,122 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 09:35:42,122 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-01-12 09:35:42,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 09:35:42,123 INFO L225 Difference]: With dead ends: 134 [2019-01-12 09:35:42,123 INFO L226 Difference]: Without dead ends: 114 [2019-01-12 09:35:42,124 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-12 09:35:42,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2019-01-12 09:35:42,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 73. [2019-01-12 09:35:42,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2019-01-12 09:35:42,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 83 transitions. [2019-01-12 09:35:42,134 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 83 transitions. Word has length 16 [2019-01-12 09:35:42,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 09:35:42,135 INFO L480 AbstractCegarLoop]: Abstraction has 73 states and 83 transitions. [2019-01-12 09:35:42,135 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 09:35:42,135 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 83 transitions. [2019-01-12 09:35:42,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-01-12 09:35:42,139 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 09:35:42,140 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] [2019-01-12 09:35:42,140 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 09:35:42,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 09:35:42,141 INFO L82 PathProgramCache]: Analyzing trace with hash -940628020, now seen corresponding path program 1 times [2019-01-12 09:35:42,141 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 09:35:42,141 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 09:35:42,145 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 09:35:42,146 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 09:35:42,148 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 09:35:42,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 09:35:42,220 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-12 09:35:42,220 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 09:35:42,220 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 09:35:42,221 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 09:35:42,221 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 09:35:42,221 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 09:35:42,222 INFO L87 Difference]: Start difference. First operand 73 states and 83 transitions. Second operand 3 states. [2019-01-12 09:35:42,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 09:35:42,252 INFO L93 Difference]: Finished difference Result 139 states and 159 transitions. [2019-01-12 09:35:42,253 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 09:35:42,253 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-01-12 09:35:42,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 09:35:42,255 INFO L225 Difference]: With dead ends: 139 [2019-01-12 09:35:42,255 INFO L226 Difference]: Without dead ends: 97 [2019-01-12 09:35:42,256 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-01-12 09:35:42,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2019-01-12 09:35:42,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 76. [2019-01-12 09:35:42,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2019-01-12 09:35:42,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 87 transitions. [2019-01-12 09:35:42,263 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 87 transitions. Word has length 20 [2019-01-12 09:35:42,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 09:35:42,264 INFO L480 AbstractCegarLoop]: Abstraction has 76 states and 87 transitions. [2019-01-12 09:35:42,264 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 09:35:42,264 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 87 transitions. [2019-01-12 09:35:42,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-01-12 09:35:42,265 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 09:35:42,265 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] [2019-01-12 09:35:42,265 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 09:35:42,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 09:35:42,266 INFO L82 PathProgramCache]: Analyzing trace with hash 905291998, now seen corresponding path program 1 times [2019-01-12 09:35:42,266 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 09:35:42,266 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 09:35:42,267 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 09:35:42,268 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 09:35:42,268 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 09:35:42,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 09:35:42,350 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-12 09:35:42,351 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 09:35:42,351 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 09:35:42,351 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 09:35:42,351 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 09:35:42,352 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 09:35:42,352 INFO L87 Difference]: Start difference. First operand 76 states and 87 transitions. Second operand 3 states. [2019-01-12 09:35:42,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 09:35:42,390 INFO L93 Difference]: Finished difference Result 76 states and 87 transitions. [2019-01-12 09:35:42,391 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 09:35:42,391 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-01-12 09:35:42,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 09:35:42,392 INFO L225 Difference]: With dead ends: 76 [2019-01-12 09:35:42,392 INFO L226 Difference]: Without dead ends: 74 [2019-01-12 09:35:42,393 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-01-12 09:35:42,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2019-01-12 09:35:42,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2019-01-12 09:35:42,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2019-01-12 09:35:42,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 85 transitions. [2019-01-12 09:35:42,406 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 85 transitions. Word has length 21 [2019-01-12 09:35:42,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 09:35:42,406 INFO L480 AbstractCegarLoop]: Abstraction has 74 states and 85 transitions. [2019-01-12 09:35:42,406 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 09:35:42,407 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 85 transitions. [2019-01-12 09:35:42,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-01-12 09:35:42,408 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 09:35:42,408 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] [2019-01-12 09:35:42,409 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 09:35:42,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 09:35:42,409 INFO L82 PathProgramCache]: Analyzing trace with hash 886650935, now seen corresponding path program 1 times [2019-01-12 09:35:42,409 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 09:35:42,411 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 09:35:42,414 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 09:35:42,414 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 09:35:42,414 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 09:35:42,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 09:35:42,518 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-12 09:35:42,519 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 09:35:42,519 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 09:35:42,519 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 09:35:42,519 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 09:35:42,520 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 09:35:42,520 INFO L87 Difference]: Start difference. First operand 74 states and 85 transitions. Second operand 4 states. [2019-01-12 09:35:42,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 09:35:42,627 INFO L93 Difference]: Finished difference Result 75 states and 86 transitions. [2019-01-12 09:35:42,629 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 09:35:42,629 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 23 [2019-01-12 09:35:42,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 09:35:42,630 INFO L225 Difference]: With dead ends: 75 [2019-01-12 09:35:42,631 INFO L226 Difference]: Without dead ends: 73 [2019-01-12 09:35:42,631 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 09:35:42,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2019-01-12 09:35:42,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 72. [2019-01-12 09:35:42,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2019-01-12 09:35:42,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 83 transitions. [2019-01-12 09:35:42,636 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 83 transitions. Word has length 23 [2019-01-12 09:35:42,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 09:35:42,636 INFO L480 AbstractCegarLoop]: Abstraction has 72 states and 83 transitions. [2019-01-12 09:35:42,636 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 09:35:42,637 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 83 transitions. [2019-01-12 09:35:42,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-01-12 09:35:42,638 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 09:35:42,638 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] [2019-01-12 09:35:42,638 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 09:35:42,639 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 09:35:42,639 INFO L82 PathProgramCache]: Analyzing trace with hash 1458355201, now seen corresponding path program 1 times [2019-01-12 09:35:42,639 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 09:35:42,639 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 09:35:42,640 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 09:35:42,641 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 09:35:42,641 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 09:35:42,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 09:35:42,764 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-12 09:35:42,764 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 09:35:42,765 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-12 09:35:42,765 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-12 09:35:42,765 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-12 09:35:42,765 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-01-12 09:35:42,766 INFO L87 Difference]: Start difference. First operand 72 states and 83 transitions. Second operand 6 states. [2019-01-12 09:35:43,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 09:35:43,371 INFO L93 Difference]: Finished difference Result 178 states and 205 transitions. [2019-01-12 09:35:43,372 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-12 09:35:43,372 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 24 [2019-01-12 09:35:43,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 09:35:43,374 INFO L225 Difference]: With dead ends: 178 [2019-01-12 09:35:43,375 INFO L226 Difference]: Without dead ends: 135 [2019-01-12 09:35:43,376 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2019-01-12 09:35:43,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2019-01-12 09:35:43,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 82. [2019-01-12 09:35:43,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2019-01-12 09:35:43,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 94 transitions. [2019-01-12 09:35:43,384 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 94 transitions. Word has length 24 [2019-01-12 09:35:43,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 09:35:43,384 INFO L480 AbstractCegarLoop]: Abstraction has 82 states and 94 transitions. [2019-01-12 09:35:43,384 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-12 09:35:43,384 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 94 transitions. [2019-01-12 09:35:43,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-01-12 09:35:43,386 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 09:35:43,386 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] [2019-01-12 09:35:43,387 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 09:35:43,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 09:35:43,387 INFO L82 PathProgramCache]: Analyzing trace with hash 1357759361, now seen corresponding path program 1 times [2019-01-12 09:35:43,387 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 09:35:43,388 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 09:35:43,389 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 09:35:43,389 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 09:35:43,389 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 09:35:43,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 09:35:43,811 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-12 09:35:43,811 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 09:35:43,811 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-12 09:35:43,812 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-12 09:35:43,812 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-12 09:35:43,812 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-01-12 09:35:43,813 INFO L87 Difference]: Start difference. First operand 82 states and 94 transitions. Second operand 7 states. [2019-01-12 09:35:44,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 09:35:44,605 INFO L93 Difference]: Finished difference Result 237 states and 265 transitions. [2019-01-12 09:35:44,607 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-12 09:35:44,607 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 24 [2019-01-12 09:35:44,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 09:35:44,610 INFO L225 Difference]: With dead ends: 237 [2019-01-12 09:35:44,610 INFO L226 Difference]: Without dead ends: 235 [2019-01-12 09:35:44,611 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2019-01-12 09:35:44,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2019-01-12 09:35:44,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 94. [2019-01-12 09:35:44,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2019-01-12 09:35:44,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 108 transitions. [2019-01-12 09:35:44,622 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 108 transitions. Word has length 24 [2019-01-12 09:35:44,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 09:35:44,622 INFO L480 AbstractCegarLoop]: Abstraction has 94 states and 108 transitions. [2019-01-12 09:35:44,622 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-12 09:35:44,622 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 108 transitions. [2019-01-12 09:35:44,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-01-12 09:35:44,623 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 09:35:44,623 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] [2019-01-12 09:35:44,624 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 09:35:44,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 09:35:44,624 INFO L82 PathProgramCache]: Analyzing trace with hash -545310703, now seen corresponding path program 1 times [2019-01-12 09:35:44,625 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 09:35:44,625 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 09:35:44,626 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 09:35:44,626 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 09:35:44,626 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 09:35:44,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 09:35:44,730 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-12 09:35:44,731 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 09:35:44,731 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-12 09:35:44,731 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-12 09:35:44,731 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-12 09:35:44,731 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-01-12 09:35:44,732 INFO L87 Difference]: Start difference. First operand 94 states and 108 transitions. Second operand 5 states. [2019-01-12 09:35:44,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 09:35:44,905 INFO L93 Difference]: Finished difference Result 141 states and 162 transitions. [2019-01-12 09:35:44,905 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-12 09:35:44,906 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2019-01-12 09:35:44,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 09:35:44,907 INFO L225 Difference]: With dead ends: 141 [2019-01-12 09:35:44,907 INFO L226 Difference]: Without dead ends: 123 [2019-01-12 09:35:44,908 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-01-12 09:35:44,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2019-01-12 09:35:44,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 115. [2019-01-12 09:35:44,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2019-01-12 09:35:44,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 137 transitions. [2019-01-12 09:35:44,918 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 137 transitions. Word has length 26 [2019-01-12 09:35:44,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 09:35:44,919 INFO L480 AbstractCegarLoop]: Abstraction has 115 states and 137 transitions. [2019-01-12 09:35:44,919 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-12 09:35:44,919 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 137 transitions. [2019-01-12 09:35:44,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-01-12 09:35:44,920 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 09:35:44,920 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] [2019-01-12 09:35:44,921 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 09:35:44,921 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 09:35:44,921 INFO L82 PathProgramCache]: Analyzing trace with hash 1566334865, now seen corresponding path program 1 times [2019-01-12 09:35:44,921 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 09:35:44,922 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 09:35:44,923 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 09:35:44,923 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 09:35:44,923 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 09:35:44,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 09:35:44,981 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-12 09:35:44,982 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 09:35:44,982 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 09:35:44,982 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 09:35:44,982 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 09:35:44,982 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 09:35:44,983 INFO L87 Difference]: Start difference. First operand 115 states and 137 transitions. Second operand 3 states. [2019-01-12 09:35:45,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 09:35:45,106 INFO L93 Difference]: Finished difference Result 115 states and 137 transitions. [2019-01-12 09:35:45,107 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 09:35:45,107 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2019-01-12 09:35:45,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 09:35:45,108 INFO L225 Difference]: With dead ends: 115 [2019-01-12 09:35:45,108 INFO L226 Difference]: Without dead ends: 113 [2019-01-12 09:35:45,109 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-01-12 09:35:45,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2019-01-12 09:35:45,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2019-01-12 09:35:45,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2019-01-12 09:35:45,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 135 transitions. [2019-01-12 09:35:45,117 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 135 transitions. Word has length 26 [2019-01-12 09:35:45,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 09:35:45,118 INFO L480 AbstractCegarLoop]: Abstraction has 113 states and 135 transitions. [2019-01-12 09:35:45,118 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 09:35:45,118 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 135 transitions. [2019-01-12 09:35:45,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-01-12 09:35:45,119 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 09:35:45,119 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] [2019-01-12 09:35:45,119 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 09:35:45,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 09:35:45,120 INFO L82 PathProgramCache]: Analyzing trace with hash -988757936, now seen corresponding path program 1 times [2019-01-12 09:35:45,120 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 09:35:45,120 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 09:35:45,121 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 09:35:45,121 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 09:35:45,122 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 09:35:45,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 09:35:45,506 WARN L181 SmtUtils]: Spent 265.00 ms on a formula simplification. DAG size of input: 13 DAG size of output: 9 [2019-01-12 09:35:45,986 WARN L181 SmtUtils]: Spent 427.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 24 [2019-01-12 09:35:46,180 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-12 09:35:46,181 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 09:35:46,181 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-01-12 09:35:46,181 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-12 09:35:46,182 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-12 09:35:46,182 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-01-12 09:35:46,182 INFO L87 Difference]: Start difference. First operand 113 states and 135 transitions. Second operand 8 states. [2019-01-12 09:35:46,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 09:35:46,988 INFO L93 Difference]: Finished difference Result 203 states and 235 transitions. [2019-01-12 09:35:46,989 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-01-12 09:35:46,989 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 27 [2019-01-12 09:35:46,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 09:35:46,991 INFO L225 Difference]: With dead ends: 203 [2019-01-12 09:35:46,991 INFO L226 Difference]: Without dead ends: 201 [2019-01-12 09:35:46,992 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=86, Invalid=186, Unknown=0, NotChecked=0, Total=272 [2019-01-12 09:35:46,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2019-01-12 09:35:47,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 116. [2019-01-12 09:35:47,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2019-01-12 09:35:47,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 138 transitions. [2019-01-12 09:35:47,003 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 138 transitions. Word has length 27 [2019-01-12 09:35:47,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 09:35:47,003 INFO L480 AbstractCegarLoop]: Abstraction has 116 states and 138 transitions. [2019-01-12 09:35:47,003 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-12 09:35:47,003 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 138 transitions. [2019-01-12 09:35:47,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-01-12 09:35:47,004 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 09:35:47,004 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 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-12 09:35:47,005 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 09:35:47,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 09:35:47,005 INFO L82 PathProgramCache]: Analyzing trace with hash 2026653164, now seen corresponding path program 1 times [2019-01-12 09:35:47,005 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 09:35:47,005 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 09:35:47,007 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 09:35:47,007 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 09:35:47,007 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 09:35:47,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 09:35:47,136 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 09:35:47,137 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 09:35:47,137 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 09:35:47,158 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 09:35:47,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 09:35:47,205 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 09:35:47,298 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2019-01-12 09:35:47,316 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-12 09:35:47,316 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-12 09:35:47,350 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-12 09:35:47,489 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2019-01-12 09:35:47,500 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-12 09:35:47,500 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-12 09:35:47,528 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-12 09:35:47,537 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-12 09:35:47,537 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:26, output treesize:18 [2019-01-12 09:35:47,570 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2019-01-12 09:35:47,576 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:35:47,578 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2019-01-12 09:35:47,579 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-12 09:35:47,590 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-12 09:35:47,635 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2019-01-12 09:35:47,638 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:35:47,639 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2019-01-12 09:35:47,639 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-12 09:35:47,644 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-12 09:35:47,654 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-12 09:35:47,655 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:44, output treesize:36 [2019-01-12 09:35:47,707 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16 [2019-01-12 09:35:47,710 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 3 [2019-01-12 09:35:47,710 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-12 09:35:47,711 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-12 09:35:47,739 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16 [2019-01-12 09:35:47,755 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 3 [2019-01-12 09:35:47,755 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-12 09:35:47,770 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-12 09:35:47,834 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-12 09:35:47,835 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:43, output treesize:7 [2019-01-12 09:35:47,939 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 09:35:47,973 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 09:35:47,973 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6] total 8 [2019-01-12 09:35:47,973 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-12 09:35:47,974 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-12 09:35:47,974 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-01-12 09:35:47,974 INFO L87 Difference]: Start difference. First operand 116 states and 138 transitions. Second operand 8 states. [2019-01-12 09:35:49,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 09:35:49,005 INFO L93 Difference]: Finished difference Result 220 states and 256 transitions. [2019-01-12 09:35:49,006 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-12 09:35:49,006 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 29 [2019-01-12 09:35:49,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 09:35:49,007 INFO L225 Difference]: With dead ends: 220 [2019-01-12 09:35:49,007 INFO L226 Difference]: Without dead ends: 158 [2019-01-12 09:35:49,008 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 26 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2019-01-12 09:35:49,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2019-01-12 09:35:49,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 118. [2019-01-12 09:35:49,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2019-01-12 09:35:49,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 138 transitions. [2019-01-12 09:35:49,028 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 138 transitions. Word has length 29 [2019-01-12 09:35:49,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 09:35:49,028 INFO L480 AbstractCegarLoop]: Abstraction has 118 states and 138 transitions. [2019-01-12 09:35:49,028 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-12 09:35:49,028 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 138 transitions. [2019-01-12 09:35:49,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-01-12 09:35:49,029 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 09:35:49,029 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] [2019-01-12 09:35:49,030 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 09:35:49,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 09:35:49,030 INFO L82 PathProgramCache]: Analyzing trace with hash -2133518130, now seen corresponding path program 1 times [2019-01-12 09:35:49,030 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 09:35:49,030 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 09:35:49,031 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 09:35:49,032 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 09:35:49,032 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 09:35:49,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 09:35:49,338 WARN L181 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 27 [2019-01-12 09:35:49,412 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 09:35:49,413 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 09:35:49,413 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-12 09:35:49,413 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-12 09:35:49,413 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-12 09:35:49,413 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-01-12 09:35:49,414 INFO L87 Difference]: Start difference. First operand 118 states and 138 transitions. Second operand 6 states. [2019-01-12 09:35:49,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 09:35:49,919 INFO L93 Difference]: Finished difference Result 161 states and 180 transitions. [2019-01-12 09:35:49,920 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-12 09:35:49,920 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 29 [2019-01-12 09:35:49,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 09:35:49,921 INFO L225 Difference]: With dead ends: 161 [2019-01-12 09:35:49,922 INFO L226 Difference]: Without dead ends: 141 [2019-01-12 09:35:49,922 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-01-12 09:35:49,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2019-01-12 09:35:49,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 117. [2019-01-12 09:35:49,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2019-01-12 09:35:49,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 136 transitions. [2019-01-12 09:35:49,934 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 136 transitions. Word has length 29 [2019-01-12 09:35:49,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 09:35:49,935 INFO L480 AbstractCegarLoop]: Abstraction has 117 states and 136 transitions. [2019-01-12 09:35:49,935 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-12 09:35:49,935 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 136 transitions. [2019-01-12 09:35:49,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-01-12 09:35:49,936 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 09:35:49,936 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 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-12 09:35:49,936 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 09:35:49,937 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 09:35:49,937 INFO L82 PathProgramCache]: Analyzing trace with hash 830518973, now seen corresponding path program 1 times [2019-01-12 09:35:49,937 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 09:35:49,937 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 09:35:49,938 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 09:35:49,938 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 09:35:49,938 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 09:35:49,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 09:35:50,249 WARN L181 SmtUtils]: Spent 230.00 ms on a formula simplification. DAG size of input: 27 DAG size of output: 19 [2019-01-12 09:35:50,332 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 09:35:50,332 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 09:35:50,332 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 09:35:50,342 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 09:35:50,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 09:35:50,385 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 09:35:50,408 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2019-01-12 09:35:50,413 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2019-01-12 09:35:50,414 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-12 09:35:50,421 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-12 09:35:50,424 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-12 09:35:50,424 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2019-01-12 09:35:50,551 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2019-01-12 09:35:50,554 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2019-01-12 09:35:50,554 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-12 09:35:50,579 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-12 09:35:50,590 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 18 [2019-01-12 09:35:50,592 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:35:50,593 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2019-01-12 09:35:50,594 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-12 09:35:50,600 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-12 09:35:50,653 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-12 09:35:50,654 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:38, output treesize:7 [2019-01-12 09:35:50,662 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 09:35:50,681 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 09:35:50,681 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7] total 10 [2019-01-12 09:35:50,682 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-12 09:35:50,682 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-12 09:35:50,682 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2019-01-12 09:35:50,683 INFO L87 Difference]: Start difference. First operand 117 states and 136 transitions. Second operand 10 states. [2019-01-12 09:35:51,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 09:35:51,112 INFO L93 Difference]: Finished difference Result 221 states and 249 transitions. [2019-01-12 09:35:51,113 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-12 09:35:51,114 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 32 [2019-01-12 09:35:51,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 09:35:51,115 INFO L225 Difference]: With dead ends: 221 [2019-01-12 09:35:51,116 INFO L226 Difference]: Without dead ends: 190 [2019-01-12 09:35:51,116 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 29 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2019-01-12 09:35:51,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2019-01-12 09:35:51,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 134. [2019-01-12 09:35:51,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2019-01-12 09:35:51,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 161 transitions. [2019-01-12 09:35:51,129 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 161 transitions. Word has length 32 [2019-01-12 09:35:51,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 09:35:51,130 INFO L480 AbstractCegarLoop]: Abstraction has 134 states and 161 transitions. [2019-01-12 09:35:51,130 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-12 09:35:51,130 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 161 transitions. [2019-01-12 09:35:51,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-01-12 09:35:51,131 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 09:35:51,131 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] [2019-01-12 09:35:51,131 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 09:35:51,131 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 09:35:51,132 INFO L82 PathProgramCache]: Analyzing trace with hash -60835504, now seen corresponding path program 1 times [2019-01-12 09:35:51,132 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 09:35:51,132 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 09:35:51,133 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 09:35:51,133 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 09:35:51,133 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 09:35:51,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 09:35:51,204 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 09:35:51,204 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 09:35:51,204 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 09:35:51,205 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 09:35:51,205 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 09:35:51,205 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 09:35:51,205 INFO L87 Difference]: Start difference. First operand 134 states and 161 transitions. Second operand 3 states. [2019-01-12 09:35:51,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 09:35:51,387 INFO L93 Difference]: Finished difference Result 293 states and 360 transitions. [2019-01-12 09:35:51,387 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 09:35:51,387 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2019-01-12 09:35:51,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 09:35:51,389 INFO L225 Difference]: With dead ends: 293 [2019-01-12 09:35:51,389 INFO L226 Difference]: Without dead ends: 211 [2019-01-12 09:35:51,389 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 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-01-12 09:35:51,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2019-01-12 09:35:51,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 171. [2019-01-12 09:35:51,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171 states. [2019-01-12 09:35:51,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 207 transitions. [2019-01-12 09:35:51,406 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 207 transitions. Word has length 32 [2019-01-12 09:35:51,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 09:35:51,406 INFO L480 AbstractCegarLoop]: Abstraction has 171 states and 207 transitions. [2019-01-12 09:35:51,406 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 09:35:51,406 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 207 transitions. [2019-01-12 09:35:51,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-01-12 09:35:51,407 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 09:35:51,407 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 09:35:51,408 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 09:35:51,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 09:35:51,408 INFO L82 PathProgramCache]: Analyzing trace with hash 1562646056, now seen corresponding path program 1 times [2019-01-12 09:35:51,408 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 09:35:51,409 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 09:35:51,409 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 09:35:51,410 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 09:35:51,410 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 09:35:51,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 09:35:51,760 WARN L181 SmtUtils]: Spent 237.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 13 [2019-01-12 09:35:52,078 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 09:35:52,078 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 09:35:52,079 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 09:35:52,089 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 09:35:52,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 09:35:52,117 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 09:35:52,132 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-12 09:35:52,133 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-12 09:35:52,176 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-12 09:35:52,176 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-01-12 09:35:52,251 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2019-01-12 09:35:52,253 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2019-01-12 09:35:52,254 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-12 09:35:52,256 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-12 09:35:52,267 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2019-01-12 09:35:52,271 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2019-01-12 09:35:52,271 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-12 09:35:52,274 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-12 09:35:52,280 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-12 09:35:52,281 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:35, output treesize:27 [2019-01-12 09:35:52,375 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:35:52,398 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:35:52,400 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2019-01-12 09:35:52,400 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-12 09:35:52,617 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 27 [2019-01-12 09:35:52,662 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:35:52,687 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2019-01-12 09:35:52,688 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-12 09:35:52,901 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 29 [2019-01-12 09:35:52,916 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-12 09:35:52,917 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-12 09:35:52,966 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-12 09:35:52,975 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-12 09:35:52,997 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 27 [2019-01-12 09:35:53,010 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:35:53,012 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2019-01-12 09:35:53,012 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-12 09:35:53,027 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 33 [2019-01-12 09:35:53,031 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2019-01-12 09:35:53,031 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-12 09:35:53,038 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-12 09:35:53,055 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-12 09:35:53,072 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-12 09:35:53,072 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 4 variables, input treesize:86, output treesize:51 [2019-01-12 09:35:53,113 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 82 treesize of output 72 [2019-01-12 09:35:53,142 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:35:53,143 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 31 [2019-01-12 09:35:53,144 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-12 09:35:53,158 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-12 09:35:53,187 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 37 [2019-01-12 09:35:53,192 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:35:53,193 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 31 [2019-01-12 09:35:53,193 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-12 09:35:53,243 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-12 09:35:53,262 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-12 09:35:53,263 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:94, output treesize:78 [2019-01-12 09:35:53,503 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 71 treesize of output 54 [2019-01-12 09:35:53,544 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:35:53,546 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 6 [2019-01-12 09:35:53,546 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-12 09:35:53,753 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 24 [2019-01-12 09:35:53,755 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-12 09:35:53,885 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-12 09:35:54,111 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 27 [2019-01-12 09:35:54,148 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:35:54,150 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 6 [2019-01-12 09:35:54,150 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-12 09:35:54,283 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2019-01-12 09:35:54,283 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-12 09:35:54,311 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-12 09:35:54,396 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-12 09:35:54,397 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:85, output treesize:7 [2019-01-12 09:35:54,412 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 09:35:54,446 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 09:35:54,447 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9] total 17 [2019-01-12 09:35:54,447 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-01-12 09:35:54,447 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-01-12 09:35:54,447 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=212, Unknown=0, NotChecked=0, Total=272 [2019-01-12 09:35:54,448 INFO L87 Difference]: Start difference. First operand 171 states and 207 transitions. Second operand 17 states. [2019-01-12 09:35:55,476 WARN L181 SmtUtils]: Spent 486.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 33 [2019-01-12 09:35:55,939 WARN L181 SmtUtils]: Spent 333.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 43 [2019-01-12 09:35:57,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 09:35:57,247 INFO L93 Difference]: Finished difference Result 473 states and 561 transitions. [2019-01-12 09:35:57,249 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-01-12 09:35:57,249 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 36 [2019-01-12 09:35:57,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 09:35:57,252 INFO L225 Difference]: With dead ends: 473 [2019-01-12 09:35:57,252 INFO L226 Difference]: Without dead ends: 381 [2019-01-12 09:35:57,253 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 31 SyntacticMatches, 2 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 202 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=254, Invalid=738, Unknown=0, NotChecked=0, Total=992 [2019-01-12 09:35:57,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 381 states. [2019-01-12 09:35:57,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 381 to 205. [2019-01-12 09:35:57,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 205 states. [2019-01-12 09:35:57,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 247 transitions. [2019-01-12 09:35:57,275 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 247 transitions. Word has length 36 [2019-01-12 09:35:57,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 09:35:57,275 INFO L480 AbstractCegarLoop]: Abstraction has 205 states and 247 transitions. [2019-01-12 09:35:57,275 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-01-12 09:35:57,275 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 247 transitions. [2019-01-12 09:35:57,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-01-12 09:35:57,276 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 09:35:57,276 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 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-12 09:35:57,279 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 09:35:57,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 09:35:57,280 INFO L82 PathProgramCache]: Analyzing trace with hash -648373053, now seen corresponding path program 1 times [2019-01-12 09:35:57,280 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 09:35:57,281 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 09:35:57,282 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 09:35:57,282 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 09:35:57,282 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 09:35:57,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-12 09:35:57,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-12 09:35:57,332 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2019-01-12 09:35:57,385 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.01 09:35:57 BoogieIcfgContainer [2019-01-12 09:35:57,386 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-12 09:35:57,386 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-12 09:35:57,386 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-12 09:35:57,386 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-12 09:35:57,387 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 09:35:40" (3/4) ... [2019-01-12 09:35:57,389 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2019-01-12 09:35:57,457 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-12 09:35:57,458 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-12 09:35:57,459 INFO L168 Benchmark]: Toolchain (without parser) took 19260.44 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 328.2 MB). Free memory was 942.0 MB in the beginning and 951.7 MB in the end (delta: -9.8 MB). Peak memory consumption was 318.4 MB. Max. memory is 11.5 GB. [2019-01-12 09:35:57,462 INFO L168 Benchmark]: CDTParser took 1.29 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-12 09:35:57,463 INFO L168 Benchmark]: CACSL2BoogieTranslator took 711.97 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 150.5 MB). Free memory was 942.0 MB in the beginning and 1.1 GB in the end (delta: -187.5 MB). Peak memory consumption was 25.1 MB. Max. memory is 11.5 GB. [2019-01-12 09:35:57,463 INFO L168 Benchmark]: Boogie Procedure Inliner took 58.36 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-12 09:35:57,464 INFO L168 Benchmark]: Boogie Preprocessor took 55.00 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.9 MB). Peak memory consumption was 6.9 MB. Max. memory is 11.5 GB. [2019-01-12 09:35:57,466 INFO L168 Benchmark]: RCFGBuilder took 1000.16 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: 33.0 MB). Peak memory consumption was 33.0 MB. Max. memory is 11.5 GB. [2019-01-12 09:35:57,466 INFO L168 Benchmark]: TraceAbstraction took 17358.61 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 177.7 MB). Free memory was 1.1 GB in the beginning and 961.3 MB in the end (delta: 128.2 MB). Peak memory consumption was 305.9 MB. Max. memory is 11.5 GB. [2019-01-12 09:35:57,468 INFO L168 Benchmark]: Witness Printer took 71.78 ms. Allocated memory is still 1.4 GB. Free memory was 961.3 MB in the beginning and 951.7 MB in the end (delta: 9.6 MB). Peak memory consumption was 9.6 MB. Max. memory is 11.5 GB. [2019-01-12 09:35:57,476 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.29 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 711.97 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 150.5 MB). Free memory was 942.0 MB in the beginning and 1.1 GB in the end (delta: -187.5 MB). Peak memory consumption was 25.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 58.36 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. * Boogie Preprocessor took 55.00 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.9 MB). Peak memory consumption was 6.9 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1000.16 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: 33.0 MB). Peak memory consumption was 33.0 MB. Max. memory is 11.5 GB. * TraceAbstraction took 17358.61 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 177.7 MB). Free memory was 1.1 GB in the beginning and 961.3 MB in the end (delta: 128.2 MB). Peak memory consumption was 305.9 MB. Max. memory is 11.5 GB. * Witness Printer took 71.78 ms. Allocated memory is still 1.4 GB. Free memory was 961.3 MB in the beginning and 951.7 MB in the end (delta: 9.6 MB). Peak memory consumption was 9.6 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 1025]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L991] SLL* list = malloc(sizeof(SLL)); [L992] list->next = ((void*)0) [L993] COND FALSE !(!(list != ((void*)0))) [L993] COND FALSE !(__VERIFIER_nondet_int()) [L993] list->inner = malloc(sizeof(SLL)) [L993] EXPR list->inner [L993] list->inner->next = ((void*)0) [L993] EXPR list->inner [L993] list->inner->inner = ((void*)0) [L993] EXPR list->inner [L993] EXPR list->inner != ((void*)0) || list->inner == ((void*)0) [L993] COND FALSE !(!(list->inner != ((void*)0) || list->inner == ((void*)0))) [L995] SLL* end = list; [L998] COND FALSE !(__VERIFIER_nondet_int()) [L1008] end = ((void*)0) [L1009] end = list [L1012] COND FALSE !(!(((void*)0) != end)) [L1014] COND TRUE ((void*)0) != end [L1016] int len = 0; [L1017] EXPR end->inner [L1017] SLL* inner = end->inner; [L1018] COND TRUE ((void*)0) != inner [L1020] COND TRUE len == 0 [L1021] len = 1 [L1024] COND FALSE !(!(((void*)0) != inner)) [L1025] EXPR inner->inner [L1025] COND FALSE !(!(((void*)0) == inner->inner)) [L1026] EXPR inner->next [L1026] COND FALSE !(!(((void*)0) == inner->next)) [L1027] EXPR inner->inner [L1027] inner = inner->inner [L1028] COND TRUE len == 1 [L1029] EXPR inner->inner [L1029] inner = inner->inner [L1018] COND TRUE ((void*)0) != inner [L1020] COND FALSE !(len == 0) [L1023] len = 2 [L1024] COND FALSE !(!(((void*)0) != inner)) [L1025] EXPR inner->inner [L1025] COND TRUE !(((void*)0) == inner->inner) [L1025] __VERIFIER_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 84 locations, 13 error locations. UNSAFE Result, 17.2s OverallTime, 20 OverallIterations, 2 TraceHistogramMax, 8.8s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1415 SDtfs, 2783 SDslu, 2756 SDs, 0 SdLazy, 1641 SolverSat, 268 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 5.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 239 GetRequests, 121 SyntacticMatches, 8 SemanticMatches, 110 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 277 ImplicationChecksByTransitivity, 6.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=205occurred in iteration=19, 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: 0.2s AutomataMinimizationTime, 19 MinimizatonAttempts, 761 StatesRemovedByMinimization, 16 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 7.2s InterpolantComputationTime, 553 NumberOfCodeBlocks, 553 NumberOfCodeBlocksAsserted, 23 NumberOfCheckSat, 495 ConstructedInterpolants, 10 QuantifiedInterpolants, 185931 SizeOfPredicates, 29 NumberOfNonLiveVariables, 314 ConjunctsInSsa, 69 ConjunctsInUnsatCore, 22 InterpolantComputations, 16 PerfectInterpolantSequences, 8/18 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...