./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/ldv-regression/rule60_list2.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.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 2ab50e26e6f5e14d4b2965496bdd00ba16261c4e ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.2.1-wip.dd.multireach-323-8d31f38 [2021-07-05 00:58:01,145 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-07-05 00:58:01,146 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-07-05 00:58:01,175 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-07-05 00:58:01,175 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-07-05 00:58:01,178 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-07-05 00:58:01,179 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-07-05 00:58:01,183 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-07-05 00:58:01,184 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-07-05 00:58:01,188 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-07-05 00:58:01,189 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-07-05 00:58:01,190 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-07-05 00:58:01,190 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-07-05 00:58:01,191 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-07-05 00:58:01,192 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-07-05 00:58:01,193 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-07-05 00:58:01,194 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-07-05 00:58:01,196 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-07-05 00:58:01,197 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-07-05 00:58:01,198 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-07-05 00:58:01,201 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-07-05 00:58:01,201 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-07-05 00:58:01,202 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-07-05 00:58:01,203 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-07-05 00:58:01,206 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-07-05 00:58:01,208 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-07-05 00:58:01,209 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-07-05 00:58:01,209 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-07-05 00:58:01,210 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-07-05 00:58:01,211 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-07-05 00:58:01,211 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-07-05 00:58:01,211 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-07-05 00:58:01,212 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-07-05 00:58:01,212 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-07-05 00:58:01,213 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-07-05 00:58:01,213 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-07-05 00:58:01,214 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-07-05 00:58:01,214 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-07-05 00:58:01,214 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-07-05 00:58:01,215 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-07-05 00:58:01,216 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-07-05 00:58:01,218 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:58:01,245 INFO L113 SettingsManager]: Loading preferences was successful [2021-07-05 00:58:01,245 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-07-05 00:58:01,247 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-07-05 00:58:01,247 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-07-05 00:58:01,247 INFO L138 SettingsManager]: * Use SBE=true [2021-07-05 00:58:01,247 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-07-05 00:58:01,247 INFO L138 SettingsManager]: * sizeof long=4 [2021-07-05 00:58:01,247 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-07-05 00:58:01,248 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-07-05 00:58:01,248 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-07-05 00:58:01,248 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-07-05 00:58:01,249 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-07-05 00:58:01,249 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-07-05 00:58:01,249 INFO L138 SettingsManager]: * sizeof long double=12 [2021-07-05 00:58:01,249 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-07-05 00:58:01,249 INFO L138 SettingsManager]: * Use constant arrays=true [2021-07-05 00:58:01,249 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-07-05 00:58:01,249 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-07-05 00:58:01,250 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-07-05 00:58:01,250 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-07-05 00:58:01,250 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-07-05 00:58:01,250 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-07-05 00:58:01,250 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-07-05 00:58:01,250 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-07-05 00:58:01,251 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-07-05 00:58:01,251 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-07-05 00:58:01,251 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-07-05 00:58:01,251 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-07-05 00:58:01,251 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 -> 2ab50e26e6f5e14d4b2965496bdd00ba16261c4e [2021-07-05 00:58:01,485 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-07-05 00:58:01,498 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-07-05 00:58:01,500 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-07-05 00:58:01,501 INFO L271 PluginConnector]: Initializing CDTParser... [2021-07-05 00:58:01,501 INFO L275 PluginConnector]: CDTParser initialized [2021-07-05 00:58:01,502 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-regression/rule60_list2.i [2021-07-05 00:58:01,544 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b9b0044c1/74b8147dc94547c98be9f3575b9868f4/FLAGc53432348 [2021-07-05 00:58:01,951 INFO L306 CDTParser]: Found 1 translation units. [2021-07-05 00:58:01,952 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-regression/rule60_list2.i [2021-07-05 00:58:01,959 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b9b0044c1/74b8147dc94547c98be9f3575b9868f4/FLAGc53432348 [2021-07-05 00:58:01,967 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b9b0044c1/74b8147dc94547c98be9f3575b9868f4 [2021-07-05 00:58:01,969 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-07-05 00:58:01,970 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-07-05 00:58:01,970 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-07-05 00:58:01,971 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-07-05 00:58:01,978 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-07-05 00:58:01,978 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.07 12:58:01" (1/1) ... [2021-07-05 00:58:01,979 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@499b6d58 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.07 12:58:01, skipping insertion in model container [2021-07-05 00:58:01,979 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.07 12:58:01" (1/1) ... [2021-07-05 00:58:01,983 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-07-05 00:58:02,010 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-07-05 00:58:02,091 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.i[292,305] [2021-07-05 00:58:02,237 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-07-05 00:58:02,243 INFO L203 MainTranslator]: Completed pre-run [2021-07-05 00:58:02,250 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.i[292,305] [2021-07-05 00:58:02,274 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-07-05 00:58:02,306 INFO L208 MainTranslator]: Completed translation [2021-07-05 00:58:02,307 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.07 12:58:02 WrapperNode [2021-07-05 00:58:02,307 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-07-05 00:58:02,308 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-07-05 00:58:02,308 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-07-05 00:58:02,308 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-07-05 00:58:02,312 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:02" (1/1) ... [2021-07-05 00:58:02,320 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:02" (1/1) ... [2021-07-05 00:58:02,333 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-07-05 00:58:02,334 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-07-05 00:58:02,334 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-07-05 00:58:02,334 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-07-05 00:58:02,339 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:02" (1/1) ... [2021-07-05 00:58:02,339 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:02" (1/1) ... [2021-07-05 00:58:02,341 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:02" (1/1) ... [2021-07-05 00:58:02,342 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:02" (1/1) ... [2021-07-05 00:58:02,344 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:02" (1/1) ... [2021-07-05 00:58:02,346 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:02" (1/1) ... [2021-07-05 00:58:02,347 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:02" (1/1) ... [2021-07-05 00:58:02,348 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-07-05 00:58:02,349 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-07-05 00:58:02,349 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-07-05 00:58:02,349 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-07-05 00:58:02,350 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.07 12:58:02" (1/1) ... [2021-07-05 00:58:02,354 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-07-05 00:58:02,359 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-07-05 00:58:02,378 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:02,396 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:02,437 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-07-05 00:58:02,437 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2021-07-05 00:58:02,437 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-07-05 00:58:02,438 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-07-05 00:58:02,438 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-07-05 00:58:02,739 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-07-05 00:58:02,739 INFO L299 CfgBuilder]: Removed 30 assume(true) statements. [2021-07-05 00:58:02,740 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.07 12:58:02 BoogieIcfgContainer [2021-07-05 00:58:02,740 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-07-05 00:58:02,741 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-07-05 00:58:02,741 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-07-05 00:58:02,750 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-07-05 00:58:02,750 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.07 12:58:01" (1/3) ... [2021-07-05 00:58:02,751 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e74e42a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.07 12:58:02, skipping insertion in model container [2021-07-05 00:58:02,751 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.07 12:58:02" (2/3) ... [2021-07-05 00:58:02,751 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e74e42a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.07 12:58:02, skipping insertion in model container [2021-07-05 00:58:02,751 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.07 12:58:02" (3/3) ... [2021-07-05 00:58:02,753 INFO L111 eAbstractionObserver]: Analyzing ICFG rule60_list2.i [2021-07-05 00:58:02,757 INFO L198 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-07-05 00:58:02,757 INFO L158 ceAbstractionStarter]: Applying trace abstraction to program that has 5 error locations. [2021-07-05 00:58:02,781 INFO L328 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION ======== [2021-07-05 00:58:02,785 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,785 INFO L330 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-07-05 00:58:02,794 INFO L276 IsEmpty]: Start isEmpty. Operand has 40 states, 34 states have (on average 1.5) internal successors, (51), 39 states have internal predecessors, (51), 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,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2021-07-05 00:58:02,796 INFO L517 BasicCegarLoop]: Found error trace [2021-07-05 00:58:02,797 INFO L525 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2021-07-05 00:58:02,797 INFO L374 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-07-05 00:58:02,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-05 00:58:02,802 INFO L82 PathProgramCache]: Analyzing trace with hash 925669, now seen corresponding path program 1 times [2021-07-05 00:58:02,807 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-05 00:58:02,807 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1124132380] [2021-07-05 00:58:02,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-05 00:58:02,808 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-05 00:58:02,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-05 00:58:02,916 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 00:58:02,917 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [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 5 [2021-07-05 00:58:02,925 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 00:58:02,925 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 00:58:02,926 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,926 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-05 00:58:02,927 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1124132380] [2021-07-05 00:58:02,928 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1124132380] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-05 00:58:02,928 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-05 00:58:02,928 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-07-05 00:58:02,931 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1435367] [2021-07-05 00:58:02,935 INFO L425 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-07-05 00:58:02,935 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-05 00:58:02,943 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-07-05 00:58:02,944 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-07-05 00:58:02,945 INFO L87 Difference]: Start difference. First operand has 40 states, 34 states have (on average 1.5) internal successors, (51), 39 states have internal predecessors, (51), 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:02,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-05 00:58:02,967 INFO L93 Difference]: Finished difference Result 73 states and 94 transitions. [2021-07-05 00:58:02,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-07-05 00:58:02,968 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:02,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-05 00:58:02,972 INFO L225 Difference]: With dead ends: 73 [2021-07-05 00:58:02,972 INFO L226 Difference]: Without dead ends: 0 [2021-07-05 00:58:02,974 INFO L795 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.9ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-07-05 00:58:02,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-07-05 00:58:02,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-07-05 00:58:02,987 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,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-07-05 00:58:02,988 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 4 [2021-07-05 00:58:02,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-05 00:58:02,988 INFO L442 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-07-05 00:58:02,989 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:02,989 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-07-05 00:58:02,989 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-07-05 00:58:02,992 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2021-07-05 00:58:02,994 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 00:58:02,996 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 00:58:03,000 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 00:58:03,001 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 00:58:03,002 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 00:58:03,016 INFO L762 garLoopResultBuilder]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION(line 6) no Hoare annotation was computed. [2021-07-05 00:58:03,016 INFO L762 garLoopResultBuilder]: For program point ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION(line 6) no Hoare annotation was computed. [2021-07-05 00:58:03,016 INFO L762 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2021-07-05 00:58:03,016 INFO L762 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2021-07-05 00:58:03,016 INFO L762 garLoopResultBuilder]: For program point L540(lines 540 543) no Hoare annotation was computed. [2021-07-05 00:58:03,016 INFO L762 garLoopResultBuilder]: For program point L524(lines 524 525) no Hoare annotation was computed. [2021-07-05 00:58:03,016 INFO L762 garLoopResultBuilder]: For program point L524-1(lines 524 525) no Hoare annotation was computed. [2021-07-05 00:58:03,016 INFO L762 garLoopResultBuilder]: For program point L549(lines 549 554) no Hoare annotation was computed. [2021-07-05 00:58:03,017 INFO L762 garLoopResultBuilder]: For program point L4(lines 1 556) no Hoare annotation was computed. [2021-07-05 00:58:03,017 INFO L762 garLoopResultBuilder]: For program point L549-1(lines 549 554) no Hoare annotation was computed. [2021-07-05 00:58:03,017 INFO L762 garLoopResultBuilder]: For program point L4-1(lines 1 556) no Hoare annotation was computed. [2021-07-05 00:58:03,017 INFO L762 garLoopResultBuilder]: For program point L4-2(lines 1 556) no Hoare annotation was computed. [2021-07-05 00:58:03,017 INFO L762 garLoopResultBuilder]: For program point L4-3(lines 1 556) no Hoare annotation was computed. [2021-07-05 00:58:03,017 INFO L762 garLoopResultBuilder]: For program point L4-4(lines 1 556) no Hoare annotation was computed. [2021-07-05 00:58:03,017 INFO L762 garLoopResultBuilder]: For program point L541(lines 541 542) no Hoare annotation was computed. [2021-07-05 00:58:03,017 INFO L762 garLoopResultBuilder]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION(line 6) no Hoare annotation was computed. [2021-07-05 00:58:03,018 INFO L758 garLoopResultBuilder]: At program point L526(lines 520 527) the Hoare annotation is: (= ULTIMATE.start___getMemory_~size 8) [2021-07-05 00:58:03,018 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:03,019 INFO L762 garLoopResultBuilder]: For program point L6(line 6) no Hoare annotation was computed. [2021-07-05 00:58:03,019 INFO L762 garLoopResultBuilder]: For program point L6-1(line 6) no Hoare annotation was computed. [2021-07-05 00:58:03,019 INFO L762 garLoopResultBuilder]: For program point L6-2(line 6) no Hoare annotation was computed. [2021-07-05 00:58:03,019 INFO L762 garLoopResultBuilder]: For program point L6-3(line 6) no Hoare annotation was computed. [2021-07-05 00:58:03,019 INFO L762 garLoopResultBuilder]: For program point L6-4(line 6) no Hoare annotation was computed. [2021-07-05 00:58:03,019 INFO L762 garLoopResultBuilder]: For program point L535(lines 535 539) no Hoare annotation was computed. [2021-07-05 00:58:03,019 INFO L762 garLoopResultBuilder]: For program point L535-1(lines 535 539) no Hoare annotation was computed. [2021-07-05 00:58:03,020 INFO L762 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2021-07-05 00:58:03,020 INFO L762 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 6) no Hoare annotation was computed. [2021-07-05 00:58:03,020 INFO L762 garLoopResultBuilder]: For program point L536(line 536) no Hoare annotation was computed. [2021-07-05 00:58:03,020 INFO L762 garLoopResultBuilder]: For program point L536-2(line 536) no Hoare annotation was computed. [2021-07-05 00:58:03,021 INFO L762 garLoopResultBuilder]: For program point L536-4(line 536) no Hoare annotation was computed. [2021-07-05 00:58:03,021 INFO L762 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2021-07-05 00:58:03,021 INFO L762 garLoopResultBuilder]: For program point L537(lines 537 538) no Hoare annotation was computed. [2021-07-05 00:58:03,021 INFO L762 garLoopResultBuilder]: For program point L537-2(lines 537 538) no Hoare annotation was computed. [2021-07-05 00:58:03,021 INFO L762 garLoopResultBuilder]: For program point L537-4(lines 537 538) no Hoare annotation was computed. [2021-07-05 00:58:03,022 INFO L758 garLoopResultBuilder]: At program point L529(lines 528 530) the Hoare annotation is: (= ULTIMATE.start___getMemory_~size 8) [2021-07-05 00:58:03,022 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:03,023 INFO L762 garLoopResultBuilder]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION(line 6) no Hoare annotation was computed. [2021-07-05 00:58:03,023 INFO L758 garLoopResultBuilder]: At program point L555(lines 545 556) the Hoare annotation is: (= ULTIMATE.start___getMemory_~size 8) [2021-07-05 00:58:03,024 INFO L762 garLoopResultBuilder]: For program point L522(line 522) no Hoare annotation was computed. [2021-07-05 00:58:03,024 INFO L762 garLoopResultBuilder]: For program point L522-2(line 522) no Hoare annotation was computed. [2021-07-05 00:58:03,025 WARN L471 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-07-05 00:58:03,025 WARN L182 nStatisticsGenerator]: total relevant statements: 0 [2021-07-05 00:58:03,029 INFO L303 ceAbstractionStarter]: Result for error location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION was SAFE (1/5) [2021-07-05 00:58:03,036 INFO L328 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION ======== [2021-07-05 00:58:03,041 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:03,041 INFO L330 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-07-05 00:58:03,043 INFO L276 IsEmpty]: Start isEmpty. Operand has 40 states, 34 states have (on average 1.5) internal successors, (51), 39 states have internal predecessors, (51), 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,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2021-07-05 00:58:03,044 INFO L517 BasicCegarLoop]: Found error trace [2021-07-05 00:58:03,044 INFO L525 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-05 00:58:03,044 INFO L374 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-07-05 00:58:03,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-05 00:58:03,044 INFO L82 PathProgramCache]: Analyzing trace with hash -475735895, now seen corresponding path program 1 times [2021-07-05 00:58:03,045 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-05 00:58:03,045 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1107224428] [2021-07-05 00:58:03,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-05 00:58:03,045 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-05 00:58:03,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-05 00:58:03,076 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 00:58:03,076 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 00:58:03,080 INFO L142 QuantifierPusher]: treesize reduction 6, result has 33.3 percent of original size [2021-07-05 00:58:03,080 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-07-05 00:58:03,083 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 00:58:03,084 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 00:58:03,084 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 00:58:03,085 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-07-05 00:58:03,088 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 00:58:03,089 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 00:58:03,089 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,089 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-05 00:58:03,089 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1107224428] [2021-07-05 00:58:03,089 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1107224428] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-05 00:58:03,089 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-05 00:58:03,089 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-07-05 00:58:03,089 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1864358424] [2021-07-05 00:58:03,090 INFO L425 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-07-05 00:58:03,090 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-05 00:58:03,090 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-07-05 00:58:03,090 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-07-05 00:58:03,091 INFO L87 Difference]: Start difference. First operand has 40 states, 34 states have (on average 1.5) internal successors, (51), 39 states have internal predecessors, (51), 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:03,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-05 00:58:03,101 INFO L93 Difference]: Finished difference Result 73 states and 94 transitions. [2021-07-05 00:58:03,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-07-05 00:58:03,101 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:03,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-05 00:58:03,102 INFO L225 Difference]: With dead ends: 73 [2021-07-05 00:58:03,102 INFO L226 Difference]: Without dead ends: 0 [2021-07-05 00:58:03,102 INFO L795 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.3ms TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-07-05 00:58:03,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-07-05 00:58:03,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-07-05 00:58:03,103 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,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-07-05 00:58:03,103 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 9 [2021-07-05 00:58:03,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-05 00:58:03,103 INFO L442 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-07-05 00:58:03,103 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:03,104 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-07-05 00:58:03,104 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-07-05 00:58:03,104 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2021-07-05 00:58:03,104 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 00:58:03,105 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 00:58:03,106 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 00:58:03,106 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 00:58:03,107 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 00:58:03,114 INFO L762 garLoopResultBuilder]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION(line 6) no Hoare annotation was computed. [2021-07-05 00:58:03,114 INFO L762 garLoopResultBuilder]: For program point ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION(line 6) no Hoare annotation was computed. [2021-07-05 00:58:03,114 INFO L762 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2021-07-05 00:58:03,114 INFO L762 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2021-07-05 00:58:03,114 INFO L762 garLoopResultBuilder]: For program point L540(lines 540 543) no Hoare annotation was computed. [2021-07-05 00:58:03,114 INFO L762 garLoopResultBuilder]: For program point L524(lines 524 525) no Hoare annotation was computed. [2021-07-05 00:58:03,115 INFO L762 garLoopResultBuilder]: For program point L524-1(lines 524 525) no Hoare annotation was computed. [2021-07-05 00:58:03,115 INFO L762 garLoopResultBuilder]: For program point L549(lines 549 554) no Hoare annotation was computed. [2021-07-05 00:58:03,115 INFO L762 garLoopResultBuilder]: For program point L4(lines 1 556) no Hoare annotation was computed. [2021-07-05 00:58:03,115 INFO L762 garLoopResultBuilder]: For program point L549-1(lines 549 554) no Hoare annotation was computed. [2021-07-05 00:58:03,115 INFO L762 garLoopResultBuilder]: For program point L4-1(lines 1 556) no Hoare annotation was computed. [2021-07-05 00:58:03,115 INFO L762 garLoopResultBuilder]: For program point L4-2(lines 1 556) no Hoare annotation was computed. [2021-07-05 00:58:03,115 INFO L762 garLoopResultBuilder]: For program point L4-3(lines 1 556) no Hoare annotation was computed. [2021-07-05 00:58:03,116 INFO L762 garLoopResultBuilder]: For program point L4-4(lines 1 556) no Hoare annotation was computed. [2021-07-05 00:58:03,116 INFO L762 garLoopResultBuilder]: For program point L541(lines 541 542) no Hoare annotation was computed. [2021-07-05 00:58:03,116 INFO L762 garLoopResultBuilder]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION(line 6) no Hoare annotation was computed. [2021-07-05 00:58:03,116 INFO L758 garLoopResultBuilder]: At program point L526(lines 520 527) the Hoare annotation is: (= ULTIMATE.start___getMemory_~size 8) [2021-07-05 00:58:03,116 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:03,116 INFO L762 garLoopResultBuilder]: For program point L6(line 6) no Hoare annotation was computed. [2021-07-05 00:58:03,116 INFO L762 garLoopResultBuilder]: For program point L6-1(line 6) no Hoare annotation was computed. [2021-07-05 00:58:03,117 INFO L762 garLoopResultBuilder]: For program point L6-2(line 6) no Hoare annotation was computed. [2021-07-05 00:58:03,117 INFO L762 garLoopResultBuilder]: For program point L6-3(line 6) no Hoare annotation was computed. [2021-07-05 00:58:03,117 INFO L762 garLoopResultBuilder]: For program point L6-4(line 6) no Hoare annotation was computed. [2021-07-05 00:58:03,117 INFO L762 garLoopResultBuilder]: For program point L535(lines 535 539) no Hoare annotation was computed. [2021-07-05 00:58:03,117 INFO L762 garLoopResultBuilder]: For program point L535-1(lines 535 539) no Hoare annotation was computed. [2021-07-05 00:58:03,117 INFO L762 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2021-07-05 00:58:03,117 INFO L762 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 6) no Hoare annotation was computed. [2021-07-05 00:58:03,118 INFO L762 garLoopResultBuilder]: For program point L536(line 536) no Hoare annotation was computed. [2021-07-05 00:58:03,118 INFO L762 garLoopResultBuilder]: For program point L536-2(line 536) no Hoare annotation was computed. [2021-07-05 00:58:03,118 INFO L762 garLoopResultBuilder]: For program point L536-4(line 536) no Hoare annotation was computed. [2021-07-05 00:58:03,118 INFO L762 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2021-07-05 00:58:03,118 INFO L762 garLoopResultBuilder]: For program point L537(lines 537 538) no Hoare annotation was computed. [2021-07-05 00:58:03,118 INFO L762 garLoopResultBuilder]: For program point L537-2(lines 537 538) no Hoare annotation was computed. [2021-07-05 00:58:03,118 INFO L762 garLoopResultBuilder]: For program point L537-4(lines 537 538) no Hoare annotation was computed. [2021-07-05 00:58:03,118 INFO L758 garLoopResultBuilder]: At program point L529(lines 528 530) the Hoare annotation is: (= ULTIMATE.start___getMemory_~size 8) [2021-07-05 00:58:03,119 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:03,119 INFO L762 garLoopResultBuilder]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION(line 6) no Hoare annotation was computed. [2021-07-05 00:58:03,119 INFO L758 garLoopResultBuilder]: At program point L555(lines 545 556) the Hoare annotation is: (= ULTIMATE.start___getMemory_~size 8) [2021-07-05 00:58:03,119 INFO L762 garLoopResultBuilder]: For program point L522(line 522) no Hoare annotation was computed. [2021-07-05 00:58:03,119 INFO L762 garLoopResultBuilder]: For program point L522-2(line 522) no Hoare annotation was computed. [2021-07-05 00:58:03,119 WARN L471 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-07-05 00:58:03,119 WARN L182 nStatisticsGenerator]: total relevant statements: 0 [2021-07-05 00:58:03,120 INFO L303 ceAbstractionStarter]: Result for error location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION was SAFE (2/5) [2021-07-05 00:58:03,124 INFO L328 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION ======== [2021-07-05 00:58:03,129 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:03,131 INFO L330 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-07-05 00:58:03,132 INFO L276 IsEmpty]: Start isEmpty. Operand has 40 states, 34 states have (on average 1.5) internal successors, (51), 39 states have internal predecessors, (51), 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,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-07-05 00:58:03,134 INFO L517 BasicCegarLoop]: Found error trace [2021-07-05 00:58:03,134 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:03,134 INFO L374 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2021-07-05 00:58:03,134 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-05 00:58:03,134 INFO L82 PathProgramCache]: Analyzing trace with hash 170685048, now seen corresponding path program 1 times [2021-07-05 00:58:03,134 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-05 00:58:03,135 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1412050928] [2021-07-05 00:58:03,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-05 00:58:03,135 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-05 00:58:03,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-05 00:58:03,167 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 00:58:03,167 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 00:58:03,168 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 00:58:03,168 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-07-05 00:58:03,173 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 00:58:03,174 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-07-05 00:58:03,187 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 00:58:03,201 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-07-05 00:58:03,210 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 00:58:03,210 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 00:58:03,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:03,211 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-05 00:58:03,213 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1412050928] [2021-07-05 00:58:03,213 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1412050928] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-05 00:58:03,214 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-05 00:58:03,214 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-07-05 00:58:03,214 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2087906989] [2021-07-05 00:58:03,215 INFO L425 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-07-05 00:58:03,215 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-05 00:58:03,215 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-07-05 00:58:03,216 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-07-05 00:58:03,220 INFO L87 Difference]: Start difference. First operand has 40 states, 34 states have (on average 1.5) internal successors, (51), 39 states have internal predecessors, (51), 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:03,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-05 00:58:03,284 INFO L93 Difference]: Finished difference Result 122 states and 152 transitions. [2021-07-05 00:58:03,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-07-05 00:58:03,285 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:03,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-05 00:58:03,287 INFO L225 Difference]: With dead ends: 122 [2021-07-05 00:58:03,287 INFO L226 Difference]: Without dead ends: 22 [2021-07-05 00:58:03,287 INFO L795 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 50.5ms TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-07-05 00:58:03,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2021-07-05 00:58:03,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 16. [2021-07-05 00:58:03,291 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:03,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2021-07-05 00:58:03,292 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 15 [2021-07-05 00:58:03,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-05 00:58:03,292 INFO L442 AbstractCegarLoop]: Abstraction has 16 states and 16 transitions. [2021-07-05 00:58:03,292 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:03,292 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2021-07-05 00:58:03,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-07-05 00:58:03,292 INFO L517 BasicCegarLoop]: Found error trace [2021-07-05 00:58:03,292 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:03,292 WARN L471 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-07-05 00:58:03,293 INFO L374 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2021-07-05 00:58:03,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-05 00:58:03,293 INFO L82 PathProgramCache]: Analyzing trace with hash 871749626, now seen corresponding path program 1 times [2021-07-05 00:58:03,293 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-05 00:58:03,293 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [911483038] [2021-07-05 00:58:03,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-05 00:58:03,293 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-05 00:58:03,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-05 00:58:03,321 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 00:58:03,322 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 00:58:03,323 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 00:58:03,324 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-07-05 00:58:03,329 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 00:58:03,329 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-07-05 00:58:03,336 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 00:58:03,337 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-07-05 00:58:03,346 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 00:58:03,347 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 00:58:03,347 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,347 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-05 00:58:03,347 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [911483038] [2021-07-05 00:58:03,348 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [911483038] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-05 00:58:03,348 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-05 00:58:03,348 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-07-05 00:58:03,348 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1835823149] [2021-07-05 00:58:03,349 INFO L425 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-07-05 00:58:03,349 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-05 00:58:03,349 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-07-05 00:58:03,350 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-07-05 00:58:03,350 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:03,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-05 00:58:03,389 INFO L93 Difference]: Finished difference Result 22 states and 21 transitions. [2021-07-05 00:58:03,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-07-05 00:58:03,390 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:03,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-05 00:58:03,391 INFO L225 Difference]: With dead ends: 22 [2021-07-05 00:58:03,391 INFO L226 Difference]: Without dead ends: 16 [2021-07-05 00:58:03,392 INFO L795 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 39.8ms TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-07-05 00:58:03,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2021-07-05 00:58:03,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2021-07-05 00:58:03,393 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:03,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 15 transitions. [2021-07-05 00:58:03,393 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 15 transitions. Word has length 15 [2021-07-05 00:58:03,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-05 00:58:03,393 INFO L442 AbstractCegarLoop]: Abstraction has 16 states and 15 transitions. [2021-07-05 00:58:03,393 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:03,394 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 15 transitions. [2021-07-05 00:58:03,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-07-05 00:58:03,394 INFO L517 BasicCegarLoop]: Found error trace [2021-07-05 00:58:03,394 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:03,394 WARN L471 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-07-05 00:58:03,394 INFO L374 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2021-07-05 00:58:03,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-05 00:58:03,394 INFO L82 PathProgramCache]: Analyzing trace with hash 929007928, now seen corresponding path program 1 times [2021-07-05 00:58:03,394 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-05 00:58:03,395 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2125405388] [2021-07-05 00:58:03,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-05 00:58:03,395 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-05 00:58:03,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-05 00:58:03,443 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 00:58:03,444 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-07-05 00:58:03,451 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 00:58:03,452 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-07-05 00:58:03,458 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 00:58:03,459 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-07-05 00:58:03,467 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 00:58:03,467 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-07-05 00:58:03,475 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 00:58:03,476 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-07-05 00:58:03,486 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 00:58:03,486 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-07-05 00:58:03,500 INFO L142 QuantifierPusher]: treesize reduction 13, result has 38.1 percent of original size [2021-07-05 00:58:03,500 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-07-05 00:58:03,509 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 00:58:03,510 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 00:58:03,511 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,511 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-05 00:58:03,511 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2125405388] [2021-07-05 00:58:03,511 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2125405388] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-05 00:58:03,511 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-05 00:58:03,511 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-07-05 00:58:03,511 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [693723876] [2021-07-05 00:58:03,512 INFO L425 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-07-05 00:58:03,512 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-05 00:58:03,513 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-07-05 00:58:03,513 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2021-07-05 00:58:03,513 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:03,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-05 00:58:03,593 INFO L93 Difference]: Finished difference Result 16 states and 15 transitions. [2021-07-05 00:58:03,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-07-05 00:58:03,594 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:03,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-05 00:58:03,594 INFO L225 Difference]: With dead ends: 16 [2021-07-05 00:58:03,594 INFO L226 Difference]: Without dead ends: 0 [2021-07-05 00:58:03,596 INFO L795 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 86.8ms TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2021-07-05 00:58:03,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-07-05 00:58:03,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-07-05 00:58:03,597 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,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-07-05 00:58:03,598 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 15 [2021-07-05 00:58:03,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-05 00:58:03,598 INFO L442 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-07-05 00:58:03,598 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:03,598 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-07-05 00:58:03,598 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-07-05 00:58:03,599 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2021-07-05 00:58:03,601 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 00:58:03,611 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 00:58:03,621 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 00:58:03,625 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 00:58:03,626 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 00:58:03,680 INFO L762 garLoopResultBuilder]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION(line 6) no Hoare annotation was computed. [2021-07-05 00:58:03,680 INFO L762 garLoopResultBuilder]: For program point ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION(line 6) no Hoare annotation was computed. [2021-07-05 00:58:03,680 INFO L762 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2021-07-05 00:58:03,680 INFO L762 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2021-07-05 00:58:03,680 INFO L762 garLoopResultBuilder]: For program point L540(lines 540 543) no Hoare annotation was computed. [2021-07-05 00:58:03,680 INFO L762 garLoopResultBuilder]: For program point L524(lines 524 525) no Hoare annotation was computed. [2021-07-05 00:58:03,680 INFO L762 garLoopResultBuilder]: For program point L524-1(lines 524 525) no Hoare annotation was computed. [2021-07-05 00:58:03,680 INFO L762 garLoopResultBuilder]: For program point L549(lines 549 554) no Hoare annotation was computed. [2021-07-05 00:58:03,680 INFO L762 garLoopResultBuilder]: For program point L4(lines 1 556) no Hoare annotation was computed. [2021-07-05 00:58:03,680 INFO L762 garLoopResultBuilder]: For program point L549-1(lines 549 554) no Hoare annotation was computed. [2021-07-05 00:58:03,681 INFO L762 garLoopResultBuilder]: For program point L4-1(lines 1 556) no Hoare annotation was computed. [2021-07-05 00:58:03,681 INFO L762 garLoopResultBuilder]: For program point L4-2(lines 1 556) no Hoare annotation was computed. [2021-07-05 00:58:03,681 INFO L762 garLoopResultBuilder]: For program point L4-3(lines 1 556) no Hoare annotation was computed. [2021-07-05 00:58:03,681 INFO L762 garLoopResultBuilder]: For program point L4-4(lines 1 556) no Hoare annotation was computed. [2021-07-05 00:58:03,681 INFO L762 garLoopResultBuilder]: For program point L541(lines 541 542) no Hoare annotation was computed. [2021-07-05 00:58:03,681 INFO L762 garLoopResultBuilder]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION(line 6) no Hoare annotation was computed. [2021-07-05 00:58:03,681 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:03,681 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:03,681 INFO L762 garLoopResultBuilder]: For program point L6(line 6) no Hoare annotation was computed. [2021-07-05 00:58:03,681 INFO L762 garLoopResultBuilder]: For program point L6-1(line 6) no Hoare annotation was computed. [2021-07-05 00:58:03,681 INFO L762 garLoopResultBuilder]: For program point L6-2(line 6) no Hoare annotation was computed. [2021-07-05 00:58:03,681 INFO L762 garLoopResultBuilder]: For program point L6-3(line 6) no Hoare annotation was computed. [2021-07-05 00:58:03,681 INFO L762 garLoopResultBuilder]: For program point L6-4(line 6) no Hoare annotation was computed. [2021-07-05 00:58:03,681 INFO L762 garLoopResultBuilder]: For program point L535(lines 535 539) no Hoare annotation was computed. [2021-07-05 00:58:03,681 INFO L762 garLoopResultBuilder]: For program point L535-1(lines 535 539) no Hoare annotation was computed. [2021-07-05 00:58:03,681 INFO L762 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2021-07-05 00:58:03,681 INFO L762 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 6) no Hoare annotation was computed. [2021-07-05 00:58:03,682 INFO L762 garLoopResultBuilder]: For program point L536(line 536) no Hoare annotation was computed. [2021-07-05 00:58:03,682 INFO L762 garLoopResultBuilder]: For program point L536-2(line 536) no Hoare annotation was computed. [2021-07-05 00:58:03,682 INFO L762 garLoopResultBuilder]: For program point L536-4(line 536) no Hoare annotation was computed. [2021-07-05 00:58:03,682 INFO L762 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2021-07-05 00:58:03,682 INFO L762 garLoopResultBuilder]: For program point L537(lines 537 538) no Hoare annotation was computed. [2021-07-05 00:58:03,682 INFO L762 garLoopResultBuilder]: For program point L537-2(lines 537 538) no Hoare annotation was computed. [2021-07-05 00:58:03,682 INFO L762 garLoopResultBuilder]: For program point L537-4(lines 537 538) no Hoare annotation was computed. [2021-07-05 00:58:03,682 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:03,682 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:03,682 INFO L762 garLoopResultBuilder]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION(line 6) no Hoare annotation was computed. [2021-07-05 00:58:03,682 INFO L758 garLoopResultBuilder]: At program point L555(lines 545 556) the Hoare annotation is: (= ULTIMATE.start___getMemory_~size 8) [2021-07-05 00:58:03,682 INFO L762 garLoopResultBuilder]: For program point L522(line 522) no Hoare annotation was computed. [2021-07-05 00:58:03,682 INFO L762 garLoopResultBuilder]: For program point L522-2(line 522) no Hoare annotation was computed. [2021-07-05 00:58:03,682 WARN L471 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-07-05 00:58:03,682 WARN L182 nStatisticsGenerator]: total relevant statements: 0 [2021-07-05 00:58:03,683 INFO L303 ceAbstractionStarter]: Result for error location ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION was SAFE (3/5) [2021-07-05 00:58:03,684 INFO L328 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION ======== [2021-07-05 00:58:03,685 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:03,685 INFO L330 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-07-05 00:58:03,686 INFO L276 IsEmpty]: Start isEmpty. Operand has 40 states, 34 states have (on average 1.5) internal successors, (51), 39 states have internal predecessors, (51), 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,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-07-05 00:58:03,687 INFO L517 BasicCegarLoop]: Found error trace [2021-07-05 00:58:03,687 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:03,687 INFO L374 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION] === [2021-07-05 00:58:03,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-05 00:58:03,687 INFO L82 PathProgramCache]: Analyzing trace with hash 1579739684, now seen corresponding path program 1 times [2021-07-05 00:58:03,687 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-05 00:58:03,687 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [637434916] [2021-07-05 00:58:03,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-05 00:58:03,688 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-05 00:58:03,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-05 00:58:03,707 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 00:58:03,707 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 00:58:03,708 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 00:58:03,708 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-07-05 00:58:03,713 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 00:58:03,713 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-07-05 00:58:03,718 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 00:58:03,718 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-07-05 00:58:03,724 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 00:58:03,724 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 00:58:03,724 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,725 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-05 00:58:03,725 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [637434916] [2021-07-05 00:58:03,725 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [637434916] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-05 00:58:03,725 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-05 00:58:03,725 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-07-05 00:58:03,725 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [512573205] [2021-07-05 00:58:03,725 INFO L425 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-07-05 00:58:03,726 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-05 00:58:03,726 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-07-05 00:58:03,726 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-07-05 00:58:03,726 INFO L87 Difference]: Start difference. First operand has 40 states, 34 states have (on average 1.5) internal successors, (51), 39 states have internal predecessors, (51), 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:03,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-05 00:58:03,775 INFO L93 Difference]: Finished difference Result 122 states and 152 transitions. [2021-07-05 00:58:03,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-07-05 00:58:03,775 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:03,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-05 00:58:03,776 INFO L225 Difference]: With dead ends: 122 [2021-07-05 00:58:03,776 INFO L226 Difference]: Without dead ends: 30 [2021-07-05 00:58:03,776 INFO L795 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 35.8ms TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-07-05 00:58:03,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2021-07-05 00:58:03,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 20. [2021-07-05 00:58:03,782 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:03,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 21 transitions. [2021-07-05 00:58:03,784 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 21 transitions. Word has length 19 [2021-07-05 00:58:03,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-05 00:58:03,784 INFO L442 AbstractCegarLoop]: Abstraction has 20 states and 21 transitions. [2021-07-05 00:58:03,784 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:03,785 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 21 transitions. [2021-07-05 00:58:03,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-07-05 00:58:03,785 INFO L517 BasicCegarLoop]: Found error trace [2021-07-05 00:58:03,785 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:03,786 WARN L471 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-07-05 00:58:03,786 INFO L374 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION] === [2021-07-05 00:58:03,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-05 00:58:03,786 INFO L82 PathProgramCache]: Analyzing trace with hash 299876006, now seen corresponding path program 1 times [2021-07-05 00:58:03,786 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-05 00:58:03,786 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1841719243] [2021-07-05 00:58:03,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-05 00:58:03,787 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-05 00:58:03,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [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,824 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 00:58:03,824 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 00:58:03,825 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-07-05 00:58:03,830 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 00:58:03,831 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-07-05 00:58:03,837 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 00:58:03,838 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-07-05 00:58:03,845 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 00:58:03,846 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 00:58:03,846 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,846 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-05 00:58:03,846 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1841719243] [2021-07-05 00:58:03,846 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1841719243] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-05 00:58:03,847 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-05 00:58:03,847 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-07-05 00:58:03,847 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2109534568] [2021-07-05 00:58:03,847 INFO L425 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-07-05 00:58:03,847 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-05 00:58:03,848 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-07-05 00:58:03,848 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-07-05 00:58:03,848 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:03,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-05 00:58:03,904 INFO L93 Difference]: Finished difference Result 30 states and 31 transitions. [2021-07-05 00:58:03,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-07-05 00:58:03,904 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:03,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-05 00:58:03,904 INFO L225 Difference]: With dead ends: 30 [2021-07-05 00:58:03,905 INFO L226 Difference]: Without dead ends: 20 [2021-07-05 00:58:03,905 INFO L795 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 42.9ms TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-07-05 00:58:03,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2021-07-05 00:58:03,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2021-07-05 00:58:03,906 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:03,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 20 transitions. [2021-07-05 00:58:03,907 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 20 transitions. Word has length 19 [2021-07-05 00:58:03,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-05 00:58:03,907 INFO L442 AbstractCegarLoop]: Abstraction has 20 states and 20 transitions. [2021-07-05 00:58:03,907 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:03,907 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2021-07-05 00:58:03,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-07-05 00:58:03,907 INFO L517 BasicCegarLoop]: Found error trace [2021-07-05 00:58:03,908 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:03,908 WARN L471 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-07-05 00:58:03,908 INFO L374 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION] === [2021-07-05 00:58:03,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-05 00:58:03,908 INFO L82 PathProgramCache]: Analyzing trace with hash -93151004, now seen corresponding path program 1 times [2021-07-05 00:58:03,908 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-05 00:58:03,908 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1301920455] [2021-07-05 00:58:03,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-05 00:58:03,909 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-05 00:58:03,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-05 00:58:03,953 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 00:58:03,953 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 00:58:03,954 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 00:58:03,954 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-07-05 00:58:03,956 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 00:58:03,956 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-07-05 00:58:03,958 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 00:58:03,959 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-07-05 00:58:03,962 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 00:58:03,962 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-07-05 00:58:03,966 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 00:58:03,967 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-07-05 00:58:03,980 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 00:58:03,981 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-07-05 00:58:03,987 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 00:58:03,987 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-07-05 00:58:03,995 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 00:58:03,996 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-07-05 00:58:04,004 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 00:58:04,004 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-07-05 00:58:04,013 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 00:58:04,014 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-07-05 00:58:04,023 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 00:58:04,023 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 00:58:04,024 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,024 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-05 00:58:04,024 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1301920455] [2021-07-05 00:58:04,024 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1301920455] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-05 00:58:04,024 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-05 00:58:04,024 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-07-05 00:58:04,025 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [840231227] [2021-07-05 00:58:04,025 INFO L425 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-07-05 00:58:04,025 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-05 00:58:04,026 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-07-05 00:58:04,026 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2021-07-05 00:58:04,026 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:04,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-05 00:58:04,204 INFO L93 Difference]: Finished difference Result 24 states and 23 transitions. [2021-07-05 00:58:04,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-07-05 00:58:04,206 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:04,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-05 00:58:04,206 INFO L225 Difference]: With dead ends: 24 [2021-07-05 00:58:04,206 INFO L226 Difference]: Without dead ends: 20 [2021-07-05 00:58:04,206 INFO L795 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 188.2ms TimeCoverageRelationStatistics Valid=99, Invalid=243, Unknown=0, NotChecked=0, Total=342 [2021-07-05 00:58:04,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2021-07-05 00:58:04,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2021-07-05 00:58:04,208 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:04,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 19 transitions. [2021-07-05 00:58:04,208 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 19 transitions. Word has length 19 [2021-07-05 00:58:04,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-05 00:58:04,208 INFO L442 AbstractCegarLoop]: Abstraction has 20 states and 19 transitions. [2021-07-05 00:58:04,209 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:04,209 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 19 transitions. [2021-07-05 00:58:04,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-07-05 00:58:04,209 INFO L517 BasicCegarLoop]: Found error trace [2021-07-05 00:58:04,209 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:04,209 WARN L471 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2021-07-05 00:58:04,209 INFO L374 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION] === [2021-07-05 00:58:04,210 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-05 00:58:04,210 INFO L82 PathProgramCache]: Analyzing trace with hash -93091422, now seen corresponding path program 1 times [2021-07-05 00:58:04,210 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-05 00:58:04,210 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1983174220] [2021-07-05 00:58:04,210 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-05 00:58:04,210 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-05 00:58:04,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [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,230 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-07-05 00:58:04,234 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 00:58:04,234 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-07-05 00:58:04,239 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 00:58:04,239 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-07-05 00:58:04,244 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 00:58:04,244 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-07-05 00:58:04,250 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 00:58:04,250 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-07-05 00:58:04,257 INFO L142 QuantifierPusher]: treesize reduction 13, result has 38.1 percent of original size [2021-07-05 00:58:04,257 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-07-05 00:58:04,264 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 00:58:04,265 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 00:58:04,265 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,265 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-05 00:58:04,265 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1983174220] [2021-07-05 00:58:04,265 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1983174220] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-05 00:58:04,265 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-05 00:58:04,265 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-07-05 00:58:04,266 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1614509884] [2021-07-05 00:58:04,266 INFO L425 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-07-05 00:58:04,266 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-05 00:58:04,266 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-07-05 00:58:04,266 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2021-07-05 00:58:04,267 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:04,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-05 00:58:04,345 INFO L93 Difference]: Finished difference Result 20 states and 19 transitions. [2021-07-05 00:58:04,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-07-05 00:58:04,346 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:04,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-05 00:58:04,346 INFO L225 Difference]: With dead ends: 20 [2021-07-05 00:58:04,346 INFO L226 Difference]: Without dead ends: 0 [2021-07-05 00:58:04,346 INFO L795 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 77.4ms TimeCoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2021-07-05 00:58:04,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-07-05 00:58:04,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-07-05 00:58:04,347 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:04,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-07-05 00:58:04,347 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 19 [2021-07-05 00:58:04,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-05 00:58:04,347 INFO L442 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-07-05 00:58:04,347 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:04,347 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-07-05 00:58:04,348 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-07-05 00:58:04,348 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2021-07-05 00:58:04,348 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 00:58:04,363 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 00:58:04,365 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 00:58:04,366 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 00:58:04,366 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 00:58:04,483 INFO L762 garLoopResultBuilder]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION(line 6) no Hoare annotation was computed. [2021-07-05 00:58:04,483 INFO L762 garLoopResultBuilder]: For program point ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION(line 6) no Hoare annotation was computed. [2021-07-05 00:58:04,483 INFO L762 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2021-07-05 00:58:04,483 INFO L762 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2021-07-05 00:58:04,483 INFO L762 garLoopResultBuilder]: For program point L540(lines 540 543) no Hoare annotation was computed. [2021-07-05 00:58:04,484 INFO L762 garLoopResultBuilder]: For program point L524(lines 524 525) no Hoare annotation was computed. [2021-07-05 00:58:04,484 INFO L762 garLoopResultBuilder]: For program point L524-1(lines 524 525) no Hoare annotation was computed. [2021-07-05 00:58:04,484 INFO L762 garLoopResultBuilder]: For program point L549(lines 549 554) no Hoare annotation was computed. [2021-07-05 00:58:04,484 INFO L762 garLoopResultBuilder]: For program point L4(lines 1 556) no Hoare annotation was computed. [2021-07-05 00:58:04,484 INFO L762 garLoopResultBuilder]: For program point L549-1(lines 549 554) no Hoare annotation was computed. [2021-07-05 00:58:04,484 INFO L762 garLoopResultBuilder]: For program point L4-1(lines 1 556) no Hoare annotation was computed. [2021-07-05 00:58:04,484 INFO L762 garLoopResultBuilder]: For program point L4-2(lines 1 556) no Hoare annotation was computed. [2021-07-05 00:58:04,484 INFO L762 garLoopResultBuilder]: For program point L4-3(lines 1 556) no Hoare annotation was computed. [2021-07-05 00:58:04,484 INFO L762 garLoopResultBuilder]: For program point L4-4(lines 1 556) no Hoare annotation was computed. [2021-07-05 00:58:04,484 INFO L762 garLoopResultBuilder]: For program point L541(lines 541 542) no Hoare annotation was computed. [2021-07-05 00:58:04,484 INFO L762 garLoopResultBuilder]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION(line 6) no Hoare annotation was computed. [2021-07-05 00:58:04,484 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:04,485 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:04,485 INFO L762 garLoopResultBuilder]: For program point L6(line 6) no Hoare annotation was computed. [2021-07-05 00:58:04,485 INFO L762 garLoopResultBuilder]: For program point L6-1(line 6) no Hoare annotation was computed. [2021-07-05 00:58:04,485 INFO L762 garLoopResultBuilder]: For program point L6-2(line 6) no Hoare annotation was computed. [2021-07-05 00:58:04,485 INFO L762 garLoopResultBuilder]: For program point L6-3(line 6) no Hoare annotation was computed. [2021-07-05 00:58:04,485 INFO L762 garLoopResultBuilder]: For program point L6-4(line 6) no Hoare annotation was computed. [2021-07-05 00:58:04,485 INFO L762 garLoopResultBuilder]: For program point L535(lines 535 539) no Hoare annotation was computed. [2021-07-05 00:58:04,485 INFO L762 garLoopResultBuilder]: For program point L535-1(lines 535 539) no Hoare annotation was computed. [2021-07-05 00:58:04,485 INFO L762 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2021-07-05 00:58:04,485 INFO L762 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 6) no Hoare annotation was computed. [2021-07-05 00:58:04,485 INFO L762 garLoopResultBuilder]: For program point L536(line 536) no Hoare annotation was computed. [2021-07-05 00:58:04,485 INFO L762 garLoopResultBuilder]: For program point L536-2(line 536) no Hoare annotation was computed. [2021-07-05 00:58:04,485 INFO L762 garLoopResultBuilder]: For program point L536-4(line 536) no Hoare annotation was computed. [2021-07-05 00:58:04,485 INFO L762 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2021-07-05 00:58:04,485 INFO L762 garLoopResultBuilder]: For program point L537(lines 537 538) no Hoare annotation was computed. [2021-07-05 00:58:04,485 INFO L762 garLoopResultBuilder]: For program point L537-2(lines 537 538) no Hoare annotation was computed. [2021-07-05 00:58:04,486 INFO L762 garLoopResultBuilder]: For program point L537-4(lines 537 538) no Hoare annotation was computed. [2021-07-05 00:58:04,486 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:04,486 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:04,486 INFO L762 garLoopResultBuilder]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION(line 6) no Hoare annotation was computed. [2021-07-05 00:58:04,486 INFO L758 garLoopResultBuilder]: At program point L555(lines 545 556) the Hoare annotation is: (= ULTIMATE.start___getMemory_~size 8) [2021-07-05 00:58:04,487 INFO L762 garLoopResultBuilder]: For program point L522(line 522) no Hoare annotation was computed. [2021-07-05 00:58:04,487 INFO L762 garLoopResultBuilder]: For program point L522-2(line 522) no Hoare annotation was computed. [2021-07-05 00:58:04,487 WARN L471 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2021-07-05 00:58:04,487 WARN L182 nStatisticsGenerator]: total relevant statements: 0 [2021-07-05 00:58:04,487 INFO L303 ceAbstractionStarter]: Result for error location ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION was SAFE (4/5) [2021-07-05 00:58:04,488 INFO L328 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION ======== [2021-07-05 00:58:04,489 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,489 INFO L330 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-07-05 00:58:04,490 INFO L276 IsEmpty]: Start isEmpty. Operand has 40 states, 34 states have (on average 1.5) internal successors, (51), 39 states have internal predecessors, (51), 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,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-07-05 00:58:04,490 INFO L517 BasicCegarLoop]: Found error trace [2021-07-05 00:58:04,490 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:04,491 INFO L374 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION] === [2021-07-05 00:58:04,491 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-05 00:58:04,491 INFO L82 PathProgramCache]: Analyzing trace with hash -1903530188, now seen corresponding path program 1 times [2021-07-05 00:58:04,491 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-05 00:58:04,491 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1720114694] [2021-07-05 00:58:04,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-05 00:58:04,492 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-05 00:58:04,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-05 00:58:04,508 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 00:58:04,509 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 00:58:04,509 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 00:58:04,510 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-07-05 00:58:04,514 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 00:58:04,514 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [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,519 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-07-05 00:58:04,525 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 00:58:04,525 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 00:58:04,526 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,526 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-05 00:58:04,526 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1720114694] [2021-07-05 00:58:04,526 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1720114694] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-05 00:58:04,526 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-05 00:58:04,526 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-07-05 00:58:04,526 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2011547070] [2021-07-05 00:58:04,527 INFO L425 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-07-05 00:58:04,527 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-05 00:58:04,527 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-07-05 00:58:04,527 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-07-05 00:58:04,528 INFO L87 Difference]: Start difference. First operand has 40 states, 34 states have (on average 1.5) internal successors, (51), 39 states have internal predecessors, (51), 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:04,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-05 00:58:04,593 INFO L93 Difference]: Finished difference Result 122 states and 152 transitions. [2021-07-05 00:58:04,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-07-05 00:58:04,593 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:04,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-05 00:58:04,594 INFO L225 Difference]: With dead ends: 122 [2021-07-05 00:58:04,595 INFO L226 Difference]: Without dead ends: 42 [2021-07-05 00:58:04,595 INFO L795 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 37.7ms TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-07-05 00:58:04,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2021-07-05 00:58:04,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 26. [2021-07-05 00:58:04,597 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:04,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 29 transitions. [2021-07-05 00:58:04,597 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 29 transitions. Word has length 25 [2021-07-05 00:58:04,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-05 00:58:04,597 INFO L442 AbstractCegarLoop]: Abstraction has 26 states and 29 transitions. [2021-07-05 00:58:04,597 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:04,598 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 29 transitions. [2021-07-05 00:58:04,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-07-05 00:58:04,598 INFO L517 BasicCegarLoop]: Found error trace [2021-07-05 00:58:04,598 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:04,598 WARN L471 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2021-07-05 00:58:04,598 INFO L374 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION] === [2021-07-05 00:58:04,599 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-05 00:58:04,599 INFO L82 PathProgramCache]: Analyzing trace with hash -1480828362, now seen corresponding path program 1 times [2021-07-05 00:58:04,599 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-05 00:58:04,599 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [343243667] [2021-07-05 00:58:04,599 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-05 00:58:04,599 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-05 00:58:04,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-05 00:58:04,611 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 00:58:04,612 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 00:58:04,612 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 00:58:04,612 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-07-05 00:58:04,616 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 00:58:04,617 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-07-05 00:58:04,621 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 00:58:04,621 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-07-05 00:58:04,626 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 00:58:04,627 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 00:58:04,627 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,627 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-05 00:58:04,627 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [343243667] [2021-07-05 00:58:04,627 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [343243667] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-05 00:58:04,627 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-05 00:58:04,627 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-07-05 00:58:04,628 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1267858391] [2021-07-05 00:58:04,628 INFO L425 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-07-05 00:58:04,628 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-05 00:58:04,628 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-07-05 00:58:04,629 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-07-05 00:58:04,629 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:04,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-05 00:58:04,656 INFO L93 Difference]: Finished difference Result 42 states and 47 transitions. [2021-07-05 00:58:04,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-07-05 00:58:04,656 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:04,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-05 00:58:04,656 INFO L225 Difference]: With dead ends: 42 [2021-07-05 00:58:04,657 INFO L226 Difference]: Without dead ends: 26 [2021-07-05 00:58:04,657 INFO L795 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 26.0ms TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-07-05 00:58:04,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2021-07-05 00:58:04,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2021-07-05 00:58:04,658 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:04,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 28 transitions. [2021-07-05 00:58:04,658 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 28 transitions. Word has length 25 [2021-07-05 00:58:04,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-05 00:58:04,659 INFO L442 AbstractCegarLoop]: Abstraction has 26 states and 28 transitions. [2021-07-05 00:58:04,659 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:04,659 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 28 transitions. [2021-07-05 00:58:04,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-07-05 00:58:04,659 INFO L517 BasicCegarLoop]: Found error trace [2021-07-05 00:58:04,659 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:04,659 WARN L471 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2021-07-05 00:58:04,659 INFO L374 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION] === [2021-07-05 00:58:04,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-05 00:58:04,660 INFO L82 PathProgramCache]: Analyzing trace with hash 1793070580, now seen corresponding path program 1 times [2021-07-05 00:58:04,660 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-05 00:58:04,660 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [601762373] [2021-07-05 00:58:04,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-05 00:58:04,660 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-05 00:58:04,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-05 00:58:04,701 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 00:58:04,701 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-07-05 00:58:04,703 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 00:58:04,703 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-07-05 00:58:04,704 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 00:58:04,705 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-07-05 00:58:04,705 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 00:58:04,705 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-07-05 00:58:04,711 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 00:58:04,711 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-07-05 00:58:04,715 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 00:58:04,715 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-07-05 00:58:04,727 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 00:58:04,727 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-07-05 00:58:04,733 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 00:58:04,734 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-07-05 00:58:04,741 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 00:58:04,741 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-07-05 00:58:04,747 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 00:58:04,747 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 00:58:04,747 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,747 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-05 00:58:04,747 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [601762373] [2021-07-05 00:58:04,748 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [601762373] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-05 00:58:04,748 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-05 00:58:04,748 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-07-05 00:58:04,748 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2042197999] [2021-07-05 00:58:04,748 INFO L425 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-07-05 00:58:04,748 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-05 00:58:04,749 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-07-05 00:58:04,749 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2021-07-05 00:58:04,749 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:04,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-05 00:58:04,836 INFO L93 Difference]: Finished difference Result 30 states and 31 transitions. [2021-07-05 00:58:04,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-07-05 00:58:04,837 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:04,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-05 00:58:04,837 INFO L225 Difference]: With dead ends: 30 [2021-07-05 00:58:04,837 INFO L226 Difference]: Without dead ends: 26 [2021-07-05 00:58:04,837 INFO L795 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 83.1ms TimeCoverageRelationStatistics Valid=72, Invalid=138, Unknown=0, NotChecked=0, Total=210 [2021-07-05 00:58:04,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2021-07-05 00:58:04,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2021-07-05 00:58:04,841 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:04,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 27 transitions. [2021-07-05 00:58:04,841 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 27 transitions. Word has length 25 [2021-07-05 00:58:04,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-05 00:58:04,842 INFO L442 AbstractCegarLoop]: Abstraction has 26 states and 27 transitions. [2021-07-05 00:58:04,842 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:04,842 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 27 transitions. [2021-07-05 00:58:04,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-07-05 00:58:04,845 INFO L517 BasicCegarLoop]: Found error trace [2021-07-05 00:58:04,845 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:04,845 WARN L471 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2021-07-05 00:58:04,845 INFO L374 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION] === [2021-07-05 00:58:04,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-05 00:58:04,845 INFO L82 PathProgramCache]: Analyzing trace with hash 1793130162, now seen corresponding path program 1 times [2021-07-05 00:58:04,846 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-05 00:58:04,846 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [383949281] [2021-07-05 00:58:04,846 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-05 00:58:04,846 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-05 00:58:04,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-05 00:58:04,881 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 00:58:04,882 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 00:58:04,882 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 00:58:04,882 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-07-05 00:58:04,884 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 00:58:04,885 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-07-05 00:58:04,887 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 00:58:04,888 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-07-05 00:58:04,891 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 00:58:04,891 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-07-05 00:58:04,895 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 00:58:04,896 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-07-05 00:58:04,900 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 00:58:04,901 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-07-05 00:58:04,906 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 00:58:04,906 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-07-05 00:58:04,913 INFO L142 QuantifierPusher]: treesize reduction 23, result has 14.8 percent of original size [2021-07-05 00:58:04,913 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-07-05 00:58:04,920 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 00:58:04,921 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-07-05 00:58:04,928 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 00:58:04,928 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-07-05 00:58:04,936 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 00:58:04,937 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 00:58:04,937 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,937 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-05 00:58:04,937 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [383949281] [2021-07-05 00:58:04,937 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [383949281] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-05 00:58:04,937 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-05 00:58:04,937 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-07-05 00:58:04,938 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1413766227] [2021-07-05 00:58:04,938 INFO L425 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-07-05 00:58:04,938 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-05 00:58:04,939 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-07-05 00:58:04,939 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2021-07-05 00:58:04,939 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:05,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-05 00:58:05,106 INFO L93 Difference]: Finished difference Result 32 states and 32 transitions. [2021-07-05 00:58:05,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-07-05 00:58:05,106 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:05,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-05 00:58:05,107 INFO L225 Difference]: With dead ends: 32 [2021-07-05 00:58:05,107 INFO L226 Difference]: Without dead ends: 26 [2021-07-05 00:58:05,107 INFO L795 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 162.3ms TimeCoverageRelationStatistics Valid=99, Invalid=243, Unknown=0, NotChecked=0, Total=342 [2021-07-05 00:58:05,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2021-07-05 00:58:05,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2021-07-05 00:58:05,109 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:05,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 26 transitions. [2021-07-05 00:58:05,109 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 26 transitions. Word has length 25 [2021-07-05 00:58:05,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-05 00:58:05,109 INFO L442 AbstractCegarLoop]: Abstraction has 26 states and 26 transitions. [2021-07-05 00:58:05,109 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:05,110 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2021-07-05 00:58:05,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-07-05 00:58:05,110 INFO L517 BasicCegarLoop]: Found error trace [2021-07-05 00:58:05,110 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:05,110 WARN L471 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2021-07-05 00:58:05,110 INFO L374 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION] === [2021-07-05 00:58:05,111 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-05 00:58:05,111 INFO L82 PathProgramCache]: Analyzing trace with hash 1850388464, now seen corresponding path program 1 times [2021-07-05 00:58:05,111 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-05 00:58:05,111 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1544935997] [2021-07-05 00:58:05,111 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-05 00:58:05,111 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-05 00:58:05,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-05 00:58:05,135 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 00:58:05,136 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-07-05 00:58:05,140 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 00:58:05,140 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-07-05 00:58:05,144 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 00:58:05,145 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-07-05 00:58:05,150 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 00:58:05,150 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-07-05 00:58:05,156 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 00:58:05,156 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-07-05 00:58:05,166 INFO L142 QuantifierPusher]: treesize reduction 29, result has 27.5 percent of original size [2021-07-05 00:58:05,167 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 11 [2021-07-05 00:58:05,177 INFO L142 QuantifierPusher]: treesize reduction 23, result has 46.5 percent of original size [2021-07-05 00:58:05,178 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 20 [2021-07-05 00:58:05,195 INFO L142 QuantifierPusher]: treesize reduction 23, result has 46.5 percent of original size [2021-07-05 00:58:05,196 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 20 [2021-07-05 00:58:05,218 INFO L142 QuantifierPusher]: treesize reduction 31, result has 54.4 percent of original size [2021-07-05 00:58:05,219 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 37 [2021-07-05 00:58:05,251 INFO L142 QuantifierPusher]: treesize reduction 17, result has 55.3 percent of original size [2021-07-05 00:58:05,252 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-07-05 00:58:05,271 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 00:58:05,271 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-07-05 00:58:05,279 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 00:58:05,280 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 00:58:05,280 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:05,280 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-05 00:58:05,280 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1544935997] [2021-07-05 00:58:05,280 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1544935997] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-05 00:58:05,280 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-05 00:58:05,281 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-07-05 00:58:05,281 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [305567611] [2021-07-05 00:58:05,281 INFO L425 AbstractCegarLoop]: Interpolant automaton has 13 states [2021-07-05 00:58:05,281 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-05 00:58:05,282 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-07-05 00:58:05,282 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2021-07-05 00:58:05,282 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:05,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-05 00:58:05,475 INFO L93 Difference]: Finished difference Result 36 states and 35 transitions. [2021-07-05 00:58:05,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-07-05 00:58:05,476 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:05,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-05 00:58:05,476 INFO L225 Difference]: With dead ends: 36 [2021-07-05 00:58:05,476 INFO L226 Difference]: Without dead ends: 26 [2021-07-05 00:58:05,477 INFO L795 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 254.5ms TimeCoverageRelationStatistics Valid=123, Invalid=339, Unknown=0, NotChecked=0, Total=462 [2021-07-05 00:58:05,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2021-07-05 00:58:05,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2021-07-05 00:58:05,478 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:05,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 25 transitions. [2021-07-05 00:58:05,479 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 25 transitions. Word has length 25 [2021-07-05 00:58:05,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-05 00:58:05,479 INFO L442 AbstractCegarLoop]: Abstraction has 26 states and 25 transitions. [2021-07-05 00:58:05,479 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:05,479 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 25 transitions. [2021-07-05 00:58:05,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-07-05 00:58:05,480 INFO L517 BasicCegarLoop]: Found error trace [2021-07-05 00:58:05,480 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:05,480 WARN L471 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2021-07-05 00:58:05,480 INFO L374 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION] === [2021-07-05 00:58:05,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-05 00:58:05,480 INFO L82 PathProgramCache]: Analyzing trace with hash 1457361454, now seen corresponding path program 1 times [2021-07-05 00:58:05,481 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-05 00:58:05,481 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1852928670] [2021-07-05 00:58:05,481 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-05 00:58:05,481 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-05 00:58:05,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-05 00:58:05,499 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 00:58:05,500 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-07-05 00:58:05,505 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 00:58:05,505 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-07-05 00:58:05,506 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 00:58:05,506 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-07-05 00:58:05,506 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 00:58:05,507 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-07-05 00:58:05,512 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 00:58:05,513 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-07-05 00:58:05,518 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 00:58:05,519 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-07-05 00:58:05,529 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 00:58:05,529 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-07-05 00:58:05,535 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 00:58:05,536 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-07-05 00:58:05,540 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 00:58:05,541 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 00:58:05,542 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:05,542 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-05 00:58:05,543 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1852928670] [2021-07-05 00:58:05,543 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1852928670] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-05 00:58:05,543 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-05 00:58:05,543 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-07-05 00:58:05,543 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1607387946] [2021-07-05 00:58:05,543 INFO L425 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-07-05 00:58:05,543 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-05 00:58:05,544 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-07-05 00:58:05,544 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2021-07-05 00:58:05,544 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:05,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-05 00:58:05,622 INFO L93 Difference]: Finished difference Result 26 states and 25 transitions. [2021-07-05 00:58:05,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-07-05 00:58:05,623 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:05,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-05 00:58:05,624 INFO L225 Difference]: With dead ends: 26 [2021-07-05 00:58:05,624 INFO L226 Difference]: Without dead ends: 0 [2021-07-05 00:58:05,625 INFO L795 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 81.6ms TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2021-07-05 00:58:05,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-07-05 00:58:05,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-07-05 00:58:05,625 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:05,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-07-05 00:58:05,626 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 25 [2021-07-05 00:58:05,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-05 00:58:05,626 INFO L442 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-07-05 00:58:05,626 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:05,626 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-07-05 00:58:05,626 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-07-05 00:58:05,627 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2021-07-05 00:58:05,627 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 00:58:05,629 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 00:58:05,631 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 00:58:05,633 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 00:58:05,634 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 00:58:05,741 INFO L762 garLoopResultBuilder]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION(line 6) no Hoare annotation was computed. [2021-07-05 00:58:05,741 INFO L762 garLoopResultBuilder]: For program point ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION(line 6) no Hoare annotation was computed. [2021-07-05 00:58:05,741 INFO L762 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2021-07-05 00:58:05,741 INFO L762 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2021-07-05 00:58:05,742 INFO L762 garLoopResultBuilder]: For program point L540(lines 540 543) no Hoare annotation was computed. [2021-07-05 00:58:05,742 INFO L762 garLoopResultBuilder]: For program point L524(lines 524 525) no Hoare annotation was computed. [2021-07-05 00:58:05,742 INFO L762 garLoopResultBuilder]: For program point L524-1(lines 524 525) no Hoare annotation was computed. [2021-07-05 00:58:05,742 INFO L762 garLoopResultBuilder]: For program point L549(lines 549 554) no Hoare annotation was computed. [2021-07-05 00:58:05,742 INFO L762 garLoopResultBuilder]: For program point L4(lines 1 556) no Hoare annotation was computed. [2021-07-05 00:58:05,742 INFO L762 garLoopResultBuilder]: For program point L549-1(lines 549 554) no Hoare annotation was computed. [2021-07-05 00:58:05,742 INFO L762 garLoopResultBuilder]: For program point L4-1(lines 1 556) no Hoare annotation was computed. [2021-07-05 00:58:05,742 INFO L762 garLoopResultBuilder]: For program point L4-2(lines 1 556) no Hoare annotation was computed. [2021-07-05 00:58:05,742 INFO L762 garLoopResultBuilder]: For program point L4-3(lines 1 556) no Hoare annotation was computed. [2021-07-05 00:58:05,743 INFO L762 garLoopResultBuilder]: For program point L4-4(lines 1 556) no Hoare annotation was computed. [2021-07-05 00:58:05,743 INFO L762 garLoopResultBuilder]: For program point L541(lines 541 542) no Hoare annotation was computed. [2021-07-05 00:58:05,743 INFO L762 garLoopResultBuilder]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION(line 6) no Hoare annotation was computed. [2021-07-05 00:58:05,743 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:05,743 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:05,743 INFO L762 garLoopResultBuilder]: For program point L6(line 6) no Hoare annotation was computed. [2021-07-05 00:58:05,743 INFO L762 garLoopResultBuilder]: For program point L6-1(line 6) no Hoare annotation was computed. [2021-07-05 00:58:05,743 INFO L762 garLoopResultBuilder]: For program point L6-2(line 6) no Hoare annotation was computed. [2021-07-05 00:58:05,744 INFO L762 garLoopResultBuilder]: For program point L6-3(line 6) no Hoare annotation was computed. [2021-07-05 00:58:05,744 INFO L762 garLoopResultBuilder]: For program point L6-4(line 6) no Hoare annotation was computed. [2021-07-05 00:58:05,744 INFO L762 garLoopResultBuilder]: For program point L535(lines 535 539) no Hoare annotation was computed. [2021-07-05 00:58:05,744 INFO L762 garLoopResultBuilder]: For program point L535-1(lines 535 539) no Hoare annotation was computed. [2021-07-05 00:58:05,744 INFO L762 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2021-07-05 00:58:05,744 INFO L762 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 6) no Hoare annotation was computed. [2021-07-05 00:58:05,744 INFO L762 garLoopResultBuilder]: For program point L536(line 536) no Hoare annotation was computed. [2021-07-05 00:58:05,745 INFO L762 garLoopResultBuilder]: For program point L536-2(line 536) no Hoare annotation was computed. [2021-07-05 00:58:05,745 INFO L762 garLoopResultBuilder]: For program point L536-4(line 536) no Hoare annotation was computed. [2021-07-05 00:58:05,745 INFO L762 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2021-07-05 00:58:05,745 INFO L762 garLoopResultBuilder]: For program point L537(lines 537 538) no Hoare annotation was computed. [2021-07-05 00:58:05,745 INFO L762 garLoopResultBuilder]: For program point L537-2(lines 537 538) no Hoare annotation was computed. [2021-07-05 00:58:05,745 INFO L762 garLoopResultBuilder]: For program point L537-4(lines 537 538) no Hoare annotation was computed. [2021-07-05 00:58:05,746 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:05,746 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:05,746 INFO L762 garLoopResultBuilder]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION(line 6) no Hoare annotation was computed. [2021-07-05 00:58:05,746 INFO L758 garLoopResultBuilder]: At program point L555(lines 545 556) the Hoare annotation is: (= ULTIMATE.start___getMemory_~size 8) [2021-07-05 00:58:05,746 INFO L762 garLoopResultBuilder]: For program point L522(line 522) no Hoare annotation was computed. [2021-07-05 00:58:05,746 INFO L762 garLoopResultBuilder]: For program point L522-2(line 522) no Hoare annotation was computed. [2021-07-05 00:58:05,746 WARN L471 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2021-07-05 00:58:05,746 WARN L182 nStatisticsGenerator]: total relevant statements: 0 [2021-07-05 00:58:05,747 INFO L303 ceAbstractionStarter]: Result for error location ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION was SAFE (5/5) [2021-07-05 00:58:05,775 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.07 12:58:05 BoogieIcfgContainer [2021-07-05 00:58:05,777 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-07-05 00:58:05,777 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-07-05 00:58:05,777 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-07-05 00:58:05,777 INFO L275 PluginConnector]: Witness Printer initialized [2021-07-05 00:58:05,778 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:02" (3/4) ... [2021-07-05 00:58:05,780 INFO L137 WitnessPrinter]: Generating witness for correct program [2021-07-05 00:58:05,788 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 15 nodes and edges [2021-07-05 00:58:05,788 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2021-07-05 00:58:05,789 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2021-07-05 00:58:05,789 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2021-07-05 00:58:05,804 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((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)) [2021-07-05 00:58:05,804 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((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)) [2021-07-05 00:58:05,805 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((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)) [2021-07-05 00:58:05,805 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((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)) [2021-07-05 00:58:05,820 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2021-07-05 00:58:05,820 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-07-05 00:58:05,821 INFO L168 Benchmark]: Toolchain (without parser) took 3850.92 ms. Allocated memory was 56.6 MB in the beginning and 111.1 MB in the end (delta: 54.5 MB). Free memory was 33.8 MB in the beginning and 48.3 MB in the end (delta: -14.5 MB). Peak memory consumption was 38.0 MB. Max. memory is 16.1 GB. [2021-07-05 00:58:05,821 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 56.6 MB. Free memory was 38.3 MB in the beginning and 38.2 MB in the end (delta: 44.4 kB). There was no memory consumed. Max. memory is 16.1 GB. [2021-07-05 00:58:05,821 INFO L168 Benchmark]: CACSL2BoogieTranslator took 336.60 ms. Allocated memory was 56.6 MB in the beginning and 75.5 MB in the end (delta: 18.9 MB). Free memory was 33.5 MB in the beginning and 46.1 MB in the end (delta: -12.5 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. [2021-07-05 00:58:05,821 INFO L168 Benchmark]: Boogie Procedure Inliner took 26.09 ms. Allocated memory is still 75.5 MB. Free memory was 45.9 MB in the beginning and 44.0 MB in the end (delta: 1.9 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-07-05 00:58:05,822 INFO L168 Benchmark]: Boogie Preprocessor took 14.44 ms. Allocated memory is still 75.5 MB. Free memory was 44.0 MB in the beginning and 42.5 MB in the end (delta: 1.5 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-07-05 00:58:05,824 INFO L168 Benchmark]: RCFGBuilder took 391.23 ms. Allocated memory is still 75.5 MB. Free memory was 42.5 MB in the beginning and 38.3 MB in the end (delta: 4.2 MB). Peak memory consumption was 4.9 MB. Max. memory is 16.1 GB. [2021-07-05 00:58:05,825 INFO L168 Benchmark]: TraceAbstraction took 3035.71 ms. Allocated memory was 75.5 MB in the beginning and 111.1 MB in the end (delta: 35.7 MB). Free memory was 38.0 MB in the beginning and 52.5 MB in the end (delta: -14.4 MB). Peak memory consumption was 21.2 MB. Max. memory is 16.1 GB. [2021-07-05 00:58:05,825 INFO L168 Benchmark]: Witness Printer took 42.84 ms. Allocated memory is still 111.1 MB. Free memory was 52.5 MB in the beginning and 48.3 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:05,828 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.15 ms. Allocated memory is still 56.6 MB. Free memory was 38.3 MB in the beginning and 38.2 MB in the end (delta: 44.4 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 336.60 ms. Allocated memory was 56.6 MB in the beginning and 75.5 MB in the end (delta: 18.9 MB). Free memory was 33.5 MB in the beginning and 46.1 MB in the end (delta: -12.5 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 26.09 ms. Allocated memory is still 75.5 MB. Free memory was 45.9 MB in the beginning and 44.0 MB in the end (delta: 1.9 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 14.44 ms. Allocated memory is still 75.5 MB. Free memory was 44.0 MB in the beginning and 42.5 MB in the end (delta: 1.5 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 391.23 ms. Allocated memory is still 75.5 MB. Free memory was 42.5 MB in the beginning and 38.3 MB in the end (delta: 4.2 MB). Peak memory consumption was 4.9 MB. Max. memory is 16.1 GB. * TraceAbstraction took 3035.71 ms. Allocated memory was 75.5 MB in the beginning and 111.1 MB in the end (delta: 35.7 MB). Free memory was 38.0 MB in the beginning and 52.5 MB in the end (delta: -14.4 MB). Peak memory consumption was 21.2 MB. Max. memory is 16.1 GB. * Witness Printer took 42.84 ms. Allocated memory is still 111.1 MB. Free memory was 52.5 MB in the beginning and 48.3 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 - 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 - StatisticsResult: Ultimate Automizer benchmark data for error location: ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION CFG has 1 procedures, 40 locations, 5 error locations. Started 1 CEGAR loops. OverallTime: 248.4ms, OverallIterations: 1, TraceHistogramMax: 1, EmptinessCheckTime: 5.0ms, AutomataDifference: 39.2ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 24.5ms, InitialAbstractionConstructionTime: 6.3ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 40 SDtfs, 39 SDslu, 1 SDs, 0 SdLazy, 2 SolverSat, 2 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.6ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.9ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=40occurred 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.1ms AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0ms HoareAnnotationTime, 5 LocationsWithAnnotation, 5 PreInvPairs, 10 NumberOfFragments, 15 HoareAnnotationTreeSize, 5 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 10.2ms HoareSimplificationTime, 5 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 10.3ms HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 2.8ms SsaConstructionTime, 15.2ms SatisfiabilityAnalysisTime, 61.2ms 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, 40 locations, 5 error locations. Started 1 CEGAR loops. OverallTime: 83.9ms, OverallIterations: 1, TraceHistogramMax: 1, EmptinessCheckTime: 1.2ms, AutomataDifference: 12.5ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 9.5ms, InitialAbstractionConstructionTime: 0.8ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 40 SDtfs, 39 SDslu, 2 SDs, 0 SdLazy, 2 SolverSat, 3 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.6ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.3ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=40occurred 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, 3.0ms HoareSimplificationTime, 5 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 6.0ms HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 1.4ms SsaConstructionTime, 6.9ms SatisfiabilityAnalysisTime, 33.4ms 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, 40 locations, 5 error locations. Started 1 CEGAR loops. OverallTime: 559.0ms, OverallIterations: 3, TraceHistogramMax: 1, EmptinessCheckTime: 2.6ms, AutomataDifference: 197.7ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 80.9ms, InitialAbstractionConstructionTime: 0.6ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 61 SDtfs, 107 SDslu, 165 SDs, 0 SdLazy, 82 SolverSat, 7 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 62.3ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 27 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 177.1ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=40occurred 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: 7.1ms AutomataMinimizationTime, 3 MinimizatonAttempts, 6 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: 0.0ms HoareAnnotationTime, 5 LocationsWithAnnotation, 5 PreInvPairs, 21 NumberOfFragments, 96 HoareAnnotationTreeSize, 5 FomulaSimplifications, 32 FormulaSimplificationTreeSizeReduction, 34.7ms HoareSimplificationTime, 5 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 43.4ms HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 8.5ms SsaConstructionTime, 24.6ms SatisfiabilityAnalysisTime, 204.1ms 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, 40 locations, 5 error locations. Started 1 CEGAR loops. OverallTime: 802.7ms, OverallIterations: 4, TraceHistogramMax: 1, EmptinessCheckTime: 2.8ms, AutomataDifference: 369.5ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 134.5ms, InitialAbstractionConstructionTime: 0.5ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 76 SDtfs, 186 SDslu, 215 SDs, 0 SdLazy, 160 SolverSat, 29 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 95.7ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 47 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 344.5ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=40occurred 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: 11.3ms AutomataMinimizationTime, 4 MinimizatonAttempts, 10 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: 0.0ms HoareAnnotationTime, 5 LocationsWithAnnotation, 5 PreInvPairs, 21 NumberOfFragments, 123 HoareAnnotationTreeSize, 5 FomulaSimplifications, 32 FormulaSimplificationTreeSizeReduction, 20.5ms HoareSimplificationTime, 5 FomulaSimplificationsInter, 21 FormulaSimplificationTreeSizeReductionInter, 113.0ms HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 5.4ms SsaConstructionTime, 41.7ms SatisfiabilityAnalysisTime, 212.0ms 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, 40 locations, 5 error locations. Started 1 CEGAR loops. OverallTime: 1258.2ms, OverallIterations: 6, TraceHistogramMax: 1, EmptinessCheckTime: 5.3ms, AutomataDifference: 631.6ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 114.3ms, InitialAbstractionConstructionTime: 0.4ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 120 SDtfs, 452 SDslu, 327 SDs, 0 SdLazy, 355 SolverSat, 30 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 151.4ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 85 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 645.5ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=40occurred 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: 11.2ms AutomataMinimizationTime, 6 MinimizatonAttempts, 16 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: 0.0ms HoareAnnotationTime, 5 LocationsWithAnnotation, 5 PreInvPairs, 21 NumberOfFragments, 160 HoareAnnotationTreeSize, 5 FomulaSimplifications, 32 FormulaSimplificationTreeSizeReduction, 9.7ms HoareSimplificationTime, 5 FomulaSimplificationsInter, 20 FormulaSimplificationTreeSizeReductionInter, 103.6ms HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 7.5ms SsaConstructionTime, 30.9ms SatisfiabilityAnalysisTime, 421.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 - AllSpecificationsHoldResult: All specifications hold 5 specifications checked. All of them hold - 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: 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: 545]: Loop Invariant Derived loop invariant: size == 8 - 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 correct! [2021-07-05 00:58:05,868 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...