./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/ldv-regression/stateful_check_false-unreach-call_false-termination.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/ldv-regression/stateful_check_false-unreach-call_false-termination.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 1225f82562543767c482452e9133e4a69d5dae70 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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:32:37,271 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-12 09:32:37,273 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-12 09:32:37,287 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-12 09:32:37,288 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-12 09:32:37,289 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-12 09:32:37,291 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-12 09:32:37,293 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-12 09:32:37,294 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-12 09:32:37,296 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-12 09:32:37,297 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-12 09:32:37,297 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-12 09:32:37,298 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-12 09:32:37,300 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-12 09:32:37,301 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-12 09:32:37,302 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-12 09:32:37,303 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-12 09:32:37,305 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-12 09:32:37,308 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-12 09:32:37,309 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-12 09:32:37,311 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-12 09:32:37,314 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-12 09:32:37,321 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-12 09:32:37,321 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-12 09:32:37,322 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-12 09:32:37,323 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-12 09:32:37,323 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-12 09:32:37,327 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-12 09:32:37,328 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-12 09:32:37,332 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-12 09:32:37,334 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-12 09:32:37,335 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-12 09:32:37,335 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-12 09:32:37,335 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-12 09:32:37,338 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-12 09:32:37,339 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-12 09:32:37,339 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:32:37,368 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-12 09:32:37,370 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-12 09:32:37,371 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-12 09:32:37,371 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-12 09:32:37,371 INFO L133 SettingsManager]: * Use SBE=true [2019-01-12 09:32:37,373 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-12 09:32:37,373 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-12 09:32:37,373 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-12 09:32:37,373 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-12 09:32:37,373 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-12 09:32:37,373 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-12 09:32:37,374 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-12 09:32:37,374 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-12 09:32:37,374 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-12 09:32:37,374 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-12 09:32:37,374 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-12 09:32:37,374 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-12 09:32:37,377 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-12 09:32:37,377 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-12 09:32:37,378 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-12 09:32:37,378 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-12 09:32:37,378 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-12 09:32:37,378 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-12 09:32:37,378 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-12 09:32:37,379 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-12 09:32:37,379 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-12 09:32:37,379 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-12 09:32:37,379 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-01-12 09:32:37,379 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 -> 1225f82562543767c482452e9133e4a69d5dae70 [2019-01-12 09:32:37,453 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-12 09:32:37,469 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-12 09:32:37,476 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-12 09:32:37,478 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-12 09:32:37,478 INFO L276 PluginConnector]: CDTParser initialized [2019-01-12 09:32:37,479 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/ldv-regression/stateful_check_false-unreach-call_false-termination.i [2019-01-12 09:32:37,529 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e75b709c3/5ab777f3c2e04b5bbebf9d1c3b4e9205/FLAGe4d103f80 [2019-01-12 09:32:37,917 INFO L307 CDTParser]: Found 1 translation units. [2019-01-12 09:32:37,917 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/ldv-regression/stateful_check_false-unreach-call_false-termination.i [2019-01-12 09:32:37,925 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e75b709c3/5ab777f3c2e04b5bbebf9d1c3b4e9205/FLAGe4d103f80 [2019-01-12 09:32:38,306 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e75b709c3/5ab777f3c2e04b5bbebf9d1c3b4e9205 [2019-01-12 09:32:38,310 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-12 09:32:38,312 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-12 09:32:38,313 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-12 09:32:38,313 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-12 09:32:38,317 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-12 09:32:38,318 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.01 09:32:38" (1/1) ... [2019-01-12 09:32:38,321 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@11c73574 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:32:38, skipping insertion in model container [2019-01-12 09:32:38,322 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.01 09:32:38" (1/1) ... [2019-01-12 09:32:38,329 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-12 09:32:38,355 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-12 09:32:38,585 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-12 09:32:38,595 INFO L191 MainTranslator]: Completed pre-run [2019-01-12 09:32:38,618 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-12 09:32:38,635 INFO L195 MainTranslator]: Completed translation [2019-01-12 09:32:38,636 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:32:38 WrapperNode [2019-01-12 09:32:38,636 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-12 09:32:38,636 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-12 09:32:38,637 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-12 09:32:38,637 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-12 09:32:38,643 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:32:38" (1/1) ... [2019-01-12 09:32:38,648 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:32:38" (1/1) ... [2019-01-12 09:32:38,670 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-12 09:32:38,670 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-12 09:32:38,670 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-12 09:32:38,670 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-12 09:32:38,679 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:32:38" (1/1) ... [2019-01-12 09:32:38,680 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:32:38" (1/1) ... [2019-01-12 09:32:38,681 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:32:38" (1/1) ... [2019-01-12 09:32:38,681 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:32:38" (1/1) ... [2019-01-12 09:32:38,685 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:32:38" (1/1) ... [2019-01-12 09:32:38,692 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:32:38" (1/1) ... [2019-01-12 09:32:38,693 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:32:38" (1/1) ... [2019-01-12 09:32:38,695 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-12 09:32:38,696 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-12 09:32:38,696 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-12 09:32:38,696 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-12 09:32:38,698 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:32: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:32:38,820 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-12 09:32:38,820 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-12 09:32:39,339 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-12 09:32:39,339 INFO L286 CfgBuilder]: Removed 35 assue(true) statements. [2019-01-12 09:32:39,340 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 09:32:39 BoogieIcfgContainer [2019-01-12 09:32:39,341 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-12 09:32:39,341 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-12 09:32:39,341 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-12 09:32:39,344 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-12 09:32:39,345 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.01 09:32:38" (1/3) ... [2019-01-12 09:32:39,345 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@26f95ab0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.01 09:32:39, skipping insertion in model container [2019-01-12 09:32:39,346 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:32:38" (2/3) ... [2019-01-12 09:32:39,346 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@26f95ab0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.01 09:32:39, skipping insertion in model container [2019-01-12 09:32:39,346 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 09:32:39" (3/3) ... [2019-01-12 09:32:39,348 INFO L112 eAbstractionObserver]: Analyzing ICFG stateful_check_false-unreach-call_false-termination.i [2019-01-12 09:32:39,358 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-12 09:32:39,368 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 5 error locations. [2019-01-12 09:32:39,383 INFO L257 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-01-12 09:32:39,415 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-12 09:32:39,416 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-12 09:32:39,416 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-12 09:32:39,416 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-12 09:32:39,417 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-12 09:32:39,417 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-12 09:32:39,417 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-12 09:32:39,417 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-12 09:32:39,417 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-12 09:32:39,434 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states. [2019-01-12 09:32:39,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-12 09:32:39,441 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 09:32:39,442 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-12 09:32:39,444 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 09:32:39,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 09:32:39,450 INFO L82 PathProgramCache]: Analyzing trace with hash 889605129, now seen corresponding path program 1 times [2019-01-12 09:32:39,452 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 09:32:39,452 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 09:32:39,491 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 09:32:39,491 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 09:32:39,491 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 09:32:39,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 09:32:39,540 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:32:39,542 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 09:32:39,543 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-12 09:32:39,546 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-01-12 09:32:39,557 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-01-12 09:32:39,557 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-01-12 09:32:39,560 INFO L87 Difference]: Start difference. First operand 46 states. Second operand 2 states. [2019-01-12 09:32:39,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 09:32:39,581 INFO L93 Difference]: Finished difference Result 89 states and 123 transitions. [2019-01-12 09:32:39,581 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-01-12 09:32:39,582 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 6 [2019-01-12 09:32:39,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 09:32:39,592 INFO L225 Difference]: With dead ends: 89 [2019-01-12 09:32:39,592 INFO L226 Difference]: Without dead ends: 42 [2019-01-12 09:32:39,596 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-01-12 09:32:39,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-01-12 09:32:39,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2019-01-12 09:32:39,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-01-12 09:32:39,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 53 transitions. [2019-01-12 09:32:39,628 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 53 transitions. Word has length 6 [2019-01-12 09:32:39,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 09:32:39,628 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 53 transitions. [2019-01-12 09:32:39,628 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-01-12 09:32:39,629 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 53 transitions. [2019-01-12 09:32:39,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-12 09:32:39,629 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 09:32:39,629 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-12 09:32:39,630 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 09:32:39,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 09:32:39,631 INFO L82 PathProgramCache]: Analyzing trace with hash 1804046918, now seen corresponding path program 1 times [2019-01-12 09:32:39,631 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 09:32:39,631 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 09:32:39,632 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 09:32:39,632 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 09:32:39,632 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 09:32:39,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 09:32:39,680 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:32:39,680 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 09:32:39,681 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-12 09:32:39,683 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 09:32:39,683 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 09:32:39,683 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 09:32:39,683 INFO L87 Difference]: Start difference. First operand 42 states and 53 transitions. Second operand 3 states. [2019-01-12 09:32:39,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 09:32:39,787 INFO L93 Difference]: Finished difference Result 70 states and 92 transitions. [2019-01-12 09:32:39,788 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 09:32:39,788 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2019-01-12 09:32:39,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 09:32:39,790 INFO L225 Difference]: With dead ends: 70 [2019-01-12 09:32:39,790 INFO L226 Difference]: Without dead ends: 63 [2019-01-12 09:32:39,791 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 09:32:39,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2019-01-12 09:32:39,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2019-01-12 09:32:39,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-01-12 09:32:39,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 85 transitions. [2019-01-12 09:32:39,807 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 85 transitions. Word has length 7 [2019-01-12 09:32:39,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 09:32:39,808 INFO L480 AbstractCegarLoop]: Abstraction has 63 states and 85 transitions. [2019-01-12 09:32:39,808 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 09:32:39,808 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 85 transitions. [2019-01-12 09:32:39,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-01-12 09:32:39,809 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 09:32:39,810 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 09:32:39,810 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 09:32:39,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 09:32:39,811 INFO L82 PathProgramCache]: Analyzing trace with hash -147365405, now seen corresponding path program 1 times [2019-01-12 09:32:39,811 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 09:32:39,811 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 09:32:39,813 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 09:32:39,815 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 09:32:39,815 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 09:32:39,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 09:32:39,887 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:32:39,888 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 09:32:39,888 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 09:32:39,888 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 09:32:39,888 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 09:32:39,889 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 09:32:39,889 INFO L87 Difference]: Start difference. First operand 63 states and 85 transitions. Second operand 3 states. [2019-01-12 09:32:40,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 09:32:40,014 INFO L93 Difference]: Finished difference Result 150 states and 212 transitions. [2019-01-12 09:32:40,015 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 09:32:40,015 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2019-01-12 09:32:40,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 09:32:40,017 INFO L225 Difference]: With dead ends: 150 [2019-01-12 09:32:40,017 INFO L226 Difference]: Without dead ends: 90 [2019-01-12 09:32:40,018 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:32:40,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2019-01-12 09:32:40,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 87. [2019-01-12 09:32:40,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2019-01-12 09:32:40,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 122 transitions. [2019-01-12 09:32:40,038 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 122 transitions. Word has length 15 [2019-01-12 09:32:40,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 09:32:40,039 INFO L480 AbstractCegarLoop]: Abstraction has 87 states and 122 transitions. [2019-01-12 09:32:40,039 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 09:32:40,039 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 122 transitions. [2019-01-12 09:32:40,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-01-12 09:32:40,040 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 09:32:40,040 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 09:32:40,041 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 09:32:40,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 09:32:40,041 INFO L82 PathProgramCache]: Analyzing trace with hash 1293798555, now seen corresponding path program 1 times [2019-01-12 09:32:40,041 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 09:32:40,042 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 09:32:40,043 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 09:32:40,043 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 09:32:40,043 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 09:32:40,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 09:32:40,172 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 09:32:40,173 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 09:32:40,173 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:32:40,190 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 09:32:40,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 09:32:40,254 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 09:32:40,327 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-01-12 09:32:40,355 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-01-12 09:32:40,355 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2019-01-12 09:32:40,356 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-12 09:32:40,356 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-12 09:32:40,357 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-01-12 09:32:40,357 INFO L87 Difference]: Start difference. First operand 87 states and 122 transitions. Second operand 6 states. [2019-01-12 09:32:40,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 09:32:40,742 INFO L93 Difference]: Finished difference Result 319 states and 482 transitions. [2019-01-12 09:32:40,742 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-12 09:32:40,743 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2019-01-12 09:32:40,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 09:32:40,748 INFO L225 Difference]: With dead ends: 319 [2019-01-12 09:32:40,748 INFO L226 Difference]: Without dead ends: 235 [2019-01-12 09:32:40,750 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2019-01-12 09:32:40,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2019-01-12 09:32:40,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 217. [2019-01-12 09:32:40,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 217 states. [2019-01-12 09:32:40,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 327 transitions. [2019-01-12 09:32:40,777 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 327 transitions. Word has length 22 [2019-01-12 09:32:40,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 09:32:40,778 INFO L480 AbstractCegarLoop]: Abstraction has 217 states and 327 transitions. [2019-01-12 09:32:40,778 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-12 09:32:40,778 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 327 transitions. [2019-01-12 09:32:40,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-01-12 09:32:40,780 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 09:32:40,780 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 09:32:40,780 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 09:32:40,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 09:32:40,781 INFO L82 PathProgramCache]: Analyzing trace with hash 1040975168, now seen corresponding path program 1 times [2019-01-12 09:32:40,781 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 09:32:40,781 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 09:32:40,782 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 09:32:40,783 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 09:32:40,783 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 09:32:40,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 09:32:40,944 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-01-12 09:32:40,944 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 09:32:40,944 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 09:32:40,945 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 09:32:40,945 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 09:32:40,945 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 09:32:40,945 INFO L87 Difference]: Start difference. First operand 217 states and 327 transitions. Second operand 4 states. [2019-01-12 09:32:41,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 09:32:41,066 INFO L93 Difference]: Finished difference Result 629 states and 979 transitions. [2019-01-12 09:32:41,070 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 09:32:41,070 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 29 [2019-01-12 09:32:41,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 09:32:41,074 INFO L225 Difference]: With dead ends: 629 [2019-01-12 09:32:41,075 INFO L226 Difference]: Without dead ends: 415 [2019-01-12 09:32:41,076 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 09:32:41,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 415 states. [2019-01-12 09:32:41,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 415 to 313. [2019-01-12 09:32:41,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 313 states. [2019-01-12 09:32:41,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 313 states to 313 states and 487 transitions. [2019-01-12 09:32:41,117 INFO L78 Accepts]: Start accepts. Automaton has 313 states and 487 transitions. Word has length 29 [2019-01-12 09:32:41,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 09:32:41,122 INFO L480 AbstractCegarLoop]: Abstraction has 313 states and 487 transitions. [2019-01-12 09:32:41,122 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 09:32:41,123 INFO L276 IsEmpty]: Start isEmpty. Operand 313 states and 487 transitions. [2019-01-12 09:32:41,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-01-12 09:32:41,125 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 09:32:41,125 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 2, 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:32:41,126 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 09:32:41,126 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 09:32:41,126 INFO L82 PathProgramCache]: Analyzing trace with hash 1446791270, now seen corresponding path program 1 times [2019-01-12 09:32:41,126 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 09:32:41,126 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 09:32:41,127 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 09:32:41,128 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 09:32:41,128 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 09:32:41,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-12 09:32:41,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-12 09:32:41,185 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2019-01-12 09:32:41,244 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.01 09:32:41 BoogieIcfgContainer [2019-01-12 09:32:41,248 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-12 09:32:41,249 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-12 09:32:41,249 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-12 09:32:41,249 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-12 09:32:41,251 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 09:32:39" (3/4) ... [2019-01-12 09:32:41,254 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2019-01-12 09:32:41,376 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-12 09:32:41,379 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-12 09:32:41,380 INFO L168 Benchmark]: Toolchain (without parser) took 3069.86 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 120.1 MB). Free memory was 951.4 MB in the beginning and 988.4 MB in the end (delta: -37.1 MB). Peak memory consumption was 83.0 MB. Max. memory is 11.5 GB. [2019-01-12 09:32:41,384 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-12 09:32:41,385 INFO L168 Benchmark]: CACSL2BoogieTranslator took 323.35 ms. Allocated memory is still 1.0 GB. Free memory was 951.4 MB in the beginning and 940.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2019-01-12 09:32:41,390 INFO L168 Benchmark]: Boogie Procedure Inliner took 33.39 ms. Allocated memory is still 1.0 GB. Free memory is still 940.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-12 09:32:41,390 INFO L168 Benchmark]: Boogie Preprocessor took 25.54 ms. Allocated memory is still 1.0 GB. Free memory was 940.6 MB in the beginning and 935.3 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-01-12 09:32:41,391 INFO L168 Benchmark]: RCFGBuilder took 644.70 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 120.1 MB). Free memory was 935.3 MB in the beginning and 1.1 GB in the end (delta: -147.6 MB). Peak memory consumption was 13.3 MB. Max. memory is 11.5 GB. [2019-01-12 09:32:41,393 INFO L168 Benchmark]: TraceAbstraction took 1907.18 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 995.2 MB in the end (delta: 87.7 MB). Peak memory consumption was 87.7 MB. Max. memory is 11.5 GB. [2019-01-12 09:32:41,394 INFO L168 Benchmark]: Witness Printer took 130.43 ms. Allocated memory is still 1.1 GB. Free memory was 995.2 MB in the beginning and 988.4 MB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2019-01-12 09:32:41,402 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 323.35 ms. Allocated memory is still 1.0 GB. Free memory was 951.4 MB in the beginning and 940.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 33.39 ms. Allocated memory is still 1.0 GB. Free memory is still 940.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 25.54 ms. Allocated memory is still 1.0 GB. Free memory was 940.6 MB in the beginning and 935.3 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 644.70 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 120.1 MB). Free memory was 935.3 MB in the beginning and 1.1 GB in the end (delta: -147.6 MB). Peak memory consumption was 13.3 MB. Max. memory is 11.5 GB. * TraceAbstraction took 1907.18 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 995.2 MB in the end (delta: 87.7 MB). Peak memory consumption was 87.7 MB. Max. memory is 11.5 GB. * Witness Printer took 130.43 ms. Allocated memory is still 1.1 GB. Free memory was 995.2 MB in the beginning and 988.4 MB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L9] int ldv_mutex = 1; [L11] int open_called = 0; VAL [ldv_mutex=1, open_called=0] [L74] int ldv_s_misc_fops_file_operations = 0; [L69] open_called = 0 [L70] return 0; VAL [ldv_mutex=1, open_called=0] [L76] COND TRUE __VERIFIER_nondet_int() [L80] case 0: VAL [ldv_mutex=1, open_called=0] [L81] COND TRUE ldv_s_misc_fops_file_operations==0 [L57] COND TRUE __VERIFIER_nondet_int() [L59] return 1; VAL [ldv_mutex=1, open_called=0] [L83] ldv_s_misc_fops_file_operations++ VAL [ldv_mutex=1, open_called=0] [L76] COND TRUE __VERIFIER_nondet_int() [L80] case 0: [L88] case 1: VAL [ldv_mutex=1, open_called=0] [L89] COND TRUE ldv_s_misc_fops_file_operations==1 [L52] return 0; VAL [ldv_mutex=1, open_called=0] [L91] ldv_s_misc_fops_file_operations++ VAL [ldv_mutex=1, open_called=0] [L76] COND TRUE __VERIFIER_nondet_int() [L80] case 0: [L88] case 1: [L96] case 2: VAL [ldv_mutex=1, open_called=0] [L97] COND TRUE ldv_s_misc_fops_file_operations==2 [L48] return 0; VAL [ldv_mutex=1, open_called=0] [L99] ldv_s_misc_fops_file_operations++ VAL [ldv_mutex=1, open_called=0] [L76] COND TRUE __VERIFIER_nondet_int() [L80] case 0: [L88] case 1: [L96] case 2: [L104] case 3: VAL [ldv_mutex=1, open_called=0] [L105] COND TRUE ldv_s_misc_fops_file_operations==3 [L34] COND FALSE !(\read(open_called)) VAL [ldv_mutex=1, open_called=0] [L16] (ldv_mutex == 1) ? 0 : __blast_assert() VAL [ldv_mutex=1, open_called=0] [L17] ldv_mutex = 2 VAL [ldv_mutex=2, open_called=0] [L16] (ldv_mutex == 1) ? 0 : __blast_assert() VAL [ldv_mutex=2, open_called=0] [L4] __VERIFIER_error() VAL [ldv_mutex=2, open_called=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 46 locations, 5 error locations. UNSAFE Result, 1.8s OverallTime, 6 OverallIterations, 4 TraceHistogramMax, 0.8s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 244 SDtfs, 248 SDslu, 275 SDs, 0 SdLazy, 103 SolverSat, 42 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 40 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=313occurred in iteration=5, 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.1s AutomataMinimizationTime, 5 MinimizatonAttempts, 123 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 138 NumberOfCodeBlocks, 138 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 95 ConstructedInterpolants, 0 QuantifiedInterpolants, 4013 SizeOfPredicates, 0 NumberOfNonLiveVariables, 55 ConjunctsInSsa, 3 ConjunctsInUnsatCore, 6 InterpolantComputations, 5 PerfectInterpolantSequences, 14/17 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...