./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/ldv-regression/rule60_list2.c_1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8d31f386 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/ldv-regression/rule60_list2.c_1.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(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 2af97cd1d0200c0dff6df008e1ae10eecdfc76e4 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ 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.2.1-wip.dd.multireach-323-8d31f38 [2021-07-05 00:57:58,852 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-07-05 00:57:58,853 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-07-05 00:57:58,871 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-07-05 00:57:58,872 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-07-05 00:57:58,873 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-07-05 00:57:58,874 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-07-05 00:57:58,875 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-07-05 00:57:58,876 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-07-05 00:57:58,877 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-07-05 00:57:58,877 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-07-05 00:57:58,878 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-07-05 00:57:58,879 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-07-05 00:57:58,879 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-07-05 00:57:58,880 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-07-05 00:57:58,881 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-07-05 00:57:58,881 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-07-05 00:57:58,882 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-07-05 00:57:58,883 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-07-05 00:57:58,884 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-07-05 00:57:58,885 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-07-05 00:57:58,888 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-07-05 00:57:58,889 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-07-05 00:57:58,889 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-07-05 00:57:58,897 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-07-05 00:57:58,897 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-07-05 00:57:58,897 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-07-05 00:57:58,898 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-07-05 00:57:58,898 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-07-05 00:57:58,899 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-07-05 00:57:58,899 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-07-05 00:57:58,900 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-07-05 00:57:58,900 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-07-05 00:57:58,901 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-07-05 00:57:58,901 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-07-05 00:57:58,902 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-07-05 00:57:58,902 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-07-05 00:57:58,902 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-07-05 00:57:58,903 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-07-05 00:57:58,903 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-07-05 00:57:58,904 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-07-05 00:57:58,917 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-07-05 00:57:58,936 INFO L113 SettingsManager]: Loading preferences was successful [2021-07-05 00:57:58,936 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-07-05 00:57:58,938 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-07-05 00:57:58,938 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-07-05 00:57:58,938 INFO L138 SettingsManager]: * Use SBE=true [2021-07-05 00:57:58,938 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-07-05 00:57:58,939 INFO L138 SettingsManager]: * sizeof long=4 [2021-07-05 00:57:58,939 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-07-05 00:57:58,939 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-07-05 00:57:58,939 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-07-05 00:57:58,940 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-07-05 00:57:58,940 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-07-05 00:57:58,940 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-07-05 00:57:58,940 INFO L138 SettingsManager]: * sizeof long double=12 [2021-07-05 00:57:58,940 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-07-05 00:57:58,940 INFO L138 SettingsManager]: * Use constant arrays=true [2021-07-05 00:57:58,941 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-07-05 00:57:58,941 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-07-05 00:57:58,941 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-07-05 00:57:58,941 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-07-05 00:57:58,941 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-07-05 00:57:58,942 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-07-05 00:57:58,942 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-07-05 00:57:58,942 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-07-05 00:57:58,942 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-07-05 00:57:58,942 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-07-05 00:57:58,942 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-07-05 00:57:58,943 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-07-05 00:57:58,943 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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(reach_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 -> 2af97cd1d0200c0dff6df008e1ae10eecdfc76e4 [2021-07-05 00:57:59,217 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-07-05 00:57:59,230 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-07-05 00:57:59,231 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-07-05 00:57:59,232 INFO L271 PluginConnector]: Initializing CDTParser... [2021-07-05 00:57:59,233 INFO L275 PluginConnector]: CDTParser initialized [2021-07-05 00:57:59,233 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-regression/rule60_list2.c_1.i [2021-07-05 00:57:59,323 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8a48039e1/750df479c9cf40849ba139cdf65d9839/FLAG081d01a50 [2021-07-05 00:57:59,781 INFO L306 CDTParser]: Found 1 translation units. [2021-07-05 00:57:59,781 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-regression/rule60_list2.c_1.i [2021-07-05 00:57:59,789 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8a48039e1/750df479c9cf40849ba139cdf65d9839/FLAG081d01a50 [2021-07-05 00:58:00,274 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8a48039e1/750df479c9cf40849ba139cdf65d9839 [2021-07-05 00:58:00,277 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-07-05 00:58:00,278 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-07-05 00:58:00,281 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-07-05 00:58:00,281 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-07-05 00:58:00,286 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-07-05 00:58:00,286 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.07 12:58:00" (1/1) ... [2021-07-05 00:58:00,287 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1a1fd5b0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.07 12:58:00, skipping insertion in model container [2021-07-05 00:58:00,287 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.07 12:58:00" (1/1) ... [2021-07-05 00:58:00,292 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-07-05 00:58:00,331 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-07-05 00:58:00,489 WARN L224 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-regression/rule60_list2.c_1.i[296,309] [2021-07-05 00:58:00,607 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-07-05 00:58:00,613 INFO L203 MainTranslator]: Completed pre-run [2021-07-05 00:58:00,620 WARN L224 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-regression/rule60_list2.c_1.i[296,309] [2021-07-05 00:58:00,644 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-07-05 00:58:00,686 INFO L208 MainTranslator]: Completed translation [2021-07-05 00:58:00,687 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.07 12:58:00 WrapperNode [2021-07-05 00:58:00,687 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-07-05 00:58:00,688 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-07-05 00:58:00,688 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-07-05 00:58:00,689 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-07-05 00:58:00,693 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.07 12:58:00" (1/1) ... [2021-07-05 00:58:00,712 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.07 12:58:00" (1/1) ... [2021-07-05 00:58:00,735 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-07-05 00:58:00,735 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-07-05 00:58:00,736 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-07-05 00:58:00,736 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-07-05 00:58:00,741 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.07 12:58:00" (1/1) ... [2021-07-05 00:58:00,741 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.07 12:58:00" (1/1) ... [2021-07-05 00:58:00,752 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.07 12:58:00" (1/1) ... [2021-07-05 00:58:00,753 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.07 12:58:00" (1/1) ... [2021-07-05 00:58:00,760 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.07 12:58:00" (1/1) ... [2021-07-05 00:58:00,762 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.07 12:58:00" (1/1) ... [2021-07-05 00:58:00,767 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.07 12:58:00" (1/1) ... [2021-07-05 00:58:00,770 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-07-05 00:58:00,781 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-07-05 00:58:00,781 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-07-05 00:58:00,782 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-07-05 00:58:00,782 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.07 12:58:00" (1/1) ... [2021-07-05 00:58:00,787 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-07-05 00:58:00,792 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-07-05 00:58:00,802 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-07-05 00:58:00,820 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-07-05 00:58:00,838 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-07-05 00:58:00,839 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2021-07-05 00:58:00,839 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-07-05 00:58:00,839 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-07-05 00:58:00,840 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-07-05 00:58:01,216 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-07-05 00:58:01,217 INFO L299 CfgBuilder]: Removed 34 assume(true) statements. [2021-07-05 00:58:01,218 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.07 12:58:01 BoogieIcfgContainer [2021-07-05 00:58:01,218 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-07-05 00:58:01,221 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-07-05 00:58:01,221 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-07-05 00:58:01,223 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-07-05 00:58:01,223 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.07 12:58:00" (1/3) ... [2021-07-05 00:58:01,223 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b7b2fc6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.07 12:58:01, skipping insertion in model container [2021-07-05 00:58:01,223 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.07 12:58:00" (2/3) ... [2021-07-05 00:58:01,224 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b7b2fc6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.07 12:58:01, skipping insertion in model container [2021-07-05 00:58:01,224 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.07 12:58:01" (3/3) ... [2021-07-05 00:58:01,225 INFO L111 eAbstractionObserver]: Analyzing ICFG rule60_list2.c_1.i [2021-07-05 00:58:01,229 INFO L198 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-07-05 00:58:01,230 INFO L158 ceAbstractionStarter]: Applying trace abstraction to program that has 6 error locations. [2021-07-05 00:58:01,269 INFO L328 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION ======== [2021-07-05 00:58:01,275 INFO L329 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mLimitAnalysisTime=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-07-05 00:58:01,275 INFO L330 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-07-05 00:58:01,287 INFO L276 IsEmpty]: Start isEmpty. Operand has 46 states, 39 states have (on average 1.5128205128205128) internal successors, (59), 45 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-05 00:58:01,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2021-07-05 00:58:01,290 INFO L517 BasicCegarLoop]: Found error trace [2021-07-05 00:58:01,290 INFO L525 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2021-07-05 00:58:01,291 INFO L374 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-07-05 00:58:01,296 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-05 00:58:01,297 INFO L82 PathProgramCache]: Analyzing trace with hash 925669, now seen corresponding path program 1 times [2021-07-05 00:58:01,302 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-05 00:58:01,303 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1147754551] [2021-07-05 00:58:01,303 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-05 00:58:01,304 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-05 00:58:01,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-05 00:58:01,407 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 00:58:01,408 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 00:58:01,409 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 00:58:01,409 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-07-05 00:58:01,417 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 00:58:01,417 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 00:58:01,418 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-05 00:58:01,419 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-05 00:58:01,419 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1147754551] [2021-07-05 00:58:01,419 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1147754551] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-05 00:58:01,419 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-05 00:58:01,420 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-07-05 00:58:01,421 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [848419892] [2021-07-05 00:58:01,423 INFO L425 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-07-05 00:58:01,424 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-05 00:58:01,430 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-07-05 00:58:01,431 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-07-05 00:58:01,432 INFO L87 Difference]: Start difference. First operand has 46 states, 39 states have (on average 1.5128205128205128) internal successors, (59), 45 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-05 00:58:01,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-05 00:58:01,449 INFO L93 Difference]: Finished difference Result 85 states and 110 transitions. [2021-07-05 00:58:01,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-07-05 00:58:01,450 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2021-07-05 00:58:01,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-05 00:58:01,454 INFO L225 Difference]: With dead ends: 85 [2021-07-05 00:58:01,454 INFO L226 Difference]: Without dead ends: 0 [2021-07-05 00:58:01,456 INFO L795 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.8ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-07-05 00:58:01,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-07-05 00:58:01,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-07-05 00:58:01,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-05 00:58:01,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-07-05 00:58:01,469 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 4 [2021-07-05 00:58:01,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-05 00:58:01,469 INFO L442 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-07-05 00:58:01,469 INFO L443 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-05 00:58:01,470 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-07-05 00:58:01,470 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-07-05 00:58:01,472 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2021-07-05 00:58:01,474 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 00:58:01,476 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 00:58:01,477 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 00:58:01,477 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 00:58:01,478 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 00:58:01,486 INFO L762 garLoopResultBuilder]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION(line 6) no Hoare annotation was computed. [2021-07-05 00:58:01,486 INFO L758 garLoopResultBuilder]: At program point L556(lines 545 557) the Hoare annotation is: (= ULTIMATE.start___getMemory_~size 8) [2021-07-05 00:58:01,487 INFO L762 garLoopResultBuilder]: For program point ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION(line 6) no Hoare annotation was computed. [2021-07-05 00:58:01,487 INFO L762 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2021-07-05 00:58:01,487 INFO L762 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2021-07-05 00:58:01,487 INFO L762 garLoopResultBuilder]: For program point L540(lines 540 543) no Hoare annotation was computed. [2021-07-05 00:58:01,487 INFO L762 garLoopResultBuilder]: For program point L524(lines 524 525) no Hoare annotation was computed. [2021-07-05 00:58:01,487 INFO L762 garLoopResultBuilder]: For program point L524-1(lines 524 525) no Hoare annotation was computed. [2021-07-05 00:58:01,487 INFO L762 garLoopResultBuilder]: For program point L549(lines 549 555) no Hoare annotation was computed. [2021-07-05 00:58:01,487 INFO L762 garLoopResultBuilder]: For program point L4(lines 1 557) no Hoare annotation was computed. [2021-07-05 00:58:01,488 INFO L762 garLoopResultBuilder]: For program point L549-1(lines 549 555) no Hoare annotation was computed. [2021-07-05 00:58:01,488 INFO L762 garLoopResultBuilder]: For program point L4-1(lines 1 557) no Hoare annotation was computed. [2021-07-05 00:58:01,488 INFO L762 garLoopResultBuilder]: For program point L4-2(lines 1 557) no Hoare annotation was computed. [2021-07-05 00:58:01,488 INFO L762 garLoopResultBuilder]: For program point L4-3(lines 1 557) no Hoare annotation was computed. [2021-07-05 00:58:01,488 INFO L762 garLoopResultBuilder]: For program point L4-4(lines 1 557) no Hoare annotation was computed. [2021-07-05 00:58:01,488 INFO L762 garLoopResultBuilder]: For program point L4-5(lines 1 557) no Hoare annotation was computed. [2021-07-05 00:58:01,488 INFO L762 garLoopResultBuilder]: For program point L541(lines 541 542) no Hoare annotation was computed. [2021-07-05 00:58:01,489 INFO L762 garLoopResultBuilder]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION(line 6) no Hoare annotation was computed. [2021-07-05 00:58:01,489 INFO L758 garLoopResultBuilder]: At program point L526(lines 520 527) the Hoare annotation is: (= ULTIMATE.start___getMemory_~size 8) [2021-07-05 00:58:01,489 INFO L758 garLoopResultBuilder]: At program point L526-1(lines 520 527) the Hoare annotation is: (= ULTIMATE.start___getMemory_~size 8) [2021-07-05 00:58:01,489 INFO L762 garLoopResultBuilder]: For program point L6(line 6) no Hoare annotation was computed. [2021-07-05 00:58:01,489 INFO L762 garLoopResultBuilder]: For program point L6-1(line 6) no Hoare annotation was computed. [2021-07-05 00:58:01,489 INFO L762 garLoopResultBuilder]: For program point L6-2(line 6) no Hoare annotation was computed. [2021-07-05 00:58:01,489 INFO L762 garLoopResultBuilder]: For program point L6-3(line 6) no Hoare annotation was computed. [2021-07-05 00:58:01,490 INFO L762 garLoopResultBuilder]: For program point L6-4(line 6) no Hoare annotation was computed. [2021-07-05 00:58:01,490 INFO L762 garLoopResultBuilder]: For program point L6-5(line 6) no Hoare annotation was computed. [2021-07-05 00:58:01,490 INFO L762 garLoopResultBuilder]: For program point ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION(line 6) no Hoare annotation was computed. [2021-07-05 00:58:01,490 INFO L762 garLoopResultBuilder]: For program point L535(lines 535 539) no Hoare annotation was computed. [2021-07-05 00:58:01,490 INFO L762 garLoopResultBuilder]: For program point L535-1(lines 535 539) no Hoare annotation was computed. [2021-07-05 00:58:01,490 INFO L762 garLoopResultBuilder]: For program point L535-2(lines 535 539) no Hoare annotation was computed. [2021-07-05 00:58:01,490 INFO L762 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2021-07-05 00:58:01,491 INFO L762 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 6) no Hoare annotation was computed. [2021-07-05 00:58:01,491 INFO L762 garLoopResultBuilder]: For program point L536(line 536) no Hoare annotation was computed. [2021-07-05 00:58:01,491 INFO L762 garLoopResultBuilder]: For program point L536-2(line 536) no Hoare annotation was computed. [2021-07-05 00:58:01,491 INFO L762 garLoopResultBuilder]: For program point L536-4(line 536) no Hoare annotation was computed. [2021-07-05 00:58:01,491 INFO L762 garLoopResultBuilder]: For program point L536-6(line 536) no Hoare annotation was computed. [2021-07-05 00:58:01,491 INFO L762 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2021-07-05 00:58:01,491 INFO L762 garLoopResultBuilder]: For program point L537(lines 537 538) no Hoare annotation was computed. [2021-07-05 00:58:01,492 INFO L762 garLoopResultBuilder]: For program point L537-2(lines 537 538) no Hoare annotation was computed. [2021-07-05 00:58:01,492 INFO L762 garLoopResultBuilder]: For program point L537-4(lines 537 538) no Hoare annotation was computed. [2021-07-05 00:58:01,492 INFO L762 garLoopResultBuilder]: For program point L537-6(lines 537 538) no Hoare annotation was computed. [2021-07-05 00:58:01,492 INFO L758 garLoopResultBuilder]: At program point L529(lines 528 530) the Hoare annotation is: (= ULTIMATE.start___getMemory_~size 8) [2021-07-05 00:58:01,492 INFO L758 garLoopResultBuilder]: At program point L529-1(lines 528 530) the Hoare annotation is: (= ULTIMATE.start___getMemory_~size 8) [2021-07-05 00:58:01,492 INFO L762 garLoopResultBuilder]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION(line 6) no Hoare annotation was computed. [2021-07-05 00:58:01,492 INFO L762 garLoopResultBuilder]: For program point L522(line 522) no Hoare annotation was computed. [2021-07-05 00:58:01,493 INFO L762 garLoopResultBuilder]: For program point L522-2(line 522) no Hoare annotation was computed. [2021-07-05 00:58:01,493 WARN L471 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-07-05 00:58:01,493 WARN L182 nStatisticsGenerator]: total relevant statements: 0 [2021-07-05 00:58:01,496 INFO L303 ceAbstractionStarter]: Result for error location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION was SAFE (1/6) [2021-07-05 00:58:01,498 INFO L328 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION ======== [2021-07-05 00:58:01,498 INFO L329 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mLimitAnalysisTime=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-07-05 00:58:01,499 INFO L330 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-07-05 00:58:01,500 INFO L276 IsEmpty]: Start isEmpty. Operand has 46 states, 39 states have (on average 1.5128205128205128) internal successors, (59), 45 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-05 00:58:01,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2021-07-05 00:58:01,500 INFO L517 BasicCegarLoop]: Found error trace [2021-07-05 00:58:01,501 INFO L525 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-05 00:58:01,501 INFO L374 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-07-05 00:58:01,501 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-05 00:58:01,501 INFO L82 PathProgramCache]: Analyzing trace with hash -475735895, now seen corresponding path program 1 times [2021-07-05 00:58:01,501 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-05 00:58:01,502 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [568856571] [2021-07-05 00:58:01,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-05 00:58:01,502 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-05 00:58:01,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-05 00:58:01,528 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 00:58:01,529 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 00:58:01,532 INFO L142 QuantifierPusher]: treesize reduction 6, result has 33.3 percent of original size [2021-07-05 00:58:01,533 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-07-05 00:58:01,535 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 00:58:01,536 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 00:58:01,536 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 00:58:01,536 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-07-05 00:58:01,540 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 00:58:01,540 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 00:58:01,540 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-05 00:58:01,540 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-05 00:58:01,541 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [568856571] [2021-07-05 00:58:01,541 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [568856571] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-05 00:58:01,541 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-05 00:58:01,541 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-07-05 00:58:01,541 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1050663985] [2021-07-05 00:58:01,542 INFO L425 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-07-05 00:58:01,542 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-05 00:58:01,542 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-07-05 00:58:01,542 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-07-05 00:58:01,543 INFO L87 Difference]: Start difference. First operand has 46 states, 39 states have (on average 1.5128205128205128) internal successors, (59), 45 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-05 00:58:01,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-05 00:58:01,553 INFO L93 Difference]: Finished difference Result 85 states and 110 transitions. [2021-07-05 00:58:01,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-07-05 00:58:01,554 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2021-07-05 00:58:01,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-05 00:58:01,554 INFO L225 Difference]: With dead ends: 85 [2021-07-05 00:58:01,554 INFO L226 Difference]: Without dead ends: 0 [2021-07-05 00:58:01,555 INFO L795 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.7ms TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-07-05 00:58:01,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-07-05 00:58:01,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-07-05 00:58:01,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-05 00:58:01,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-07-05 00:58:01,555 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 9 [2021-07-05 00:58:01,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-05 00:58:01,556 INFO L442 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-07-05 00:58:01,556 INFO L443 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-05 00:58:01,556 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-07-05 00:58:01,556 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-07-05 00:58:01,556 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2021-07-05 00:58:01,557 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 00:58:01,557 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 00:58:01,558 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 00:58:01,558 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 00:58:01,559 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 00:58:01,565 INFO L762 garLoopResultBuilder]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION(line 6) no Hoare annotation was computed. [2021-07-05 00:58:01,565 INFO L758 garLoopResultBuilder]: At program point L556(lines 545 557) the Hoare annotation is: (= ULTIMATE.start___getMemory_~size 8) [2021-07-05 00:58:01,565 INFO L762 garLoopResultBuilder]: For program point ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION(line 6) no Hoare annotation was computed. [2021-07-05 00:58:01,565 INFO L762 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2021-07-05 00:58:01,566 INFO L762 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2021-07-05 00:58:01,566 INFO L762 garLoopResultBuilder]: For program point L540(lines 540 543) no Hoare annotation was computed. [2021-07-05 00:58:01,566 INFO L762 garLoopResultBuilder]: For program point L524(lines 524 525) no Hoare annotation was computed. [2021-07-05 00:58:01,566 INFO L762 garLoopResultBuilder]: For program point L524-1(lines 524 525) no Hoare annotation was computed. [2021-07-05 00:58:01,566 INFO L762 garLoopResultBuilder]: For program point L549(lines 549 555) no Hoare annotation was computed. [2021-07-05 00:58:01,566 INFO L762 garLoopResultBuilder]: For program point L4(lines 1 557) no Hoare annotation was computed. [2021-07-05 00:58:01,566 INFO L762 garLoopResultBuilder]: For program point L549-1(lines 549 555) no Hoare annotation was computed. [2021-07-05 00:58:01,567 INFO L762 garLoopResultBuilder]: For program point L4-1(lines 1 557) no Hoare annotation was computed. [2021-07-05 00:58:01,567 INFO L762 garLoopResultBuilder]: For program point L4-2(lines 1 557) no Hoare annotation was computed. [2021-07-05 00:58:01,567 INFO L762 garLoopResultBuilder]: For program point L4-3(lines 1 557) no Hoare annotation was computed. [2021-07-05 00:58:01,567 INFO L762 garLoopResultBuilder]: For program point L4-4(lines 1 557) no Hoare annotation was computed. [2021-07-05 00:58:01,567 INFO L762 garLoopResultBuilder]: For program point L4-5(lines 1 557) no Hoare annotation was computed. [2021-07-05 00:58:01,567 INFO L762 garLoopResultBuilder]: For program point L541(lines 541 542) no Hoare annotation was computed. [2021-07-05 00:58:01,567 INFO L762 garLoopResultBuilder]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION(line 6) no Hoare annotation was computed. [2021-07-05 00:58:01,568 INFO L758 garLoopResultBuilder]: At program point L526(lines 520 527) the Hoare annotation is: (= ULTIMATE.start___getMemory_~size 8) [2021-07-05 00:58:01,568 INFO L758 garLoopResultBuilder]: At program point L526-1(lines 520 527) the Hoare annotation is: (= ULTIMATE.start___getMemory_~size 8) [2021-07-05 00:58:01,568 INFO L762 garLoopResultBuilder]: For program point L6(line 6) no Hoare annotation was computed. [2021-07-05 00:58:01,568 INFO L762 garLoopResultBuilder]: For program point L6-1(line 6) no Hoare annotation was computed. [2021-07-05 00:58:01,568 INFO L762 garLoopResultBuilder]: For program point L6-2(line 6) no Hoare annotation was computed. [2021-07-05 00:58:01,568 INFO L762 garLoopResultBuilder]: For program point L6-3(line 6) no Hoare annotation was computed. [2021-07-05 00:58:01,568 INFO L762 garLoopResultBuilder]: For program point L6-4(line 6) no Hoare annotation was computed. [2021-07-05 00:58:01,568 INFO L762 garLoopResultBuilder]: For program point L6-5(line 6) no Hoare annotation was computed. [2021-07-05 00:58:01,569 INFO L762 garLoopResultBuilder]: For program point ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION(line 6) no Hoare annotation was computed. [2021-07-05 00:58:01,569 INFO L762 garLoopResultBuilder]: For program point L535(lines 535 539) no Hoare annotation was computed. [2021-07-05 00:58:01,569 INFO L762 garLoopResultBuilder]: For program point L535-1(lines 535 539) no Hoare annotation was computed. [2021-07-05 00:58:01,569 INFO L762 garLoopResultBuilder]: For program point L535-2(lines 535 539) no Hoare annotation was computed. [2021-07-05 00:58:01,569 INFO L762 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2021-07-05 00:58:01,569 INFO L762 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 6) no Hoare annotation was computed. [2021-07-05 00:58:01,569 INFO L762 garLoopResultBuilder]: For program point L536(line 536) no Hoare annotation was computed. [2021-07-05 00:58:01,570 INFO L762 garLoopResultBuilder]: For program point L536-2(line 536) no Hoare annotation was computed. [2021-07-05 00:58:01,570 INFO L762 garLoopResultBuilder]: For program point L536-4(line 536) no Hoare annotation was computed. [2021-07-05 00:58:01,570 INFO L762 garLoopResultBuilder]: For program point L536-6(line 536) no Hoare annotation was computed. [2021-07-05 00:58:01,570 INFO L762 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2021-07-05 00:58:01,570 INFO L762 garLoopResultBuilder]: For program point L537(lines 537 538) no Hoare annotation was computed. [2021-07-05 00:58:01,570 INFO L762 garLoopResultBuilder]: For program point L537-2(lines 537 538) no Hoare annotation was computed. [2021-07-05 00:58:01,570 INFO L762 garLoopResultBuilder]: For program point L537-4(lines 537 538) no Hoare annotation was computed. [2021-07-05 00:58:01,570 INFO L762 garLoopResultBuilder]: For program point L537-6(lines 537 538) no Hoare annotation was computed. [2021-07-05 00:58:01,571 INFO L758 garLoopResultBuilder]: At program point L529(lines 528 530) the Hoare annotation is: (= ULTIMATE.start___getMemory_~size 8) [2021-07-05 00:58:01,571 INFO L758 garLoopResultBuilder]: At program point L529-1(lines 528 530) the Hoare annotation is: (= ULTIMATE.start___getMemory_~size 8) [2021-07-05 00:58:01,571 INFO L762 garLoopResultBuilder]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION(line 6) no Hoare annotation was computed. [2021-07-05 00:58:01,571 INFO L762 garLoopResultBuilder]: For program point L522(line 522) no Hoare annotation was computed. [2021-07-05 00:58:01,571 INFO L762 garLoopResultBuilder]: For program point L522-2(line 522) no Hoare annotation was computed. [2021-07-05 00:58:01,571 WARN L471 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-07-05 00:58:01,571 WARN L182 nStatisticsGenerator]: total relevant statements: 0 [2021-07-05 00:58:01,572 INFO L303 ceAbstractionStarter]: Result for error location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION was SAFE (2/6) [2021-07-05 00:58:01,573 INFO L328 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION ======== [2021-07-05 00:58:01,574 INFO L329 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mLimitAnalysisTime=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-07-05 00:58:01,574 INFO L330 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-07-05 00:58:01,575 INFO L276 IsEmpty]: Start isEmpty. Operand has 46 states, 39 states have (on average 1.5128205128205128) internal successors, (59), 45 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-05 00:58:01,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-07-05 00:58:01,575 INFO L517 BasicCegarLoop]: Found error trace [2021-07-05 00:58:01,576 INFO L525 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-05 00:58:01,576 INFO L374 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2021-07-05 00:58:01,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-05 00:58:01,576 INFO L82 PathProgramCache]: Analyzing trace with hash 170685048, now seen corresponding path program 1 times [2021-07-05 00:58:01,576 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-05 00:58:01,576 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1774209305] [2021-07-05 00:58:01,577 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-05 00:58:01,577 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-05 00:58:01,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-05 00:58:01,616 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 00:58:01,617 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 00:58:01,622 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 00:58:01,622 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-07-05 00:58:01,627 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 00:58:01,627 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-07-05 00:58:01,635 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 00:58:01,637 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-07-05 00:58:01,645 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 00:58:01,647 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 00:58:01,648 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-05 00:58:01,648 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-05 00:58:01,648 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1774209305] [2021-07-05 00:58:01,648 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1774209305] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-05 00:58:01,649 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-05 00:58:01,649 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-07-05 00:58:01,649 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1081852621] [2021-07-05 00:58:01,650 INFO L425 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-07-05 00:58:01,650 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-05 00:58:01,651 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-07-05 00:58:01,651 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-07-05 00:58:01,651 INFO L87 Difference]: Start difference. First operand has 46 states, 39 states have (on average 1.5128205128205128) internal successors, (59), 45 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-05 00:58:01,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-05 00:58:01,742 INFO L93 Difference]: Finished difference Result 140 states and 176 transitions. [2021-07-05 00:58:01,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-07-05 00:58:01,744 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2021-07-05 00:58:01,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-05 00:58:01,746 INFO L225 Difference]: With dead ends: 140 [2021-07-05 00:58:01,746 INFO L226 Difference]: Without dead ends: 22 [2021-07-05 00:58:01,746 INFO L795 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 53.1ms TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-07-05 00:58:01,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2021-07-05 00:58:01,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 16. [2021-07-05 00:58:01,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 15 states have (on average 1.0666666666666667) internal successors, (16), 15 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-05 00:58:01,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2021-07-05 00:58:01,764 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 15 [2021-07-05 00:58:01,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-05 00:58:01,765 INFO L442 AbstractCegarLoop]: Abstraction has 16 states and 16 transitions. [2021-07-05 00:58:01,765 INFO L443 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-05 00:58:01,765 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2021-07-05 00:58:01,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-07-05 00:58:01,766 INFO L517 BasicCegarLoop]: Found error trace [2021-07-05 00:58:01,766 INFO L525 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-05 00:58:01,766 WARN L471 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-07-05 00:58:01,766 INFO L374 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2021-07-05 00:58:01,767 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-05 00:58:01,767 INFO L82 PathProgramCache]: Analyzing trace with hash 871749626, now seen corresponding path program 1 times [2021-07-05 00:58:01,767 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-05 00:58:01,767 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1846932690] [2021-07-05 00:58:01,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-05 00:58:01,767 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-05 00:58:01,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-05 00:58:01,814 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 00:58:01,814 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 00:58:01,815 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 00:58:01,815 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-07-05 00:58:01,820 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 00:58:01,821 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-07-05 00:58:01,827 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 00:58:01,828 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-07-05 00:58:01,833 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 00:58:01,833 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 00:58:01,833 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-05 00:58:01,833 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-05 00:58:01,834 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1846932690] [2021-07-05 00:58:01,834 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1846932690] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-05 00:58:01,834 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-05 00:58:01,834 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-07-05 00:58:01,834 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [564746124] [2021-07-05 00:58:01,835 INFO L425 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-07-05 00:58:01,835 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-05 00:58:01,835 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-07-05 00:58:01,836 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-07-05 00:58:01,836 INFO L87 Difference]: Start difference. First operand 16 states and 16 transitions. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-05 00:58:01,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-05 00:58:01,871 INFO L93 Difference]: Finished difference Result 22 states and 21 transitions. [2021-07-05 00:58:01,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-07-05 00:58:01,871 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2021-07-05 00:58:01,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-05 00:58:01,872 INFO L225 Difference]: With dead ends: 22 [2021-07-05 00:58:01,872 INFO L226 Difference]: Without dead ends: 16 [2021-07-05 00:58:01,872 INFO L795 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 30.0ms TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-07-05 00:58:01,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2021-07-05 00:58:01,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2021-07-05 00:58:01,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 15 states have (on average 1.0) internal successors, (15), 15 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-05 00:58:01,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 15 transitions. [2021-07-05 00:58:01,875 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 15 transitions. Word has length 15 [2021-07-05 00:58:01,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-05 00:58:01,877 INFO L442 AbstractCegarLoop]: Abstraction has 16 states and 15 transitions. [2021-07-05 00:58:01,878 INFO L443 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-05 00:58:01,878 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 15 transitions. [2021-07-05 00:58:01,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-07-05 00:58:01,878 INFO L517 BasicCegarLoop]: Found error trace [2021-07-05 00:58:01,878 INFO L525 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-05 00:58:01,879 WARN L471 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-07-05 00:58:01,879 INFO L374 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2021-07-05 00:58:01,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-05 00:58:01,879 INFO L82 PathProgramCache]: Analyzing trace with hash 929007928, now seen corresponding path program 1 times [2021-07-05 00:58:01,879 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-05 00:58:01,880 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [929727407] [2021-07-05 00:58:01,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-05 00:58:01,880 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-05 00:58:01,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-05 00:58:01,945 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 00:58:01,945 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-07-05 00:58:01,949 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 00:58:01,950 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-07-05 00:58:01,955 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 00:58:01,955 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-07-05 00:58:01,961 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 00:58:01,961 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-07-05 00:58:01,967 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 00:58:01,967 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-07-05 00:58:01,974 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 00:58:01,974 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-07-05 00:58:01,982 INFO L142 QuantifierPusher]: treesize reduction 13, result has 38.1 percent of original size [2021-07-05 00:58:01,983 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-07-05 00:58:01,990 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 00:58:01,991 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 00:58:01,991 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-05 00:58:01,991 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-05 00:58:01,991 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [929727407] [2021-07-05 00:58:01,991 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [929727407] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-05 00:58:01,992 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-05 00:58:01,992 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-07-05 00:58:01,992 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1329124581] [2021-07-05 00:58:01,992 INFO L425 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-07-05 00:58:01,992 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-05 00:58:01,993 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-07-05 00:58:01,993 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2021-07-05 00:58:01,993 INFO L87 Difference]: Start difference. First operand 16 states and 15 transitions. Second operand has 9 states, 9 states have (on average 1.6666666666666667) internal successors, (15), 8 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-05 00:58:02,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-05 00:58:02,068 INFO L93 Difference]: Finished difference Result 16 states and 15 transitions. [2021-07-05 00:58:02,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-07-05 00:58:02,068 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 1.6666666666666667) internal successors, (15), 8 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2021-07-05 00:58:02,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-05 00:58:02,069 INFO L225 Difference]: With dead ends: 16 [2021-07-05 00:58:02,069 INFO L226 Difference]: Without dead ends: 0 [2021-07-05 00:58:02,069 INFO L795 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 87.1ms TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2021-07-05 00:58:02,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-07-05 00:58:02,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-07-05 00:58:02,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-05 00:58:02,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-07-05 00:58:02,069 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 15 [2021-07-05 00:58:02,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-05 00:58:02,070 INFO L442 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-07-05 00:58:02,070 INFO L443 AbstractCegarLoop]: Interpolant automaton has has 9 states, 9 states have (on average 1.6666666666666667) internal successors, (15), 8 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-05 00:58:02,070 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-07-05 00:58:02,070 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-07-05 00:58:02,070 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2021-07-05 00:58:02,073 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 00:58:02,075 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 00:58:02,078 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 00:58:02,079 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 00:58:02,080 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 00:58:02,139 INFO L762 garLoopResultBuilder]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION(line 6) no Hoare annotation was computed. [2021-07-05 00:58:02,139 INFO L758 garLoopResultBuilder]: At program point L556(lines 545 557) the Hoare annotation is: (= ULTIMATE.start___getMemory_~size 8) [2021-07-05 00:58:02,139 INFO L762 garLoopResultBuilder]: For program point ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION(line 6) no Hoare annotation was computed. [2021-07-05 00:58:02,139 INFO L762 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2021-07-05 00:58:02,139 INFO L762 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2021-07-05 00:58:02,140 INFO L762 garLoopResultBuilder]: For program point L540(lines 540 543) no Hoare annotation was computed. [2021-07-05 00:58:02,140 INFO L762 garLoopResultBuilder]: For program point L524(lines 524 525) no Hoare annotation was computed. [2021-07-05 00:58:02,140 INFO L762 garLoopResultBuilder]: For program point L524-1(lines 524 525) no Hoare annotation was computed. [2021-07-05 00:58:02,140 INFO L762 garLoopResultBuilder]: For program point L549(lines 549 555) no Hoare annotation was computed. [2021-07-05 00:58:02,140 INFO L762 garLoopResultBuilder]: For program point L4(lines 1 557) no Hoare annotation was computed. [2021-07-05 00:58:02,140 INFO L762 garLoopResultBuilder]: For program point L549-1(lines 549 555) no Hoare annotation was computed. [2021-07-05 00:58:02,140 INFO L762 garLoopResultBuilder]: For program point L4-1(lines 1 557) no Hoare annotation was computed. [2021-07-05 00:58:02,140 INFO L762 garLoopResultBuilder]: For program point L4-2(lines 1 557) no Hoare annotation was computed. [2021-07-05 00:58:02,140 INFO L762 garLoopResultBuilder]: For program point L4-3(lines 1 557) no Hoare annotation was computed. [2021-07-05 00:58:02,140 INFO L762 garLoopResultBuilder]: For program point L4-4(lines 1 557) no Hoare annotation was computed. [2021-07-05 00:58:02,140 INFO L762 garLoopResultBuilder]: For program point L4-5(lines 1 557) no Hoare annotation was computed. [2021-07-05 00:58:02,140 INFO L762 garLoopResultBuilder]: For program point L541(lines 541 542) no Hoare annotation was computed. [2021-07-05 00:58:02,140 INFO L762 garLoopResultBuilder]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION(line 6) no Hoare annotation was computed. [2021-07-05 00:58:02,141 INFO L758 garLoopResultBuilder]: At program point L526(lines 520 527) the Hoare annotation is: (and (= ULTIMATE.start___getMemory_~size 8) (or (and (<= 1 ~guard_malloc_counter~0.offset) (= ~elem~0.offset 0)) (and (= |ULTIMATE.start___getMemory_#res.offset| 0) (= |ULTIMATE.start___getMemory_#res.base| 0)))) [2021-07-05 00:58:02,141 INFO L758 garLoopResultBuilder]: At program point L526-1(lines 520 527) the Hoare annotation is: (and (= ULTIMATE.start___getMemory_~size 8) (or (and (<= 2 |ULTIMATE.start___getMemory_#res.offset|) (<= 2 ~guard_malloc_counter~0.offset) (= ~elem~0.offset 0)) (and (= ULTIMATE.start_main_~dev1~0.base 0) (= ULTIMATE.start_main_~dev1~0.offset 0)) (and (= |ULTIMATE.start___getMemory_#res.offset| 0) (= |ULTIMATE.start___getMemory_#res.base| 0)))) [2021-07-05 00:58:02,141 INFO L762 garLoopResultBuilder]: For program point L6(line 6) no Hoare annotation was computed. [2021-07-05 00:58:02,141 INFO L762 garLoopResultBuilder]: For program point L6-1(line 6) no Hoare annotation was computed. [2021-07-05 00:58:02,141 INFO L762 garLoopResultBuilder]: For program point L6-2(line 6) no Hoare annotation was computed. [2021-07-05 00:58:02,141 INFO L762 garLoopResultBuilder]: For program point L6-3(line 6) no Hoare annotation was computed. [2021-07-05 00:58:02,141 INFO L762 garLoopResultBuilder]: For program point L6-4(line 6) no Hoare annotation was computed. [2021-07-05 00:58:02,141 INFO L762 garLoopResultBuilder]: For program point L6-5(line 6) no Hoare annotation was computed. [2021-07-05 00:58:02,141 INFO L762 garLoopResultBuilder]: For program point ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION(line 6) no Hoare annotation was computed. [2021-07-05 00:58:02,141 INFO L762 garLoopResultBuilder]: For program point L535(lines 535 539) no Hoare annotation was computed. [2021-07-05 00:58:02,141 INFO L762 garLoopResultBuilder]: For program point L535-1(lines 535 539) no Hoare annotation was computed. [2021-07-05 00:58:02,141 INFO L762 garLoopResultBuilder]: For program point L535-2(lines 535 539) no Hoare annotation was computed. [2021-07-05 00:58:02,142 INFO L762 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2021-07-05 00:58:02,142 INFO L762 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 6) no Hoare annotation was computed. [2021-07-05 00:58:02,142 INFO L762 garLoopResultBuilder]: For program point L536(line 536) no Hoare annotation was computed. [2021-07-05 00:58:02,142 INFO L762 garLoopResultBuilder]: For program point L536-2(line 536) no Hoare annotation was computed. [2021-07-05 00:58:02,142 INFO L762 garLoopResultBuilder]: For program point L536-4(line 536) no Hoare annotation was computed. [2021-07-05 00:58:02,142 INFO L762 garLoopResultBuilder]: For program point L536-6(line 536) no Hoare annotation was computed. [2021-07-05 00:58:02,142 INFO L762 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2021-07-05 00:58:02,142 INFO L762 garLoopResultBuilder]: For program point L537(lines 537 538) no Hoare annotation was computed. [2021-07-05 00:58:02,142 INFO L762 garLoopResultBuilder]: For program point L537-2(lines 537 538) no Hoare annotation was computed. [2021-07-05 00:58:02,142 INFO L762 garLoopResultBuilder]: For program point L537-4(lines 537 538) no Hoare annotation was computed. [2021-07-05 00:58:02,142 INFO L762 garLoopResultBuilder]: For program point L537-6(lines 537 538) no Hoare annotation was computed. [2021-07-05 00:58:02,142 INFO L758 garLoopResultBuilder]: At program point L529(lines 528 530) the Hoare annotation is: (and (= ULTIMATE.start___getMemory_~size 8) (or (and (<= 1 ~guard_malloc_counter~0.offset) (= ~elem~0.offset 0)) (and (= 0 |ULTIMATE.start_my_malloc_#res.offset|) (= |ULTIMATE.start___getMemory_#res.offset| 0) (= |ULTIMATE.start_my_malloc_#res.base| 0) (= |ULTIMATE.start___getMemory_#res.base| 0)))) [2021-07-05 00:58:02,143 INFO L758 garLoopResultBuilder]: At program point L529-1(lines 528 530) the Hoare annotation is: (and (= ULTIMATE.start___getMemory_~size 8) (or (and (= ULTIMATE.start_main_~dev1~0.base 0) (= ULTIMATE.start_main_~dev1~0.offset 0)) (and (= 0 |ULTIMATE.start_my_malloc_#res.offset|) (= |ULTIMATE.start___getMemory_#res.offset| 0) (= |ULTIMATE.start_my_malloc_#res.base| 0) (= |ULTIMATE.start___getMemory_#res.base| 0)) (and (<= 2 |ULTIMATE.start_my_malloc_#res.offset|) (<= 2 |ULTIMATE.start___getMemory_#res.offset|) (<= 2 ~guard_malloc_counter~0.offset) (= ~elem~0.offset 0)))) [2021-07-05 00:58:02,143 INFO L762 garLoopResultBuilder]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION(line 6) no Hoare annotation was computed. [2021-07-05 00:58:02,143 INFO L762 garLoopResultBuilder]: For program point L522(line 522) no Hoare annotation was computed. [2021-07-05 00:58:02,143 INFO L762 garLoopResultBuilder]: For program point L522-2(line 522) no Hoare annotation was computed. [2021-07-05 00:58:02,143 WARN L471 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-07-05 00:58:02,143 WARN L182 nStatisticsGenerator]: total relevant statements: 0 [2021-07-05 00:58:02,143 INFO L303 ceAbstractionStarter]: Result for error location ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION was SAFE (3/6) [2021-07-05 00:58:02,144 INFO L328 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION ======== [2021-07-05 00:58:02,145 INFO L329 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mLimitAnalysisTime=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-07-05 00:58:02,145 INFO L330 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-07-05 00:58:02,146 INFO L276 IsEmpty]: Start isEmpty. Operand has 46 states, 39 states have (on average 1.5128205128205128) internal successors, (59), 45 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-05 00:58:02,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-07-05 00:58:02,146 INFO L517 BasicCegarLoop]: Found error trace [2021-07-05 00:58:02,146 INFO L525 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-05 00:58:02,146 INFO L374 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION] === [2021-07-05 00:58:02,146 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-05 00:58:02,147 INFO L82 PathProgramCache]: Analyzing trace with hash 1579739684, now seen corresponding path program 1 times [2021-07-05 00:58:02,147 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-05 00:58:02,147 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [974074213] [2021-07-05 00:58:02,147 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-05 00:58:02,147 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-05 00:58:02,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-05 00:58:02,190 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 00:58:02,191 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 00:58:02,191 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 00:58:02,192 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-07-05 00:58:02,196 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 00:58:02,199 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-07-05 00:58:02,204 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 00:58:02,204 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-07-05 00:58:02,210 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 00:58:02,210 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 00:58:02,210 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-05 00:58:02,211 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-05 00:58:02,211 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [974074213] [2021-07-05 00:58:02,211 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [974074213] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-05 00:58:02,211 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-05 00:58:02,211 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-07-05 00:58:02,211 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [818275127] [2021-07-05 00:58:02,212 INFO L425 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-07-05 00:58:02,212 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-05 00:58:02,212 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-07-05 00:58:02,212 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-07-05 00:58:02,213 INFO L87 Difference]: Start difference. First operand has 46 states, 39 states have (on average 1.5128205128205128) internal successors, (59), 45 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-05 00:58:02,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-05 00:58:02,288 INFO L93 Difference]: Finished difference Result 140 states and 176 transitions. [2021-07-05 00:58:02,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-07-05 00:58:02,289 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2021-07-05 00:58:02,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-05 00:58:02,289 INFO L225 Difference]: With dead ends: 140 [2021-07-05 00:58:02,289 INFO L226 Difference]: Without dead ends: 30 [2021-07-05 00:58:02,290 INFO L795 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 36.5ms TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-07-05 00:58:02,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2021-07-05 00:58:02,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 20. [2021-07-05 00:58:02,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 19 states have (on average 1.105263157894737) internal successors, (21), 19 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-05 00:58:02,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 21 transitions. [2021-07-05 00:58:02,291 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 21 transitions. Word has length 19 [2021-07-05 00:58:02,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-05 00:58:02,292 INFO L442 AbstractCegarLoop]: Abstraction has 20 states and 21 transitions. [2021-07-05 00:58:02,292 INFO L443 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-05 00:58:02,292 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 21 transitions. [2021-07-05 00:58:02,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-07-05 00:58:02,292 INFO L517 BasicCegarLoop]: Found error trace [2021-07-05 00:58:02,292 INFO L525 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-05 00:58:02,292 WARN L471 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-07-05 00:58:02,292 INFO L374 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION] === [2021-07-05 00:58:02,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-05 00:58:02,293 INFO L82 PathProgramCache]: Analyzing trace with hash 299876006, now seen corresponding path program 1 times [2021-07-05 00:58:02,293 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-05 00:58:02,293 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [946190435] [2021-07-05 00:58:02,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-05 00:58:02,293 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-05 00:58:02,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-05 00:58:02,325 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 00:58:02,325 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 00:58:02,326 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 00:58:02,326 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-07-05 00:58:02,330 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 00:58:02,331 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-07-05 00:58:02,345 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 00:58:02,346 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-07-05 00:58:02,352 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 00:58:02,352 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 00:58:02,353 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-05 00:58:02,353 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-05 00:58:02,353 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [946190435] [2021-07-05 00:58:02,353 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [946190435] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-05 00:58:02,353 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-05 00:58:02,353 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-07-05 00:58:02,353 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [935901653] [2021-07-05 00:58:02,354 INFO L425 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-07-05 00:58:02,354 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-05 00:58:02,354 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-07-05 00:58:02,354 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-07-05 00:58:02,354 INFO L87 Difference]: Start difference. First operand 20 states and 21 transitions. Second operand has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-05 00:58:02,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-05 00:58:02,387 INFO L93 Difference]: Finished difference Result 30 states and 31 transitions. [2021-07-05 00:58:02,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-07-05 00:58:02,387 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2021-07-05 00:58:02,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-05 00:58:02,387 INFO L225 Difference]: With dead ends: 30 [2021-07-05 00:58:02,388 INFO L226 Difference]: Without dead ends: 20 [2021-07-05 00:58:02,388 INFO L795 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 43.1ms TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-07-05 00:58:02,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2021-07-05 00:58:02,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2021-07-05 00:58:02,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 19 states have (on average 1.0526315789473684) internal successors, (20), 19 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-05 00:58:02,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 20 transitions. [2021-07-05 00:58:02,389 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 20 transitions. Word has length 19 [2021-07-05 00:58:02,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-05 00:58:02,390 INFO L442 AbstractCegarLoop]: Abstraction has 20 states and 20 transitions. [2021-07-05 00:58:02,390 INFO L443 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-05 00:58:02,390 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2021-07-05 00:58:02,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-07-05 00:58:02,390 INFO L517 BasicCegarLoop]: Found error trace [2021-07-05 00:58:02,390 INFO L525 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-05 00:58:02,391 WARN L471 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-07-05 00:58:02,391 INFO L374 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION] === [2021-07-05 00:58:02,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-05 00:58:02,391 INFO L82 PathProgramCache]: Analyzing trace with hash -93151004, now seen corresponding path program 1 times [2021-07-05 00:58:02,391 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-05 00:58:02,391 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [86775729] [2021-07-05 00:58:02,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-05 00:58:02,392 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-05 00:58:02,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-05 00:58:02,408 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 00:58:02,409 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 00:58:02,409 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 00:58:02,409 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-07-05 00:58:02,412 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 00:58:02,412 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-07-05 00:58:02,415 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 00:58:02,415 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-07-05 00:58:02,419 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 00:58:02,419 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-07-05 00:58:02,423 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 00:58:02,424 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-07-05 00:58:02,428 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 00:58:02,429 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-07-05 00:58:02,434 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 00:58:02,435 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-07-05 00:58:02,441 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 00:58:02,441 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-07-05 00:58:02,448 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 00:58:02,449 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-07-05 00:58:02,456 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 00:58:02,457 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-07-05 00:58:02,465 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 00:58:02,465 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 00:58:02,465 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-05 00:58:02,466 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-05 00:58:02,466 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [86775729] [2021-07-05 00:58:02,466 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [86775729] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-05 00:58:02,466 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-05 00:58:02,466 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-07-05 00:58:02,466 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [747486926] [2021-07-05 00:58:02,466 INFO L425 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-07-05 00:58:02,467 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-05 00:58:02,467 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-07-05 00:58:02,467 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2021-07-05 00:58:02,467 INFO L87 Difference]: Start difference. First operand 20 states and 20 transitions. Second operand has 12 states, 12 states have (on average 1.5833333333333333) internal successors, (19), 12 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-05 00:58:02,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-05 00:58:02,629 INFO L93 Difference]: Finished difference Result 24 states and 23 transitions. [2021-07-05 00:58:02,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-07-05 00:58:02,630 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 1.5833333333333333) internal successors, (19), 12 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2021-07-05 00:58:02,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-05 00:58:02,630 INFO L225 Difference]: With dead ends: 24 [2021-07-05 00:58:02,630 INFO L226 Difference]: Without dead ends: 20 [2021-07-05 00:58:02,631 INFO L795 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 164.6ms TimeCoverageRelationStatistics Valid=99, Invalid=243, Unknown=0, NotChecked=0, Total=342 [2021-07-05 00:58:02,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2021-07-05 00:58:02,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2021-07-05 00:58:02,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 19 states have (on average 1.0) internal successors, (19), 19 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-05 00:58:02,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 19 transitions. [2021-07-05 00:58:02,632 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 19 transitions. Word has length 19 [2021-07-05 00:58:02,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-05 00:58:02,633 INFO L442 AbstractCegarLoop]: Abstraction has 20 states and 19 transitions. [2021-07-05 00:58:02,633 INFO L443 AbstractCegarLoop]: Interpolant automaton has has 12 states, 12 states have (on average 1.5833333333333333) internal successors, (19), 12 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-05 00:58:02,633 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 19 transitions. [2021-07-05 00:58:02,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-07-05 00:58:02,633 INFO L517 BasicCegarLoop]: Found error trace [2021-07-05 00:58:02,634 INFO L525 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-05 00:58:02,634 WARN L471 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2021-07-05 00:58:02,634 INFO L374 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION] === [2021-07-05 00:58:02,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-05 00:58:02,634 INFO L82 PathProgramCache]: Analyzing trace with hash -93091422, now seen corresponding path program 1 times [2021-07-05 00:58:02,634 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-05 00:58:02,634 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1816694323] [2021-07-05 00:58:02,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-05 00:58:02,635 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-05 00:58:02,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-05 00:58:02,651 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 00:58:02,652 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-07-05 00:58:02,656 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 00:58:02,656 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-07-05 00:58:02,661 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 00:58:02,661 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-07-05 00:58:02,666 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 00:58:02,666 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-07-05 00:58:02,672 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 00:58:02,672 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-07-05 00:58:02,679 INFO L142 QuantifierPusher]: treesize reduction 13, result has 38.1 percent of original size [2021-07-05 00:58:02,680 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-07-05 00:58:02,687 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 00:58:02,687 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 00:58:02,688 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-05 00:58:02,688 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-05 00:58:02,688 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1816694323] [2021-07-05 00:58:02,688 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1816694323] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-05 00:58:02,688 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-05 00:58:02,688 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-07-05 00:58:02,688 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1643158852] [2021-07-05 00:58:02,689 INFO L425 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-07-05 00:58:02,689 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-05 00:58:02,689 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-07-05 00:58:02,689 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2021-07-05 00:58:02,689 INFO L87 Difference]: Start difference. First operand 20 states and 19 transitions. Second operand has 8 states, 8 states have (on average 2.375) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-05 00:58:02,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-05 00:58:02,764 INFO L93 Difference]: Finished difference Result 20 states and 19 transitions. [2021-07-05 00:58:02,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-07-05 00:58:02,764 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.375) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2021-07-05 00:58:02,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-05 00:58:02,765 INFO L225 Difference]: With dead ends: 20 [2021-07-05 00:58:02,765 INFO L226 Difference]: Without dead ends: 0 [2021-07-05 00:58:02,765 INFO L795 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 73.1ms TimeCoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2021-07-05 00:58:02,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-07-05 00:58:02,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-07-05 00:58:02,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-05 00:58:02,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-07-05 00:58:02,766 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 19 [2021-07-05 00:58:02,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-05 00:58:02,766 INFO L442 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-07-05 00:58:02,766 INFO L443 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 2.375) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-05 00:58:02,766 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-07-05 00:58:02,766 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-07-05 00:58:02,767 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2021-07-05 00:58:02,767 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 00:58:02,768 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 00:58:02,770 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 00:58:02,771 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 00:58:02,772 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 00:58:02,873 INFO L762 garLoopResultBuilder]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION(line 6) no Hoare annotation was computed. [2021-07-05 00:58:02,873 INFO L758 garLoopResultBuilder]: At program point L556(lines 545 557) the Hoare annotation is: (= ULTIMATE.start___getMemory_~size 8) [2021-07-05 00:58:02,873 INFO L762 garLoopResultBuilder]: For program point ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION(line 6) no Hoare annotation was computed. [2021-07-05 00:58:02,873 INFO L762 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2021-07-05 00:58:02,874 INFO L762 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2021-07-05 00:58:02,874 INFO L762 garLoopResultBuilder]: For program point L540(lines 540 543) no Hoare annotation was computed. [2021-07-05 00:58:02,874 INFO L762 garLoopResultBuilder]: For program point L524(lines 524 525) no Hoare annotation was computed. [2021-07-05 00:58:02,874 INFO L762 garLoopResultBuilder]: For program point L524-1(lines 524 525) no Hoare annotation was computed. [2021-07-05 00:58:02,874 INFO L762 garLoopResultBuilder]: For program point L549(lines 549 555) no Hoare annotation was computed. [2021-07-05 00:58:02,874 INFO L762 garLoopResultBuilder]: For program point L4(lines 1 557) no Hoare annotation was computed. [2021-07-05 00:58:02,874 INFO L762 garLoopResultBuilder]: For program point L549-1(lines 549 555) no Hoare annotation was computed. [2021-07-05 00:58:02,874 INFO L762 garLoopResultBuilder]: For program point L4-1(lines 1 557) no Hoare annotation was computed. [2021-07-05 00:58:02,874 INFO L762 garLoopResultBuilder]: For program point L4-2(lines 1 557) no Hoare annotation was computed. [2021-07-05 00:58:02,875 INFO L762 garLoopResultBuilder]: For program point L4-3(lines 1 557) no Hoare annotation was computed. [2021-07-05 00:58:02,875 INFO L762 garLoopResultBuilder]: For program point L4-4(lines 1 557) no Hoare annotation was computed. [2021-07-05 00:58:02,875 INFO L762 garLoopResultBuilder]: For program point L4-5(lines 1 557) no Hoare annotation was computed. [2021-07-05 00:58:02,875 INFO L762 garLoopResultBuilder]: For program point L541(lines 541 542) no Hoare annotation was computed. [2021-07-05 00:58:02,875 INFO L762 garLoopResultBuilder]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION(line 6) no Hoare annotation was computed. [2021-07-05 00:58:02,875 INFO L758 garLoopResultBuilder]: At program point L526(lines 520 527) the Hoare annotation is: (let ((.cse0 (= ~elem~0.offset 0)) (.cse1 (and (= |ULTIMATE.start___getMemory_#res.offset| 0) (= |ULTIMATE.start___getMemory_#res.base| 0)))) (and (= ULTIMATE.start___getMemory_~size 8) (or (and (<= |ULTIMATE.start___getMemory_#res.offset| ~guard_malloc_counter~0.offset) (<= 1 |ULTIMATE.start___getMemory_#res.offset|) .cse0) .cse1) (or (and (<= 1 ~guard_malloc_counter~0.offset) .cse0) .cse1))) [2021-07-05 00:58:02,875 INFO L758 garLoopResultBuilder]: At program point L526-1(lines 520 527) the Hoare annotation is: (let ((.cse1 (= ~elem~0.offset 0)) (.cse0 (and (= ULTIMATE.start_main_~dev1~0.base 0) (= ULTIMATE.start_main_~dev1~0.offset 0))) (.cse2 (and (= |ULTIMATE.start___getMemory_#res.offset| 0) (= |ULTIMATE.start___getMemory_#res.base| 0)))) (and (= ULTIMATE.start___getMemory_~size 8) (or .cse0 (and (<= 1 ULTIMATE.start_main_~dev1~0.offset) (<= |ULTIMATE.start___getMemory_#res.offset| ~guard_malloc_counter~0.offset) (<= (+ ULTIMATE.start_main_~dev1~0.offset 1) |ULTIMATE.start___getMemory_#res.offset|) .cse1) .cse2) (or (and (<= 2 |ULTIMATE.start___getMemory_#res.offset|) (<= 2 ~guard_malloc_counter~0.offset) .cse1) .cse0 .cse2))) [2021-07-05 00:58:02,876 INFO L762 garLoopResultBuilder]: For program point L6(line 6) no Hoare annotation was computed. [2021-07-05 00:58:02,876 INFO L762 garLoopResultBuilder]: For program point L6-1(line 6) no Hoare annotation was computed. [2021-07-05 00:58:02,876 INFO L762 garLoopResultBuilder]: For program point L6-2(line 6) no Hoare annotation was computed. [2021-07-05 00:58:02,876 INFO L762 garLoopResultBuilder]: For program point L6-3(line 6) no Hoare annotation was computed. [2021-07-05 00:58:02,876 INFO L762 garLoopResultBuilder]: For program point L6-4(line 6) no Hoare annotation was computed. [2021-07-05 00:58:02,876 INFO L762 garLoopResultBuilder]: For program point L6-5(line 6) no Hoare annotation was computed. [2021-07-05 00:58:02,876 INFO L762 garLoopResultBuilder]: For program point ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION(line 6) no Hoare annotation was computed. [2021-07-05 00:58:02,876 INFO L762 garLoopResultBuilder]: For program point L535(lines 535 539) no Hoare annotation was computed. [2021-07-05 00:58:02,876 INFO L762 garLoopResultBuilder]: For program point L535-1(lines 535 539) no Hoare annotation was computed. [2021-07-05 00:58:02,877 INFO L762 garLoopResultBuilder]: For program point L535-2(lines 535 539) no Hoare annotation was computed. [2021-07-05 00:58:02,877 INFO L762 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2021-07-05 00:58:02,877 INFO L762 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 6) no Hoare annotation was computed. [2021-07-05 00:58:02,877 INFO L762 garLoopResultBuilder]: For program point L536(line 536) no Hoare annotation was computed. [2021-07-05 00:58:02,877 INFO L762 garLoopResultBuilder]: For program point L536-2(line 536) no Hoare annotation was computed. [2021-07-05 00:58:02,877 INFO L762 garLoopResultBuilder]: For program point L536-4(line 536) no Hoare annotation was computed. [2021-07-05 00:58:02,877 INFO L762 garLoopResultBuilder]: For program point L536-6(line 536) no Hoare annotation was computed. [2021-07-05 00:58:02,877 INFO L762 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2021-07-05 00:58:02,877 INFO L762 garLoopResultBuilder]: For program point L537(lines 537 538) no Hoare annotation was computed. [2021-07-05 00:58:02,877 INFO L762 garLoopResultBuilder]: For program point L537-2(lines 537 538) no Hoare annotation was computed. [2021-07-05 00:58:02,878 INFO L762 garLoopResultBuilder]: For program point L537-4(lines 537 538) no Hoare annotation was computed. [2021-07-05 00:58:02,878 INFO L762 garLoopResultBuilder]: For program point L537-6(lines 537 538) no Hoare annotation was computed. [2021-07-05 00:58:02,878 INFO L758 garLoopResultBuilder]: At program point L529(lines 528 530) the Hoare annotation is: (let ((.cse1 (= ~elem~0.offset 0)) (.cse0 (and (= 0 |ULTIMATE.start_my_malloc_#res.offset|) (= |ULTIMATE.start___getMemory_#res.offset| 0) (= |ULTIMATE.start_my_malloc_#res.base| 0) (= |ULTIMATE.start___getMemory_#res.base| 0)))) (and (= ULTIMATE.start___getMemory_~size 8) (or .cse0 (and (<= 1 |ULTIMATE.start_my_malloc_#res.offset|) (<= |ULTIMATE.start___getMemory_#res.offset| ~guard_malloc_counter~0.offset) (<= 1 |ULTIMATE.start___getMemory_#res.offset|) .cse1 (<= |ULTIMATE.start_my_malloc_#res.offset| ~guard_malloc_counter~0.offset))) (or (and (<= 1 ~guard_malloc_counter~0.offset) .cse1) .cse0))) [2021-07-05 00:58:02,878 INFO L758 garLoopResultBuilder]: At program point L529-1(lines 528 530) the Hoare annotation is: (let ((.cse0 (and (= ULTIMATE.start_main_~dev1~0.base 0) (= ULTIMATE.start_main_~dev1~0.offset 0))) (.cse1 (and (= 0 |ULTIMATE.start_my_malloc_#res.offset|) (= |ULTIMATE.start___getMemory_#res.offset| 0) (= |ULTIMATE.start_my_malloc_#res.base| 0) (= |ULTIMATE.start___getMemory_#res.base| 0))) (.cse2 (= ~elem~0.offset 0))) (and (= ULTIMATE.start___getMemory_~size 8) (or .cse0 .cse1 (and (<= 2 |ULTIMATE.start_my_malloc_#res.offset|) (<= 2 |ULTIMATE.start___getMemory_#res.offset|) (<= 2 ~guard_malloc_counter~0.offset) .cse2)) (or .cse0 .cse1 (let ((.cse3 (+ ULTIMATE.start_main_~dev1~0.offset 1))) (and (<= 1 ULTIMATE.start_main_~dev1~0.offset) (<= |ULTIMATE.start___getMemory_#res.offset| ~guard_malloc_counter~0.offset) (<= .cse3 |ULTIMATE.start___getMemory_#res.offset|) (<= .cse3 |ULTIMATE.start_my_malloc_#res.offset|) .cse2 (<= |ULTIMATE.start_my_malloc_#res.offset| ~guard_malloc_counter~0.offset)))))) [2021-07-05 00:58:02,878 INFO L762 garLoopResultBuilder]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION(line 6) no Hoare annotation was computed. [2021-07-05 00:58:02,883 INFO L762 garLoopResultBuilder]: For program point L522(line 522) no Hoare annotation was computed. [2021-07-05 00:58:02,883 INFO L762 garLoopResultBuilder]: For program point L522-2(line 522) no Hoare annotation was computed. [2021-07-05 00:58:02,884 WARN L471 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2021-07-05 00:58:02,884 WARN L182 nStatisticsGenerator]: total relevant statements: 0 [2021-07-05 00:58:02,884 INFO L303 ceAbstractionStarter]: Result for error location ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION was SAFE (4/6) [2021-07-05 00:58:02,885 INFO L328 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION ======== [2021-07-05 00:58:02,885 INFO L329 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mLimitAnalysisTime=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-07-05 00:58:02,885 INFO L330 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-07-05 00:58:02,886 INFO L276 IsEmpty]: Start isEmpty. Operand has 46 states, 39 states have (on average 1.5128205128205128) internal successors, (59), 45 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-05 00:58:02,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-07-05 00:58:02,887 INFO L517 BasicCegarLoop]: Found error trace [2021-07-05 00:58:02,887 INFO L525 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-05 00:58:02,887 INFO L374 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION] === [2021-07-05 00:58:02,887 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-05 00:58:02,887 INFO L82 PathProgramCache]: Analyzing trace with hash -1903530188, now seen corresponding path program 1 times [2021-07-05 00:58:02,888 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-05 00:58:02,888 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1516874789] [2021-07-05 00:58:02,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-05 00:58:02,888 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-05 00:58:02,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-05 00:58:02,901 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 00:58:02,901 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 00:58:02,902 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 00:58:02,902 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-07-05 00:58:02,907 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 00:58:02,907 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-07-05 00:58:02,912 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 00:58:02,912 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-07-05 00:58:02,918 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 00:58:02,918 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 00:58:02,919 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-05 00:58:02,919 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-05 00:58:02,919 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1516874789] [2021-07-05 00:58:02,919 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1516874789] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-05 00:58:02,919 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-05 00:58:02,919 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-07-05 00:58:02,919 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [533317744] [2021-07-05 00:58:02,920 INFO L425 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-07-05 00:58:02,920 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-05 00:58:02,920 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-07-05 00:58:02,920 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-07-05 00:58:02,921 INFO L87 Difference]: Start difference. First operand has 46 states, 39 states have (on average 1.5128205128205128) internal successors, (59), 45 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-05 00:58:02,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-05 00:58:02,966 INFO L93 Difference]: Finished difference Result 140 states and 176 transitions. [2021-07-05 00:58:02,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-07-05 00:58:02,966 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2021-07-05 00:58:02,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-05 00:58:02,967 INFO L225 Difference]: With dead ends: 140 [2021-07-05 00:58:02,967 INFO L226 Difference]: Without dead ends: 42 [2021-07-05 00:58:02,968 INFO L795 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 34.2ms TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-07-05 00:58:02,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2021-07-05 00:58:02,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 26. [2021-07-05 00:58:02,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 25 states have (on average 1.16) internal successors, (29), 25 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-05 00:58:02,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 29 transitions. [2021-07-05 00:58:02,970 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 29 transitions. Word has length 25 [2021-07-05 00:58:02,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-05 00:58:02,970 INFO L442 AbstractCegarLoop]: Abstraction has 26 states and 29 transitions. [2021-07-05 00:58:02,970 INFO L443 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-05 00:58:02,970 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 29 transitions. [2021-07-05 00:58:02,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-07-05 00:58:02,971 INFO L517 BasicCegarLoop]: Found error trace [2021-07-05 00:58:02,971 INFO L525 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-05 00:58:02,971 WARN L471 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2021-07-05 00:58:02,971 INFO L374 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION] === [2021-07-05 00:58:02,971 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-05 00:58:02,971 INFO L82 PathProgramCache]: Analyzing trace with hash -1480828362, now seen corresponding path program 1 times [2021-07-05 00:58:02,972 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-05 00:58:02,972 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1655277249] [2021-07-05 00:58:02,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-05 00:58:02,972 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-05 00:58:02,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-05 00:58:02,983 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 00:58:02,983 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 00:58:02,984 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 00:58:02,984 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-07-05 00:58:02,988 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 00:58:02,988 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-07-05 00:58:02,999 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 00:58:02,999 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-07-05 00:58:03,004 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 00:58:03,005 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 00:58:03,005 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-05 00:58:03,006 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-05 00:58:03,006 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1655277249] [2021-07-05 00:58:03,006 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1655277249] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-05 00:58:03,006 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-05 00:58:03,006 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-07-05 00:58:03,006 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [675797882] [2021-07-05 00:58:03,007 INFO L425 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-07-05 00:58:03,007 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-05 00:58:03,007 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-07-05 00:58:03,007 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-07-05 00:58:03,007 INFO L87 Difference]: Start difference. First operand 26 states and 29 transitions. Second operand has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-05 00:58:03,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-05 00:58:03,034 INFO L93 Difference]: Finished difference Result 42 states and 47 transitions. [2021-07-05 00:58:03,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-07-05 00:58:03,034 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2021-07-05 00:58:03,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-05 00:58:03,034 INFO L225 Difference]: With dead ends: 42 [2021-07-05 00:58:03,034 INFO L226 Difference]: Without dead ends: 26 [2021-07-05 00:58:03,035 INFO L795 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 31.5ms TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-07-05 00:58:03,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2021-07-05 00:58:03,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2021-07-05 00:58:03,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 25 states have (on average 1.12) internal successors, (28), 25 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-05 00:58:03,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 28 transitions. [2021-07-05 00:58:03,037 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 28 transitions. Word has length 25 [2021-07-05 00:58:03,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-05 00:58:03,037 INFO L442 AbstractCegarLoop]: Abstraction has 26 states and 28 transitions. [2021-07-05 00:58:03,037 INFO L443 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-05 00:58:03,037 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 28 transitions. [2021-07-05 00:58:03,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-07-05 00:58:03,038 INFO L517 BasicCegarLoop]: Found error trace [2021-07-05 00:58:03,038 INFO L525 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-05 00:58:03,038 WARN L471 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2021-07-05 00:58:03,038 INFO L374 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION] === [2021-07-05 00:58:03,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-05 00:58:03,038 INFO L82 PathProgramCache]: Analyzing trace with hash 1793070580, now seen corresponding path program 1 times [2021-07-05 00:58:03,039 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-05 00:58:03,039 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [484426884] [2021-07-05 00:58:03,039 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-05 00:58:03,039 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-05 00:58:03,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-05 00:58:03,053 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 00:58:03,054 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-07-05 00:58:03,056 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 00:58:03,056 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-07-05 00:58:03,056 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 00:58:03,057 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-07-05 00:58:03,057 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 00:58:03,057 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-07-05 00:58:03,060 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 00:58:03,060 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-07-05 00:58:03,064 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 00:58:03,064 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-07-05 00:58:03,069 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 00:58:03,070 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-07-05 00:58:03,074 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 00:58:03,075 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-07-05 00:58:03,081 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 00:58:03,082 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-07-05 00:58:03,087 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 00:58:03,087 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 00:58:03,087 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-05 00:58:03,087 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-05 00:58:03,088 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [484426884] [2021-07-05 00:58:03,088 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [484426884] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-05 00:58:03,088 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-05 00:58:03,088 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-07-05 00:58:03,088 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1977576919] [2021-07-05 00:58:03,088 INFO L425 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-07-05 00:58:03,088 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-05 00:58:03,089 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-07-05 00:58:03,089 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2021-07-05 00:58:03,089 INFO L87 Difference]: Start difference. First operand 26 states and 28 transitions. Second operand has 9 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 8 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-05 00:58:03,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-05 00:58:03,168 INFO L93 Difference]: Finished difference Result 30 states and 31 transitions. [2021-07-05 00:58:03,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-07-05 00:58:03,168 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 8 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2021-07-05 00:58:03,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-05 00:58:03,169 INFO L225 Difference]: With dead ends: 30 [2021-07-05 00:58:03,169 INFO L226 Difference]: Without dead ends: 26 [2021-07-05 00:58:03,169 INFO L795 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 68.7ms TimeCoverageRelationStatistics Valid=72, Invalid=138, Unknown=0, NotChecked=0, Total=210 [2021-07-05 00:58:03,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2021-07-05 00:58:03,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2021-07-05 00:58:03,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 25 states have (on average 1.08) internal successors, (27), 25 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-05 00:58:03,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 27 transitions. [2021-07-05 00:58:03,171 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 27 transitions. Word has length 25 [2021-07-05 00:58:03,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-05 00:58:03,171 INFO L442 AbstractCegarLoop]: Abstraction has 26 states and 27 transitions. [2021-07-05 00:58:03,171 INFO L443 AbstractCegarLoop]: Interpolant automaton has has 9 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 8 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-05 00:58:03,171 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 27 transitions. [2021-07-05 00:58:03,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-07-05 00:58:03,172 INFO L517 BasicCegarLoop]: Found error trace [2021-07-05 00:58:03,172 INFO L525 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-05 00:58:03,172 WARN L471 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2021-07-05 00:58:03,172 INFO L374 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION] === [2021-07-05 00:58:03,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-05 00:58:03,173 INFO L82 PathProgramCache]: Analyzing trace with hash 1793130162, now seen corresponding path program 1 times [2021-07-05 00:58:03,173 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-05 00:58:03,173 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [846609079] [2021-07-05 00:58:03,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-05 00:58:03,173 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-05 00:58:03,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-05 00:58:03,188 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 00:58:03,189 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 00:58:03,189 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 00:58:03,189 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-07-05 00:58:03,191 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 00:58:03,191 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-07-05 00:58:03,194 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 00:58:03,194 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-07-05 00:58:03,198 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 00:58:03,198 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-07-05 00:58:03,202 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 00:58:03,203 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-07-05 00:58:03,207 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 00:58:03,207 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-07-05 00:58:03,213 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 00:58:03,213 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-07-05 00:58:03,220 INFO L142 QuantifierPusher]: treesize reduction 23, result has 14.8 percent of original size [2021-07-05 00:58:03,220 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-07-05 00:58:03,227 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 00:58:03,227 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-07-05 00:58:03,234 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 00:58:03,234 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-07-05 00:58:03,242 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 00:58:03,243 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 00:58:03,243 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-05 00:58:03,243 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-05 00:58:03,243 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [846609079] [2021-07-05 00:58:03,243 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [846609079] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-05 00:58:03,243 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-05 00:58:03,244 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-07-05 00:58:03,244 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [881709761] [2021-07-05 00:58:03,244 INFO L425 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-07-05 00:58:03,244 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-05 00:58:03,244 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-07-05 00:58:03,245 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2021-07-05 00:58:03,245 INFO L87 Difference]: Start difference. First operand 26 states and 27 transitions. Second operand has 12 states, 12 states have (on average 2.0833333333333335) internal successors, (25), 12 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-05 00:58:03,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-05 00:58:03,409 INFO L93 Difference]: Finished difference Result 32 states and 32 transitions. [2021-07-05 00:58:03,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-07-05 00:58:03,410 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.0833333333333335) internal successors, (25), 12 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2021-07-05 00:58:03,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-05 00:58:03,411 INFO L225 Difference]: With dead ends: 32 [2021-07-05 00:58:03,411 INFO L226 Difference]: Without dead ends: 26 [2021-07-05 00:58:03,412 INFO L795 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 160.5ms TimeCoverageRelationStatistics Valid=99, Invalid=243, Unknown=0, NotChecked=0, Total=342 [2021-07-05 00:58:03,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2021-07-05 00:58:03,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2021-07-05 00:58:03,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 25 states have (on average 1.04) internal successors, (26), 25 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-05 00:58:03,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 26 transitions. [2021-07-05 00:58:03,413 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 26 transitions. Word has length 25 [2021-07-05 00:58:03,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-05 00:58:03,414 INFO L442 AbstractCegarLoop]: Abstraction has 26 states and 26 transitions. [2021-07-05 00:58:03,414 INFO L443 AbstractCegarLoop]: Interpolant automaton has has 12 states, 12 states have (on average 2.0833333333333335) internal successors, (25), 12 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-05 00:58:03,414 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2021-07-05 00:58:03,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-07-05 00:58:03,414 INFO L517 BasicCegarLoop]: Found error trace [2021-07-05 00:58:03,414 INFO L525 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-05 00:58:03,415 WARN L471 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2021-07-05 00:58:03,415 INFO L374 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION] === [2021-07-05 00:58:03,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-05 00:58:03,415 INFO L82 PathProgramCache]: Analyzing trace with hash 1850388464, now seen corresponding path program 1 times [2021-07-05 00:58:03,415 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-05 00:58:03,415 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [867848490] [2021-07-05 00:58:03,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-05 00:58:03,416 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-05 00:58:03,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-05 00:58:03,440 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 00:58:03,441 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-07-05 00:58:03,445 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 00:58:03,445 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-07-05 00:58:03,449 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 00:58:03,450 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-07-05 00:58:03,455 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 00:58:03,455 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-07-05 00:58:03,461 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 00:58:03,461 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-07-05 00:58:03,469 INFO L142 QuantifierPusher]: treesize reduction 29, result has 27.5 percent of original size [2021-07-05 00:58:03,470 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 11 [2021-07-05 00:58:03,479 INFO L142 QuantifierPusher]: treesize reduction 23, result has 46.5 percent of original size [2021-07-05 00:58:03,480 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 20 [2021-07-05 00:58:03,495 INFO L142 QuantifierPusher]: treesize reduction 23, result has 46.5 percent of original size [2021-07-05 00:58:03,496 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 20 [2021-07-05 00:58:03,513 INFO L142 QuantifierPusher]: treesize reduction 31, result has 54.4 percent of original size [2021-07-05 00:58:03,514 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 37 [2021-07-05 00:58:03,542 INFO L142 QuantifierPusher]: treesize reduction 17, result has 55.3 percent of original size [2021-07-05 00:58:03,543 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-07-05 00:58:03,567 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 00:58:03,567 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-07-05 00:58:03,575 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 00:58:03,575 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 00:58:03,575 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-05 00:58:03,576 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-05 00:58:03,576 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [867848490] [2021-07-05 00:58:03,576 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [867848490] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-05 00:58:03,576 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-05 00:58:03,576 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-07-05 00:58:03,576 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [939162059] [2021-07-05 00:58:03,577 INFO L425 AbstractCegarLoop]: Interpolant automaton has 13 states [2021-07-05 00:58:03,577 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-05 00:58:03,577 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-07-05 00:58:03,577 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2021-07-05 00:58:03,577 INFO L87 Difference]: Start difference. First operand 26 states and 26 transitions. Second operand has 13 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 12 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-05 00:58:03,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-05 00:58:03,758 INFO L93 Difference]: Finished difference Result 36 states and 35 transitions. [2021-07-05 00:58:03,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-07-05 00:58:03,758 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 12 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2021-07-05 00:58:03,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-05 00:58:03,759 INFO L225 Difference]: With dead ends: 36 [2021-07-05 00:58:03,759 INFO L226 Difference]: Without dead ends: 26 [2021-07-05 00:58:03,759 INFO L795 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 246.0ms TimeCoverageRelationStatistics Valid=123, Invalid=339, Unknown=0, NotChecked=0, Total=462 [2021-07-05 00:58:03,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2021-07-05 00:58:03,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2021-07-05 00:58:03,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 25 states have (on average 1.0) internal successors, (25), 25 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-05 00:58:03,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 25 transitions. [2021-07-05 00:58:03,761 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 25 transitions. Word has length 25 [2021-07-05 00:58:03,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-05 00:58:03,761 INFO L442 AbstractCegarLoop]: Abstraction has 26 states and 25 transitions. [2021-07-05 00:58:03,761 INFO L443 AbstractCegarLoop]: Interpolant automaton has has 13 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 12 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-05 00:58:03,761 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 25 transitions. [2021-07-05 00:58:03,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-07-05 00:58:03,762 INFO L517 BasicCegarLoop]: Found error trace [2021-07-05 00:58:03,762 INFO L525 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-05 00:58:03,762 WARN L471 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2021-07-05 00:58:03,762 INFO L374 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION] === [2021-07-05 00:58:03,762 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-05 00:58:03,762 INFO L82 PathProgramCache]: Analyzing trace with hash 1457361454, now seen corresponding path program 1 times [2021-07-05 00:58:03,763 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-05 00:58:03,763 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [753152178] [2021-07-05 00:58:03,763 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-05 00:58:03,763 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-05 00:58:03,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-05 00:58:03,779 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 00:58:03,779 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-07-05 00:58:03,788 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 00:58:03,789 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-07-05 00:58:03,789 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 00:58:03,789 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-07-05 00:58:03,790 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 00:58:03,790 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-07-05 00:58:03,794 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 00:58:03,795 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-07-05 00:58:03,800 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 00:58:03,801 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-07-05 00:58:03,810 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 00:58:03,811 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-07-05 00:58:03,817 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 00:58:03,818 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-07-05 00:58:03,823 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 00:58:03,823 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 00:58:03,823 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-05 00:58:03,824 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-05 00:58:03,824 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [753152178] [2021-07-05 00:58:03,824 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [753152178] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-05 00:58:03,824 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-05 00:58:03,824 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-07-05 00:58:03,824 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1385695863] [2021-07-05 00:58:03,825 INFO L425 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-07-05 00:58:03,825 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-05 00:58:03,825 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-07-05 00:58:03,825 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2021-07-05 00:58:03,825 INFO L87 Difference]: Start difference. First operand 26 states and 25 transitions. Second operand has 8 states, 8 states have (on average 3.125) internal successors, (25), 7 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-05 00:58:03,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-05 00:58:03,902 INFO L93 Difference]: Finished difference Result 26 states and 25 transitions. [2021-07-05 00:58:03,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-07-05 00:58:03,902 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.125) internal successors, (25), 7 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2021-07-05 00:58:03,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-05 00:58:03,903 INFO L225 Difference]: With dead ends: 26 [2021-07-05 00:58:03,903 INFO L226 Difference]: Without dead ends: 0 [2021-07-05 00:58:03,903 INFO L795 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 85.4ms TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2021-07-05 00:58:03,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-07-05 00:58:03,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-07-05 00:58:03,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-05 00:58:03,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-07-05 00:58:03,904 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 25 [2021-07-05 00:58:03,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-05 00:58:03,904 INFO L442 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-07-05 00:58:03,904 INFO L443 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 3.125) internal successors, (25), 7 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-05 00:58:03,904 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-07-05 00:58:03,904 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-07-05 00:58:03,904 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2021-07-05 00:58:03,905 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 00:58:03,906 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 00:58:03,907 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 00:58:03,908 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 00:58:03,909 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 00:58:04,025 INFO L762 garLoopResultBuilder]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION(line 6) no Hoare annotation was computed. [2021-07-05 00:58:04,025 INFO L758 garLoopResultBuilder]: At program point L556(lines 545 557) the Hoare annotation is: (= ULTIMATE.start___getMemory_~size 8) [2021-07-05 00:58:04,025 INFO L762 garLoopResultBuilder]: For program point ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION(line 6) no Hoare annotation was computed. [2021-07-05 00:58:04,025 INFO L762 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2021-07-05 00:58:04,025 INFO L762 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2021-07-05 00:58:04,025 INFO L762 garLoopResultBuilder]: For program point L540(lines 540 543) no Hoare annotation was computed. [2021-07-05 00:58:04,025 INFO L762 garLoopResultBuilder]: For program point L524(lines 524 525) no Hoare annotation was computed. [2021-07-05 00:58:04,026 INFO L762 garLoopResultBuilder]: For program point L524-1(lines 524 525) no Hoare annotation was computed. [2021-07-05 00:58:04,026 INFO L762 garLoopResultBuilder]: For program point L549(lines 549 555) no Hoare annotation was computed. [2021-07-05 00:58:04,026 INFO L762 garLoopResultBuilder]: For program point L4(lines 1 557) no Hoare annotation was computed. [2021-07-05 00:58:04,026 INFO L762 garLoopResultBuilder]: For program point L549-1(lines 549 555) no Hoare annotation was computed. [2021-07-05 00:58:04,026 INFO L762 garLoopResultBuilder]: For program point L4-1(lines 1 557) no Hoare annotation was computed. [2021-07-05 00:58:04,026 INFO L762 garLoopResultBuilder]: For program point L4-2(lines 1 557) no Hoare annotation was computed. [2021-07-05 00:58:04,026 INFO L762 garLoopResultBuilder]: For program point L4-3(lines 1 557) no Hoare annotation was computed. [2021-07-05 00:58:04,026 INFO L762 garLoopResultBuilder]: For program point L4-4(lines 1 557) no Hoare annotation was computed. [2021-07-05 00:58:04,026 INFO L762 garLoopResultBuilder]: For program point L4-5(lines 1 557) no Hoare annotation was computed. [2021-07-05 00:58:04,027 INFO L762 garLoopResultBuilder]: For program point L541(lines 541 542) no Hoare annotation was computed. [2021-07-05 00:58:04,027 INFO L762 garLoopResultBuilder]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION(line 6) no Hoare annotation was computed. [2021-07-05 00:58:04,027 INFO L758 garLoopResultBuilder]: At program point L526(lines 520 527) the Hoare annotation is: (let ((.cse4 (= |ULTIMATE.start___getMemory_#res.base| 0))) (let ((.cse3 (<= 1 ~guard_malloc_counter~0.offset)) (.cse0 (<= |ULTIMATE.start___getMemory_#res.offset| ~guard_malloc_counter~0.offset)) (.cse1 (= ~elem~0.offset 0)) (.cse2 (and (= |ULTIMATE.start___getMemory_#res.offset| 0) .cse4))) (and (= ULTIMATE.start___getMemory_~size 8) (or (and .cse0 (<= 1 |ULTIMATE.start___getMemory_#res.offset|) .cse1) .cse2) (or (and .cse3 .cse1) .cse2) (or (and (<= ~guard_malloc_counter~0.offset 1) .cse3 .cse0 .cse4 (= ~guard_malloc_counter~0.base 0) .cse1) .cse2)))) [2021-07-05 00:58:04,027 INFO L758 garLoopResultBuilder]: At program point L526-1(lines 520 527) the Hoare annotation is: (let ((.cse3 (= |ULTIMATE.start___getMemory_#res.base| 0))) (let ((.cse2 (<= |ULTIMATE.start___getMemory_#res.offset| ~guard_malloc_counter~0.offset)) (.cse4 (<= (+ ULTIMATE.start_main_~dev1~0.offset 1) |ULTIMATE.start___getMemory_#res.offset|)) (.cse1 (<= 2 |ULTIMATE.start___getMemory_#res.offset|)) (.cse5 (= ~elem~0.offset 0)) (.cse0 (and (= ULTIMATE.start_main_~dev1~0.base 0) (= ULTIMATE.start_main_~dev1~0.offset 0))) (.cse6 (and (= |ULTIMATE.start___getMemory_#res.offset| 0) .cse3))) (and (= ULTIMATE.start___getMemory_~size 8) (or .cse0 (and .cse1 (<= ~guard_malloc_counter~0.offset 2) .cse2 .cse3 (= ~guard_malloc_counter~0.base 0) .cse4 .cse5) .cse6) (or .cse0 (and (<= 1 ULTIMATE.start_main_~dev1~0.offset) .cse2 .cse4 .cse5) .cse6) (or (and .cse1 (<= 2 ~guard_malloc_counter~0.offset) .cse5) .cse0 .cse6)))) [2021-07-05 00:58:04,027 INFO L762 garLoopResultBuilder]: For program point L6(line 6) no Hoare annotation was computed. [2021-07-05 00:58:04,027 INFO L762 garLoopResultBuilder]: For program point L6-1(line 6) no Hoare annotation was computed. [2021-07-05 00:58:04,027 INFO L762 garLoopResultBuilder]: For program point L6-2(line 6) no Hoare annotation was computed. [2021-07-05 00:58:04,027 INFO L762 garLoopResultBuilder]: For program point L6-3(line 6) no Hoare annotation was computed. [2021-07-05 00:58:04,028 INFO L762 garLoopResultBuilder]: For program point L6-4(line 6) no Hoare annotation was computed. [2021-07-05 00:58:04,028 INFO L762 garLoopResultBuilder]: For program point L6-5(line 6) no Hoare annotation was computed. [2021-07-05 00:58:04,028 INFO L762 garLoopResultBuilder]: For program point ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION(line 6) no Hoare annotation was computed. [2021-07-05 00:58:04,028 INFO L762 garLoopResultBuilder]: For program point L535(lines 535 539) no Hoare annotation was computed. [2021-07-05 00:58:04,028 INFO L762 garLoopResultBuilder]: For program point L535-1(lines 535 539) no Hoare annotation was computed. [2021-07-05 00:58:04,028 INFO L762 garLoopResultBuilder]: For program point L535-2(lines 535 539) no Hoare annotation was computed. [2021-07-05 00:58:04,028 INFO L762 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2021-07-05 00:58:04,028 INFO L762 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 6) no Hoare annotation was computed. [2021-07-05 00:58:04,028 INFO L762 garLoopResultBuilder]: For program point L536(line 536) no Hoare annotation was computed. [2021-07-05 00:58:04,028 INFO L762 garLoopResultBuilder]: For program point L536-2(line 536) no Hoare annotation was computed. [2021-07-05 00:58:04,029 INFO L762 garLoopResultBuilder]: For program point L536-4(line 536) no Hoare annotation was computed. [2021-07-05 00:58:04,029 INFO L762 garLoopResultBuilder]: For program point L536-6(line 536) no Hoare annotation was computed. [2021-07-05 00:58:04,029 INFO L762 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2021-07-05 00:58:04,029 INFO L762 garLoopResultBuilder]: For program point L537(lines 537 538) no Hoare annotation was computed. [2021-07-05 00:58:04,029 INFO L762 garLoopResultBuilder]: For program point L537-2(lines 537 538) no Hoare annotation was computed. [2021-07-05 00:58:04,029 INFO L762 garLoopResultBuilder]: For program point L537-4(lines 537 538) no Hoare annotation was computed. [2021-07-05 00:58:04,029 INFO L762 garLoopResultBuilder]: For program point L537-6(lines 537 538) no Hoare annotation was computed. [2021-07-05 00:58:04,029 INFO L758 garLoopResultBuilder]: At program point L529(lines 528 530) the Hoare annotation is: (let ((.cse5 (= |ULTIMATE.start_my_malloc_#res.base| 0)) (.cse6 (= |ULTIMATE.start___getMemory_#res.base| 0))) (let ((.cse4 (<= 1 ~guard_malloc_counter~0.offset)) (.cse1 (<= |ULTIMATE.start___getMemory_#res.offset| ~guard_malloc_counter~0.offset)) (.cse2 (= ~elem~0.offset 0)) (.cse3 (<= |ULTIMATE.start_my_malloc_#res.offset| ~guard_malloc_counter~0.offset)) (.cse0 (and (= 0 |ULTIMATE.start_my_malloc_#res.offset|) (= |ULTIMATE.start___getMemory_#res.offset| 0) .cse5 .cse6))) (and (= ULTIMATE.start___getMemory_~size 8) (or .cse0 (and (<= 1 |ULTIMATE.start_my_malloc_#res.offset|) .cse1 (<= 1 |ULTIMATE.start___getMemory_#res.offset|) .cse2 .cse3)) (or (and .cse4 .cse2) .cse0) (or (and (<= ~guard_malloc_counter~0.offset 1) .cse4 .cse5 .cse1 .cse6 (= ~guard_malloc_counter~0.base 0) .cse2 .cse3) .cse0)))) [2021-07-05 00:58:04,029 INFO L758 garLoopResultBuilder]: At program point L529-1(lines 528 530) the Hoare annotation is: (let ((.cse10 (+ ULTIMATE.start_main_~dev1~0.offset 1)) (.cse4 (= |ULTIMATE.start_my_malloc_#res.base| 0)) (.cse6 (= |ULTIMATE.start___getMemory_#res.base| 0))) (let ((.cse2 (<= 2 |ULTIMATE.start_my_malloc_#res.offset|)) (.cse3 (<= 2 |ULTIMATE.start___getMemory_#res.offset|)) (.cse0 (and (= ULTIMATE.start_main_~dev1~0.base 0) (= ULTIMATE.start_main_~dev1~0.offset 0))) (.cse1 (and (= 0 |ULTIMATE.start_my_malloc_#res.offset|) (= |ULTIMATE.start___getMemory_#res.offset| 0) .cse4 .cse6)) (.cse5 (<= |ULTIMATE.start___getMemory_#res.offset| ~guard_malloc_counter~0.offset)) (.cse7 (<= .cse10 |ULTIMATE.start_my_malloc_#res.offset|)) (.cse8 (= ~elem~0.offset 0)) (.cse9 (<= |ULTIMATE.start_my_malloc_#res.offset| ~guard_malloc_counter~0.offset))) (and (= ULTIMATE.start___getMemory_~size 8) (or .cse0 .cse1 (and .cse2 .cse3 .cse4 (<= ~guard_malloc_counter~0.offset 2) .cse5 .cse6 (= ~guard_malloc_counter~0.base 0) .cse7 .cse8 .cse9)) (or .cse0 .cse1 (and .cse2 .cse3 (<= 2 ~guard_malloc_counter~0.offset) .cse8)) (or .cse0 .cse1 (and (<= 1 ULTIMATE.start_main_~dev1~0.offset) .cse5 (<= .cse10 |ULTIMATE.start___getMemory_#res.offset|) .cse7 .cse8 .cse9))))) [2021-07-05 00:58:04,030 INFO L762 garLoopResultBuilder]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION(line 6) no Hoare annotation was computed. [2021-07-05 00:58:04,030 INFO L762 garLoopResultBuilder]: For program point L522(line 522) no Hoare annotation was computed. [2021-07-05 00:58:04,030 INFO L762 garLoopResultBuilder]: For program point L522-2(line 522) no Hoare annotation was computed. [2021-07-05 00:58:04,030 WARN L471 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2021-07-05 00:58:04,030 WARN L182 nStatisticsGenerator]: total relevant statements: 0 [2021-07-05 00:58:04,030 INFO L303 ceAbstractionStarter]: Result for error location ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION was SAFE (5/6) [2021-07-05 00:58:04,031 INFO L328 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION ======== [2021-07-05 00:58:04,031 INFO L329 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mLimitAnalysisTime=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-07-05 00:58:04,031 INFO L330 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-07-05 00:58:04,032 INFO L276 IsEmpty]: Start isEmpty. Operand has 46 states, 39 states have (on average 1.5128205128205128) internal successors, (59), 45 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-05 00:58:04,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-07-05 00:58:04,032 INFO L517 BasicCegarLoop]: Found error trace [2021-07-05 00:58:04,032 INFO L525 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-05 00:58:04,033 INFO L374 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION] === [2021-07-05 00:58:04,033 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-05 00:58:04,033 INFO L82 PathProgramCache]: Analyzing trace with hash 1435917216, now seen corresponding path program 1 times [2021-07-05 00:58:04,033 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-05 00:58:04,033 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [629368271] [2021-07-05 00:58:04,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-05 00:58:04,033 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-05 00:58:04,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-05 00:58:04,044 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 00:58:04,044 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 00:58:04,044 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 00:58:04,045 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-07-05 00:58:04,069 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 00:58:04,069 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-07-05 00:58:04,073 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 00:58:04,074 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-07-05 00:58:04,078 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 00:58:04,079 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 00:58:04,079 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-05 00:58:04,079 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-05 00:58:04,079 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [629368271] [2021-07-05 00:58:04,079 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [629368271] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-05 00:58:04,079 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-05 00:58:04,079 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-07-05 00:58:04,079 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1013925217] [2021-07-05 00:58:04,080 INFO L425 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-07-05 00:58:04,080 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-05 00:58:04,080 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-07-05 00:58:04,080 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-07-05 00:58:04,080 INFO L87 Difference]: Start difference. First operand has 46 states, 39 states have (on average 1.5128205128205128) internal successors, (59), 45 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-05 00:58:04,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-05 00:58:04,120 INFO L93 Difference]: Finished difference Result 140 states and 176 transitions. [2021-07-05 00:58:04,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-07-05 00:58:04,120 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2021-07-05 00:58:04,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-05 00:58:04,121 INFO L225 Difference]: With dead ends: 140 [2021-07-05 00:58:04,121 INFO L226 Difference]: Without dead ends: 50 [2021-07-05 00:58:04,121 INFO L795 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 35.5ms TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-07-05 00:58:04,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2021-07-05 00:58:04,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 30. [2021-07-05 00:58:04,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 29 states have (on average 1.1724137931034482) internal successors, (34), 29 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-05 00:58:04,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 34 transitions. [2021-07-05 00:58:04,123 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 34 transitions. Word has length 29 [2021-07-05 00:58:04,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-05 00:58:04,123 INFO L442 AbstractCegarLoop]: Abstraction has 30 states and 34 transitions. [2021-07-05 00:58:04,123 INFO L443 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-05 00:58:04,123 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 34 transitions. [2021-07-05 00:58:04,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-07-05 00:58:04,123 INFO L517 BasicCegarLoop]: Found error trace [2021-07-05 00:58:04,123 INFO L525 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-05 00:58:04,123 WARN L471 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2021-07-05 00:58:04,123 INFO L374 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION] === [2021-07-05 00:58:04,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-05 00:58:04,124 INFO L82 PathProgramCache]: Analyzing trace with hash 1576465826, now seen corresponding path program 1 times [2021-07-05 00:58:04,124 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-05 00:58:04,124 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1523947384] [2021-07-05 00:58:04,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-05 00:58:04,124 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-05 00:58:04,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-05 00:58:04,138 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 00:58:04,138 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 00:58:04,139 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 00:58:04,139 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-07-05 00:58:04,143 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 00:58:04,143 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-07-05 00:58:04,148 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 00:58:04,148 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-07-05 00:58:04,154 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 00:58:04,154 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 00:58:04,154 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-05 00:58:04,154 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-05 00:58:04,155 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1523947384] [2021-07-05 00:58:04,155 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1523947384] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-05 00:58:04,155 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-05 00:58:04,155 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-07-05 00:58:04,155 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1787783535] [2021-07-05 00:58:04,155 INFO L425 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-07-05 00:58:04,155 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-05 00:58:04,156 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-07-05 00:58:04,156 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-07-05 00:58:04,156 INFO L87 Difference]: Start difference. First operand 30 states and 34 transitions. Second operand has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-05 00:58:04,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-05 00:58:04,182 INFO L93 Difference]: Finished difference Result 50 states and 57 transitions. [2021-07-05 00:58:04,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-07-05 00:58:04,182 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2021-07-05 00:58:04,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-05 00:58:04,183 INFO L225 Difference]: With dead ends: 50 [2021-07-05 00:58:04,183 INFO L226 Difference]: Without dead ends: 30 [2021-07-05 00:58:04,183 INFO L795 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 25.9ms TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-07-05 00:58:04,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2021-07-05 00:58:04,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2021-07-05 00:58:04,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 29 states have (on average 1.1379310344827587) internal successors, (33), 29 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-05 00:58:04,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 33 transitions. [2021-07-05 00:58:04,185 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 33 transitions. Word has length 29 [2021-07-05 00:58:04,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-05 00:58:04,185 INFO L442 AbstractCegarLoop]: Abstraction has 30 states and 33 transitions. [2021-07-05 00:58:04,185 INFO L443 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-05 00:58:04,185 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 33 transitions. [2021-07-05 00:58:04,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-07-05 00:58:04,185 INFO L517 BasicCegarLoop]: Found error trace [2021-07-05 00:58:04,185 INFO L525 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-05 00:58:04,186 WARN L471 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2021-07-05 00:58:04,186 INFO L374 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION] === [2021-07-05 00:58:04,186 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-05 00:58:04,186 INFO L82 PathProgramCache]: Analyzing trace with hash 758817376, now seen corresponding path program 1 times [2021-07-05 00:58:04,186 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-05 00:58:04,186 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [317277327] [2021-07-05 00:58:04,186 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-05 00:58:04,186 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-05 00:58:04,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-05 00:58:04,199 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 00:58:04,200 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 00:58:04,200 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 00:58:04,200 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-07-05 00:58:04,202 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 00:58:04,203 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-07-05 00:58:04,205 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 00:58:04,205 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-07-05 00:58:04,209 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 00:58:04,209 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-07-05 00:58:04,213 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 00:58:04,213 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-07-05 00:58:04,218 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 00:58:04,218 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-07-05 00:58:04,223 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 00:58:04,223 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-07-05 00:58:04,229 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 00:58:04,229 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-07-05 00:58:04,236 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 00:58:04,236 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-07-05 00:58:04,243 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 00:58:04,243 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-07-05 00:58:04,251 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 00:58:04,251 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 00:58:04,251 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-05 00:58:04,251 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-05 00:58:04,251 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [317277327] [2021-07-05 00:58:04,252 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [317277327] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-05 00:58:04,252 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-05 00:58:04,252 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-07-05 00:58:04,252 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [528540155] [2021-07-05 00:58:04,252 INFO L425 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-07-05 00:58:04,252 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-05 00:58:04,253 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-07-05 00:58:04,253 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2021-07-05 00:58:04,253 INFO L87 Difference]: Start difference. First operand 30 states and 33 transitions. Second operand has 12 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 12 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-05 00:58:04,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-05 00:58:04,457 INFO L93 Difference]: Finished difference Result 48 states and 52 transitions. [2021-07-05 00:58:04,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-07-05 00:58:04,457 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 12 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2021-07-05 00:58:04,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-05 00:58:04,457 INFO L225 Difference]: With dead ends: 48 [2021-07-05 00:58:04,458 INFO L226 Difference]: Without dead ends: 40 [2021-07-05 00:58:04,458 INFO L795 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 181.6ms TimeCoverageRelationStatistics Valid=118, Invalid=262, Unknown=0, NotChecked=0, Total=380 [2021-07-05 00:58:04,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2021-07-05 00:58:04,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 32. [2021-07-05 00:58:04,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 31 states have (on average 1.1290322580645162) internal successors, (35), 31 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-05 00:58:04,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 35 transitions. [2021-07-05 00:58:04,460 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 35 transitions. Word has length 29 [2021-07-05 00:58:04,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-05 00:58:04,460 INFO L442 AbstractCegarLoop]: Abstraction has 32 states and 35 transitions. [2021-07-05 00:58:04,461 INFO L443 AbstractCegarLoop]: Interpolant automaton has has 12 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 12 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-05 00:58:04,461 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 35 transitions. [2021-07-05 00:58:04,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-07-05 00:58:04,461 INFO L517 BasicCegarLoop]: Found error trace [2021-07-05 00:58:04,461 INFO L525 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-05 00:58:04,461 WARN L471 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2021-07-05 00:58:04,461 INFO L374 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION] === [2021-07-05 00:58:04,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-05 00:58:04,462 INFO L82 PathProgramCache]: Analyzing trace with hash -50529250, now seen corresponding path program 1 times [2021-07-05 00:58:04,462 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-05 00:58:04,462 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [771803475] [2021-07-05 00:58:04,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-05 00:58:04,462 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-05 00:58:04,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-05 00:58:04,475 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 00:58:04,476 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 00:58:04,476 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 00:58:04,476 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-07-05 00:58:04,478 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 00:58:04,479 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-07-05 00:58:04,481 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 00:58:04,482 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-07-05 00:58:04,485 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 00:58:04,485 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-07-05 00:58:04,489 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 00:58:04,490 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-07-05 00:58:04,494 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 00:58:04,494 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-07-05 00:58:04,500 INFO L142 QuantifierPusher]: treesize reduction 23, result has 14.8 percent of original size [2021-07-05 00:58:04,500 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-07-05 00:58:04,506 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 00:58:04,506 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-07-05 00:58:04,512 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 00:58:04,512 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-07-05 00:58:04,519 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 00:58:04,520 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-07-05 00:58:04,527 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 00:58:04,528 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 00:58:04,528 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-05 00:58:04,528 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-05 00:58:04,528 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [771803475] [2021-07-05 00:58:04,528 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [771803475] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-05 00:58:04,528 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-05 00:58:04,528 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-07-05 00:58:04,529 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [364978869] [2021-07-05 00:58:04,529 INFO L425 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-07-05 00:58:04,529 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-05 00:58:04,529 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-07-05 00:58:04,530 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2021-07-05 00:58:04,530 INFO L87 Difference]: Start difference. First operand 32 states and 35 transitions. Second operand has 12 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 12 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-05 00:58:04,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-05 00:58:04,712 INFO L93 Difference]: Finished difference Result 46 states and 51 transitions. [2021-07-05 00:58:04,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-07-05 00:58:04,712 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 12 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2021-07-05 00:58:04,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-05 00:58:04,713 INFO L225 Difference]: With dead ends: 46 [2021-07-05 00:58:04,713 INFO L226 Difference]: Without dead ends: 38 [2021-07-05 00:58:04,714 INFO L795 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 155.3ms TimeCoverageRelationStatistics Valid=99, Invalid=243, Unknown=0, NotChecked=0, Total=342 [2021-07-05 00:58:04,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2021-07-05 00:58:04,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2021-07-05 00:58:04,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 37 states have (on average 1.1081081081081081) internal successors, (41), 37 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-05 00:58:04,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 41 transitions. [2021-07-05 00:58:04,716 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 41 transitions. Word has length 29 [2021-07-05 00:58:04,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-05 00:58:04,717 INFO L442 AbstractCegarLoop]: Abstraction has 38 states and 41 transitions. [2021-07-05 00:58:04,717 INFO L443 AbstractCegarLoop]: Interpolant automaton has has 12 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 12 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-05 00:58:04,717 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 41 transitions. [2021-07-05 00:58:04,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-07-05 00:58:04,717 INFO L517 BasicCegarLoop]: Found error trace [2021-07-05 00:58:04,717 INFO L525 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-05 00:58:04,717 WARN L471 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2021-07-05 00:58:04,718 INFO L374 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION] === [2021-07-05 00:58:04,718 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-05 00:58:04,718 INFO L82 PathProgramCache]: Analyzing trace with hash -50469668, now seen corresponding path program 1 times [2021-07-05 00:58:04,718 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-05 00:58:04,718 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [920569809] [2021-07-05 00:58:04,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-05 00:58:04,718 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-05 00:58:04,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-07-05 00:58:04,725 INFO L224 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-07-05 00:58:04,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-07-05 00:58:04,732 INFO L224 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-07-05 00:58:04,748 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-07-05 00:58:04,748 INFO L639 BasicCegarLoop]: Counterexample is feasible [2021-07-05 00:58:04,748 WARN L471 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2021-07-05 00:58:04,749 WARN L182 nStatisticsGenerator]: total relevant statements: 0 [2021-07-05 00:58:04,749 INFO L303 ceAbstractionStarter]: Result for error location ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION was UNSAFE (6/6) [2021-07-05 00:58:04,784 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.07 12:58:04 BoogieIcfgContainer [2021-07-05 00:58:04,784 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-07-05 00:58:04,785 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-07-05 00:58:04,785 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-07-05 00:58:04,785 INFO L275 PluginConnector]: Witness Printer initialized [2021-07-05 00:58:04,785 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.07 12:58:01" (3/4) ... [2021-07-05 00:58:04,787 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2021-07-05 00:58:04,813 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2021-07-05 00:58:04,813 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-07-05 00:58:04,814 INFO L168 Benchmark]: Toolchain (without parser) took 4535.58 ms. Allocated memory was 65.0 MB in the beginning and 142.6 MB in the end (delta: 77.6 MB). Free memory was 43.5 MB in the beginning and 97.7 MB in the end (delta: -54.2 MB). Peak memory consumption was 23.2 MB. Max. memory is 16.1 GB. [2021-07-05 00:58:04,814 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 65.0 MB. Free memory was 45.9 MB in the beginning and 45.9 MB in the end (delta: 50.9 kB). There was no memory consumed. Max. memory is 16.1 GB. [2021-07-05 00:58:04,814 INFO L168 Benchmark]: CACSL2BoogieTranslator took 406.63 ms. Allocated memory is still 65.0 MB. Free memory was 43.4 MB in the beginning and 35.2 MB in the end (delta: 8.1 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. [2021-07-05 00:58:04,815 INFO L168 Benchmark]: Boogie Procedure Inliner took 47.10 ms. Allocated memory is still 65.0 MB. Free memory was 35.2 MB in the beginning and 33.1 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-07-05 00:58:04,815 INFO L168 Benchmark]: Boogie Preprocessor took 34.88 ms. Allocated memory is still 65.0 MB. Free memory was 33.1 MB in the beginning and 31.5 MB in the end (delta: 1.6 MB). There was no memory consumed. Max. memory is 16.1 GB. [2021-07-05 00:58:04,815 INFO L168 Benchmark]: RCFGBuilder took 437.01 ms. Allocated memory was 65.0 MB in the beginning and 79.7 MB in the end (delta: 14.7 MB). Free memory was 31.5 MB in the beginning and 44.3 MB in the end (delta: -12.8 MB). Peak memory consumption was 12.2 MB. Max. memory is 16.1 GB. [2021-07-05 00:58:04,815 INFO L168 Benchmark]: TraceAbstraction took 3563.55 ms. Allocated memory was 79.7 MB in the beginning and 142.6 MB in the end (delta: 62.9 MB). Free memory was 43.9 MB in the beginning and 101.9 MB in the end (delta: -58.0 MB). Peak memory consumption was 5.8 MB. Max. memory is 16.1 GB. [2021-07-05 00:58:04,816 INFO L168 Benchmark]: Witness Printer took 28.88 ms. Allocated memory is still 142.6 MB. Free memory was 101.9 MB in the beginning and 97.7 MB in the end (delta: 4.2 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. [2021-07-05 00:58:04,817 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14 ms. Allocated memory is still 65.0 MB. Free memory was 45.9 MB in the beginning and 45.9 MB in the end (delta: 50.9 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 406.63 ms. Allocated memory is still 65.0 MB. Free memory was 43.4 MB in the beginning and 35.2 MB in the end (delta: 8.1 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 47.10 ms. Allocated memory is still 65.0 MB. Free memory was 35.2 MB in the beginning and 33.1 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 34.88 ms. Allocated memory is still 65.0 MB. Free memory was 33.1 MB in the beginning and 31.5 MB in the end (delta: 1.6 MB). There was no memory consumed. Max. memory is 16.1 GB. * RCFGBuilder took 437.01 ms. Allocated memory was 65.0 MB in the beginning and 79.7 MB in the end (delta: 14.7 MB). Free memory was 31.5 MB in the beginning and 44.3 MB in the end (delta: -12.8 MB). Peak memory consumption was 12.2 MB. Max. memory is 16.1 GB. * TraceAbstraction took 3563.55 ms. Allocated memory was 79.7 MB in the beginning and 142.6 MB in the end (delta: 62.9 MB). Free memory was 43.9 MB in the beginning and 101.9 MB in the end (delta: -58.0 MB). Peak memory consumption was 5.8 MB. Max. memory is 16.1 GB. * Witness Printer took 28.88 ms. Allocated memory is still 142.6 MB. Free memory was 101.9 MB in the beginning and 97.7 MB in the end (delta: 4.2 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0ms ErrorAutomatonConstructionTimeTotal, 0.0ms FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0ms ErrorAutomatonConstructionTimeAvg, 0.0ms ErrorAutomatonDifferenceTimeAvg, 0.0ms ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0ms ErrorAutomatonConstructionTimeTotal, 0.0ms FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0ms ErrorAutomatonConstructionTimeAvg, 0.0ms ErrorAutomatonDifferenceTimeAvg, 0.0ms ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0ms ErrorAutomatonConstructionTimeTotal, 0.0ms FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0ms ErrorAutomatonConstructionTimeAvg, 0.0ms ErrorAutomatonDifferenceTimeAvg, 0.0ms ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0ms ErrorAutomatonConstructionTimeTotal, 0.0ms FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0ms ErrorAutomatonConstructionTimeAvg, 0.0ms ErrorAutomatonDifferenceTimeAvg, 0.0ms ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0ms ErrorAutomatonConstructionTimeTotal, 0.0ms FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0ms ErrorAutomatonConstructionTimeAvg, 0.0ms ErrorAutomatonDifferenceTimeAvg, 0.0ms ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0ms ErrorAutomatonConstructionTimeTotal, 0.0ms FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0ms ErrorAutomatonConstructionTimeAvg, 0.0ms ErrorAutomatonDifferenceTimeAvg, 0.0ms ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 6]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 6]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 6]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 6]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 6]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - CounterExampleResult [Line: 6]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L519] void * guard_malloc_counter = 0; [L534] struct list_head *elem = ((void *)0); [L544] static struct list_head head; VAL [elem={0:0}, guard_malloc_counter={0:0}, head={5:0}] [L546] struct list_head *dev1, *dev2; [L522] (size > 0) ? (0) : __blast_assert () VAL [elem={0:0}, guard_malloc_counter={0:0}, head={5:0}] [L523] guard_malloc_counter++ [L524] COND FALSE !(!__VERIFIER_nondet_int()) [L526] return (void *) guard_malloc_counter; VAL [elem={0:0}, guard_malloc_counter={0:1}, head={5:0}] [L529] return __getMemory(size); [L547] dev1 = my_malloc(sizeof(*dev1)) [L522] (size > 0) ? (0) : __blast_assert () VAL [elem={0:0}, guard_malloc_counter={0:1}, head={5:0}] [L523] guard_malloc_counter++ [L524] COND FALSE !(!__VERIFIER_nondet_int()) [L526] return (void *) guard_malloc_counter; VAL [elem={0:0}, guard_malloc_counter={0:2}, head={5:0}] [L529] return __getMemory(size); [L548] dev2 = my_malloc(sizeof(*dev2)) [L549] COND TRUE dev1!=((void *)0) && dev2!=((void *)0) [L536] (new!=elem) ? (0) : __blast_assert () VAL [elem={0:0}, guard_malloc_counter={0:2}, head={5:0}] [L537] COND TRUE __VERIFIER_nondet_int() [L538] elem = new VAL [elem={0:2}, guard_malloc_counter={0:2}, head={5:0}] [L536] (new!=elem) ? (0) : __blast_assert () VAL [elem={0:2}, guard_malloc_counter={0:2}, head={5:0}] [L537] COND TRUE __VERIFIER_nondet_int() [L538] elem = new VAL [elem={0:1}, guard_malloc_counter={0:2}, head={5:0}] [L541] COND FALSE !(entry==elem) VAL [elem={0:1}, guard_malloc_counter={0:2}, head={5:0}] [L536] (new!=elem) ? (0) : __blast_assert () VAL [elem={0:1}, guard_malloc_counter={0:2}, head={5:0}] [L537] COND FALSE !(__VERIFIER_nondet_int()) [L536] (new!=elem) ? (0) : __blast_assert () VAL [elem={0:1}, guard_malloc_counter={0:2}, head={5:0}] [L6] reach_error() VAL [elem={0:1}, guard_malloc_counter={0:2}, head={5:0}] - StatisticsResult: Ultimate Automizer benchmark data for error location: ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION CFG has 1 procedures, 46 locations, 6 error locations. Started 1 CEGAR loops. OverallTime: 228.0ms, OverallIterations: 1, TraceHistogramMax: 1, EmptinessCheckTime: 5.9ms, AutomataDifference: 31.6ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 14.0ms, InitialAbstractionConstructionTime: 8.6ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 47 SDtfs, 46 SDslu, 1 SDs, 0 SdLazy, 2 SolverSat, 2 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.3ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.8ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=46occurred in iteration=0, InterpolantAutomatonStates: 3, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 5.2ms AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0ms HoareAnnotationTime, 5 LocationsWithAnnotation, 5 PreInvPairs, 10 NumberOfFragments, 15 HoareAnnotationTreeSize, 5 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 4.4ms HoareSimplificationTime, 5 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 5.5ms HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 2.9ms SsaConstructionTime, 15.5ms SatisfiabilityAnalysisTime, 42.4ms InterpolantComputationTime, 4 NumberOfCodeBlocks, 4 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 3 ConstructedInterpolants, 0 QuantifiedInterpolants, 5 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - StatisticsResult: Ultimate Automizer benchmark data for error location: ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION CFG has 1 procedures, 46 locations, 6 error locations. Started 1 CEGAR loops. OverallTime: 74.0ms, OverallIterations: 1, TraceHistogramMax: 1, EmptinessCheckTime: 0.8ms, AutomataDifference: 12.9ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 8.6ms, InitialAbstractionConstructionTime: 1.0ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 47 SDtfs, 46 SDslu, 2 SDs, 0 SdLazy, 2 SolverSat, 3 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.4ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.7ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=46occurred in iteration=0, InterpolantAutomatonStates: 3, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 0.5ms AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0ms HoareAnnotationTime, 5 LocationsWithAnnotation, 5 PreInvPairs, 10 NumberOfFragments, 15 HoareAnnotationTreeSize, 5 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 2.9ms HoareSimplificationTime, 5 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 5.1ms HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 1.5ms SsaConstructionTime, 8.6ms SatisfiabilityAnalysisTime, 25.8ms InterpolantComputationTime, 9 NumberOfCodeBlocks, 9 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 8 ConstructedInterpolants, 0 QuantifiedInterpolants, 12 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - StatisticsResult: Ultimate Automizer benchmark data for error location: ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION CFG has 1 procedures, 46 locations, 6 error locations. Started 1 CEGAR loops. OverallTime: 570.0ms, OverallIterations: 3, TraceHistogramMax: 1, EmptinessCheckTime: 1.6ms, AutomataDifference: 209.5ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 68.8ms, InitialAbstractionConstructionTime: 0.8ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 68 SDtfs, 121 SDslu, 185 SDs, 0 SdLazy, 83 SolverSat, 7 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 58.7ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 27 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 170.4ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=46occurred in iteration=0, InterpolantAutomatonStates: 21, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 21.1ms AutomataMinimizationTime, 3 MinimizatonAttempts, 6 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: 0.0ms HoareAnnotationTime, 5 LocationsWithAnnotation, 5 PreInvPairs, 21 NumberOfFragments, 96 HoareAnnotationTreeSize, 5 FomulaSimplifications, 32 FormulaSimplificationTreeSizeReduction, 26.4ms HoareSimplificationTime, 5 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 41.3ms HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 4.4ms SsaConstructionTime, 40.9ms SatisfiabilityAnalysisTime, 189.8ms InterpolantComputationTime, 45 NumberOfCodeBlocks, 45 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 42 ConstructedInterpolants, 0 QuantifiedInterpolants, 187 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 3 InterpolantComputations, 3 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - StatisticsResult: Ultimate Automizer benchmark data for error location: ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION CFG has 1 procedures, 46 locations, 6 error locations. Started 1 CEGAR loops. OverallTime: 739.8ms, OverallIterations: 4, TraceHistogramMax: 1, EmptinessCheckTime: 1.9ms, AutomataDifference: 351.8ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 106.2ms, InitialAbstractionConstructionTime: 0.7ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 83 SDtfs, 190 SDslu, 236 SDs, 0 SdLazy, 166 SolverSat, 27 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 76.1ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 47 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 317.4ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=46occurred in iteration=0, InterpolantAutomatonStates: 34, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 5.4ms AutomataMinimizationTime, 4 MinimizatonAttempts, 10 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: 0.0ms HoareAnnotationTime, 5 LocationsWithAnnotation, 5 PreInvPairs, 21 NumberOfFragments, 123 HoareAnnotationTreeSize, 5 FomulaSimplifications, 32 FormulaSimplificationTreeSizeReduction, 6.8ms HoareSimplificationTime, 5 FomulaSimplificationsInter, 21 FormulaSimplificationTreeSizeReductionInter, 98.3ms HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 4.4ms SsaConstructionTime, 18.7ms SatisfiabilityAnalysisTime, 220.9ms InterpolantComputationTime, 76 NumberOfCodeBlocks, 76 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 72 ConstructedInterpolants, 0 QuantifiedInterpolants, 284 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 4 InterpolantComputations, 4 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - StatisticsResult: Ultimate Automizer benchmark data for error location: ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION CFG has 1 procedures, 46 locations, 6 error locations. Started 1 CEGAR loops. OverallTime: 1145.2ms, OverallIterations: 6, TraceHistogramMax: 1, EmptinessCheckTime: 3.0ms, AutomataDifference: 584.7ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 119.9ms, InitialAbstractionConstructionTime: 0.5ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 127 SDtfs, 466 SDslu, 347 SDs, 0 SdLazy, 356 SolverSat, 30 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 139.0ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 85 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 626.4ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=46occurred in iteration=0, InterpolantAutomatonStates: 55, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 8.9ms AutomataMinimizationTime, 6 MinimizatonAttempts, 16 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: 0.0ms HoareAnnotationTime, 5 LocationsWithAnnotation, 5 PreInvPairs, 21 NumberOfFragments, 160 HoareAnnotationTreeSize, 5 FomulaSimplifications, 32 FormulaSimplificationTreeSizeReduction, 5.6ms HoareSimplificationTime, 5 FomulaSimplificationsInter, 20 FormulaSimplificationTreeSizeReductionInter, 113.4ms HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 6.6ms SsaConstructionTime, 21.4ms SatisfiabilityAnalysisTime, 366.6ms InterpolantComputationTime, 150 NumberOfCodeBlocks, 150 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 144 ConstructedInterpolants, 0 QuantifiedInterpolants, 629 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 6 InterpolantComputations, 6 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - StatisticsResult: Ultimate Automizer benchmark data for error location: ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION CFG has 1 procedures, 46 locations, 6 error locations. Started 1 CEGAR loops. OverallTime: 717.7ms, OverallIterations: 5, TraceHistogramMax: 1, EmptinessCheckTime: 1.6ms, AutomataDifference: 458.9ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 0.3ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 115 SDtfs, 488 SDslu, 324 SDs, 0 SdLazy, 269 SolverSat, 73 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 119.7ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 54 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 398.4ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=46occurred in iteration=0, InterpolantAutomatonStates: 37, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 7.3ms AutomataMinimizationTime, 4 MinimizatonAttempts, 28 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 5.8ms SsaConstructionTime, 15.0ms SatisfiabilityAnalysisTime, 186.6ms InterpolantComputationTime, 145 NumberOfCodeBlocks, 145 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 112 ConstructedInterpolants, 0 QuantifiedInterpolants, 305 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 4 InterpolantComputations, 4 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - InvariantResult [Line: 520]: Loop Invariant Derived loop invariant: ((size == 8 && (((\result <= guard_malloc_counter && 1 <= \result) && elem == 0) || (\result == 0 && \result == 0))) && ((1 <= guard_malloc_counter && elem == 0) || (\result == 0 && \result == 0))) && ((((((guard_malloc_counter <= 1 && 1 <= guard_malloc_counter) && \result <= guard_malloc_counter) && \result == 0) && guard_malloc_counter == 0) && elem == 0) || (\result == 0 && \result == 0)) - InvariantResult [Line: 520]: Loop Invariant Derived loop invariant: ((size == 8 && (((dev1 == 0 && dev1 == 0) || ((((((2 <= \result && guard_malloc_counter <= 2) && \result <= guard_malloc_counter) && \result == 0) && guard_malloc_counter == 0) && dev1 + 1 <= \result) && elem == 0)) || (\result == 0 && \result == 0))) && (((dev1 == 0 && dev1 == 0) || (((1 <= dev1 && \result <= guard_malloc_counter) && dev1 + 1 <= \result) && elem == 0)) || (\result == 0 && \result == 0))) && ((((2 <= \result && 2 <= guard_malloc_counter) && elem == 0) || (dev1 == 0 && dev1 == 0)) || (\result == 0 && \result == 0)) - InvariantResult [Line: 545]: Loop Invariant Derived loop invariant: size == 8 - InvariantResult [Line: 528]: Loop Invariant Derived loop invariant: ((size == 8 && ((((0 == \result && \result == 0) && \result == 0) && \result == 0) || ((((1 <= \result && \result <= guard_malloc_counter) && 1 <= \result) && elem == 0) && \result <= guard_malloc_counter))) && ((1 <= guard_malloc_counter && elem == 0) || (((0 == \result && \result == 0) && \result == 0) && \result == 0))) && ((((((((guard_malloc_counter <= 1 && 1 <= guard_malloc_counter) && \result == 0) && \result <= guard_malloc_counter) && \result == 0) && guard_malloc_counter == 0) && elem == 0) && \result <= guard_malloc_counter) || (((0 == \result && \result == 0) && \result == 0) && \result == 0)) - InvariantResult [Line: 528]: Loop Invariant Derived loop invariant: ((size == 8 && (((dev1 == 0 && dev1 == 0) || (((0 == \result && \result == 0) && \result == 0) && \result == 0)) || (((((((((2 <= \result && 2 <= \result) && \result == 0) && guard_malloc_counter <= 2) && \result <= guard_malloc_counter) && \result == 0) && guard_malloc_counter == 0) && dev1 + 1 <= \result) && elem == 0) && \result <= guard_malloc_counter))) && (((dev1 == 0 && dev1 == 0) || (((0 == \result && \result == 0) && \result == 0) && \result == 0)) || (((2 <= \result && 2 <= \result) && 2 <= guard_malloc_counter) && elem == 0))) && (((dev1 == 0 && dev1 == 0) || (((0 == \result && \result == 0) && \result == 0) && \result == 0)) || (((((1 <= dev1 && \result <= guard_malloc_counter) && dev1 + 1 <= \result) && dev1 + 1 <= \result) && elem == 0) && \result <= guard_malloc_counter)) RESULT: Ultimate proved your program to be incorrect! [2021-07-05 00:58:04,849 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...