./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/forester-heap/dll-token_false-unreach-call_false-valid-memcleanup.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 2e94e6aa Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/svcomp/c/forester-heap/dll-token_false-unreach-call_false-valid-memcleanup.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 35a5ccff58935eefedf723cd2243fac7c8b8e61b ................................................................................................................................................................................................................................................................................................................................................................................................................................. 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-2e94e6a [2018-12-31 04:25:15,968 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-31 04:25:15,973 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-31 04:25:15,990 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-31 04:25:15,990 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-31 04:25:15,992 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-31 04:25:15,993 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-31 04:25:15,996 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-31 04:25:16,001 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-31 04:25:16,006 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-31 04:25:16,008 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-31 04:25:16,010 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-31 04:25:16,011 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-31 04:25:16,012 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-31 04:25:16,016 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-31 04:25:16,018 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-31 04:25:16,019 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-31 04:25:16,023 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-31 04:25:16,031 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-31 04:25:16,036 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-31 04:25:16,037 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-31 04:25:16,038 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-31 04:25:16,041 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-31 04:25:16,041 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-31 04:25:16,041 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-31 04:25:16,042 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-31 04:25:16,043 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-31 04:25:16,046 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-31 04:25:16,047 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-31 04:25:16,048 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-31 04:25:16,048 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-31 04:25:16,050 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-31 04:25:16,050 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-31 04:25:16,050 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-31 04:25:16,051 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-31 04:25:16,052 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-31 04:25:16,053 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-12-31 04:25:16,074 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-31 04:25:16,074 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-31 04:25:16,076 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-31 04:25:16,078 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-31 04:25:16,078 INFO L133 SettingsManager]: * Use SBE=true [2018-12-31 04:25:16,078 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-31 04:25:16,078 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-31 04:25:16,080 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-31 04:25:16,080 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-31 04:25:16,080 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-31 04:25:16,080 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-31 04:25:16,080 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-31 04:25:16,080 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-31 04:25:16,081 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-31 04:25:16,081 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-31 04:25:16,081 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-31 04:25:16,081 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-31 04:25:16,081 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-31 04:25:16,081 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-31 04:25:16,084 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-31 04:25:16,084 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-31 04:25:16,085 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-31 04:25:16,085 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-31 04:25:16,086 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-31 04:25:16,086 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-31 04:25:16,086 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-31 04:25:16,086 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-31 04:25:16,086 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-31 04:25:16,086 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 -> 35a5ccff58935eefedf723cd2243fac7c8b8e61b [2018-12-31 04:25:16,137 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-31 04:25:16,151 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-31 04:25:16,155 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-31 04:25:16,157 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-31 04:25:16,158 INFO L276 PluginConnector]: CDTParser initialized [2018-12-31 04:25:16,159 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/forester-heap/dll-token_false-unreach-call_false-valid-memcleanup.i [2018-12-31 04:25:16,226 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/871320d57/3c9174395d4e4780a7d583d78ea70b53/FLAG072f90605 [2018-12-31 04:25:16,707 INFO L307 CDTParser]: Found 1 translation units. [2018-12-31 04:25:16,707 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/forester-heap/dll-token_false-unreach-call_false-valid-memcleanup.i [2018-12-31 04:25:16,725 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/871320d57/3c9174395d4e4780a7d583d78ea70b53/FLAG072f90605 [2018-12-31 04:25:17,001 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/871320d57/3c9174395d4e4780a7d583d78ea70b53 [2018-12-31 04:25:17,005 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-31 04:25:17,007 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-31 04:25:17,008 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-31 04:25:17,011 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-31 04:25:17,015 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-31 04:25:17,016 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.12 04:25:17" (1/1) ... [2018-12-31 04:25:17,020 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@51c017a2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 04:25:17, skipping insertion in model container [2018-12-31 04:25:17,021 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.12 04:25:17" (1/1) ... [2018-12-31 04:25:17,032 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-31 04:25:17,102 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-31 04:25:17,502 INFO L204 PostProcessor]: Analyzing one entry point: main [2018-12-31 04:25:17,516 INFO L191 MainTranslator]: Completed pre-run [2018-12-31 04:25:17,681 INFO L204 PostProcessor]: Analyzing one entry point: main [2018-12-31 04:25:17,752 INFO L195 MainTranslator]: Completed translation [2018-12-31 04:25:17,753 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 04:25:17 WrapperNode [2018-12-31 04:25:17,753 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-31 04:25:17,754 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-31 04:25:17,754 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-31 04:25:17,754 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-31 04:25:17,765 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 04:25:17" (1/1) ... [2018-12-31 04:25:17,791 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 04:25:17" (1/1) ... [2018-12-31 04:25:17,818 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-31 04:25:17,820 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-31 04:25:17,820 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-31 04:25:17,821 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-31 04:25:17,830 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 04:25:17" (1/1) ... [2018-12-31 04:25:17,831 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 04:25:17" (1/1) ... [2018-12-31 04:25:17,835 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 04:25:17" (1/1) ... [2018-12-31 04:25:17,835 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 04:25:17" (1/1) ... [2018-12-31 04:25:17,846 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 04:25:17" (1/1) ... [2018-12-31 04:25:17,853 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 04:25:17" (1/1) ... [2018-12-31 04:25:17,855 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 04:25:17" (1/1) ... [2018-12-31 04:25:17,859 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-31 04:25:17,859 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-31 04:25:17,860 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-31 04:25:17,860 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-31 04:25:17,861 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 04:25:17" (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 [2018-12-31 04:25:17,928 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-12-31 04:25:17,928 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-31 04:25:17,928 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2018-12-31 04:25:17,929 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-12-31 04:25:17,929 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-12-31 04:25:17,929 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-31 04:25:17,929 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-31 04:25:17,929 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-31 04:25:18,508 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-31 04:25:18,509 INFO L280 CfgBuilder]: Removed 19 assue(true) statements. [2018-12-31 04:25:18,509 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.12 04:25:18 BoogieIcfgContainer [2018-12-31 04:25:18,509 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-31 04:25:18,512 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-31 04:25:18,513 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-31 04:25:18,516 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-31 04:25:18,519 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.12 04:25:17" (1/3) ... [2018-12-31 04:25:18,520 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@18f6ca8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.12 04:25:18, skipping insertion in model container [2018-12-31 04:25:18,520 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 04:25:17" (2/3) ... [2018-12-31 04:25:18,520 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@18f6ca8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.12 04:25:18, skipping insertion in model container [2018-12-31 04:25:18,522 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.12 04:25:18" (3/3) ... [2018-12-31 04:25:18,525 INFO L112 eAbstractionObserver]: Analyzing ICFG dll-token_false-unreach-call_false-valid-memcleanup.i [2018-12-31 04:25:18,536 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-31 04:25:18,549 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 6 error locations. [2018-12-31 04:25:18,569 INFO L257 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2018-12-31 04:25:18,606 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-31 04:25:18,607 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-31 04:25:18,607 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-31 04:25:18,607 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-31 04:25:18,607 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-31 04:25:18,607 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-31 04:25:18,607 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-31 04:25:18,608 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-31 04:25:18,609 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-31 04:25:18,626 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states. [2018-12-31 04:25:18,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-12-31 04:25:18,635 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 04:25:18,636 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2018-12-31 04:25:18,639 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 04:25:18,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 04:25:18,646 INFO L82 PathProgramCache]: Analyzing trace with hash 890337990, now seen corresponding path program 1 times [2018-12-31 04:25:18,648 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 04:25:18,648 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 04:25:18,711 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 04:25:18,711 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 04:25:18,711 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 04:25:18,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 04:25:18,806 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 04:25:18,808 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 04:25:18,808 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-31 04:25:18,811 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-12-31 04:25:18,824 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-12-31 04:25:18,824 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-12-31 04:25:18,826 INFO L87 Difference]: Start difference. First operand 44 states. Second operand 2 states. [2018-12-31 04:25:18,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 04:25:18,847 INFO L93 Difference]: Finished difference Result 86 states and 132 transitions. [2018-12-31 04:25:18,848 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-12-31 04:25:18,849 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 6 [2018-12-31 04:25:18,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 04:25:18,859 INFO L225 Difference]: With dead ends: 86 [2018-12-31 04:25:18,859 INFO L226 Difference]: Without dead ends: 39 [2018-12-31 04:25:18,863 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 [2018-12-31 04:25:18,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-12-31 04:25:18,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2018-12-31 04:25:18,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-12-31 04:25:18,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 41 transitions. [2018-12-31 04:25:18,901 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 41 transitions. Word has length 6 [2018-12-31 04:25:18,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 04:25:18,901 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 41 transitions. [2018-12-31 04:25:18,902 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-12-31 04:25:18,902 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 41 transitions. [2018-12-31 04:25:18,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-12-31 04:25:18,902 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 04:25:18,902 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2018-12-31 04:25:18,903 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 04:25:18,903 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 04:25:18,903 INFO L82 PathProgramCache]: Analyzing trace with hash 889571369, now seen corresponding path program 1 times [2018-12-31 04:25:18,903 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 04:25:18,904 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 04:25:18,905 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 04:25:18,906 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 04:25:18,906 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 04:25:18,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 04:25:19,055 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 04:25:19,056 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 04:25:19,056 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-31 04:25:19,057 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-31 04:25:19,058 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-31 04:25:19,058 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-31 04:25:19,058 INFO L87 Difference]: Start difference. First operand 39 states and 41 transitions. Second operand 4 states. [2018-12-31 04:25:19,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 04:25:19,395 INFO L93 Difference]: Finished difference Result 39 states and 41 transitions. [2018-12-31 04:25:19,396 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-31 04:25:19,396 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 6 [2018-12-31 04:25:19,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 04:25:19,397 INFO L225 Difference]: With dead ends: 39 [2018-12-31 04:25:19,397 INFO L226 Difference]: Without dead ends: 37 [2018-12-31 04:25:19,398 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 [2018-12-31 04:25:19,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-12-31 04:25:19,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2018-12-31 04:25:19,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-12-31 04:25:19,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 39 transitions. [2018-12-31 04:25:19,404 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 39 transitions. Word has length 6 [2018-12-31 04:25:19,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 04:25:19,405 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 39 transitions. [2018-12-31 04:25:19,405 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-31 04:25:19,405 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 39 transitions. [2018-12-31 04:25:19,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-12-31 04:25:19,405 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 04:25:19,406 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-12-31 04:25:19,406 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 04:25:19,406 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 04:25:19,407 INFO L82 PathProgramCache]: Analyzing trace with hash 1806865149, now seen corresponding path program 1 times [2018-12-31 04:25:19,407 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 04:25:19,407 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 04:25:19,409 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 04:25:19,409 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 04:25:19,409 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 04:25:19,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 04:25:19,506 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 04:25:19,506 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 04:25:19,507 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-31 04:25:19,507 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-31 04:25:19,507 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-31 04:25:19,507 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-31 04:25:19,508 INFO L87 Difference]: Start difference. First operand 37 states and 39 transitions. Second operand 4 states. [2018-12-31 04:25:19,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 04:25:19,647 INFO L93 Difference]: Finished difference Result 63 states and 66 transitions. [2018-12-31 04:25:19,647 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-31 04:25:19,648 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 7 [2018-12-31 04:25:19,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 04:25:19,649 INFO L225 Difference]: With dead ends: 63 [2018-12-31 04:25:19,649 INFO L226 Difference]: Without dead ends: 61 [2018-12-31 04:25:19,650 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 [2018-12-31 04:25:19,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2018-12-31 04:25:19,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 35. [2018-12-31 04:25:19,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-12-31 04:25:19,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 37 transitions. [2018-12-31 04:25:19,657 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 37 transitions. Word has length 7 [2018-12-31 04:25:19,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 04:25:19,657 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 37 transitions. [2018-12-31 04:25:19,657 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-31 04:25:19,658 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 37 transitions. [2018-12-31 04:25:19,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-12-31 04:25:19,658 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 04:25:19,658 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 04:25:19,659 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 04:25:19,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 04:25:19,659 INFO L82 PathProgramCache]: Analyzing trace with hash -913382283, now seen corresponding path program 1 times [2018-12-31 04:25:19,660 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 04:25:19,660 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 04:25:19,661 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 04:25:19,662 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 04:25:19,662 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 04:25:19,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 04:25:19,755 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 04:25:19,755 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 04:25:19,755 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-31 04:25:19,758 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-31 04:25:19,758 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-31 04:25:19,759 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-31 04:25:19,759 INFO L87 Difference]: Start difference. First operand 35 states and 37 transitions. Second operand 5 states. [2018-12-31 04:25:20,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 04:25:20,173 INFO L93 Difference]: Finished difference Result 35 states and 37 transitions. [2018-12-31 04:25:20,174 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-31 04:25:20,174 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 12 [2018-12-31 04:25:20,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 04:25:20,175 INFO L225 Difference]: With dead ends: 35 [2018-12-31 04:25:20,175 INFO L226 Difference]: Without dead ends: 33 [2018-12-31 04:25:20,175 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-31 04:25:20,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-12-31 04:25:20,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2018-12-31 04:25:20,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-12-31 04:25:20,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 35 transitions. [2018-12-31 04:25:20,181 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 35 transitions. Word has length 12 [2018-12-31 04:25:20,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 04:25:20,182 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 35 transitions. [2018-12-31 04:25:20,182 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-31 04:25:20,182 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 35 transitions. [2018-12-31 04:25:20,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-12-31 04:25:20,182 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 04:25:20,183 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 04:25:20,183 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 04:25:20,183 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 04:25:20,184 INFO L82 PathProgramCache]: Analyzing trace with hash -913344547, now seen corresponding path program 1 times [2018-12-31 04:25:20,184 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 04:25:20,184 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 04:25:20,186 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 04:25:20,186 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 04:25:20,186 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 04:25:20,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 04:25:20,527 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 04:25:20,527 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 04:25:20,528 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-31 04:25:20,528 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-31 04:25:20,528 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-31 04:25:20,528 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-31 04:25:20,529 INFO L87 Difference]: Start difference. First operand 33 states and 35 transitions. Second operand 5 states. [2018-12-31 04:25:21,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 04:25:21,023 INFO L93 Difference]: Finished difference Result 68 states and 73 transitions. [2018-12-31 04:25:21,024 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-31 04:25:21,024 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 12 [2018-12-31 04:25:21,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 04:25:21,025 INFO L225 Difference]: With dead ends: 68 [2018-12-31 04:25:21,025 INFO L226 Difference]: Without dead ends: 44 [2018-12-31 04:25:21,029 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-12-31 04:25:21,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-12-31 04:25:21,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 40. [2018-12-31 04:25:21,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-12-31 04:25:21,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 43 transitions. [2018-12-31 04:25:21,042 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 43 transitions. Word has length 12 [2018-12-31 04:25:21,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 04:25:21,044 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 43 transitions. [2018-12-31 04:25:21,044 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-31 04:25:21,045 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 43 transitions. [2018-12-31 04:25:21,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-12-31 04:25:21,047 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 04:25:21,047 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 04:25:21,047 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 04:25:21,049 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 04:25:21,050 INFO L82 PathProgramCache]: Analyzing trace with hash -313255267, now seen corresponding path program 1 times [2018-12-31 04:25:21,050 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 04:25:21,050 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 04:25:21,052 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 04:25:21,056 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 04:25:21,056 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 04:25:21,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-31 04:25:21,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-31 04:25:21,149 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-12-31 04:25:21,195 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 31.12 04:25:21 BoogieIcfgContainer [2018-12-31 04:25:21,198 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-31 04:25:21,201 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-31 04:25:21,201 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-31 04:25:21,201 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-31 04:25:21,202 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.12 04:25:18" (3/4) ... [2018-12-31 04:25:21,205 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-12-31 04:25:21,260 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2018-12-31 04:25:21,260 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-31 04:25:21,261 INFO L168 Benchmark]: Toolchain (without parser) took 4255.40 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 135.3 MB). Free memory was 951.4 MB in the beginning and 992.5 MB in the end (delta: -41.2 MB). Peak memory consumption was 94.1 MB. Max. memory is 11.5 GB. [2018-12-31 04:25:21,264 INFO L168 Benchmark]: CDTParser took 0.24 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. [2018-12-31 04:25:21,265 INFO L168 Benchmark]: CACSL2BoogieTranslator took 745.27 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 135.3 MB). Free memory was 951.4 MB in the beginning and 1.1 GB in the end (delta: -164.0 MB). Peak memory consumption was 31.4 MB. Max. memory is 11.5 GB. [2018-12-31 04:25:21,266 INFO L168 Benchmark]: Boogie Procedure Inliner took 65.84 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. [2018-12-31 04:25:21,267 INFO L168 Benchmark]: Boogie Preprocessor took 38.85 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. [2018-12-31 04:25:21,267 INFO L168 Benchmark]: RCFGBuilder took 649.95 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: 26.2 MB). Peak memory consumption was 26.2 MB. Max. memory is 11.5 GB. [2018-12-31 04:25:21,268 INFO L168 Benchmark]: TraceAbstraction took 2688.23 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 992.5 MB in the end (delta: 96.6 MB). Peak memory consumption was 96.6 MB. Max. memory is 11.5 GB. [2018-12-31 04:25:21,270 INFO L168 Benchmark]: Witness Printer took 59.09 ms. Allocated memory is still 1.2 GB. Free memory is still 992.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-31 04:25:21,275 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.24 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 745.27 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 135.3 MB). Free memory was 951.4 MB in the beginning and 1.1 GB in the end (delta: -164.0 MB). Peak memory consumption was 31.4 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 65.84 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 38.85 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 649.95 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: 26.2 MB). Peak memory consumption was 26.2 MB. Max. memory is 11.5 GB. * TraceAbstraction took 2688.23 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 992.5 MB in the end (delta: 96.6 MB). Peak memory consumption was 96.6 MB. Max. memory is 11.5 GB. * Witness Printer took 59.09 ms. Allocated memory is still 1.2 GB. Free memory is still 992.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 1026]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L993] SLL* head = malloc(sizeof(SLL)); [L994] head->next = ((void*)0) [L995] head->prev = ((void*)0) [L996] head->data = 0 [L998] SLL* x = head; [L1001] COND FALSE !(__VERIFIER_nondet_int()) [L1010] x->data = 1 [L1011] x->next = malloc(sizeof(SLL)) [L1012] EXPR x->next [L1012] x->next->prev = x [L1013] EXPR x->next [L1013] x->next->data = 2 [L1015] x = head [L1017] COND FALSE !(!(((void*)0) != x)) [L1019] EXPR x->data [L1019] COND FALSE !(1 != x->data) [L1024] EXPR x->data [L1024] COND FALSE !(!(1 == x->data)) [L1025] EXPR x->next [L1025] x = x->next [L1026] EXPR x->data [L1026] COND TRUE !(2 != x->data) [L1026] __VERIFIER_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 44 locations, 6 error locations. UNSAFE Result, 2.5s OverallTime, 6 OverallIterations, 1 TraceHistogramMax, 1.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 164 SDtfs, 91 SDslu, 190 SDs, 0 SdLazy, 141 SolverSat, 14 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 27 GetRequests, 10 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=44occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 5 MinimizatonAttempts, 30 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 59 NumberOfCodeBlocks, 59 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 38 ConstructedInterpolants, 0 QuantifiedInterpolants, 1401 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 5 InterpolantComputations, 5 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...